NAME
ACE_Fixed_Set -
Implement a simple unordered set of T with maximum SIZE.
SYNOPSIS
#include <ace/Set.h>
template<class T, size_t SIZE>
class ACE_Fixed_Set
{
public:
friend class ACE_Fixed_Set_Iterator<T, SIZE>;
ACE_Fixed_Set (void);
~ACE_Fixed_Set (void);
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_[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);
void dump (void) const;
ACE_ALLOC_HOOK_DECLARE;
ACE_Bounded_Set<T> &s_;
ssize_t next_;
};
DESCRIPTION
This implementation of an unordered set uses a fixed array.
This implementation does not allow duplicates...
Initialization and termination methods.
ACE_Fixed_Set (void);
~ACE_Fixed_Set (void);
Classic unordered set operations.
int insert (const T &new_item);
Insert 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);
Remove first occurrence of item from the set. Returns 1 if
it removes the item, 0 if it can't find the item, and -1 if a
failure occurs.
int find (const T &item) const;
Return first occurrence of item from the set.
Returns 0 if can't find, else 1.
size_t size (void) const;
void dump (void) const;
Dump the state of an object.
ACE_ALLOC_HOOK_DECLARE;
Declare the dynamic allocation hooks.
Iteration methods.
int next (T *&next_item);
Pass back the next_item that hasn't been seen in the Set.
Returns 0 when all items have been seen, else 1.
int advance (void);
Move forward by one element in the set.
void dump (void) const;
Dump the state of an object.
ACE_ALLOC_HOOK_DECLARE;
Declare the dynamic allocation hooks.
AUTHOR
Doug Schmidt
LIBRARY
ace