T
with maximum ACE_SIZE
.
#include <ace/Containers.h>
template<class T, size_t ACE_SIZE> class ACE_Fixed_Set {
public:
friend class ACE_Fixed_Set_Iterator<T, ACE_SIZE>;
typedef ACE_Fixed_Set_Iterator<T, ACE_SIZE> ITERATOR;
ACE_Fixed_Set (void);
ACE_Fixed_Set (const ACE_Fixed_Set<T, ACE_SIZE> &);
void operator= (const ACE_Fixed_Set<T, ACE_SIZE> &);
~ACE_Fixed_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;
ACE_ALLOC_HOOK_DECLARE;
private:
struct { T item_; int is_free_; } search_structure_[ACE_SIZE]; size_t cur_size_; size_t max_size_; }; template <class T> class ACE_Bounded_Set; template <class T> class ACE_Bounded_Set_Iterator { public: ACE_Bounded_Set_Iterator ( ACE_Bounded_Set<T> &s );
int next (T *&next_item);
int advance (void);
int first (void);
int done (void) const;
void dump (void) const;
ACE_ALLOC_HOOK_DECLARE;
ACE_Bounded_Set<T> &s_;
ssize_t next_;
};
ACE_Fixed_Set (void);
ACE_Fixed_Set (const ACE_Fixed_Set<T, ACE_SIZE> &);
void operator= (const ACE_Fixed_Set<T, ACE_SIZE> &);
~ACE_Fixed_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 finds, else -1.
size_t size (void) const;
void dump (void) const;
ACE_ALLOC_HOOK_DECLARE;
int next (T *&next_item);
next_item
that hasn't been seen in the Set.
Returns 0 when all items have been seen, else 1.
int advance (void);
int first (void);
int done (void) const;
void dump (void) const;
ACE_ALLOC_HOOK_DECLARE;