---

ACE_Unbounded_List Class Template Reference

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

#include <Naming_Service_Container.h>

Collaboration diagram for ACE_Unbounded_List:

[legend]List of all members.

Public Types
typedef ACE_Unbounded_List_Iterator< T >	ITERATOR
typedef ACE_Unbounded_List_Iterator< T >	iterator
Public Methods
	ACE_Unbounded_List (ACE_Allocator *alloc=0)
	Constructor. Use user specified allocation strategy if specified. More...
	ACE_Unbounded_List (const ACE_Unbounded_List< T > &)
	Copy constructor. More...
void	operator= (const ACE_Unbounded_List< T > &)
	Assignment operator. More...
	~ACE_Unbounded_List (void)
	Destructor. More...
int	is_empty (void) const
	Returns 1 if the container is empty, otherwise returns 0. More...
int	is_full (void) const
	Returns 1 if the container is full, otherwise returns 0. More...
int	insert (const T &new_item)
	Insert <new_item> into the set (doesn't allow duplicates). More...
int	remove (const T &item)
	Remove first occurrence of <item> from the set. More...
size_t	size (void) const
	Size of the set. More...
void	dump (void) const
	Dump the state of an object. More...
void	reset (void)
	Reset the <ACE_Unbounded_List> to be empty. More...
ACE_Unbounded_List_Iterator< T >	begin (void)
ACE_Unbounded_List_Iterator< T >	end (void)
Public Attributes
	ACE_ALLOC_HOOK_DECLARE
	Declare the dynamic allocation hooks. More...
Private Methods
int	insert_tail (const T &item)
	Insert <item> at the tail of the set (doesn't check for duplicates). More...
void	delete_nodes (void)
	Delete all the nodes in the List. More...
void	copy_nodes (const ACE_Unbounded_List< T > &)
	Copy nodes into this set. More...
Private Attributes
ACE_NS_Node< T > *	head_
	Head of the linked list of NS_Nodes. More...
size_t	cur_size_
	Current size of the set. More...
ACE_Allocator *	allocator_
	Allocation strategy of the set. More...
Friends
class	ACE_Unbounded_List_Iterator< T >

---

Detailed Description

template<class T>
class ACE_Unbounded_List< T >

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.

---

Member Typedef Documentation

template<class T> typedef ACE_Unbounded_List_Iterator<T> ACE_Unbounded_List::iterator

template<class T> typedef ACE_Unbounded_List_Iterator<T> ACE_Unbounded_List::ITERATOR

---

Constructor & Destructor Documentation

template<class T> ACE_Unbounded_List< T >::ACE_Unbounded_List (  ACE_Allocator *    alloc = 0 )

Constructor. Use user specified allocation strategy if specified.

template<class T> ACE_Unbounded_List< T >::ACE_Unbounded_List (  const ACE_Unbounded_List< T > &    us )

Copy constructor.

template<class T> ACE_Unbounded_List< T >::~ACE_Unbounded_List (  void    )

Destructor.

---

Member Function Documentation

template<class T> ACE_Unbounded_List_Iterator< T > ACE_Unbounded_List< T >::begin (  void    )

template<class T> void ACE_Unbounded_List< T >::copy_nodes (  const ACE_Unbounded_List< T > &    us )  [private]

Copy nodes into this set.

template<class T> void ACE_Unbounded_List< T >::delete_nodes (  void    )  [private]

Delete all the nodes in the List.

template<class T> void ACE_Unbounded_List< T >::dump (  void    )  const

Dump the state of an object.

template<class T> ACE_Unbounded_List_Iterator< T > ACE_Unbounded_List< T >::end (  void    )

template<class T> int ACE_Unbounded_List< T >::insert (  const T &    item )

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

template<class T> int ACE_Unbounded_List< T >::insert_tail (  const T &    item )  [private]

Insert <item> at the tail of the set (doesn't check for duplicates).

template<class T> int ACE_Unbounded_List< T >::is_empty (  void    )  const

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

template<class T> int ACE_Unbounded_List< T >::is_full (  void    )  const

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

template<class T> void ACE_Unbounded_List< T >::operator= (  const ACE_Unbounded_List< T > &    us )

Assignment operator.

template<class T> int ACE_Unbounded_List< T >::remove (  const T &    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.

template<class T> void ACE_Unbounded_List< T >::reset (  void    )

Reset the <ACE_Unbounded_List> to be empty.

template<class T> size_t ACE_Unbounded_List< T >::size (  void    )  const

Size of the set.

---

Friends And Related Function Documentation

template<class T> friend class ACE_Unbounded_List_Iterator< T > [friend]

---

Member Data Documentation

template<class T> ACE_Unbounded_List::ACE_ALLOC_HOOK_DECLARE

Declare the dynamic allocation hooks.

template<class T> ACE_Allocator* ACE_Unbounded_List::allocator_ [private]

Allocation strategy of the set.

template<class T> size_t ACE_Unbounded_List::cur_size_ [private]

Current size of the set.

template<class T> ACE_NS_Node<T>* ACE_Unbounded_List::head_ [private]

Head of the linked list of NS_Nodes.

---

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

• Naming_Service_Container.h
• Naming_Service_Container.cpp

---