Please enable JavaScript.
Coggle requires JavaScript to display documents.
STL ALGORITHMS - Coggle Diagram
STL ALGORITHMS
Count
-
count(start_iterator, end_iterator, value)
count_if
-
count_if(start_iterator, end_iterator, predicate)
Replace
replace(start_iterator, end_iterator, old_value, new_value)
-
Replace_if
replace_if(start_iterator, end_iterator, predicate, new_value)
ALL_OF
Returns boolean value whether the given predicate is true for all the values of the container otherwise false
ANY_OF
-
any_of(start_iterator, end_iterator, predicate)
all_of(start_iterator, end_iterator, predicate)
FIND
Tries to locate the first occurrence of an element in the container
- Returns an iterator pointing to the located element
- If it doesn't finds one it will return iterator pointing to ending iterator
find(start_iterator, end_iterator, element)
-
-
Many algorithms require extra information in order to do their work , function must be provided to the algorithm as
- Function objects(Functors)
- Function pointers
- Lambda Expressions