#include <Containers_T.h>
Public Types | |
typedef ACE_Bounded_Set_Iterator< T > | ITERATOR |
enum | { DEFAULT_SIZE = 10 } |
Public Methods | |
ACE_Bounded_Set (void) | |
The default constructor initializes the Bounded_Set to a maximum size specified by the DEFAULT_SIZE. More... | |
ACE_Bounded_Set (size_t size) | |
Initialize the Bounded_Set to have a maximum size equal to the size parameter specified. More... | |
ACE_Bounded_Set (const ACE_Bounded_Set< T > &) | |
Initialize the Bounded_Set to be a copy of the Bounded_Set parameter. More... | |
void | operator= (const ACE_Bounded_Set< T > &) |
The assignment will make a deep copy of the Bounded_Set provided. More... | |
~ACE_Bounded_Set (void) | |
Clean up the underlying dynamically allocated memory that is used by the Bounded_Set. More... | |
int | is_empty (void) const |
A constant time check is performed to determine if the Bounded_Set is empty. More... | |
int | is_full (void) const |
Performs a constant time check to determine if the Bounded_Set is at capacity. More... | |
int | insert (const T &new_item) |
Insert new_item into the set (doesn't allow duplicates) in linear time. More... | |
int | remove (const T &item) |
Remove first occurrence of item from the set. More... | |
int | find (const T &item) const |
find preforms a linear search for <item> and returns 0 on successful find and -1 otherwise. More... | |
size_t | size (void) const |
Returns a size_t representing 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 | |
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. It provides linear insert/remove/find operations. Insertion/removal does not invalidate iterators, but caution should be taken to ensure expected behavior. Once initialized, the object has a maximum size which can only be increased by the assignment of another larger Bounded_Set.
Requirements and Performance Characteristics
|
|
|
|
|
The default constructor initializes the Bounded_Set to a maximum size specified by the DEFAULT_SIZE.
|
|
Initialize the Bounded_Set to have a maximum size equal to the size parameter specified.
|
|
Initialize the Bounded_Set to be a copy of the Bounded_Set parameter.
|
|
Clean up the underlying dynamically allocated memory that is used by the Bounded_Set.
|
|
Dump the state of an object.
|
|
find preforms a linear search for <item> and returns 0 on successful find and -1 otherwise.
|
|
Insert new_item into the set (doesn't allow duplicates) in linear time. Returns -1 if failures occur, 1 if item is already present, else 0. |
|
A constant time check is performed to determine if the Bounded_Set is empty.
|
|
Performs a constant time check to determine if the Bounded_Set is at capacity.
|
|
The assignment will make a deep copy of the Bounded_Set provided. If the rhs has more elements than the capacity of the lhs, then the lhs will be deleted and reallocated to accomadate the larger number of elements. |
|
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. The linear remove operation does not reclaim the memory associated with the removed item. |
|
Returns a size_t representing the current 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.
|