#include <Naming_Service_Container.h>
Collaboration diagram for ACE_Unbounded_List:

Public Types | |
| typedef ACE_Unbounded_List_Iterator< T > | ITERATOR |
| typedef ACE_Unbounded_List_Iterator< T > | iterator |
Public Methods | |
| ACE_Unbounded_List (ACE_Allocator *alloc=0) | |
| Constructor. Use user specified allocation strategy if specified. More... | |
| ACE_Unbounded_List (const ACE_Unbounded_List< T > &) | |
| Copy constructor. More... | |
| void | operator= (const ACE_Unbounded_List< T > &) |
| Assignment operator. More... | |
| ~ACE_Unbounded_List (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) |
| 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... | |
| 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_List> to be empty. More... | |
| ACE_Unbounded_List_Iterator< T > | begin (void) |
| ACE_Unbounded_List_Iterator< T > | end (void) |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. More... | |
Private Methods | |
| int | insert_tail (const T &item) |
| Insert <item> at the tail of the set (doesn't check for duplicates). More... | |
| void | delete_nodes (void) |
| Delete all the nodes in the List. More... | |
| void | copy_nodes (const ACE_Unbounded_List< T > &) |
| Copy nodes into this set. More... | |
Private Attributes | |
| ACE_NS_Node< T > * | head_ |
| Head of the linked list of NS_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_List_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 List.
|
|
||||||||||
|
Dump the state of an object.
|
|
||||||||||
|
|
|
||||||||||
|
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 <ACE_Unbounded_List> 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 NS_Nodes.
|
1.2.13.1 written by Dimitri van Heesch,
© 1997-2001