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


Public Member Functions | |
| ACE_Unbounded_Set (ACE_Allocator *alloc=nullptr) | |
Public Member Functions inherited from ACE_Unbounded_Set_Ex< T, ACE_Unbounded_Set_Default_Comparator< T > > | |
| ACE_Unbounded_Set_Ex (ACE_Allocator *alloc=nullptr) | |
| ACE_Unbounded_Set_Ex (const ACE_Unbounded_Set_Default_Comparator< T > &comparator, ACE_Allocator *alloc=nullptr) | |
| 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 () | |
| Destructor. | |
| bool | is_empty () const |
Returns true if the container is empty, otherwise returns false. | |
| bool | is_full () 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 () const |
| Size of the set. | |
| void | dump () const |
| Dump the state of an object. | |
| void | reset () |
| Reset the ACE_Unbounded_Set_Ex to be empty. | |
| iterator | begin () |
| const_iterator | begin () const |
| iterator | end () |
| const_iterator | end () const |
Compatibility wrapper for ACE_Unbounded_Set_Ex.
| ACE_Unbounded_Set< T >::ACE_Unbounded_Set | ( | ACE_Allocator * | alloc = nullptr | ) |