The final article.
by Jonathan Boccara
From the article:
The BooSTL algorithms are what we can call the Boost algorithms which are in the same spirit as those of the STL. They encapsulate operations on collections, and being able to use them allows to write (or re-write) more expressive code. To cover all their contents, we split up the articles of the BooSTL into three parts:
- the BooSTL algorithms on sorting and partitioning,
- the BooSTL algorithms on searching,
- the other BooSTL algorithms.
So here we go to cover the rest of the BooSTL algorithms which are not in sorting, partitioning nor searching.