stl-Non-mutation algorithm

Find

Find (): finds where a value first appears in a single iterator sequence.

Find_if (): Finds the position of the first element in a single iterator sequence that conforms to a unary predicate .

To find a custom class, you must overload the = = operator of the class !

Count

COUNT (): counts the number of occurrences of an element in a sequence.

Count_if (): Counts the number of elements in a sequence that match one of the judging predicates.

See the code above for usage.

Equal

Returns true if each element in each of the two containers is equal in turn.

Mismatch

stl-Non-mutation algorithm