klee::ImmutableSet< T, CMP > Class Template Reference

#include <ImmutableSet.h>

Collaboration diagram for klee::ImmutableSet< T, CMP >:

Collaboration graph
[legend]

List of all members.

Public Types

typedef T key_type
typedef T value_type
typedef ImmutableTree< T, T,
_Identity< T >, CMP > 
Tree
typedef Tree::iterator iterator

Public Member Functions

 ImmutableSet ()
 ImmutableSet (const ImmutableSet &b)
 ~ImmutableSet ()
ImmutableSetoperator= (const ImmutableSet &b)
bool empty () const
unsigned count (const key_type &key) const
const value_typelookup (const key_type &key) const
const value_typemin () const
const value_typemax () const
unsigned size ()
ImmutableSet insert (const value_type &value) const
ImmutableSet replace (const value_type &value) const
ImmutableSet remove (const key_type &key) const
ImmutableSet popMin (const value_type &valueOut) const
ImmutableSet popMax (const value_type &valueOut) const
iterator begin () const
iterator end () const
iterator find (const key_type &key) const
iterator lower_bound (const key_type &key) const
iterator upper_bound (const key_type &key) const

Static Public Member Functions

static unsigned getAllocated ()

Private Member Functions

 ImmutableSet (const Tree &b)

Private Attributes

Tree elts


Detailed Description

template<class T, class CMP = std::less<T>>
class klee::ImmutableSet< T, CMP >

Definition at line 25 of file ImmutableSet.h.


Member Typedef Documentation

template<class T , class CMP = std::less<T>>
typedef Tree::iterator klee::ImmutableSet< T, CMP >::iterator

Definition at line 31 of file ImmutableSet.h.

template<class T , class CMP = std::less<T>>
typedef T klee::ImmutableSet< T, CMP >::key_type

Definition at line 27 of file ImmutableSet.h.

template<class T , class CMP = std::less<T>>
typedef ImmutableTree<T, T, _Identity<T>, CMP> klee::ImmutableSet< T, CMP >::Tree

Definition at line 30 of file ImmutableSet.h.

template<class T , class CMP = std::less<T>>
typedef T klee::ImmutableSet< T, CMP >::value_type

Definition at line 28 of file ImmutableSet.h.


Constructor & Destructor Documentation

template<class T , class CMP = std::less<T>>
klee::ImmutableSet< T, CMP >::ImmutableSet ( const Tree b  )  [inline, private]

Definition at line 36 of file ImmutableSet.h.

template<class T , class CMP = std::less<T>>
klee::ImmutableSet< T, CMP >::ImmutableSet (  )  [inline]

Definition at line 39 of file ImmutableSet.h.

template<class T , class CMP = std::less<T>>
klee::ImmutableSet< T, CMP >::ImmutableSet ( const ImmutableSet< T, CMP > &  b  )  [inline]

Definition at line 40 of file ImmutableSet.h.

template<class T , class CMP = std::less<T>>
klee::ImmutableSet< T, CMP >::~ImmutableSet (  )  [inline]

Definition at line 41 of file ImmutableSet.h.


Member Function Documentation

template<class T , class CMP = std::less<T>>
iterator klee::ImmutableSet< T, CMP >::begin (  )  const [inline]

Definition at line 80 of file ImmutableSet.h.

References klee::ImmutableTree< K, V, KOV, CMP >::begin(), and klee::ImmutableSet< T, CMP >::elts.

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
unsigned klee::ImmutableSet< T, CMP >::count ( const key_type key  )  const [inline]

Definition at line 48 of file ImmutableSet.h.

References klee::ImmutableTree< K, V, KOV, CMP >::count(), and klee::ImmutableSet< T, CMP >::elts.

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
bool klee::ImmutableSet< T, CMP >::empty (  )  const [inline]

Definition at line 45 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::empty().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
iterator klee::ImmutableSet< T, CMP >::end (  )  const [inline]

Definition at line 83 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::end().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
iterator klee::ImmutableSet< T, CMP >::find ( const key_type key  )  const [inline]

Definition at line 86 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::find().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
static unsigned klee::ImmutableSet< T, CMP >::getAllocated (  )  [inline, static]

template<class T , class CMP = std::less<T>>
ImmutableSet klee::ImmutableSet< T, CMP >::insert ( const value_type value  )  const [inline]

Definition at line 64 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::insert().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
const value_type* klee::ImmutableSet< T, CMP >::lookup ( const key_type key  )  const [inline]

Definition at line 51 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::lookup().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
iterator klee::ImmutableSet< T, CMP >::lower_bound ( const key_type key  )  const [inline]

Definition at line 89 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::lower_bound().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
const value_type& klee::ImmutableSet< T, CMP >::max (  )  const [inline]

Definition at line 57 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::max().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
const value_type& klee::ImmutableSet< T, CMP >::min (  )  const [inline]

Definition at line 54 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::min().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
ImmutableSet& klee::ImmutableSet< T, CMP >::operator= ( const ImmutableSet< T, CMP > &  b  )  [inline]

Definition at line 43 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts.

template<class T , class CMP = std::less<T>>
ImmutableSet klee::ImmutableSet< T, CMP >::popMax ( const value_type valueOut  )  const [inline]

Definition at line 76 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::popMax().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
ImmutableSet klee::ImmutableSet< T, CMP >::popMin ( const value_type valueOut  )  const [inline]

Definition at line 73 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::popMin().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
ImmutableSet klee::ImmutableSet< T, CMP >::remove ( const key_type key  )  const [inline]

Definition at line 70 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::remove().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
ImmutableSet klee::ImmutableSet< T, CMP >::replace ( const value_type value  )  const [inline]

Definition at line 67 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::replace().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
unsigned klee::ImmutableSet< T, CMP >::size (  )  [inline]

Definition at line 60 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::size().

Here is the call graph for this function:

template<class T , class CMP = std::less<T>>
iterator klee::ImmutableSet< T, CMP >::upper_bound ( const key_type key  )  const [inline]

Definition at line 92 of file ImmutableSet.h.

References klee::ImmutableSet< T, CMP >::elts, and klee::ImmutableTree< K, V, KOV, CMP >::upper_bound().

Here is the call graph for this function:


Member Data Documentation

template<class T , class CMP = std::less<T>>
Tree klee::ImmutableSet< T, CMP >::elts [private]


The documentation for this class was generated from the following file:

Generated on Fri Jun 5 03:33:06 2009 for klee by  doxygen 1.5.8