#include <Containers_T.h>
Public Types | |
| typedef ACE_Bounded_Set_Iterator< T > | ITERATOR |
| enum | { DEFAULT_SIZE = 10 } |
Public Methods | |
| ACE_Bounded_Set (void) | |
| Constructor. More... | |
| ACE_Bounded_Set (size_t size) | |
| Constructor. More... | |
| ACE_Bounded_Set (const ACE_Bounded_Set< T > &) | |
| Copy constructor. More... | |
| void | operator= (const ACE_Bounded_Set< T > &) |
| Assignment operator. More... | |
| ~ACE_Bounded_Set (void) | |
| Destructor. More... | |
| int | is_empty (void) const |
| Returns 1 if the container is empty, otherwise returns 0. More... | |
| int | is_full (void) const |
| Returns 1 if the container is full, otherwise returns 0. More... | |
| int | insert (const T &new_item) |
| int | remove (const T &item) |
| int | find (const T &item) const |
| Finds if <item> occurs in the set. Returns 0 if finds, else -1. More... | |
| size_t | size (void) const |
| Size of the set. More... | |
| void | dump (void) const |
| Dump the state of an object. More... | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. More... | |
Private Attributes | |
| Search_Structure * | search_structure_ |
| Holds the contents of the set. More... | |
| size_t | cur_size_ |
| Current size of the set. More... | |
| size_t | max_size_ |
| Maximum size of the set. More... | |
Friends | |
| class | ACE_Bounded_Set_Iterator< T > |
This implementation of an unordered set uses a Bounded array. This implementation does not allow duplicates...
|
|||||
|
|
|
|||||
|
|
|
||||||||||
|
Constructor.
|
|
||||||||||
|
Constructor.
|
|
||||||||||
|
Copy constructor.
|
|
||||||||||
|
Destructor.
|
|
||||||||||
|
Dump the state of an object.
|
|
||||||||||
|
Finds if <item> occurs in the set. Returns 0 if finds, else -1.
|
|
||||||||||
|
Insert <new_item> into the set (doesn't allow duplicates). Returns -1 if failures occur, 1 if item is already present, else 0. |
|
||||||||||
|
Returns 1 if the container is empty, otherwise returns 0.
|
|
||||||||||
|
Returns 1 if the container is full, otherwise returns 0.
|
|
||||||||||
|
Assignment operator.
|
|
||||||||||
|
Remove first occurrence of <item> from the set. Returns 0 if it removes the item, -1 if it can't find the item, and -1 if a failure occurs. |
|
||||||||||
|
Size of the set.
|
|
|||||
|
|
|
|||||
|
Declare the dynamic allocation hooks.
|
|
|||||
|
Current size of the set.
|
|
|||||
|
Maximum size of the set.
|
|
|||||
|
Holds the contents of the set.
|
1.2.13.1 written by Dimitri van Heesch,
© 1997-2001