• Skip to content
  • Skip to link menu
KDE API Reference
  • KDE API Reference
  • kdepim API Reference
  • KDE Home
  • Contact Us
 

libkleo

Classes | Functions
kdtools Namespace Reference

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

template<typename Value , typename InputIterator , typename UnaryPredicate >
Value kdtools::accumulate_if ( InputIterator  first,
InputIterator  last,
UnaryPredicate  filter,
const Value &  value = Value() 
)

Definition at line 140 of file stl_util.h.

template<typename Value , typename InputIterator , typename UnaryPredicate , typename BinaryOperation >
Value kdtools::accumulate_if ( InputIterator  first,
InputIterator  last,
UnaryPredicate  filter,
const Value &  value,
BinaryOperation  op 
)

Definition at line 146 of file stl_util.h.

template<typename V , typename I , typename F >
V kdtools::accumulate_if ( const I &  i,
F  f,
V  v = V() 
)

Definition at line 395 of file stl_util.h.

template<typename V , typename I , typename F , typename B >
V kdtools::accumulate_if ( const I &  i,
F  f,
V  v,
B  b 
)

Definition at line 400 of file stl_util.h.

template<typename Value , typename InputIterator , typename UnaryFunction >
Value kdtools::accumulate_transform ( InputIterator  first,
InputIterator  last,
UnaryFunction  map,
const Value &  value = Value() 
)

Definition at line 152 of file stl_util.h.

template<typename Value , typename InputIterator , typename UnaryFunction , typename BinaryOperation >
Value kdtools::accumulate_transform ( InputIterator  first,
InputIterator  last,
UnaryFunction  map,
const Value &  value,
BinaryOperation  op 
)

Definition at line 158 of file stl_util.h.

template<typename V , typename I , typename F >
V kdtools::accumulate_transform ( const I &  i,
F  f,
V  v = V() 
)

Definition at line 405 of file stl_util.h.

template<typename V , typename I , typename F , typename B >
V kdtools::accumulate_transform ( const I &  i,
F  f,
V  v,
B  b 
)

Definition at line 410 of file stl_util.h.

template<typename Value , typename InputIterator , typename UnaryFunction , typename UnaryPredicate >
Value kdtools::accumulate_transform_if ( InputIterator  first,
InputIterator  last,
UnaryFunction  map,
UnaryPredicate  pred,
const Value &  value = Value() 
)

Definition at line 164 of file stl_util.h.

template<typename Value , typename InputIterator , typename UnaryFunction , typename UnaryPredicate , typename BinaryOperation >
Value kdtools::accumulate_transform_if ( InputIterator  first,
InputIterator  last,
UnaryFunction  map,
UnaryPredicate  filter,
const Value &  value,
BinaryOperation  op 
)

Definition at line 170 of file stl_util.h.

template<typename V , typename I , typename F , typename P >
V kdtools::accumulate_transform_if ( const I &  i,
F  f,
P  p,
V  v = V() 
)

Definition at line 415 of file stl_util.h.

template<typename V , typename I , typename F , typename P , typename B >
V kdtools::accumulate_transform_if ( const I &  i,
F  f,
P  p,
V  v,
B  b 
)

Definition at line 420 of file stl_util.h.

template<typename InputIterator >
bool kdtools::all ( InputIterator  first,
InputIterator  last 
)

Definition at line 211 of file stl_util.h.

template<typename InputIterator , typename UnaryPredicate >
bool kdtools::all ( InputIterator  first,
InputIterator  last,
UnaryPredicate  pred 
)

Definition at line 221 of file stl_util.h.

template<typename C >
bool kdtools::all ( const C &  c)

Definition at line 480 of file stl_util.h.

template<typename C , typename P >
bool kdtools::all ( const C &  c,
P  p 
)

Definition at line 485 of file stl_util.h.

template<typename InputIterator >
bool kdtools::any ( InputIterator  first,
InputIterator  last 
)

Definition at line 191 of file stl_util.h.

template<typename InputIterator , typename UnaryPredicate >
bool kdtools::any ( InputIterator  first,
InputIterator  last,
UnaryPredicate  pred 
)

Definition at line 201 of file stl_util.h.

template<typename C >
bool kdtools::any ( const C &  c)

Definition at line 470 of file stl_util.h.

template<typename C , typename P >
bool kdtools::any ( const C &  c,
P  p 
)

Definition at line 475 of file stl_util.h.

template<typename C , typename V >
bool kdtools::binary_search ( const C &  c,
const V &  v 
)

Definition at line 359 of file stl_util.h.

template<typename C , typename V >
bool kdtools::contains ( const C &  c,
const V &  v 
)

Definition at line 349 of file stl_util.h.

template<typename C , typename P >
bool kdtools::contains_if ( const C &  c,
P  p 
)

Definition at line 354 of file stl_util.h.

template<typename O , typename I >
O kdtools::copy ( const I &  i)

Definition at line 425 of file stl_util.h.

template<typename InputIterator , typename OutputIterator >
OutputIterator kdtools::copy_1st ( InputIterator  first,
InputIterator  last,
OutputIterator  dest 
)

Definition at line 98 of file stl_util.h.

template<typename InputIterator , typename OutputIterator , typename Predicate >
OutputIterator kdtools::copy_1st_if ( InputIterator  first,
InputIterator  last,
OutputIterator  dest,
Predicate  pred 
)

Definition at line 112 of file stl_util.h.

template<typename InputIterator , typename OutputIterator >
OutputIterator kdtools::copy_2nd ( InputIterator  first,
InputIterator  last,
OutputIterator  dest 
)

Definition at line 105 of file stl_util.h.

template<typename InputIterator , typename OutputIterator , typename Predicate >
OutputIterator kdtools::copy_2nd_if ( InputIterator  first,
InputIterator  last,
OutputIterator  dest,
Predicate  pred 
)

Definition at line 119 of file stl_util.h.

template<typename InputIterator , typename OutputIterator , typename UnaryPredicate >
OutputIterator kdtools::copy_if ( InputIterator  first,
InputIterator  last,
OutputIterator  dest,
UnaryPredicate  pred 
)

Definition at line 79 of file stl_util.h.

template<typename O , typename I , typename P >
O kdtools::copy_if ( const I &  i,
P  p 
)

Definition at line 432 of file stl_util.h.

template<typename C , typename V >
size_t kdtools::count ( const C &  c,
const V &  v 
)

Definition at line 364 of file stl_util.h.

template<typename C , typename P >
size_t kdtools::count_if ( const C &  c,
P  p 
)

Definition at line 369 of file stl_util.h.

template<typename C1 , typename C2 >
bool kdtools::equal ( const C1 &  c1,
const C2 &  c2 
)

Definition at line 449 of file stl_util.h.

template<typename C1 , typename C2 , typename P >
bool kdtools::equal ( const C1 &  c1,
const C2 &  c2,
P  p 
)

Definition at line 456 of file stl_util.h.

template<typename C , typename V >
boost::range_iterator<C>::type kdtools::find ( C &  c,
const V &  v 
)

Versions of std algorithms that take ranges

Definition at line 322 of file stl_util.h.

template<typename C , typename V >
boost::range_const_iterator<C>::type kdtools::find ( const C &  c,
const V &  v 
)

Definition at line 329 of file stl_util.h.

template<typename C , typename P >
boost::range_iterator<C>::type kdtools::find_if ( C &  c,
P  p 
)

Definition at line 336 of file stl_util.h.

template<typename C , typename P >
boost::range_const_iterator<C>::type kdtools::find_if ( const C &  c,
P  p 
)

Definition at line 343 of file stl_util.h.

template<typename I , typename P >
P kdtools::for_each ( const I &  i,
P  p 
)

Definition at line 439 of file stl_util.h.

template<typename I , typename P >
P kdtools::for_each ( I &  i,
P  p 
)

Definition at line 444 of file stl_util.h.

template<typename InputIterator , typename BinaryOperation >
BinaryOperation kdtools::for_each_adjacent_pair ( InputIterator  first,
InputIterator  last,
BinaryOperation  op 
)

Definition at line 241 of file stl_util.h.

template<typename C , typename B >
B kdtools::for_each_adjacent_pair ( const C &  c,
B  b 
)

Definition at line 500 of file stl_util.h.

template<typename C , typename B >
B kdtools::for_each_adjacent_pair ( C &  c,
B  b 
)

Definition at line 505 of file stl_util.h.

template<typename ForwardIterator , typename UnaryPredicate , typename UnaryFunction >
UnaryFunction kdtools::for_each_if ( ForwardIterator  first,
ForwardIterator  last,
UnaryPredicate  pred,
UnaryFunction  func 
)

Definition at line 255 of file stl_util.h.

template<typename C , typename P , typename F >
P kdtools::for_each_if ( const C &  c,
P  p,
F  f 
)

Definition at line 510 of file stl_util.h.

template<typename C , typename P , typename F >
P kdtools::for_each_if ( C &  c,
P  p,
F  f 
)

Definition at line 515 of file stl_util.h.

template<typename InputIterator >
bool kdtools::none_of ( InputIterator  first,
InputIterator  last 
)

Definition at line 231 of file stl_util.h.

template<typename InputIterator , typename UnaryPredicate >
bool kdtools::none_of ( InputIterator  first,
InputIterator  last,
UnaryPredicate  pred 
)

Definition at line 236 of file stl_util.h.

template<typename C >
bool kdtools::none_of ( const C &  c)

Definition at line 490 of file stl_util.h.

template<typename C , typename P >
bool kdtools::none_of ( const C &  c,
P  p 
)

Definition at line 495 of file stl_util.h.

template<typename InputIterator , typename OutputIterator1 , typename OutputIterator2 , typename UnaryPredicate >
std::pair<OutputIterator1,OutputIterator2> kdtools::separate_if ( InputIterator  first,
InputIterator  last,
OutputIterator1  dest1,
OutputIterator2  dest2,
UnaryPredicate  pred 
)

Definition at line 176 of file stl_util.h.

template<typename C , typename O1 , typename O2 , typename P >
std::pair<O1,O2> kdtools::separate_if ( const C &  c,
O1  o1,
O2  o2,
P  p 
)

Definition at line 463 of file stl_util.h.

template<typename ForwardIterator , typename ForwardIterator2 , typename OutputIterator , typename BinaryPredicate >
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 266 of file stl_util.h.

template<typename ForwardIterator , typename ForwardIterator2 , typename OutputIterator , typename BinaryPredicate >
OutputIterator kdtools::set_intersection ( ForwardIterator  first1,
ForwardIterator  last1,
ForwardIterator2  first2,
ForwardIterator2  last2,
OutputIterator  result,
BinaryPredicate  pred 
)

Definition at line 283 of file stl_util.h.

template<typename ForwardIterator , typename ForwardIterator2 , typename BinaryPredicate >
bool kdtools::set_intersects ( ForwardIterator  first1,
ForwardIterator  last1,
ForwardIterator2  first2,
ForwardIterator2  last2,
BinaryPredicate  pred 
)

Definition at line 301 of file stl_util.h.

template<typename C >
void kdtools::sort ( C &  c)

Definition at line 520 of file stl_util.h.

template<typename C , typename P >
void kdtools::sort ( C &  c,
P  p 
)

Definition at line 525 of file stl_util.h.

template<typename C >
C kdtools::sorted ( const C &  c)

Definition at line 530 of file stl_util.h.

template<typename C , typename P >
C kdtools::sorted ( const C &  c,
P  p 
)

Definition at line 537 of file stl_util.h.

template<typename O , typename I , typename P >
O kdtools::transform ( const I &  i,
P  p 
)

Definition at line 374 of file stl_util.h.

template<typename I , typename OutputIterator , typename P >
OutputIterator kdtools::transform ( const I &  i,
OutputIterator  out,
P  p 
)

Definition at line 382 of file stl_util.h.

template<typename OutputIterator , typename InputIterator , typename UnaryFunction >
OutputIterator kdtools::transform_1st ( InputIterator  first,
InputIterator  last,
OutputIterator  dest,
UnaryFunction  func 
)

Definition at line 126 of file stl_util.h.

template<typename OutputIterator , typename InputIterator , typename UnaryFunction >
OutputIterator kdtools::transform_2nd ( InputIterator  first,
InputIterator  last,
OutputIterator  dest,
UnaryFunction  func 
)

Definition at line 133 of file stl_util.h.

template<typename OutputIterator , typename InputIterator , typename UnaryFunction , typename UnaryPredicate >
OutputIterator kdtools::transform_if ( InputIterator  first,
InputIterator  last,
OutputIterator  dest,
UnaryPredicate  pred,
UnaryFunction  filter 
)

Definition at line 91 of file stl_util.h.

template<typename O , typename I , typename P , typename F >
O kdtools::transform_if ( const I &  i,
P  p,
F  f 
)

Definition at line 387 of file stl_util.h.

This file is part of the KDE documentation.
Documentation copyright © 1996-2014 The KDE developers.
Generated on Tue Oct 14 2014 22:57:49 by doxygen 1.8.7 written by Dimitri van Heesch, © 1997-2006

KDE's Doxygen guidelines are available online.

libkleo

Skip menu "libkleo"
  • Main Page
  • Namespace List
  • Namespace Members
  • Alphabetical List
  • Class List
  • Class Hierarchy
  • Class Members
  • File List
  • File Members

kdepim API Reference

Skip menu "kdepim API Reference"
  • akonadi_next
  • akregator
  • blogilo
  • calendarsupport
  • console
  •   kabcclient
  •   konsolekalendar
  • kaddressbook
  • kalarm
  •   lib
  • kdgantt2
  • kjots
  • kleopatra
  • kmail
  • knode
  • knotes
  • kontact
  • korgac
  • korganizer
  • ktimetracker
  • libkdepim
  • libkleo
  • libkpgp
  • mailcommon
  • messagelist
  • messageviewer

Search



Report problems with this website to our bug tracking system.
Contact the specific authors with questions and comments about the page contents.

KDE® and the K Desktop Environment® logo are registered trademarks of KDE e.V. | Legal