| ACE
    6.1.7
    | 
Compatibility wrapper for ACE_Unbounded_Set_Ex. More...
#include <Unbounded_Set.h>


| Public Member Functions | |
| ACE_Unbounded_Set (ACE_Allocator *alloc=0) | |
|  Public Member Functions inherited from ACE_Unbounded_Set_Ex< T, ACE_Unbounded_Set_Default_Comparator< T > > | |
| ACE_Unbounded_Set_Ex (ACE_Allocator *alloc=0) | |
| ACE_Unbounded_Set_Ex (const ACE_Unbounded_Set_Default_Comparator< T > &comparator, ACE_Allocator *alloc=0) | |
| ACE_Unbounded_Set_Ex (const ACE_Unbounded_Set_Ex< T, ACE_Unbounded_Set_Default_Comparator< T > > &) | |
| Copy constructor. | |
| ACE_Unbounded_Set_Ex< T, ACE_Unbounded_Set_Default_Comparator < T > > & | operator= (const ACE_Unbounded_Set_Ex< T, ACE_Unbounded_Set_Default_Comparator< T > > &) | 
| Assignment operator. | |
| ~ACE_Unbounded_Set_Ex (void) | |
| Destructor. | |
| bool | is_empty (void) const | 
| Returns trueif the container is empty, otherwise returnsfalse. | |
| bool | is_full (void) const | 
| Returns false. | |
| int | insert (const T &new_item) | 
| Linear insertion of an item. | |
| int | insert_tail (const T &item) | 
| int | remove (const T &item) | 
| Linear remove operation. | |
| int | find (const T &item) const | 
| size_t | size (void) const | 
| Size of the set. | |
| void | dump (void) const | 
| Dump the state of an object. | |
| void | reset (void) | 
| Reset the ACE_Unbounded_Set_Ex to be empty. | |
| iterator | begin (void) | 
| const_iterator | begin (void) const | 
| iterator | end (void) | 
| const_iterator | end (void) const | 
Compatibility wrapper for ACE_Unbounded_Set_Ex.
| ACE_Unbounded_Set< T >::ACE_Unbounded_Set | ( | ACE_Allocator * | alloc = 0 | ) | 
 1.8.1.1
 1.8.1.1