ACE 8.0.1
Loading...
Searching...
No Matches
Public Types | Public Member Functions | Public Attributes | Private Member Functions | Private Attributes | Friends | List of all members
ACE_Unbounded_Set_Ex< T, C > Class Template Reference

Implement a simple unordered set of <T> of unbounded size. More...

#include <Unbounded_Set_Ex.h>

Inheritance diagram for ACE_Unbounded_Set_Ex< T, C >:
Inheritance graph
[legend]
Collaboration diagram for ACE_Unbounded_Set_Ex< T, C >:
Collaboration graph
[legend]

Public Types

typedef ACE_Unbounded_Set_Ex_Iterator< T, CITERATOR
 
typedef ACE_Unbounded_Set_Ex_Iterator< T, Citerator
 
typedef ACE_Unbounded_Set_Ex_Const_Iterator< T, CCONST_ITERATOR
 
typedef ACE_Unbounded_Set_Ex_Const_Iterator< T, Cconst_iterator
 
typedef C COMP
 
typedef ACE_Node< T, CNODE
 
typedefvalue_type
 
typedef T const const_value_type
 
typedef value_typereference
 
typedef const_value_typeconst_reference
 
typedef value_typepointer
 
typedef const_value_typeconst_pointer
 
typedef ptrdiff_t difference_type
 

Public Member Functions

 ACE_Unbounded_Set_Ex (ACE_Allocator *alloc=nullptr)
 
 ACE_Unbounded_Set_Ex (const C &comparator, ACE_Allocator *alloc=nullptr)
 
 ACE_Unbounded_Set_Ex (const ACE_Unbounded_Set_Ex< T, C > &)
 Copy constructor.
 
ACE_Unbounded_Set_Ex< T, C > & operator= (const ACE_Unbounded_Set_Ex< T, C > &)
 Assignment operator.
 
 ~ACE_Unbounded_Set_Ex ()
 Destructor.
 
bool is_empty () const
 Returns true if the container is empty, otherwise returns false.
 
bool is_full () const
 Returns false.
 
int insert (const T &new_item)
 Linear insertion of an item.
 
int insert_tail (const T &item)
 
int remove (const T &item)
 Linear remove operation.
 
int find (const T &item) const
 
size_t size () const
 Size of the set.
 
void dump () const
 Dump the state of an object.
 
void reset ()
 Reset the ACE_Unbounded_Set_Ex to be empty.
 
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 

Public Attributes

 ACE_ALLOC_HOOK_DECLARE
 Declare the dynamic allocation hooks.
 

Private Member Functions

void delete_nodes ()
 Delete all the nodes in the Set.
 
void copy_nodes (const ACE_Unbounded_Set_Ex< T, C > &)
 Copy nodes into this set.
 

Private Attributes

NODEhead_
 Head of the linked list of Nodes.
 
size_t cur_size_
 Current size of the set.
 
ACE_Allocatorallocator_
 Allocation strategy of the set.
 
COMP comp_
 Comparator to be used.
 

Friends

class ACE_Unbounded_Set_Ex_Iterator< T, C >
 
class ACE_Unbounded_Set_Ex_Const_Iterator< T, C >
 

Detailed Description

template<class T, class C>
class ACE_Unbounded_Set_Ex< T, C >

Implement a simple unordered set of <T> of unbounded size.

This implementation of an unordered set uses a circular linked list with a dummy node. This implementation does not allow duplicates, but it maintains FIFO ordering of insertions.

This implementation may also be parameterized with a comparator functor, which must implement bool operator () (const T&, const T&) const, returning true if the given items are equivalent. The default comparator is sufficient for objects reliably compared with operator==.

Requirements and Performance Characteristics

Member Typedef Documentation

◆ COMP

template<class T , class C >
typedef C ACE_Unbounded_Set_Ex< T, C >::COMP

◆ CONST_ITERATOR

template<class T , class C >
typedef ACE_Unbounded_Set_Ex_Const_Iterator<T, C> ACE_Unbounded_Set_Ex< T, C >::CONST_ITERATOR

◆ const_iterator

template<class T , class C >
typedef ACE_Unbounded_Set_Ex_Const_Iterator<T, C> ACE_Unbounded_Set_Ex< T, C >::const_iterator

◆ const_pointer

template<class T , class C >
typedef const_value_type* ACE_Unbounded_Set_Ex< T, C >::const_pointer

◆ const_reference

template<class T , class C >
typedef const_value_type& ACE_Unbounded_Set_Ex< T, C >::const_reference

◆ const_value_type

template<class T , class C >
typedef T const ACE_Unbounded_Set_Ex< T, C >::const_value_type

◆ difference_type

template<class T , class C >
typedef ptrdiff_t ACE_Unbounded_Set_Ex< T, C >::difference_type

◆ ITERATOR

◆ iterator

◆ NODE

template<class T , class C >
typedef ACE_Node<T, C> ACE_Unbounded_Set_Ex< T, C >::NODE

◆ pointer

template<class T , class C >
typedef value_type* ACE_Unbounded_Set_Ex< T, C >::pointer

◆ reference

template<class T , class C >
typedef value_type& ACE_Unbounded_Set_Ex< T, C >::reference

◆ value_type

template<class T , class C >
typedef T ACE_Unbounded_Set_Ex< T, C >::value_type

Constructor & Destructor Documentation

◆ ACE_Unbounded_Set_Ex() [1/3]

Constructor. Use user specified allocation strategy if specified. Initialize an empty set using the allocation strategy of the user if provided.

◆ ACE_Unbounded_Set_Ex() [2/3]

template<class T , class C >
ACE_Unbounded_Set_Ex< T, C >::ACE_Unbounded_Set_Ex ( const C & comparator,
ACE_Allocator * alloc = nullptr )

Initialize an empty set using the allocation strategy of the user if provided, and a given comparator functor.

◆ ACE_Unbounded_Set_Ex() [3/3]

Copy constructor.

Initialize this set to be an exact copy of the set provided.

◆ ~ACE_Unbounded_Set_Ex()

Destructor.

Destroy the nodes of the set.

Member Function Documentation

◆ begin() [1/2]

template<class T , class C >
ACE_Unbounded_Set_Ex< T, C >::iterator ACE_Unbounded_Set_Ex< T, C >::begin ( )

◆ begin() [2/2]

template<class T , class C >
ACE_Unbounded_Set_Ex< T, C >::const_iterator ACE_Unbounded_Set_Ex< T, C >::begin ( ) const

◆ copy_nodes()

template<class T , class C >
void ACE_Unbounded_Set_Ex< T, C >::copy_nodes ( const ACE_Unbounded_Set_Ex< T, C > & us)
private

Copy nodes into this set.

◆ delete_nodes()

template<class T , class C >
void ACE_Unbounded_Set_Ex< T, C >::delete_nodes ( )
private

Delete all the nodes in the Set.

◆ dump()

template<class T , class C >
void ACE_Unbounded_Set_Ex< T, C >::dump ( ) const

Dump the state of an object.

◆ end() [1/2]

template<class T , class C >
ACE_Unbounded_Set_Ex< T, C >::iterator ACE_Unbounded_Set_Ex< T, C >::end ( )

◆ end() [2/2]

template<class T , class C >
ACE_Unbounded_Set_Ex< T, C >::const_iterator ACE_Unbounded_Set_Ex< T, C >::end ( ) const

◆ find()

template<class T , class C >
int ACE_Unbounded_Set_Ex< T, C >::find ( const T & item) const

Finds if item occurs in the set. Returns 0 if find succeeds, else -1. Performs a linear find operation.

◆ insert()

template<class T , class C >
int ACE_Unbounded_Set_Ex< T, C >::insert ( const T & new_item)

Linear insertion of an item.

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

◆ insert_tail()

template<class T , class C >
int ACE_Unbounded_Set_Ex< T, C >::insert_tail ( const T & item)

Insert item at the tail of the set (doesn't check for duplicates). Constant time insert at the end of the set.

◆ is_empty()

template<class T , class C >
bool ACE_Unbounded_Set_Ex< T, C >::is_empty ( ) const
inline

Returns true if the container is empty, otherwise returns false.

Constant time is_empty check.

◆ is_full()

template<class T , class C >
bool ACE_Unbounded_Set_Ex< T, C >::is_full ( ) const
inline

Returns false.

Always returns false since the set can never fill up.

◆ operator=()

template<class T , class C >
ACE_Unbounded_Set_Ex< T, C > & ACE_Unbounded_Set_Ex< T, C >::operator= ( const ACE_Unbounded_Set_Ex< T, C > & us)

Assignment operator.

Perform a deep copy of the rhs into the lhs.

◆ remove()

template<class T , class C >
int ACE_Unbounded_Set_Ex< T, C >::remove ( const T & item)

Linear remove operation.

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.

◆ reset()

template<class T , class C >
void ACE_Unbounded_Set_Ex< T, C >::reset ( )

Reset the ACE_Unbounded_Set_Ex to be empty.

Delete the nodes of the set.

◆ size()

template<class T , class C >
class C size_t ACE_Unbounded_Set_Ex< T, C >::size ( ) const

Size of the set.

Access the size of the set.

Friends And Related Symbol Documentation

◆ ACE_Unbounded_Set_Ex_Const_Iterator< T, C >

◆ ACE_Unbounded_Set_Ex_Iterator< T, C >

template<class T , class C >
friend class ACE_Unbounded_Set_Ex_Iterator< T, C >
friend

Member Data Documentation

◆ ACE_ALLOC_HOOK_DECLARE

template<class T , class C >
ACE_Unbounded_Set_Ex< T, C >::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

◆ allocator_

template<class T , class C >
ACE_Allocator* ACE_Unbounded_Set_Ex< T, C >::allocator_
private

Allocation strategy of the set.

◆ comp_

template<class T , class C >
COMP ACE_Unbounded_Set_Ex< T, C >::comp_
private

Comparator to be used.

◆ cur_size_

template<class T , class C >
size_t ACE_Unbounded_Set_Ex< T, C >::cur_size_
private

Current size of the set.

◆ head_

template<class T , class C >
NODE* ACE_Unbounded_Set_Ex< T, C >::head_
private

Head of the linked list of Nodes.


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