Tree Container Library: STL Algoritms: Non Modifying

The Tree Container Library

A C++ generic tree container library which, not only works much like the STL, but is also compatible with the STL algorithms. The Tree Container Library is used worldwide in thousands of industries and organizations. It is completely free to use, and is licensed under the zlib/libpng license.

Besides the modifying and non-modifying algorithms, there are other categories of STL algorithms, all which work with TCL containers and iterators.

  • Removing Algorithms
  • Mutating Algorithms
  • Sorting Algorithms
  • Sorted Range Algorithms
  • Numeric Algorithms

Unlike the modifying and non-modifying algorithms, which we discuss and provide examples in the preceding pages, many of the algorithms in the above categories work on either sequence containers or associative containers, but not both. Examples will not be given for these remaining algorithms. By studying the examples for the modifying algorithms and non-modifying algorithms, you will get a good idea on how to use the TCL containers and iterators with any of the STL algorithms.