ACE_Fixed_Set< T, ACE_SIZE > Class Template Reference

Implement a simple unordered set of {T} with maximum {ACE_SIZE}. More...

#include <Containers_T.h>

Public Types
typedef ACE_Fixed_Set_Iterator< T, ACE_SIZE >	ITERATOR
typedef ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >	CONST_ITERATOR

Public Member Functions
	ACE_Fixed_Set ()
	Default Constructor.
	ACE_Fixed_Set (const ACE_Fixed_Set< T, ACE_SIZE > &)
	Copy constructor.
void	operator= (const ACE_Fixed_Set< T, ACE_SIZE > &)
	Assignment operator.
	~ACE_Fixed_Set ()
	Destructor.
int	is_empty () const
	Returns 1 if the container is empty, otherwise returns 0.
int	is_full () const
	Returns 1 if the container is full, otherwise returns 0.
int	insert (const T &new_item)
	Linear time insertion of an item unique to the set.
int	remove (const T &item)
	Linear time removal operation of an item.
int	find (const T &item) const
	Finds if item occurs in the set. Returns 0 if finds, else -1.
size_t	size () const
	Size of the set.
void	dump () const
	Dump the state of an object.

Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks.

Private Attributes
struct {
T   item_
	Item in the set. More...
int   is_free_
	Keeps track of whether this item is in use or not. More...
}	search_structure_ [ACE_SIZE]
	Holds the contents of the set.
size_t	cur_size_
	Current size of the set.
size_t	max_size_
	Maximum size of the set.

Friends
class	ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >
class	ACE_Fixed_Set_Iterator< T, ACE_SIZE >
class	ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >

Detailed Description

template<class T, size_t ACE_SIZE>
class ACE_Fixed_Set< T, ACE_SIZE >

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.

Requirements and Performance Characteristics

• 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
  1. Default constructor
  2. Copy constructor
  3. operator=
  4. operator==

Member Typedef Documentation

CONST_ITERATOR

template<class T , size_t ACE_SIZE>

typedef ACE_Fixed_Set_Const_Iterator<T, ACE_SIZE> ACE_Fixed_Set< T, ACE_SIZE >::CONST_ITERATOR

ITERATOR

template<class T , size_t ACE_SIZE>

typedef ACE_Fixed_Set_Iterator<T, ACE_SIZE> ACE_Fixed_Set< T, ACE_SIZE >::ITERATOR

Constructor & Destructor Documentation

ACE_Fixed_Set() [1/2]

template<class T , size_t ACE_SIZE>

ACE_Fixed_Set< T, ACE_SIZE >::ACE_Fixed_Set

(

)

Default Constructor.

Creates an empy set

ACE_Fixed_Set() [2/2]

template<class T , size_t ACE_SIZE>

ACE_Fixed_Set< T, ACE_SIZE >::ACE_Fixed_Set

(

const ACE_Fixed_Set< T, ACE_SIZE > &

fs

)

Copy constructor.

Initializes a set to be a copy of the set parameter.

~ACE_Fixed_Set()

template<class T , size_t ACE_SIZE>

ACE_Fixed_Set< T, ACE_SIZE >::~ACE_Fixed_Set

(

)

Destructor.

Destroys a set.

Member Function Documentation

dump()

template<class T , size_t ACE_SIZE>

void ACE_Fixed_Set< T, ACE_SIZE >::dump

(

)

const

Dump the state of an object.

find()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set< T, ACE_SIZE >::find

(

const T &

item

)

const

Finds if item occurs in the set. Returns 0 if finds, else -1.

Performs a linear find operation for the specified item.

insert()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set< T, ACE_SIZE >::insert

(

const T &

new_item

)

Linear time insertion of an item unique to the set.

Insert new_item into the set (doesn't allow duplicates). Returns -1 if failures occur, 1 if item is already present, else 0.

is_empty()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set< T, ACE_SIZE >::is_empty ( ) const

inline

Returns 1 if the container is empty, otherwise returns 0.

Performs constant time check to determine if a set is empty.

is_full()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set< T, ACE_SIZE >::is_full ( ) const

inline

Returns 1 if the container is full, otherwise returns 0.

Performs a constant time check to see if the set is full.

operator=()

template<class T , size_t ACE_SIZE>

void ACE_Fixed_Set< T, ACE_SIZE >::operator=

(

const ACE_Fixed_Set< T, ACE_SIZE > &

fs

)

Assignment operator.

Deep copy of one set to another.

remove()

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set< T, ACE_SIZE >::remove

(

const T &

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 item.

size()

template<class T , size_t ACE_SIZE>

size_t ACE_SIZE size_t ACE_Fixed_Set< T, ACE_SIZE >::size

(

)

const

Size of the set.

Returns the current size of the set.

Friends And Related Symbol Documentation

ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >

template<class T , size_t ACE_SIZE>

friend class ACE_Fixed_Set_Const_Iterator< T, ACE_SIZE >

friend

ACE_Fixed_Set_Iterator< T, ACE_SIZE >

template<class T , size_t ACE_SIZE>

friend class ACE_Fixed_Set_Iterator< T, ACE_SIZE >

friend

ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >

template<class T , size_t ACE_SIZE>

friend class ACE_Fixed_Set_Iterator_Base< T, ACE_SIZE >

friend

Member Data Documentation

ACE_ALLOC_HOOK_DECLARE

template<class T , size_t ACE_SIZE>

ACE_Fixed_Set< T, ACE_SIZE >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

cur_size_

template<class T , size_t ACE_SIZE>

size_t ACE_Fixed_Set< T, ACE_SIZE >::cur_size_

private

Current size of the set.

is_free_

template<class T , size_t ACE_SIZE>

int ACE_Fixed_Set< T, ACE_SIZE >::is_free_

Keeps track of whether this item is in use or not.

item_

template<class T , size_t ACE_SIZE>

T ACE_Fixed_Set< T, ACE_SIZE >::item_

Item in the set.

max_size_

template<class T , size_t ACE_SIZE>

size_t ACE_Fixed_Set< T, ACE_SIZE >::max_size_

private

Maximum size of the set.

[struct]

struct { ... } ACE_Fixed_Set< T, ACE_SIZE >::search_structure_[ACE_SIZE]

Holds the contents of the set.

---

The documentation for this class was generated from the following files:

• Containers_T.h
• Containers_T.cpp
• Containers_T.inl