#include <Unbounded_Set.h>
Collaboration diagram for ACE_Unbounded_Set:
Public Types | |
typedef ACE_Unbounded_Set_Iterator< T> | ITERATOR |
typedef ACE_Unbounded_Set_Iterator< T> | iterator |
typedef ACE_Unbounded_Set_Const_Iterator< T> | CONST_ITERATOR |
typedef ACE_Unbounded_Set_Const_Iterator< T> | const_iterator |
Public Methods | |
ACE_Unbounded_Set (ACE_Allocator *alloc = 0) | |
Constructor. Use user specified allocation strategy if specified. | |
ACE_Unbounded_Set (const ACE_Unbounded_Set<T> &) | |
Copy constructor. | |
void | operator= (const ACE_Unbounded_Set<T> &) |
Assignment operator. | |
~ACE_Unbounded_Set (void) | |
Destructor. | |
int | is_empty (void) const |
Returns 1 if the container is empty, otherwise returns 0. | |
int | is_full (void) const |
Returns 1 if the container is full, otherwise returns 0. | |
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 find succeeds, else -1. | |
size_t | size (void) const |
Size of the set. | |
void | dump (void) const |
Dump the state of an object. | |
void | reset (void) |
Reset the to be empty. | |
ACE_Unbounded_Set_Iterator<T> | begin (void) |
ACE_Unbounded_Set_Iterator<T> | end (void) |
Public Attributes | |
ACE_ALLOC_HOOK_DECLARE | |
Declare the dynamic allocation hooks. | |
Private Methods | |
int | insert_tail (const T &item) |
Insert <item> at the tail of the set (doesn't check for duplicates). | |
void | delete_nodes (void) |
Delete all the nodes in the Set. | |
void | copy_nodes (const ACE_Unbounded_Set<T> &) |
Copy nodes into this set. | |
Private Attributes | |
ACE_Node<T>* | head_ |
Head of the linked list of Nodes. | |
size_t | cur_size_ |
Current size of the set. | |
ACE_Allocator* | allocator_ |
Allocation strategy of the set. | |
Friends | |
class | ACE_Unbounded_Set_Iterator< T > |
class | ACE_Unbounded_Set_Const_Iterator< T > |
This implementation of an unordered set uses a circular linked list with a dummy node. This implementation does not allow duplicates, but it maintains FIFO ordering of insertions.
|
|
|
|
|
|
|
|
|
Constructor. Use user specified allocation strategy if specified.
|
|
Copy constructor.
|
|
Destructor.
|
|
|
|
Copy nodes into this set.
|
|
Delete all the nodes in the Set.
|
|
Dump the state of an object.
|
|
|
|
Finds if <item> occurs in the set. Returns 0 if find succeeds, 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. |
|
Insert <item> at the tail of the set (doesn't check for duplicates).
|
|
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. |
|
Reset the to be empty.
|
|
Size of the set.
|
|
|
|
|
|
Declare the dynamic allocation hooks.
|
|
Allocation strategy of the set.
|
|
Current size of the set.
|
|
Head of the linked list of Nodes.
|