STLAlgorithmExtensions

BOOST WIKI | RecentChanges | Preferences | Page List | Links List

There are lots of useful algorithms that didn't make it into the C++ standard as part of the STL. The scope of this page is to consider a Boost Algorithm library that consists of STL-like algorithms, algorithms over sequences. The following is the list of algorithms that would go into this library. Please add to this list!

/AllAlgorithm -- Marshall
/AnyAlgorithm -- Marshall
/BinarySearch
/BinarySearchWithHint
/ClusteringAlgorithms
/ContainerAlgorithms
/ContainsAlgorithm -- Marshall sez: Same as "Any"
/CopyIf -- Marshall
/CopyN -- Marshall
/CopyWhile -- Marshall
/EqualAlgorithm
/ExistsAndOnlyAlgorithm -- Marshall
/FindFirstLast
/ForEachIf -- Marshall
/IndexAlgorithms
/InvertPermutation
/IotaAlgorithm
/IsSortedFunction - Jesse
MathematicalAlgorithms
/MapAlgorithms
/MakePermutation
/MinmaxElement
/MismatchAlgorithm
/NoneAlgorithm
/NonUniqueCopy
/PermuteAlgorithm
/PowerSet
/ReorderAlgorithm
/Select1st (and 2nd) -- Marshall
/SetsIntersect
/StatisticsAlgorithms
/StringAlgorithms
/OnEach - Jesse
/OnEachIf? - Jesse

The /DesignRationale page describes some of the design options for Boost.Algorithm.

Disclaimer: This site not officially maintained by Boost Developers