#include <Unbounded_Set.h>
Inheritance 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. More... | |
| ACE_Unbounded_Set (const ACE_Unbounded_Set< T > &) | |
| Copy constructor. More... | |
| void | operator= (const ACE_Unbounded_Set< T > &) |
| Assignment operator. More... | |
| ~ACE_Unbounded_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 0. More... | |
| int | insert (const T &new_item) |
| Linear insertion of an item. More... | |
| int | insert_tail (const T &item) |
| Insert <item> at the tail of the set (doesn't check for duplicates). More... | |
| int | remove (const T &item) |
| Linear remove operation. More... | |
| int | find (const T &item) const |
| Finds if <item> occurs in the set. Returns 0 if find succeeds, else -1. More... | |
| size_t | size (void) const |
| Size of the set. More... | |
| void | dump (void) const |
| Dump the state of an object. More... | |
| void | reset (void) |
| Reset the <ACE_Unbounded_Set> to be empty. More... | |
| 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. More... | |
Private Methods | |
| void | delete_nodes (void) |
| Delete all the nodes in the Set. More... | |
| void | copy_nodes (const ACE_Unbounded_Set< T > &) |
| Copy nodes into this set. More... | |
Private Attributes | |
| ACE_Node< T > * | head_ |
| Head of the linked list of Nodes. More... | |
| size_t | cur_size_ |
| Current size of the set. More... | |
| ACE_Allocator * | allocator_ |
| Allocation strategy of the set. More... | |
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.
Requirements and Performance Characteristics
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
|||||
|
|
|
||||||||||
|
Constructor. Use user specified allocation strategy if specified. Initialize an empty set using the allocation strategy of the user if provided. |
|
||||||||||
|
Copy constructor. Initialize this set to be an exact copy of the set provided. |
|
||||||||||
|
Destructor. Destroy the nodes of the set. |
|
||||||||||
|
|
|
||||||||||
|
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. Performs a linear find operation. |
|
||||||||||
|
Linear insertion of an item. 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). Constant time insert at the end of the set. |
|
||||||||||
|
Returns 1 if the container is empty, otherwise returns 0. Constant time is_empty check. |
|
||||||||||
|
Returns 0. Always returns 0 since the set can never fill up. |
|
||||||||||
|
Assignment operator. Perform a deep copy of the rhs into the lhs. |
|
||||||||||
|
Linear remove operation. 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 <ACE_Unbounded_Set> to be empty. Delete the nodes of the set. |
|
||||||||||
|
Size of the set. Access the 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.
|
1.2.13.1 written by Dimitri van Heesch,
© 1997-2001