#include <Containers_T.h>
Inheritance diagram for ACE_Fixed_Set:
Public Types | |
typedef ACE_Fixed_Set_Iterator< T, ACE_SIZE > | ITERATOR |
typedef ACE_Fixed_Set_Iterator< T, ACE_SIZE > | CONST_ITERATOR |
Public Methods | |
ACE_Fixed_Set (void) | |
Creates an empy set. More... | |
ACE_Fixed_Set (const ACE_Fixed_Set< T, ACE_SIZE > &) | |
Initializes a set to be a copy of the set parameter. More... | |
void | operator= (const ACE_Fixed_Set< T, ACE_SIZE > &) |
Deep copy of one set to another. More... | |
~ACE_Fixed_Set (void) | |
Destroys a set. More... | |
int | is_empty (void) const |
Performs constant time check to determine if a set is empty. More... | |
int | is_full (void) const |
Performs a constant time check to see if the set is full. More... | |
int | insert (const T &new_item) |
Insert <new_item> into the set (doesn't allow duplicates). More... | |
int | remove (const T &item) |
Remove first occurrence of <item> from the set. More... | |
int | find (const T &item) const |
Performs a linear find operation for the specified <item>. More... | |
size_t | size (void) const |
Returns the current 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 | |
struct { | |
T item_ | |
int is_free_ | |
} | search_structure_ [ACE_SIZE] |
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_Fixed_Set_Iterator< T, ACE_SIZE > |
class | ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE > |
This implementation of an unordered set uses a fixed array. It does not allow duplicate members. The set provides linear insertion/deletion operations.
Requirements and Performance Characteristics
|
|
|
|
|
Creates an empy set.
|
|
Initializes a set to be a copy of the set parameter.
|
|
Destroys a set.
|
|
Dump the state of an object.
|
|
Performs a linear find operation for the specified <item>.
|
|
Insert <new_item> into the set (doesn't allow duplicates). Returns -1 if failures occur, 1 if item is already present, else 0. |
|
Performs constant time check to determine if a set is empty.
|
|
Performs a constant time check to see if the set is full.
|
|
Deep copy of one set to another.
|
|
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. Removal doesn't reclaim memory for the <item>. |
|
Returns the current size of the set.
|
|
|
|
|
|
Declare the dynamic allocation hooks.
|
|
Current size of the set.
|
|
Keeps track of whether this item is in use or not.
|
|
Item in the set.
|
|
Maximum size of the set.
|
|
Holds the contents of the set.
|