ACE_ALLOC_HOOK_DECLARE | ACE_Unbounded_Stack< T > | |

ACE_Unbounded_Stack(ACE_Allocator *the_allocator=0) | ACE_Unbounded_Stack< T > | |

ACE_Unbounded_Stack(const ACE_Unbounded_Stack< T > &s) | ACE_Unbounded_Stack< T > | |

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 > | ` [private]` |

cur_size_ | ACE_Unbounded_Stack< T > | ` [private]` |

delete_all_nodes(void) | ACE_Unbounded_Stack< T > | ` [private]` |

dump(void) const | ACE_Unbounded_Stack< T > | |

find(const T &item) const | ACE_Unbounded_Stack< T > | |

head_ | ACE_Unbounded_Stack< T > | ` [private]` |

insert(const T &new_item) | ACE_Unbounded_Stack< T > | |

is_empty(void) const | ACE_Unbounded_Stack< T > | |

is_full(void) const | ACE_Unbounded_Stack< T > | |

ITERATOR typedef | ACE_Unbounded_Stack< T > | |

operator=(const ACE_Unbounded_Stack< T > &s) | ACE_Unbounded_Stack< T > | |

pop(T &item) | ACE_Unbounded_Stack< T > | |

push(const T &new_item) | ACE_Unbounded_Stack< T > | |

remove(const T &item) | ACE_Unbounded_Stack< T > | |

size(void) const | ACE_Unbounded_Stack< T > | |

top(T &item) const | ACE_Unbounded_Stack< T > | |

~ACE_Unbounded_Stack(void) | ACE_Unbounded_Stack< T > | |