Session: Algorithms Library

One of the strengths of the STL is the generic algorithm library. It provides many algorithms that work generically on a set of iterators and thus for all data structures that are enumerable. Further, it can choose optimised specialisations depending on iterator categories, for example to do quick sort for random access iterators. This library design is also partially realised for SeqAn and should be extended in the future. Also, whenever possible use these algorithms, as improvements such as parallelisation are than easily ported to all using code paths.

In the following we will