Condition Algorithms
 Mutating Algorithms
 Predicate Algorithms

Detailed Description

STL algorithms are the heart of generic programming. The idea is to separate algorithms from containers to take advantage of the fact that there are fewer distinct algorithms than typed containers. This is diametrically opposed to object oriented programming, where each object must contain all functionality related to its internal data. You will find, I think, that in practice, generic programming is not terribly convenient because it prevents you from encapsulating all your data. The best approach is to compromise and have raw data classes that will be manipulated by algorithms and to treat the rest of the objects as stateful data transformers.

Generated on Mon Sep 28 2015 17:58:50 for uSTL by Doxygen 1.8.10