...But Algorithms Do Depend on Element-Type Operations
Although iterators make the algorithms container independent, most of the algorithms use one (or more) operation(s) on the element type. For example, step 2, uses the element type’s ==
operator to compare each element to the given value.
Other algorithms require that the element type have the <
operator. However, as we’ll see, most algorithms provide a way for us to supply our own operation to use in place of the default operator.
Exercise 10.1: The algorithm
header defines a function named count
that, like find
, takes a pair of iterators and a value. count
returns a count of how often that value appears. Read a sequence of int
s into a vector
and print the count
of ...
Get C++ Primer, Fifth Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.