ACE_Unbounded_Stack< T > Member List

This is the complete list of members for ACE_Unbounded_Stack< T >, including all inherited members.

ACE_ALLOC_HOOK_DECLARE	ACE_Unbounded_Stack< T >
ACE_Unbounded_Stack(ACE_Allocator *the_allocator=0)	ACE_Unbounded_Stack< T >	[inline]
ACE_Unbounded_Stack(const ACE_Unbounded_Stack< T > &s)	ACE_Unbounded_Stack< T >	[inline]
ACE_Unbounded_Stack_Iterator< T > class	ACE_Unbounded_Stack< T >	[friend]
allocator_	ACE_Unbounded_Stack< T >	[private]
copy_all_nodes(const ACE_Unbounded_Stack< T > &s)	ACE_Unbounded_Stack< T >	[inline, private]
cur_size_	ACE_Unbounded_Stack< T >	[private]
delete_all_nodes(void)	ACE_Unbounded_Stack< T >	[inline, private]
dump(void) const	ACE_Unbounded_Stack< T >	[inline]
find(const T &item) const	ACE_Unbounded_Stack< T >	[inline]
head_	ACE_Unbounded_Stack< T >	[private]
insert(const T &new_item)	ACE_Unbounded_Stack< T >	[inline]
is_empty(void) const	ACE_Unbounded_Stack< T >	[inline]
is_full(void) const	ACE_Unbounded_Stack< T >	[inline]
ITERATOR typedef	ACE_Unbounded_Stack< T >
operator=(const ACE_Unbounded_Stack< T > &s)	ACE_Unbounded_Stack< T >	[inline]
pop(T &item)	ACE_Unbounded_Stack< T >	[inline]
push(const T &new_item)	ACE_Unbounded_Stack< T >	[inline]
remove(const T &item)	ACE_Unbounded_Stack< T >	[inline]
size(void) const	ACE_Unbounded_Stack< T >	[inline]
top(T &item) const	ACE_Unbounded_Stack< T >	[inline]
~ACE_Unbounded_Stack(void)	ACE_Unbounded_Stack< T >	[inline]