HDK
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
UT_SortedSet< K, C > Class Template Reference

#include <UT_Set.h>

+ Inheritance diagram for UT_SortedSet< K, C >:

Public Types

typedef std::set< K, C > Base
 
typedef C LessThan
 
typedef Base::key_type key_type
 
typedef Base::value_type value_type
 
typedef Base::key_compare key_compare
 
typedef Base::iterator iterator
 
typedef Base::const_iterator const_iterator
 

Public Member Functions

 UT_SortedSet ()
 
 UT_SortedSet (const LessThan &lt)
 
template<typename InputIt >
 UT_SortedSet (InputIt first, InputIt last)
 
template<typename InputIt >
 UT_SortedSet (InputIt first, InputIt last, const LessThan &lt)
 
 UT_SortedSet (const K &k)
 
int64 getMemoryUsage (bool inclusive) const
 
bool contains (const K &key) const
 
bool contains (const UT_SortedSet< K > &src) const
 
UT_SortedSet< K, C > & operator|= (const UT_SortedSet< K, C > &src)
 Set-wise boolean operations. More...
 
UT_SortedSet< K, C > & operator&= (const UT_SortedSet< K, C > &src)
 
UT_SortedSet< K, C > & operator-= (const UT_SortedSet< K, C > &src)
 

Detailed Description

template<typename K, typename C = std::less<K>>
class UT_SortedSet< K, C >

Definition at line 165 of file UT_Set.h.

Member Typedef Documentation

template<typename K, typename C = std::less<K>>
typedef std::set<K, C> UT_SortedSet< K, C >::Base

Definition at line 168 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
typedef Base::const_iterator UT_SortedSet< K, C >::const_iterator

Definition at line 230 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
typedef Base::iterator UT_SortedSet< K, C >::iterator

Definition at line 229 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
typedef Base::key_compare UT_SortedSet< K, C >::key_compare

Definition at line 228 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
typedef Base::key_type UT_SortedSet< K, C >::key_type

Definition at line 226 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
typedef C UT_SortedSet< K, C >::LessThan

Definition at line 169 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
typedef Base::value_type UT_SortedSet< K, C >::value_type

Definition at line 227 of file UT_Set.h.

Constructor & Destructor Documentation

template<typename K, typename C = std::less<K>>
UT_SortedSet< K, C >::UT_SortedSet ( )
inline

Definition at line 171 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
UT_SortedSet< K, C >::UT_SortedSet ( const LessThan lt)
inlineexplicit

Definition at line 173 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
template<typename InputIt >
UT_SortedSet< K, C >::UT_SortedSet ( InputIt  first,
InputIt  last 
)
inline

Definition at line 176 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
template<typename InputIt >
UT_SortedSet< K, C >::UT_SortedSet ( InputIt  first,
InputIt  last,
const LessThan lt 
)
inline

Definition at line 179 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
UT_SortedSet< K, C >::UT_SortedSet ( const K &  k)
inline

Definition at line 184 of file UT_Set.h.

Member Function Documentation

template<typename K, typename C = std::less<K>>
bool UT_SortedSet< K, C >::contains ( const K &  key) const
inline

Determines membership in a set, a bit more semantically readable than count() or find()

Definition at line 198 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
bool UT_SortedSet< K, C >::contains ( const UT_SortedSet< K > &  src) const
inline

Definition at line 201 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
int64 UT_SortedSet< K, C >::getMemoryUsage ( bool  inclusive) const
inline

Definition at line 189 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
UT_SortedSet<K,C>& UT_SortedSet< K, C >::operator&= ( const UT_SortedSet< K, C > &  src)
inline

Definition at line 212 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
UT_SortedSet<K,C>& UT_SortedSet< K, C >::operator-= ( const UT_SortedSet< K, C > &  src)
inline

Definition at line 219 of file UT_Set.h.

template<typename K, typename C = std::less<K>>
UT_SortedSet<K,C>& UT_SortedSet< K, C >::operator|= ( const UT_SortedSet< K, C > &  src)
inline

Set-wise boolean operations.

Definition at line 208 of file UT_Set.h.


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