#include <Containers_T.h>
Collaboration diagram for ACE_Ordered_MultiSet:
Public Types | |
typedef ACE_Ordered_MultiSet_Iterator< T > | ITERATOR |
Public Methods | |
ACE_Ordered_MultiSet (ACE_Allocator *alloc=0) | |
Constructor. Use user specified allocation strategy if specified. More... | |
ACE_Ordered_MultiSet (const ACE_Ordered_MultiSet< T > &) | |
Copy constructor. More... | |
~ACE_Ordered_MultiSet (void) | |
Destructor. More... | |
void | operator= (const ACE_Ordered_MultiSet< T > &) |
Assignment operator. More... | |
int | is_empty (void) const |
Returns 1 if the container is empty, otherwise returns 0. More... | |
size_t | size (void) const |
Size of the set. More... | |
int | insert (const T &new_item) |
Insert <new_item> into the ordered multiset. Returns -1 if failures occur, else 0. More... | |
int | insert (const T &new_item, ITERATOR &iter) |
int | remove (const T &item) |
Remove first occurrence of <item> from the set. Returns 0 if it removes the item, -1 if it can't find the item. More... | |
int | find (const T &item, ITERATOR &iter) const |
void | reset (void) |
Reset the <ACE_Ordered_MultiSet> to be empty. 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 Methods | |
int | insert_from (const T &item, ACE_DNode< T > *start_position, ACE_DNode< T > **new_position) |
int | locate (const T &item, ACE_DNode< T > *start_position, ACE_DNode< T > *&new_position) const |
void | delete_nodes (void) |
Delete all the nodes in the Set. More... | |
void | copy_nodes (const ACE_Ordered_MultiSet< T > &) |
Copy nodes into this set. More... | |
Private Attributes | |
ACE_DNode< T > * | head_ |
Head of the bilinked list of Nodes. More... | |
ACE_DNode< T > * | tail_ |
Head of the bilinked 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_Ordered_MultiSet_Iterator< T > |
|
|
|
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 first occurrance of <item> in the multiset, using the iterator's current position as a hint to improve performance. If find succeeds, it positions the iterator at that node and returns 0, or if it cannot locate the node, it leaves the iterator alone and just returns -1. |
|
Insert <new_item> into the ordered multiset, starting its search at the node pointed to by the iterator, and if insertion was successful, updates the iterator to point to the newly inserted node. Returns -1 if failures occur, else 0. |
|
Insert <new_item> into the ordered multiset. Returns -1 if failures occur, else 0.
|
|
Insert <item>, starting its search at the position given, and if successful updates the passed pointer to point to the newly inserted item's node. |
|
Returns 1 if the container is empty, otherwise returns 0.
|
|
looks for first occurance of <item> in the ordered set, using the passed starting position as a hint: if there is such an instance, it updates the new_position pointer to point to this node and returns 0; if there is no such node, then if there is a node before where the item would have been, it updates the new_position pointer to point to this node and returns -1; if there is no such node, then if there is a node after where the item would have been, it updates the new_position pointer to point to this node (or 0 if there is no such node) and returns 1; |
|
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.
|
|
Reset the <ACE_Ordered_MultiSet> 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 bilinked list of Nodes.
|
|
Head of the bilinked list of Nodes.
|