libkleo
Classes | |
struct | identity |
struct | nodelete |
struct | select1st |
struct | select1st< std::pair< U, V > > |
struct | select2nd |
struct | select2nd< std::pair< U, V > > |
Functions | |
template<typename Value , typename InputIterator , typename UnaryPredicate > | |
Value | accumulate_if (InputIterator first, InputIterator last, UnaryPredicate filter, const Value &value=Value()) |
template<typename Value , typename InputIterator , typename UnaryPredicate , typename BinaryOperation > | |
Value | accumulate_if (InputIterator first, InputIterator last, UnaryPredicate filter, const Value &value, BinaryOperation op) |
template<typename Value , typename InputIterator , typename UnaryFunction > | |
Value | accumulate_transform (InputIterator first, InputIterator last, UnaryFunction map, const Value &value=Value()) |
template<typename Value , typename InputIterator , typename UnaryFunction , typename BinaryOperation > | |
Value | accumulate_transform (InputIterator first, InputIterator last, UnaryFunction map, const Value &value, BinaryOperation op) |
template<typename Value , typename InputIterator , typename UnaryFunction , typename UnaryPredicate > | |
Value | accumulate_transform_if (InputIterator first, InputIterator last, UnaryFunction map, UnaryPredicate pred, const Value &value=Value()) |
template<typename Value , typename InputIterator , typename UnaryFunction , typename UnaryPredicate , typename BinaryOperation > | |
Value | accumulate_transform_if (InputIterator first, InputIterator last, UnaryFunction map, UnaryPredicate filter, const Value &value, BinaryOperation op) |
template<typename InputIterator > | |
bool | all (InputIterator first, InputIterator last) |
template<typename InputIterator , typename UnaryPredicate > | |
bool | all (InputIterator first, InputIterator last, UnaryPredicate pred) |
template<typename C > | |
bool | all (const C &c) |
template<typename C , typename P > | |
bool | all (const C &c, P p) |
template<typename InputIterator > | |
bool | any (InputIterator first, InputIterator last) |
template<typename InputIterator , typename UnaryPredicate > | |
bool | any (InputIterator first, InputIterator last, UnaryPredicate pred) |
template<typename C > | |
bool | any (const C &c) |
template<typename C , typename P > | |
bool | any (const C &c, P p) |
template<typename InputIterator , typename OutputIterator > | |
OutputIterator | copy_1st (InputIterator first, InputIterator last, OutputIterator dest) |
template<typename InputIterator , typename OutputIterator , typename Predicate > | |
OutputIterator | copy_1st_if (InputIterator first, InputIterator last, OutputIterator dest, Predicate pred) |
template<typename InputIterator , typename OutputIterator > | |
OutputIterator | copy_2nd (InputIterator first, InputIterator last, OutputIterator dest) |
template<typename InputIterator , typename OutputIterator , typename Predicate > | |
OutputIterator | copy_2nd_if (InputIterator first, InputIterator last, OutputIterator dest, Predicate pred) |
template<typename InputIterator , typename OutputIterator , typename UnaryPredicate > | |
OutputIterator | copy_if (InputIterator first, InputIterator last, OutputIterator dest, UnaryPredicate pred) |
template<typename InputIterator , typename BinaryOperation > | |
BinaryOperation | for_each_adjacent_pair (InputIterator first, InputIterator last, BinaryOperation op) |
template<typename C , typename B > | |
B | for_each_adjacent_pair (const C &c, B b) |
template<typename C , typename B > | |
B | for_each_adjacent_pair (C &c, B b) |
template<typename ForwardIterator , typename UnaryPredicate , typename UnaryFunction > | |
UnaryFunction | for_each_if (ForwardIterator first, ForwardIterator last, UnaryPredicate pred, UnaryFunction func) |
template<typename C , typename P , typename F > | |
P | for_each_if (const C &c, P p, F f) |
template<typename C , typename P , typename F > | |
P | for_each_if (C &c, P p, F f) |
template<typename InputIterator > | |
bool | none_of (InputIterator first, InputIterator last) |
template<typename InputIterator , typename UnaryPredicate > | |
bool | none_of (InputIterator first, InputIterator last, UnaryPredicate pred) |
template<typename C > | |
bool | none_of (const C &c) |
template<typename C , typename P > | |
bool | none_of (const C &c, P p) |
template<typename InputIterator , typename OutputIterator1 , typename OutputIterator2 , typename UnaryPredicate > | |
std::pair< OutputIterator1, OutputIterator2 > | separate_if (InputIterator first, InputIterator last, OutputIterator1 dest1, OutputIterator2 dest2, UnaryPredicate pred) |
template<typename ForwardIterator , typename ForwardIterator2 , typename BinaryPredicate > | |
bool | set_intersects (ForwardIterator first1, ForwardIterator last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred) |
template<typename C > | |
void | sort (C &c) |
template<typename C , typename P > | |
void | sort (C &c, P p) |
template<typename C > | |
C | sorted (const C &c) |
template<typename C , typename P > | |
C | sorted (const C &c, P p) |
template<typename OutputIterator , typename InputIterator , typename UnaryFunction > | |
OutputIterator | transform_1st (InputIterator first, InputIterator last, OutputIterator dest, UnaryFunction func) |
template<typename OutputIterator , typename InputIterator , typename UnaryFunction > | |
OutputIterator | transform_2nd (InputIterator first, InputIterator last, OutputIterator dest, UnaryFunction func) |
template<typename OutputIterator , typename InputIterator , typename UnaryFunction , typename UnaryPredicate > | |
OutputIterator | transform_if (InputIterator first, InputIterator last, OutputIterator dest, UnaryPredicate pred, UnaryFunction filter) |
template<typename ForwardIterator , typename ForwardIterator2 , typename OutputIterator , typename BinaryPredicate > | |
OutputIterator | set_intersection (ForwardIterator first1, ForwardIterator last1, ForwardIterator2 first2, ForwardIterator2 last2, OutputIterator result) |
template<typename ForwardIterator , typename ForwardIterator2 , typename OutputIterator , typename BinaryPredicate > | |
OutputIterator | set_intersection (ForwardIterator first1, ForwardIterator last1, ForwardIterator2 first2, ForwardIterator2 last2, OutputIterator result, BinaryPredicate pred) |
template<typename C , typename V > | |
boost::range_iterator< C >::type | find (C &c, const V &v) |
template<typename C , typename V > | |
boost::range_const_iterator< C > ::type | find (const C &c, const V &v) |
template<typename C , typename P > | |
boost::range_iterator< C >::type | find_if (C &c, P p) |
template<typename C , typename P > | |
boost::range_const_iterator< C > ::type | find_if (const C &c, P p) |
template<typename C , typename V > | |
bool | contains (const C &c, const V &v) |
template<typename C , typename P > | |
bool | contains_if (const C &c, P p) |
template<typename C , typename V > | |
bool | binary_search (const C &c, const V &v) |
template<typename C , typename V > | |
size_t | count (const C &c, const V &v) |
template<typename C , typename P > | |
size_t | count_if (const C &c, P p) |
template<typename O , typename I , typename P > | |
O | transform (const I &i, P p) |
template<typename I , typename OutputIterator , typename P > | |
OutputIterator | transform (const I &i, OutputIterator out, P p) |
template<typename O , typename I , typename P , typename F > | |
O | transform_if (const I &i, P p, F f) |
template<typename V , typename I , typename F > | |
V | accumulate_if (const I &i, F f, V v=V()) |
template<typename V , typename I , typename F , typename B > | |
V | accumulate_if (const I &i, F f, V v, B b) |
template<typename V , typename I , typename F > | |
V | accumulate_transform (const I &i, F f, V v=V()) |
template<typename V , typename I , typename F , typename B > | |
V | accumulate_transform (const I &i, F f, V v, B b) |
template<typename V , typename I , typename F , typename P > | |
V | accumulate_transform_if (const I &i, F f, P p, V v=V()) |
template<typename V , typename I , typename F , typename P , typename B > | |
V | accumulate_transform_if (const I &i, F f, P p, V v, B b) |
template<typename O , typename I > | |
O | copy (const I &i) |
template<typename O , typename I , typename P > | |
O | copy_if (const I &i, P p) |
template<typename I , typename P > | |
P | for_each (const I &i, P p) |
template<typename I , typename P > | |
P | for_each (I &i, P p) |
template<typename C1 , typename C2 > | |
bool | equal (const C1 &c1, const C2 &c2) |
template<typename C1 , typename C2 , typename P > | |
bool | equal (const C1 &c1, const C2 &c2, P p) |
template<typename C , typename O1 , typename O2 , typename P > | |
std::pair< O1, O2 > | separate_if (const C &c, O1 o1, O2 o2, P p) |
Function Documentation
Value kdtools::accumulate_if | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryPredicate | filter, | ||
const Value & | value = Value() |
||
) |
Definition at line 142 of file stl_util.h.
Value kdtools::accumulate_if | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryPredicate | filter, | ||
const Value & | value, | ||
BinaryOperation | op | ||
) |
Definition at line 148 of file stl_util.h.
V kdtools::accumulate_if | ( | const I & | i, |
F | f, | ||
V | v = V() |
||
) |
Definition at line 397 of file stl_util.h.
V kdtools::accumulate_if | ( | const I & | i, |
F | f, | ||
V | v, | ||
B | b | ||
) |
Definition at line 402 of file stl_util.h.
Value kdtools::accumulate_transform | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryFunction | map, | ||
const Value & | value = Value() |
||
) |
Definition at line 154 of file stl_util.h.
Value kdtools::accumulate_transform | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryFunction | map, | ||
const Value & | value, | ||
BinaryOperation | op | ||
) |
Definition at line 160 of file stl_util.h.
V kdtools::accumulate_transform | ( | const I & | i, |
F | f, | ||
V | v = V() |
||
) |
Definition at line 407 of file stl_util.h.
V kdtools::accumulate_transform | ( | const I & | i, |
F | f, | ||
V | v, | ||
B | b | ||
) |
Definition at line 412 of file stl_util.h.
Value kdtools::accumulate_transform_if | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryFunction | map, | ||
UnaryPredicate | pred, | ||
const Value & | value = Value() |
||
) |
Definition at line 166 of file stl_util.h.
Value kdtools::accumulate_transform_if | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryFunction | map, | ||
UnaryPredicate | filter, | ||
const Value & | value, | ||
BinaryOperation | op | ||
) |
Definition at line 172 of file stl_util.h.
V kdtools::accumulate_transform_if | ( | const I & | i, |
F | f, | ||
P | p, | ||
V | v = V() |
||
) |
Definition at line 417 of file stl_util.h.
V kdtools::accumulate_transform_if | ( | const I & | i, |
F | f, | ||
P | p, | ||
V | v, | ||
B | b | ||
) |
Definition at line 422 of file stl_util.h.
bool kdtools::all | ( | InputIterator | first, |
InputIterator | last | ||
) |
Definition at line 213 of file stl_util.h.
bool kdtools::all | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryPredicate | pred | ||
) |
Definition at line 223 of file stl_util.h.
bool kdtools::all | ( | const C & | c | ) |
Definition at line 482 of file stl_util.h.
bool kdtools::all | ( | const C & | c, |
P | p | ||
) |
Definition at line 487 of file stl_util.h.
bool kdtools::any | ( | InputIterator | first, |
InputIterator | last | ||
) |
Definition at line 193 of file stl_util.h.
bool kdtools::any | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryPredicate | pred | ||
) |
Definition at line 203 of file stl_util.h.
bool kdtools::any | ( | const C & | c | ) |
Definition at line 472 of file stl_util.h.
bool kdtools::any | ( | const C & | c, |
P | p | ||
) |
Definition at line 477 of file stl_util.h.
bool kdtools::binary_search | ( | const C & | c, |
const V & | v | ||
) |
Definition at line 361 of file stl_util.h.
bool kdtools::contains | ( | const C & | c, |
const V & | v | ||
) |
Definition at line 351 of file stl_util.h.
bool kdtools::contains_if | ( | const C & | c, |
P | p | ||
) |
Definition at line 356 of file stl_util.h.
O kdtools::copy | ( | const I & | i | ) |
Definition at line 427 of file stl_util.h.
OutputIterator kdtools::copy_1st | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator | dest | ||
) |
Definition at line 100 of file stl_util.h.
OutputIterator kdtools::copy_1st_if | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator | dest, | ||
Predicate | pred | ||
) |
Definition at line 114 of file stl_util.h.
OutputIterator kdtools::copy_2nd | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator | dest | ||
) |
Definition at line 107 of file stl_util.h.
OutputIterator kdtools::copy_2nd_if | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator | dest, | ||
Predicate | pred | ||
) |
Definition at line 121 of file stl_util.h.
OutputIterator kdtools::copy_if | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator | dest, | ||
UnaryPredicate | pred | ||
) |
Definition at line 81 of file stl_util.h.
O kdtools::copy_if | ( | const I & | i, |
P | p | ||
) |
Definition at line 434 of file stl_util.h.
size_t kdtools::count | ( | const C & | c, |
const V & | v | ||
) |
Definition at line 366 of file stl_util.h.
size_t kdtools::count_if | ( | const C & | c, |
P | p | ||
) |
Definition at line 371 of file stl_util.h.
bool kdtools::equal | ( | const C1 & | c1, |
const C2 & | c2 | ||
) |
Definition at line 451 of file stl_util.h.
bool kdtools::equal | ( | const C1 & | c1, |
const C2 & | c2, | ||
P | p | ||
) |
Definition at line 458 of file stl_util.h.
boost::range_iterator<C>::type kdtools::find | ( | C & | c, |
const V & | v | ||
) |
Versions of std algorithms that take ranges
Definition at line 324 of file stl_util.h.
boost::range_const_iterator<C>::type kdtools::find | ( | const C & | c, |
const V & | v | ||
) |
Definition at line 331 of file stl_util.h.
boost::range_iterator<C>::type kdtools::find_if | ( | C & | c, |
P | p | ||
) |
Definition at line 338 of file stl_util.h.
boost::range_const_iterator<C>::type kdtools::find_if | ( | const C & | c, |
P | p | ||
) |
Definition at line 345 of file stl_util.h.
P kdtools::for_each | ( | const I & | i, |
P | p | ||
) |
Definition at line 441 of file stl_util.h.
P kdtools::for_each | ( | I & | i, |
P | p | ||
) |
Definition at line 446 of file stl_util.h.
BinaryOperation kdtools::for_each_adjacent_pair | ( | InputIterator | first, |
InputIterator | last, | ||
BinaryOperation | op | ||
) |
Definition at line 243 of file stl_util.h.
B kdtools::for_each_adjacent_pair | ( | const C & | c, |
B | b | ||
) |
Definition at line 502 of file stl_util.h.
B kdtools::for_each_adjacent_pair | ( | C & | c, |
B | b | ||
) |
Definition at line 507 of file stl_util.h.
UnaryFunction kdtools::for_each_if | ( | ForwardIterator | first, |
ForwardIterator | last, | ||
UnaryPredicate | pred, | ||
UnaryFunction | func | ||
) |
Definition at line 257 of file stl_util.h.
P kdtools::for_each_if | ( | const C & | c, |
P | p, | ||
F | f | ||
) |
Definition at line 512 of file stl_util.h.
P kdtools::for_each_if | ( | C & | c, |
P | p, | ||
F | f | ||
) |
Definition at line 517 of file stl_util.h.
bool kdtools::none_of | ( | InputIterator | first, |
InputIterator | last | ||
) |
Definition at line 233 of file stl_util.h.
bool kdtools::none_of | ( | InputIterator | first, |
InputIterator | last, | ||
UnaryPredicate | pred | ||
) |
Definition at line 238 of file stl_util.h.
bool kdtools::none_of | ( | const C & | c | ) |
Definition at line 492 of file stl_util.h.
bool kdtools::none_of | ( | const C & | c, |
P | p | ||
) |
Definition at line 497 of file stl_util.h.
std::pair<OutputIterator1,OutputIterator2> kdtools::separate_if | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator1 | dest1, | ||
OutputIterator2 | dest2, | ||
UnaryPredicate | pred | ||
) |
Definition at line 178 of file stl_util.h.
std::pair<O1,O2> kdtools::separate_if | ( | const C & | c, |
O1 | o1, | ||
O2 | o2, | ||
P | p | ||
) |
Definition at line 465 of file stl_util.h.
OutputIterator kdtools::set_intersection | ( | ForwardIterator | first1, |
ForwardIterator | last1, | ||
ForwardIterator2 | first2, | ||
ForwardIterator2 | last2, | ||
OutputIterator | result | ||
) |
Versions of std::set_intersection optimized for ForwardIterator's.
Definition at line 268 of file stl_util.h.
OutputIterator kdtools::set_intersection | ( | ForwardIterator | first1, |
ForwardIterator | last1, | ||
ForwardIterator2 | first2, | ||
ForwardIterator2 | last2, | ||
OutputIterator | result, | ||
BinaryPredicate | pred | ||
) |
Definition at line 285 of file stl_util.h.
bool kdtools::set_intersects | ( | ForwardIterator | first1, |
ForwardIterator | last1, | ||
ForwardIterator2 | first2, | ||
ForwardIterator2 | last2, | ||
BinaryPredicate | pred | ||
) |
Definition at line 303 of file stl_util.h.
void kdtools::sort | ( | C & | c | ) |
Definition at line 522 of file stl_util.h.
void kdtools::sort | ( | C & | c, |
P | p | ||
) |
Definition at line 527 of file stl_util.h.
C kdtools::sorted | ( | const C & | c | ) |
Definition at line 532 of file stl_util.h.
C kdtools::sorted | ( | const C & | c, |
P | p | ||
) |
Definition at line 539 of file stl_util.h.
O kdtools::transform | ( | const I & | i, |
P | p | ||
) |
Definition at line 376 of file stl_util.h.
OutputIterator kdtools::transform | ( | const I & | i, |
OutputIterator | out, | ||
P | p | ||
) |
Definition at line 384 of file stl_util.h.
OutputIterator kdtools::transform_1st | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator | dest, | ||
UnaryFunction | func | ||
) |
Definition at line 128 of file stl_util.h.
OutputIterator kdtools::transform_2nd | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator | dest, | ||
UnaryFunction | func | ||
) |
Definition at line 135 of file stl_util.h.
OutputIterator kdtools::transform_if | ( | InputIterator | first, |
InputIterator | last, | ||
OutputIterator | dest, | ||
UnaryPredicate | pred, | ||
UnaryFunction | filter | ||
) |
Definition at line 93 of file stl_util.h.
O kdtools::transform_if | ( | const I & | i, |
P | p, | ||
F | f | ||
) |
Definition at line 389 of file stl_util.h.
Documentation copyright © 1996-2020 The KDE developers.
Generated on Mon Jun 22 2020 13:33:38 by doxygen 1.8.7 written by Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.