Modules | |
Set Algorithms | |
Functions | |
template<class InputIt, class OutputIt, class Filter> OutputIt | copy_filter (InputIt b, InputIt e, OutputIt dest, Filter f) |
copy [b,e) to [dest, ...), mapping values with f. More... | |
template<class FwdIt, class P1, class P2> FwdIt | find_if_preference (FwdIt b, FwdIt e, const P1 &must_be, const P2 &should_be) |
find_if_preference tries to find an element that satisfies both predicates. More... | |
template<class M1, class M2> void | mapping_assign (M1 &dest, M2 const &src) |
Copy a mapping by iterating through its domain. More... |
|
copy [b,e) to [dest, ...), mapping values with f. The output is the sequence f(*b), ... f(*(e-1)). This algorithm could also be expressed using std::copy and an iterator-adaptor of InputIt using Filter. However, as a filter rather operates on the corresponding value_type, this version seems to be more natural. Definition at line 41 of file some-algorithms.h. |
|
find_if_preference tries to find an element that satisfies both predicates. Return value:
Definition at line 61 of file some-algorithms.h. |
|
Copy a mapping by iterating through its domain. Template parameters
Definition at line 87 of file some-algorithms.h. |