T
of unbounded size.
#include <ace/Containers.h>
template<class T> class ACE_Unbounded_Set {
public:
friend class ACE_Unbounded_Set_Iterator<T>;
typedef ACE_Unbounded_Set_Iterator<T> ITERATOR;
typedef ACE_Unbounded_Set_Iterator<T> iterator;
ACE_Unbounded_Set (ACE_Allocator *alloc = 0);
ACE_Unbounded_Set (const ACE_Unbounded_Set<T> &);
void operator= (const ACE_Unbounded_Set<T> &);
~ACE_Unbounded_Set (void);
int is_empty (void) const;
int is_full (void) const;
int insert (const T &new_item);
int remove (const T &item);
int find (const T &item) const;
size_t size (void) const;
void dump (void) const;
void reset (void);
ACE_Unbounded_Set_Iterator<T> begin (void);
ACE_Unbounded_Set_Iterator<T> end (void);
ACE_ALLOC_HOOK_DECLARE;
private:
int insert_tail (const T &item);
void delete_nodes (void);
void copy_nodes (const ACE_Unbounded_Set<T> &);
ACE_Node<T> *head_;
size_t cur_size_;
ACE_Allocator *allocator_;
};
ACE_Unbounded_Set (ACE_Allocator *alloc = 0);
ACE_Unbounded_Set (const ACE_Unbounded_Set<T> &);
void operator= (const ACE_Unbounded_Set<T> &);
~ACE_Unbounded_Set (void);
int is_empty (void) const;
int is_full (void) const;
int insert (const T &new_item);
new_item
into the set (doesn't allow duplicates).
Returns -1 if failures occur, 1 if item is already present, else
0.
int remove (const T &item);
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.
int find (const T &item) const;
item
occurs in the set. Returns 0 if find succeeds,
else -1.
size_t size (void) const;
void dump (void) const;
void reset (void);
ACE_Unbounded_Set
to be empty.
ACE_Unbounded_Set_Iterator<T> begin (void);
ACE_Unbounded_Set_Iterator<T> end (void);
ACE_ALLOC_HOOK_DECLARE;