This small example shows how to verify the integrity of a message. We follow the digital signature algorithm (DSA) and generate a pair of keys, private and public (the public key is actually not unique). We get the signature by signing the message with the private key (which should never …

One of the fundamental data structures in information processing is the tree, to model hierarchical data. Although we have many standardized containers in C++, a tree structure is still missing. Of course, there are several different libraries which provide this feature in different facets. For my current work I am …

This article describes a small workaround for a "shortcoming" of Boost Graph. My situation is the following: Given a directed graph, I want to display just the component containing a special node. Technically speaking I'm looking for the connected component containing a special node. Although Boost Graph comes with plenty …

Usually we use a tool like Boost Spirit Qi to retrieve information from a source file. However, in some situations (like building a syntax highlighter) that is not enough and we also need some meta data about the information. This short article will describe a convenient way to get additionally …

In this article I described how to retrieve data points and their positions during parsing. However, this method has a little flaw, it doesn't work correctly with Unicode input. We're going to fix this problem now.

Since we rely on the underlying iterator, the position depends on the used iterator …