mangos-mirror/server
0
0
Fork 0
mirror of https://github.com/mangosfour/server.git synced 2025-12-12 10:37:03 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
server/dep/ACE_wrappers/ace/Containers_T.h
zerg b8d773091a [10874] Update ACE to v5.8.3 
(based on zergtmn's repo commit 3a8c259)
(based on zergtmn's repo commit 946c1a8)

Signed-off-by: VladimirMangos <vladimir@getmangos.com>
2010-12-14 17:37:42 +03:00

2068 lines
57 KiB
C++
Raw Blame History

// -*- C++ -*-
//=============================================================================
/**
* @file Containers_T.h
*
* $Id: Containers_T.h 91995 2010-09-24 12:45:24Z johnnyw $
*
* @author Douglas C. Schmidt <schmidt@cs.wustl.edu>
*/
//=============================================================================
#ifndef ACE_CONTAINERS_T_H
#define ACE_CONTAINERS_T_H
#include /**/ "ace/pre.h"
#include /**/ "ace/config-all.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
// Need by ACE_DLList_Node.
#include "ace/Containers.h"
// Shared with "ace/Unbounded_Set.h"
#include "ace/Node.h"
// Backwards compatibility, please include "ace/Array_Base.h" directly.
#include "ace/Array_Base.h"
// Backwards compatibility, please include "ace/Unbounded_Set.h" directly.
#include "ace/Unbounded_Set.h"
// Backwards compatibility, please include "ace/Unbounded_Queue.h" directly.
#include "ace/Unbounded_Queue.h"
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
class ACE_Allocator;
/**
* @class ACE_Bounded_Stack
*
* @brief Implement a generic LIFO abstract data type.
*
* This implementation of a Stack uses a bounded array
* that is allocated dynamically. The Stack interface
* provides the standard constant time push, pop, and top
* operations.
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Dynamic array
* - Duplicates allowed?
* Yes
* - Random access allowed?
* No
* - Search speed
* N/A
* - Insert/replace speed
* N/A
* - Iterator still valid after change to container?
* N/A
* - Frees memory for removed elements?
* No
* - Items inserted by
* Value
* - Requirements for contained type
* -# Default constructor
* -# Copy constructor
* -# operator=
*
*/
template <class T>
class ACE_Bounded_Stack
{
public:
// = Initialization, assignment, and termination methods.
/// Initialize a new empty stack with the provided size..
/**
* Initialize and allocate space for a new Bounded_Stack with the provided
* size.
*/
ACE_Bounded_Stack (size_t size);
/// Initialize the stack to be a copy of the stack provided.
/**
* Initialize the stack to be an exact copy of the Bounded_Stack provided
* as a parameter.
*/
ACE_Bounded_Stack (const ACE_Bounded_Stack<T> &s);
/// Assignment operator
/**
* Perform a deep copy operation using the Bounded_Stack parameter. If the
* capacity of the lhs isn't sufficient for the rhs, then the underlying data
* structure will be reallocated to accomadate the larger number of elements.
*/
void operator= (const ACE_Bounded_Stack<T> &s);
/// Perform actions needed when stack goes out of scope.
/**
* Deallocate the memory used by the Bounded_Stack.
*/
~ACE_Bounded_Stack (void);
// = Classic Stack operations.
///Add an element to the top of the stack.
/**
* Place a new item on top of the stack. Returns -1 if the stack
* is already full, 0 if the stack is not already full, and -1 if
* failure occurs.
*/
int push (const T &new_item);
///Remove an item from the top of stack.
/**
* Remove and return the top stack item. Returns -1 if the stack is
* already empty, 0 if the stack is not already empty, and -1 if
* failure occurs.
*/
int pop (T &item);
///Examine the contents of the top of stack.
/**
* Return top stack item without removing it. Returns -1 if the
* stack is already empty, 0 if the stack is not already empty, and
* -1 if failure occurs.
*/
int top (T &item) const;
// = Check boundary conditions.
/// Returns 1 if the container is empty, otherwise returns 0.
/**
* Performs constant time check to determine if the stack is empty.
*/
int is_empty (void) const;
/// Returns 1 if the container is full, otherwise returns 0.
/**
* Performs constant time check to determine if the stack is at capacity.
*/
int is_full (void) const;
/// The number of items in the stack.
/**
* Return the number of items currently in the stack.
*/
size_t size (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
/// Size of the dynamically allocated data.
size_t size_;
/// Keeps track of the current top of stack.
size_t top_;
/// Holds the stack's contents.
T *stack_;
};
//----------------------------------------
/**
* @class ACE_Fixed_Stack
*
* @brief Implement a generic LIFO abstract data type.
*
* This implementation of a Stack uses a fixed array
* with the size fixed at instantiation time.
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Fixed array
* - Duplicates allowed?
* Yes
* - Random access allowed?
* No
* - Search speed
* N/A
* - Insert/replace speed
* N/A
* - Iterator still valid after change to container?
* N/A
* - Frees memory for removed elements?
* No
* - Items inserted by
* Value
* - Requirements for contained type
* -# Default constructor
* -# Copy constructor
* -# operator=
*
*/
template <class T, size_t ACE_SIZE>
class ACE_Fixed_Stack
{
public:
// = Initialization, assignment, and termination methods.
/// Initialize a new stack so that it is empty.
/**
* Initialize an empty stack.
*/
ACE_Fixed_Stack (void);
/// The copy constructor (performs initialization).
/**
* Initialize the stack and copy the provided stack into the current stack.
*/
ACE_Fixed_Stack (const ACE_Fixed_Stack<T, ACE_SIZE> &s);
/// Assignment operator (performs assignment).
/**
* Perform a deep copy of the provided stack.
*/
void operator= (const ACE_Fixed_Stack<T, ACE_SIZE> &s);
/// Perform actions needed when stack goes out of scope.
/**
* Destroy the stack.
*/
~ACE_Fixed_Stack (void);
// = Classic Stack operations.
///Constant time placement of element on top of stack.
/**
* Place a new item on top of the stack. Returns -1 if the stack
* is already full, 0 if the stack is not already full, and -1 if
* failure occurs.
*/
int push (const T &new_item);
///Constant time removal of top of stack.
/**
* Remove and return the top stack item. Returns -1 if the stack is
* already empty, 0 if the stack is not already empty, and -1 if
* failure occurs.
*/
int pop (T &item);
///Constant time examination of top of stack.
/**
* Return top stack item without removing it. Returns -1 if the
* stack is already empty, 0 if the stack is not already empty, and
* -1 if failure occurs.
*/
int top (T &item) const;
// = Check boundary conditions.
/// Returns 1 if the container is empty, otherwise returns 0.
/**
* Performs constant time check to see if stack is empty.
*/
int is_empty (void) const;
/// Returns 1 if the container is full, otherwise returns 0.
/**
* Performs constant time check to see if stack is full.
*/
int is_full (void) const;
/// The number of items in the stack.
/**
* Constant time access to the current size of the stack.
*/
size_t size (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
/// Size of the allocated data.
size_t size_;
/// Keeps track of the current top of stack.
size_t top_;
/// Holds the stack's contents.
T stack_[ACE_SIZE];
};
//----------------------------------------
template<class T> class ACE_Ordered_MultiSet;
template<class T> class ACE_Ordered_MultiSet_Iterator;
/**
* @class ACE_DNode
*
* @brief Implementation element in a bilinked list.
*/
template<class T>
class ACE_DNode
{
friend class ACE_Ordered_MultiSet<T>;
friend class ACE_Ordered_MultiSet_Iterator<T>;
public:
/// This isn't necessary, but it keeps some compilers happy.
~ACE_DNode (void);
private:
// = Initialization methods
ACE_DNode (const T &i, ACE_DNode<T> *n = 0, ACE_DNode<T> *p = 0);
/// Pointer to next element in the list of {ACE_DNode}s.
ACE_DNode<T> *next_;
/// Pointer to previous element in the list of {ACE_DNode}s.
ACE_DNode<T> *prev_;
/// Current value of the item in this node.
T item_;
};
/**
* @class ACE_Unbounded_Stack
*
* @brief Implement a generic LIFO abstract data type.
*
* This implementation of an unbounded Stack uses a linked list.
* If you use the {insert} or {remove} methods you should keep
* in mind that duplicate entries aren't allowed. In general,
* therefore, you should avoid the use of these methods since
* they aren't really part of the ADT stack. The stack is implemented
* as a doubly linked list.
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Double linked list
* - Duplicates allowed?
* No
* - Random access allowed?
* No
* - Search speed
* Linear
* - Insert/replace speed
* Linear
* - Iterator still valid after change to container?
* Yes
* - Frees memory for removed elements?
* Yes
* - Items inserted by
* Value
* - Requirements for contained type
* -# Default constructor
* -# Copy constructor
* -# operator=
*
*/
template <class T>
class ACE_Unbounded_Stack
{
public:
friend class ACE_Unbounded_Stack_Iterator<T>;
// Trait definition.
typedef ACE_Unbounded_Stack_Iterator<T> ITERATOR;
// = Initialization, assignment, and termination methods.
/// Initialize a new stack so that it is empty. Use user defined
/// allocation strategy if specified.
/**
* Initialize an empty stack using the user specified allocation strategy
* if provided.
*/
ACE_Unbounded_Stack (ACE_Allocator *the_allocator = 0);
/// The copy constructor (performs initialization).
/**
* Initialize this stack to be an exact copy of {s}.
*/
ACE_Unbounded_Stack (const ACE_Unbounded_Stack<T> &s);
/// Assignment operator (performs assignment).
/**
* Perform a deep copy of the rhs into the lhs.
*/
void operator= (const ACE_Unbounded_Stack<T> &s);
/// Perform actions needed when stack goes out of scope.
/**
* Destroy the underlying list for the stack.
*/
~ACE_Unbounded_Stack (void);
// = Classic Stack operations.
///Push an element onto the top of stack.
/**
* Place a new item on top of the stack. Returns -1 if the stack
* is already full, 0 if the stack is not already full, and -1 if
* failure occurs.
*/
int push (const T &new_item);
///Pop the top element of the stack.
/**
* Remove and return the top stack item. Returns -1 if the stack is
* already empty, 0 if the stack is not already empty, and -1 if
* failure occurs.
*/
int pop (T &item);
///Examine the top of the stack.
/**
* Return top stack item without removing it. Returns -1 if the
* stack is already empty, 0 if the stack is not already empty, and
* -1 if failure occurs.
*/
int top (T &item) const;
// = Check boundary conditions.
/// Returns 1 if the container is empty, otherwise returns 0.
/**
* Constant time check to see if the stack is empty.
*/
int is_empty (void) const;
/// Returns 1 if the container is full, otherwise returns 0.
/**
* Always resturns 0 since the stack is unbounded.
*/
int is_full (void) const;
// = Auxiliary methods (not strictly part of the Stack ADT).
///Linear Insert of an item.
/**
* Insert {new_item} into the Stack at the head (but doesn't allow
* duplicates). Returns -1 if failures occur, 1 if item is already
* present (i.e., no duplicates are allowed), else 0.
*/
int insert (const T &new_item);
/// Remove @a item from the Stack. Returns 0 if it removes the item,
/// -1 if it can't find the item, and -1 if a failure occurs.
/**
* Linear remove operation.
*/
int remove (const T &item);
/// Finds if @a item occurs the set. Returns 0 if finds, else -1.
/**
* Linear find operation.
*/
int find (const T &item) const;
/// The number of items in the stack.
/**
* Constant time access to the current stack size.
*/
size_t size (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
/// Delete all the nodes in the stack.
void delete_all_nodes (void);
/// Copy all nodes from {s} to {this}.
void copy_all_nodes (const ACE_Unbounded_Stack<T> &s);
/// Head of the linked list of Nodes.
ACE_Node<T> *head_;
/// Current size of the stack.
size_t cur_size_;
/// Allocation strategy of the stack.
ACE_Allocator *allocator_;
};
/**
* @class ACE_Unbounded_Stack_Iterator
*
* @brief Implement an iterator over an unbounded Stack.
*/
template <class T>
class ACE_Unbounded_Stack_Iterator
{
public:
// = Initialization method.
/// Move to the first element in the {stack}.
ACE_Unbounded_Stack_Iterator (ACE_Unbounded_Stack<T> &stack);
// = Iteration methods.
/// Pass back the @a next_item that hasn't been seen in the Stack.
/// Returns 0 when all items have been seen, else 1.
int next (T *&next_item);
/// Move forward by one element in the Stack. Returns 0 when all the
/// items in the Stack have been seen, else 1.
int advance (void);
/// Move to the first element in the Stack. Returns 0 if the
/// Stack is empty, else 1.
int first (void);
/// Returns 1 when all items have been seen, else 0.
int done (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
/// Pointer to the current node in the iteration.
ACE_Node<T> *current_;
/// Pointer to the Stack we're iterating over.
ACE_Unbounded_Stack<T> &stack_;
};
template <class T>
class ACE_Double_Linked_List;
/**
* @class ACE_Double_Linked_List_Iterator_Base
*
* @brief Implements a common base class for iterators for a double
* linked list ADT
*/
template <class T>
class ACE_Double_Linked_List_Iterator_Base
{
public:
// = Iteration methods.
/// Passes back the {entry} under the iterator. Returns 0 if the
/// iteration has completed, otherwise 1
int next (T *&) const;
/**
* @deprecated Return the address of next (current) unvisited item in
* the list. 0 if there is no more element available.
*/
T *next (void) const;
/// Returns 1 when all items have been seen, else 0.
int done (void) const;
/// STL-like iterator dereference operator: returns a reference
/// to the node underneath the iterator.
T & operator* (void) const ;
/**
* Retasks the iterator to iterate over a new
* Double_Linked_List. This allows clients to reuse an iterator
* without incurring the constructor overhead. If you do use this,
* be aware that if there are more than one reference to this
* iterator, the other "clients" may be very bothered when their
* iterator changes. @@ Here be dragons. Comments?
*/
void reset (ACE_Double_Linked_List<T> &);
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
protected:
// = Initialization methods.
/// Constructor
ACE_Double_Linked_List_Iterator_Base (const ACE_Double_Linked_List<T> &);
/// Copy constructor.
ACE_Double_Linked_List_Iterator_Base (const
ACE_Double_Linked_List_Iterator_Base<T>
&iter);
// = Iteration methods.
/**
* Move to the first element of the list. Returns 0 if the list is
* empty, else 1.
* @note the head of the ACE_DLList is actually a null entry, so the
* first element is actually the 2n'd entry
*/
int go_head (void);
/// Move to the last element of the list. Returns 0 if the list is
/// empty, else 1.
int go_tail (void);
/**
* Check if we reach the end of the list. Can also be used to get
* the *current* element in the list. Return the address of the
* current item if there are still elements left , 0 if we run out
* of element.
*/
T *not_done (void) const ;
/// Advance to the next element in the list. Return the address of the
/// next element if there are more, 0 otherwise.
T *do_advance (void);
/// Retreat to the previous element in the list. Return the address
/// of the previous element if there are more, 0 otherwise.
T *do_retreat (void);
/// Dump the state of an object.
void dump_i (void) const;
/// Remember where we are.
T *current_;
const ACE_Double_Linked_List<T> *dllist_;
};
/**
* @class ACE_Double_Linked_List_Iterator
*
* @brief Implements an iterator for a double linked list ADT
*
* Iterate thru the double-linked list. This class provides
* an interface that let users access the internal element
* addresses directly. Notice {class T} must declare
* ACE_Double_Linked_List&lt;T&gt;,
* ACE_Double_Linked_List_Iterator_Base &lt;T&gt; and
* ACE_Double_Linked_List_Iterator as friend classes and class T
* should also have data members T* next_ and T* prev_.
*/
template <class T>
class ACE_Double_Linked_List_Iterator : public ACE_Double_Linked_List_Iterator_Base <T>
{
public:
// = Initialization method.
ACE_Double_Linked_List_Iterator (const ACE_Double_Linked_List<T> &);
/**
* Retasks the iterator to iterate over a new
* Double_Linked_List. This allows clients to reuse an iterator
* without incurring the constructor overhead. If you do use this,
* be aware that if there are more than one reference to this
* iterator, the other "clients" may be very bothered when their
* iterator changes.
* @@ Here be dragons. Comments?
*/
void reset (ACE_Double_Linked_List<T> &);
/// Move to the first element in the list. Returns 0 if the
/// list is empty, else 1.
int first (void);
/// Move forward by one element in the list. Returns 0 when all the
/// items in the list have been seen, else 1.
int advance (void);
/**
* Advance the iterator while removing the original item from the
* list. Return a pointer points to the original (removed) item.
* If @a dont_remove equals false, this function behaves like {advance}
* but return 0 (NULL) instead.
*/
T* advance_and_remove (bool dont_remove);
// = STL-style iteration methods
/// Prefix advance.
ACE_Double_Linked_List_Iterator<T> & operator++ (void);
/// Postfix advance.
ACE_Double_Linked_List_Iterator<T> operator++ (int);
/// Prefix reverse.
ACE_Double_Linked_List_Iterator<T> & operator-- (void);
/// Postfix reverse.
ACE_Double_Linked_List_Iterator<T> operator-- (int);
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
};
/**
* @class ACE_Double_Linked_List_Reverse_Iterator
*
* @brief Implements a reverse iterator for a double linked list ADT
*
* Iterate backwards over the double-linked list. This class
* provide an interface that let users access the internal
* element addresses directly, which seems to break the
* encapsulation. Notice {class T} must declare
* ACE_Double_Linked_List&lt;T&gt;,
* ACE_Double_Linked_List_Iterator_Base &lt;T&gt; and
* ACE_Double_Linked_List_Iterator as friend classes and class T
* should also have data members T* next_ and T* prev_.
*/
template <class T>
class ACE_Double_Linked_List_Reverse_Iterator : public ACE_Double_Linked_List_Iterator_Base <T>
{
public:
// = Initialization method.
ACE_Double_Linked_List_Reverse_Iterator (ACE_Double_Linked_List<T> &);
/**
* Retasks the iterator to iterate over a new
* Double_Linked_List. This allows clients to reuse an iterator
* without incurring the constructor overhead. If you do use this,
* be aware that if there are more than one reference to this
* iterator, the other "clients" may be very bothered when their
* iterator changes.
* @@ Here be dragons. Comments?
*/
void reset (ACE_Double_Linked_List<T> &);
/// Move to the first element in the list. Returns 0 if the
/// list is empty, else 1.
int first (void);
/// Move forward by one element in the list. Returns 0 when all the
/// items in the list have been seen, else 1.
int advance (void);
/**
* Advance the iterator while removing the original item from the
* list. Return a pointer points to the original (removed) item.
* If @a dont_remove equals false, this function behaves like {advance}
* but return 0 (NULL) instead.
*/
T* advance_and_remove (bool dont_remove);
// = STL-style iteration methods
/// Prefix advance.
ACE_Double_Linked_List_Reverse_Iterator<T> & operator++ (void);
/// Postfix advance.
ACE_Double_Linked_List_Reverse_Iterator<T> operator++ (int);
/// Prefix reverse.
ACE_Double_Linked_List_Reverse_Iterator<T> & operator-- (void);
/// Postfix reverse.
ACE_Double_Linked_List_Reverse_Iterator<T> operator-- (int);
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
};
/**
* @class ACE_Double_Linked_List
*
* @brief A double-linked list implementation.
*
* This implementation of an unbounded double-linked list uses a
* circular linked list with a dummy node. It is pretty much
* like the {ACE_Unbounded_Queue} except that it allows removing
* of a specific element from a specific location.
* Notice that this class is an implementation of a very simple
* data structure. This is *NOT* a container class. You can use the
* class to implement other contains classes but it is *NOT* a
* general purpose container class.
* The parameter class *MUST* have members T* prev and T* next
* and users of this class are responsible to follow the general
* rules of using double-linked lists to maintaining the list
* integrity.
* If you need a double linked container class, use the DLList
* class which is a container but delegates to the Double_Linked_List
* class.
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Double Linked List
* - Duplicates allowed?
* Yes
* - Random access allowed?
* No
* - Search speed
* N/A
* - Insert/replace speed
* Linear
* - Iterator still valid after change to container?
* Yes
* - Frees memory for removed elements?
* No
* - Items inserted by
* Value
* - Requirements for contained type
* -# Default constructor
* -# Copy constructor
* -# operator=
*
*/
template <class T>
class ACE_Double_Linked_List
{
public:
friend class ACE_Double_Linked_List_Iterator_Base<T>;
friend class ACE_Double_Linked_List_Iterator<T>;
friend class ACE_Double_Linked_List_Reverse_Iterator<T>;
// Trait definition.
typedef ACE_Double_Linked_List_Iterator<T> ITERATOR;
typedef ACE_Double_Linked_List_Reverse_Iterator<T> REVERSE_ITERATOR;
// = Initialization and termination methods.
/// construction. Use user specified allocation strategy
/// if specified.
/**
* Initialize an empy list using the allocation strategy specified by the user.
* If none is specified, then use default allocation strategy.
*/
ACE_Double_Linked_List (ACE_Allocator *the_allocator = 0);
/// Copy constructor.
/**
* Create a double linked list that is a copy of the provided
* parameter.
*/
ACE_Double_Linked_List (const ACE_Double_Linked_List<T> &);
/// Assignment operator.
/**
* Perform a deep copy of the provided list by first deleting the nodes of the
* lhs and then copying the nodes of the rhs.
*/
void operator= (const ACE_Double_Linked_List<T> &);
/// Destructor.
/**
* Clean up the memory allocated for the nodes of the list.
*/
~ACE_Double_Linked_List (void);
// = Check boundary conditions.
/// Returns 1 if the container is empty, 0 otherwise.
/**
* Performs constant time check to determine if the list is empty.
*/
int is_empty (void) const;
/// The list is unbounded, so this always returns 0.
/**
* Since the list is unbounded, the method simply returns 0.
*/
int is_full (void) const;
// = Classic queue operations.
/// Adds @a new_item to the tail of the list. Returns the new item
/// that was inserted.
/**
* Provides constant time insertion at the end of the list structure.
*/
T *insert_tail (T *new_item);
/// Adds @a new_item to the head of the list.Returns the new item that
/// was inserted.
/**
* Provides constant time insertion at the head of the list.
*/
T *insert_head (T *new_item);
/// Removes the head of the list and returns a pointer to that item.
/**
* Removes and returns the first {item} in the list. Returns
* internal node's address on success, 0 if the queue was empty.
* This method will *not* free the internal node.
*/
T* delete_head (void);
/// Removes the tail of the list and returns a pointer to that item.
/**
* Removes and returns the last {item} in the list. Returns
* internal nodes's address on success, 0 if the queue was
* empty. This method will *not* free the internal node.
*/
T *delete_tail (void);
// = Additional utility methods.
///Empty the list.
/**
* Reset the {ACE_Double_Linked_List} to be empty.
* Notice that since no one is interested in the items within,
* This operation will delete all items.
*/
void reset (void);
/// Get the {slot}th element in the set. Returns -1 if the element
/// isn't in the range {0..{size} - 1}, else 0.
/**
* Iterates through the list to the desired index and assigns the provides pointer
* with the address of the node occupying that index.
*/
int get (T *&item, size_t slot = 0);
/// The number of items in the queue.
/**
* Constant time call to return the current size of the list.
*/
size_t size (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Use DNode address directly.
/**
* Constant time removal of an item from the list using it's address.
*/
int remove (T *n);
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
protected:
/// Delete all the nodes in the list.
/**
* Removes and deallocates memory for all of the list nodes.
*/
void delete_nodes (void);
/// Copy nodes from {rhs} into this list.
/**
* Copy the elements of the provided list by allocated new nodes and assigning
* them with the proper data.
*/
void copy_nodes (const ACE_Double_Linked_List<T> &rhs);
/// Setup header pointer. Called after we create the head node in ctor.
/**
* Initialize the head pointer so that the list has a dummy node.
*/
void init_head (void);
///Constant time insert a new item into the list structure.
/**
* Insert a @a new_item into the list. It will be added before
* or after @a old_item. Default is to insert the new item *after*
* {head_}. Return 0 if succeed, -1 if error occured.
*/
int insert_element (T *new_item,
int before = 0,
T *old_item = 0);
///Constant time delete an item from the list structure.
/**
* Remove @a item from the list. Return 0 if succeed, -1 otherwise.
* Notice that this function checks if item is {head_} and either its
* {next_} or {prev_} is NULL. The function resets item's {next_} and
* {prev_} to 0 to prevent clobbering the double-linked list if a user
* tries to remove the same node again.
*/
int remove_element (T *item);
/// Head of the circular double-linked list.
T *head_;
/// Size of this list.
size_t size_;
/// Allocation Strategy of the queue.
ACE_Allocator *allocator_;
};
template <class T> class ACE_DLList;
template <class T> class ACE_DLList_Iterator;
template <class T> class ACE_DLList_Reverse_Iterator;
typedef ACE_Double_Linked_List<ACE_DLList_Node> ACE_DLList_Base;
//typedef ACE_Double_Linked_List_Iterator <ACE_DLList_Node>
// ACE_DLList_Iterator_Base;
//typedef ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>
// ACE_DLList_Reverse_Iterator_Base;
//@@ These two typedefs (inherited from James Hu's original design)
// have been removed because Sun CC 4.2 had problems with it. I guess
// having the DLList_Iterators inheriting from a class which is
// actually a typedef leads to problems. #define'ing rather than
// typedef'ing worked, but as per Carlos's reccomendation, I'm just
// replacing all references to the base classes with their actual
// type. Matt Braun (6/15/99)
/**
* @class ACE_DLList
*
* @brief A double-linked list container class.
*
* ACE_DLList is a simple, unbounded container implemented using a
* double-linked list. It is critical to remember that ACE_DLList inherits
* from ACE_Double_Linked_List, wrapping each T pointer in a ACE_DLList_Node
* object which satisfies the next/prev pointer requirements imposed by
* ACE_Double_Linked_List.
*
* Each item inserted to an ACE_DLList is a pointer to a T object. The
* caller is responsible for lifetime of the T object. ACE_DLList takes no
* action on the T object; it is not copied on insertion and it is not
* deleted on removal from the ACE_DLList.
*/
template <class T>
class ACE_DLList : public ACE_DLList_Base
{
friend class ACE_DLList_Node;
friend class ACE_Double_Linked_List_Iterator<T>;
friend class ACE_DLList_Iterator<T>;
friend class ACE_DLList_Reverse_Iterator<T>;
public:
/// Delegates to ACE_Double_Linked_List.
void operator= (const ACE_DLList<T> &l);
/**
* @name Queue-like insert and delete methods
*/
//@{
/**
* Insert pointer for a new item at the tail of the list.
*
* @return Pointer to item inserted; 0 on error.
*/
T *insert_tail (T *new_item);
/**
* Insert pointer for a new item at the head of the list.
*
* @return Pointer to item inserted; 0 on error.
*/
T *insert_head (T *new_item);
/**
* Removes the item at the head of the list and returns its pointer.
*
* @return Pointer to previously inserted item; 0 if the list is empty,
* an error occurred, or the original pointer inserted was 0.
*/
T *delete_head (void);
/**
* Removes the item at the tail of the list and returns its pointer.
*
* @return Pointer to previously inserted item; 0 if the list is empty,
* an error occurred, or the original pointer inserted was 0.
*/
T *delete_tail (void);
//@}
/**
* Provide random access to any item in the list.
*
* @param item Receives a pointer to the T object pointer held at the
* specified position in the list.
* @param slot Position in the list to access. The first position is 0.
*
* @retval 0 Success; T pointer returned in item.
* @retval -1 Error, most likely slot is outside the range of the list.
*/
int get (T *&item, size_t slot = 0);
/// Delegates to ACE_Double_Linked_List.
void dump (void) const;
/// Delegates to ACE_Double_Linked_List.
int remove (ACE_DLList_Node *n);
/**
* Constructor.
*
* @param the_allocator Allocator to use for allocating ACE_DLList_Node
* objects that wrap T objects for inclusion in the
* list. If 0, ACE_Allocator::instance() is used.
*/
ACE_DLList (ACE_Allocator *the_allocator = 0);
/// Delegates to ACE_Double_Linked_List.
ACE_DLList (const ACE_DLList<T> &l);
/**
* Deletes all ACE_DLList_Node objects in the list starting from the head.
* No T objects referred to by the deleted ACE_DLList_Node objects are
* modified or freed. If you desire all of the T objects in the list to
* be deleted as well, code such as this should be used prior to destroying
* the ACE_DLList:
* @code
ACE_DLList<Item> list;
... // insert dynamically allocated Items...
Item *p;
while ((p = list.delete_head()) != 0)
delete *p;
@endcode
*/
~ACE_DLList (void);
};
/**
* @class ACE_DLList_Iterator
*
* @brief A double-linked list container class iterator.
*
* This implementation uses ACE_Double_Linked_List_Iterator to
* perform the logic behind this container class. It delegates
* all of its calls to ACE_Double_Linked_List_Iterator.
*/
template <class T>
class ACE_DLList_Iterator : public ACE_Double_Linked_List_Iterator <ACE_DLList_Node>
{
friend class ACE_DLList<T>;
friend class ACE_DLList_Node;
public:
// = Initialization method.
ACE_DLList_Iterator (ACE_DLList<T> &l);
/**
* Retasks the iterator to iterate over a new
* Double_Linked_List. This allows clients to reuse an iterator
* without incurring the constructor overhead. If you do use this,
* be aware that if there are more than one reference to this
* iterator, the other "clients" may be very bothered when their
* iterator changes.
* @@ Here be dragons. Comments?
*/
void reset (ACE_DLList<T> &l);
// = Iteration methods.
/// Move forward by one element in the list. Returns 0 when all the
/// items in the list have been seen, else 1.
int advance (void);
/// Pass back the {next_item} that hasn't been seen in the list.
/// Returns 0 when all items have been seen, else 1.
int next (T *&);
/**
* @deprecated Delegates to ACE_Double_Linked_List_Iterator, except that
* whereas the Double_Linked_List version of next returns the node, this next
* returns the contents of the node
*/
T *next (void) const;
/**
* Removes the current item (i.e., {next}) from the list.
* Note that DLList iterators do not support {advance_and_remove}
* directly (defined in its base class) and you will need to
* release the element returned by it.
*/
int remove (void);
/// Delegates to ACE_Double_Linked_List_Iterator.
void dump (void) const;
private:
ACE_DLList<T> *list_;
};
/**
* @class ACE_DLList_Reverse_Iterator
*
* @brief A double-linked list container class iterator.
*
* This implementation uses ACE_Double_Linked_List_Iterator to
* perform the logic behind this container class. It delegates
* all of its calls to ACE_Double_Linked_List_Iterator.
*/
template <class T>
class ACE_DLList_Reverse_Iterator : public ACE_Double_Linked_List_Reverse_Iterator <ACE_DLList_Node>
{
friend class ACE_DLList<T>;
friend class ACE_DLList_Node;
public:
// = Initialization method.
ACE_DLList_Reverse_Iterator (ACE_DLList<T> &l);
/**
* Retasks the iterator to iterate over a new
* Double_Linked_List. This allows clients to reuse an iterator
* without incurring the constructor overhead. If you do use this,
* be aware that if there are more than one reference to this
* iterator, the other "clients" may be very bothered when their
* iterator changes.
* @@ Here be dragons. Comments?
*/
void reset (ACE_DLList<T> &l);
// = Iteration methods.
/// Move forward by one element in the list. Returns 0 when all the
/// items in the list have been seen, else 1.
int advance (void);
/// Pass back the {next_item} that hasn't been seen in the list.
/// Returns 0 when all items have been seen, else 1.
int next (T *&);
/// @deprecated Delegates to ACE_Double_Linked_List_Iterator.
T *next (void) const;
/// Removes the current item (i.e., {next}) from the list.
/// Note that DLList iterators do not support {advance_and_remove}
/// directly (defined in its base class) and you will need to
/// release the element returned by it.
int remove (void);
/// Delegates to ACE_Double_Linked_List_Iterator.
void dump (void) const;
private:
ACE_DLList<T> *list_;
};
// Forward declaration.
template <class T, size_t ACE_SIZE>
class ACE_Fixed_Set;
/**
* @class ACE_Fixed_Set_Iterator_Base
*
* @brief Implements a common base class for iterators for a unordered set.
*/
template <class T, size_t ACE_SIZE>
class ACE_Fixed_Set_Iterator_Base
{
public:
// = Iteration methods.
/// Pass back the {next_item} that hasn't been seen in the Set.
/// Returns 0 when all items have been seen, else 1.
int next (T *&next_item);
/// Move forward by one element in the set. Returns 0 when all the
/// items in the set have been seen, else 1.
int advance (void);
/// Move to the first element in the set. Returns 0 if the
/// set is empty, else 1.
int first (void);
/// Returns 1 when all items have been seen, else 0.
int done (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
protected:
// = Initialization method.
ACE_Fixed_Set_Iterator_Base (ACE_Fixed_Set<T, ACE_SIZE> &s);
/// Set we are iterating over.
ACE_Fixed_Set<T, ACE_SIZE> &s_;
/// How far we've advanced over the set.
ssize_t next_;
/// The number of non free items that the iterator had pointed at.
size_t iterated_items_;
/// Dump the state of an object.
void dump_i (void) const;
/// Pass back the {next_item} that hasn't been seen in the Set.
/// Returns 0 when all items have been seen, else 1.
int next_i (T *&next_item);
};
/**
* @class ACE_Fixed_Set_Iterator
*
* @brief Iterates through an unordered set.
*
* This implementation of an unordered set uses a fixed array.
* Allows deletions while iteration is occurring.
*/
template <class T, size_t ACE_SIZE>
class ACE_Fixed_Set_Iterator : public ACE_Fixed_Set_Iterator_Base <T, ACE_SIZE>
{
public:
// = Initialization method.
ACE_Fixed_Set_Iterator (ACE_Fixed_Set<T, ACE_SIZE> &s);
// = Iteration methods.
/// Pass back the {next_item} that hasn't been seen in the Set.
/// Returns 0 when all items have been seen, else 1.
int next (T *&next_item);
/// Dump the state of an object.
void dump (void) const;
/// Remove the item where the itearetor is located at.
/// Returns 1 if it removes a item, else 0.
/// Pass back the removed {item}.
int remove (T *&item);
/// STL-like iterator dereference operator: returns a reference
/// to the node underneath the iterator.
T & operator* (void);
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
};
/**
* @class ACE_Fixed_Set_Const_Iterator
*
* @brief Iterates through a const unordered set.
*
* This implementation of an unordered set uses a fixed array.
*/
template <class T, size_t ACE_SIZE>
class ACE_Fixed_Set_Const_Iterator : public ACE_Fixed_Set_Iterator_Base <T, ACE_SIZE>
{
public:
// = Initialization method.
ACE_Fixed_Set_Const_Iterator (const ACE_Fixed_Set<T, ACE_SIZE> &s);
// = Iteration methods.
/// Pass back the {next_item} that hasn't been seen in the Set.
/// Returns 0 when all items have been seen, else 1.
int next (const T *&next_item);
/// Dump the state of an object.
void dump (void) const;
/// STL-like iterator dereference operator: returns a reference
/// to the node underneath the iterator.
const T & operator* (void) const ;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
};
/**
* @class ACE_Fixed_Set
*
* @brief Implement a simple unordered set of {T} with maximum {ACE_SIZE}.
*
* This implementation of an unordered set uses a fixed array.
* It does not allow duplicate members. The set provides linear insertion/deletion
* operations.
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Fixed array
* - Duplicates allowed?
* No
* - Random access allowed?
* No
* - Search speed
* Linear
* - Insert/replace speed
* Linear
* - Iterator still valid after change to container?
* Yes
* - Frees memory for removed elements?
* No
* - Items inserted by
* Value
* - Requirements for contained type
* -# Default constructor
* -# Copy constructor
* -# operator=
* -# operator==
*
*/
template <class T, size_t ACE_SIZE>
class ACE_Fixed_Set
{
public:
friend class ACE_Fixed_Set_Iterator_Base<T, ACE_SIZE>;
friend class ACE_Fixed_Set_Iterator<T, ACE_SIZE>;
friend class ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE>;
// Trait definitions.
typedef ACE_Fixed_Set_Iterator<T, ACE_SIZE> ITERATOR;
typedef ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE> CONST_ITERATOR;
// = Initialization and termination methods.
/// Default Constructor.
/**
* Creates an empy set
*/
ACE_Fixed_Set (void);
/// Copy constructor.
/**
* Initializes a set to be a copy of the set parameter.
*/
ACE_Fixed_Set (const ACE_Fixed_Set<T, ACE_SIZE> &);
/// Assignment operator.
/**
* Deep copy of one set to another.
*/
void operator= (const ACE_Fixed_Set<T, ACE_SIZE> &);
/// Destructor.
/**
* Destroys a set.
*/
~ACE_Fixed_Set (void);
// = Check boundary conditions.
/// Returns 1 if the container is empty, otherwise returns 0.
/**
* Performs constant time check to determine if a set is empty.
*/
int is_empty (void) const;
/// Returns 1 if the container is full, otherwise returns 0.
/**
* Performs a constant time check to see if the set is full.
*/
int is_full (void) const;
// = Classic unordered set operations.
///Linear time insertion of an item unique to the set.
/**
* Insert @a new_item into the set (doesn't allow duplicates).
* Returns -1 if failures occur, 1 if item is already present, else
* 0.
*/
int insert (const T &new_item);
///Linear time removal operation of an item.
/**
* 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. Removal doesn't reclaim memory for the @a item.
*/
int remove (const T &item);
/// Finds if @a item occurs in the set. Returns 0 if finds, else -1.
/**
* Performs a linear find operation for the specified @a item.
*/
int find (const T &item) const;
/// Size of the set.
/**
* Returns the current size of the set.
*/
size_t size (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
/// Holds the contents of the set.
struct
{
/// Item in the set.
T item_;
/// Keeps track of whether this item is in use or not.
int is_free_;
} search_structure_[ACE_SIZE];
/// Current size of the set.
size_t cur_size_;
/// Maximum size of the set.
size_t max_size_;
};
// Forward declaration.
template <class T>
class ACE_Bounded_Set;
/**
* @class ACE_Bounded_Set_Iterator
*
* @brief Iterates through an unordered set.
*
* This implementation of an unordered set uses a Bounded array.
* Allows deletions while iteration is occurring.
*/
template <class T>
class ACE_Bounded_Set_Iterator
{
public:
// = Initialization method.
ACE_Bounded_Set_Iterator (ACE_Bounded_Set<T> &s);
// = Iteration methods.
/// Pass back the {next_item} that hasn't been seen in the Set.
/// Returns 0 when all items have been seen, else 1.
int next (T *&next_item);
/// Move forward by one element in the set. Returns 0 when all the
/// items in the set have been seen, else 1.
int advance (void);
/// Move to the first element in the set. Returns 0 if the
/// set is empty, else 1.
int first (void);
/// Returns 1 when all items have been seen, else 0.
int done (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
/// Set we are iterating over.
ACE_Bounded_Set<T> &s_;
/// How far we've advanced over the set.
ssize_t next_;
};
/**
* @class ACE_Bounded_Set
*
* @brief Implement a simple unordered set of {T} with maximum
* set at creation time.
*
* 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.
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Bounded array which can grow via assignment
* - Duplicates allowed?
* No
* - Random access allowed?
* No
* - Search speed
* Linear
* - Insert/replace speed
* Linear
* - Iterator still valid after change to container?
* Yes
* - Frees memory for removed elements?
* No
* - Items inserted by
* Value
* - Requirements for contained type
* -# Default constructor
* -# Copy constructor
* -# operator=
* -# operator==
*
*/
template <class T>
class ACE_Bounded_Set
{
public:
friend class ACE_Bounded_Set_Iterator<T>;
// Trait definition.
typedef ACE_Bounded_Set_Iterator<T> ITERATOR;
enum
{
DEFAULT_SIZE = 10
};
// = Initialization and termination methods.
/// Construct a Bounded_Set using the default size.
/**
* The default constructor initializes the Bounded_Set to a maximum size
* specified by the DEFAULT_SIZE.
*/
ACE_Bounded_Set (void);
/// Construct a Bounded_Set with the provided sizeB.
/**
* Initialize the Bounded_Set to have a maximum size equal to the size
* parameter specified.
*/
ACE_Bounded_Set (size_t size);
/// Construct a Bounded_Set that is a copy of the provides Bounded_Set.
/**
* Initialize the Bounded_Set to be a copy of the Bounded_Set parameter.
*/
ACE_Bounded_Set (const ACE_Bounded_Set<T> &);
/// Assignment operator.
/**
* 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.
*/
void operator= (const ACE_Bounded_Set<T> &);
/// Destructor
/**
* Clean up the underlying dynamically allocated memory that is used by
* the Bounded_Set.
*/
~ACE_Bounded_Set (void);
// = Check boundary conditions.
/// Returns 1 if the container is empty, otherwise returns 0.
/**
* A constant time check is performed to determine if the Bounded_Set is
* empty.
*/
int is_empty (void) const;
/// Returns 1 if the container is full, otherwise returns 0.
/**
* Performs a constant time check to determine if the Bounded_Set is at
* capacity.
*/
int is_full (void) const;
// = Classic unordered set operations.
///Inserts a new element unique to the set.
/**
* Insert @a 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.
*/
int insert (const T &new_item);
///Finds the specified element and removes it from the set.
/**
* Remove first occurrence of @a 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.
*/
int remove (const T &item);
/// Finds if @a item occurs in the set. Returns 0 if finds, else -1.
/**
* find preforms a linear search for {item} and returns 0 on successful
* find and -1 otherwise.
*/
int find (const T &item) const;
/// Size of the set.
/**
* Returns a size_t representing the current size of the set.
*/
size_t size (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
struct Search_Structure
{
/// Item in the set.
T item_;
/// Keeps track of whether this item is in use or not.
int is_free_;
};
/// Holds the contents of the set.
Search_Structure *search_structure_;
/// Current size of the set.
size_t cur_size_;
/// Maximum size of the set.
size_t max_size_;
};
/**
* @class ACE_Ordered_MultiSet_Iterator
*
* @brief Implement a bidirectional iterator over an ordered multiset.
* This class template requires that < operator semantics be
* defined for the parameterized type {T}, but does not impose
* any restriction on how that ordering operator is implemented.
*/
template <class T>
class ACE_Ordered_MultiSet_Iterator
{
public:
friend class ACE_Ordered_MultiSet<T>;
// = Initialization method.
ACE_Ordered_MultiSet_Iterator (ACE_Ordered_MultiSet<T> &s);
// = Iteration methods.
/// Pass back the {next_item} that hasn't been seen in the ordered multiset.
/// Returns 0 when all items have been seen, else 1.
int next (T *&next_item) const;
/// Repositions the iterator at the first item in the ordered multiset
/// Returns 0 if the list is empty else 1.
int first (void);
/// Repositions the iterator at the last item in the ordered multiset
/// Returns 0 if the list is empty else 1.
int last (void);
/// Move forward by one element in the set. Returns 0 when all the
/// items in the set have been seen, else 1.
int advance (void);
/// Move backward by one element in the set. Returns 0 when all the
/// items in the set have been seen, else 1.
int retreat (void);
/// Returns 1 when all items have been seen, else 0.
int done (void) const;
/// Dump the state of an object.
void dump (void) const;
/// Returns a reference to the internal element {this} is pointing to.
T& operator* (void);
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
/// Pointer to the current node in the iteration.
ACE_DNode<T> *current_;
/// Pointer to the set we're iterating over.
ACE_Ordered_MultiSet<T> &set_;
};
/**
* @class ACE_Ordered_MultiSet
*
* @brief Implement a simple ordered multiset of {T} of unbounded size
* that allows duplicates. This class template requires that <
* operator semantics be defined for the parameterized type {T}, but
* does not impose any restriction on how that ordering operator is
* implemented. The set is implemented as a linked list.
*
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Double linked list
* - Duplicates allowed?
* Yes
* - Random access allowed?
* No
* - Search speed
* Linear
* - Insert/replace speed
* Linear
* - Iterator still valid after change to container?
* Yes
* - Frees memory for removed elements?
* Yes
* - Items inserted by
* Value
* - Requirements for contained type
* -# Default constructor
* -# Copy constructor
* -# operator=
* -# operator==
* -# operator<
*
*
*/
template <class T>
class ACE_Ordered_MultiSet
{
public:
friend class ACE_Ordered_MultiSet_Iterator<T>;
// Trait definition.
typedef ACE_Ordered_MultiSet_Iterator<T> ITERATOR;
// = Initialization and termination methods.
/// Constructor. Use user specified allocation strategy
/// if specified.
/**
* Initialize the set using the allocation strategy specified. If none, use the
* default strategy.
*/
ACE_Ordered_MultiSet (ACE_Allocator *the_allocator = 0);
/// Copy constructor.
/**
* Initialize the set to be a copy of the provided set.
*/
ACE_Ordered_MultiSet (const ACE_Ordered_MultiSet<T> &);
/// Destructor.
/**
* Delete the nodes of the set.
*/
~ACE_Ordered_MultiSet (void);
/// Assignment operator.
/**
* Delete the nodes in lhs, and copy the nodes from the rhs.
*/
void operator= (const ACE_Ordered_MultiSet<T> &);
// = Check boundary conditions.
/// Returns 1 if the container is empty, otherwise returns 0.
/**
* Constant time check to determine if the set is empty.
*/
int is_empty (void) const;
/// Size of the set.
/**
* Constant time check to determine the size of the set.
*/
size_t size (void) const;
// = Classic unordered set operations.
/// Insert @a new_item into the ordered multiset.
/// Returns -1 if failures occur, else 0.
/**
* Linear time, order preserving insert into the set beginning at the head.
*/
int insert (const T &new_item);
///Linear time insert beginning at the point specified by the provided iterator.
/**
* Insert @a 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.
*/
int insert (const T &new_item, ITERATOR &iter);
/// Remove first occurrence of @a item from the set. Returns 0 if
/// it removes the item, -1 if it can't find the item.
/**
* Linear time search operation which removes the item from the set if found .
*/
int remove (const T &item);
///Linear find operation.
/**
* Finds first occurrence of @a 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.
*/
int find (const T &item, ITERATOR &iter) const;
/// Reset the ACE_Ordered_MultiSet to be empty.
/**
* Delete the nodes inside the set.
*/
void reset (void);
/// Dump the state of an object.
void dump (void) const;
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
private:
/**
* Insert @a item, starting its search at the position given,
* and if successful updates the passed pointer to point to
* the newly inserted item's node.
*/
int insert_from (const T &item, ACE_DNode<T> *start_position,
ACE_DNode<T> **new_position);
/**
* Looks for first occurrence of @a 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;
*/
int locate (const T &item, ACE_DNode<T> *start_position,
ACE_DNode<T> *&new_position) const;
/// Delete all the nodes in the Set.
void delete_nodes (void);
/// Copy nodes into this set.
void copy_nodes (const ACE_Ordered_MultiSet<T> &);
/// Head of the bilinked list of Nodes.
ACE_DNode<T> *head_;
/// Head of the bilinked list of Nodes.
ACE_DNode<T> *tail_;
/// Current size of the set.
size_t cur_size_;
/// Allocation strategy of the set.
ACE_Allocator *allocator_;
};
// ****************************************************************
/**
* @class ACE_Array
*
* @brief A dynamic array class.
*
* This class extends ACE_Array_Base, adding comparison operators.
*
* <b> Requirements and Performance Characteristics</b>
* - Internal Structure
* Dynamic array
* - Duplicates allowed?
* Yes
* - Random access allowed?
* Yes
* - Search speed
* N/A
* - Insert/replace speed
* O(1)
* - Iterator still valid after change to container?
* - In general, yes.
* - If array size is changed during iteration, no.
* - Frees memory for removed elements?
* No
* - Items inserted by
* Value
* - Requirements for contained type
* -# Default constructor
* -# Copy constructor
* -# operator=
* -# operator!=
*
* @sa ACE_Array_Base. This class inherits its operations and requirements.
*/
template <class T>
class ACE_Array : public ACE_Array_Base<T>
{
public:
// Define a "trait"
typedef T TYPE;
typedef ACE_Array_Iterator<T> ITERATOR;
/// Dynamically create an uninitialized array.
/**
* Initialize an empty array of the specified size using the provided
* allocation strategy.
*/
ACE_Array (size_t size = 0,
ACE_Allocator* alloc = 0);
/// Dynamically initialize the entire array to the {default_value}.
/**
* Initialize an array the given size placing the default_value in each index.
*/
ACE_Array (size_t size,
const T &default_value,
ACE_Allocator* alloc = 0);
///Copy constructor.
/**
* The copy constructor performs initialization by making an exact
* copy of the contents of parameter {s}, i.e., *this == s will
* return true.
*/
ACE_Array (const ACE_Array<T> &s);
///Assignment operator
/**
* Assignment operator performs an assignment by making an exact
* copy of the contents of parameter {s}, i.e., *this == s will
* return true. Note that if the {max_size_} of {array_} is >= than
* {s.max_size_} we can copy it without reallocating. However, if
* {max_size_} is < {s.max_size_} we must delete the {array_},
* reallocate a new {array_}, and then copy the contents of {s}.
*/
void operator= (const ACE_Array<T> &s);
// = Compare operators
///Equality comparison operator.
/**
* Compare this array with {s} for equality. Two arrays are equal
* if their {size}'s are equal and all the elements from 0 .. {size}
* are equal.
*/
bool operator== (const ACE_Array<T> &s) const;
///Inequality comparison operator.
/**
* Compare this array with {s} for inequality such that {*this} !=
* {s} is always the complement of the boolean return value of
* {*this} == {s}.
*/
bool operator!= (const ACE_Array<T> &s) const;
};
ACE_END_VERSIONED_NAMESPACE_DECL
#if defined (__ACE_INLINE__)
#include "ace/Containers_T.inl"
#endif /* __ACE_INLINE__ */
#if defined (ACE_TEMPLATES_REQUIRE_SOURCE)
#include "ace/Containers_T.cpp"
#endif /* ACE_TEMPLATES_REQUIRE_SOURCE */
#if defined (ACE_TEMPLATES_REQUIRE_PRAGMA)
#pragma implementation ("Containers_T.cpp")
#endif /* ACE_TEMPLATES_REQUIRE_PRAGMA */
#include /**/ "ace/post.h"
#endif /* ACE_CONTAINERS_T_H */
Reference in a new issue View git blame Copy permalink