Aleph::GenericItems< Container, T > Struct Template Reference

#include <htlist.H>

Inherited by Aleph::Array< T >, Aleph::Array_Container< T >, Aleph::ArrayQueue< T >, Aleph::ArrayStack< T >, Aleph::DynArray< T >, Aleph::DynArrayHeap< T, Compare >, Aleph::DynBinHeap< T, Compare >, Aleph::DynHashTable< Key, HashTable, Cmp >, Aleph::DynListQueue< T >, Aleph::DynSetTree< Key, Tree, Compare >, Aleph::FixedQueue< T >, Aleph::FixedStack< T >, Aleph::Random_Set< T >, Aleph::ArrayStack< Node *>, Aleph::DynArray< Arc_Type >, Aleph::DynArray< Byte >, Aleph::DynArray< Distance_Type >, Aleph::DynArray< Dnode< Key > >, Aleph::DynArray< DynArray< Node *> >, Aleph::DynArray< Entry_Type >, Aleph::DynArray< Event_Fct >, Aleph::DynArray< Key >, Aleph::DynArray< long >, Aleph::DynArray< Mat_Entry >, Aleph::DynArray< Node *>, Aleph::DynArray< Node_Type >, Aleph::DynArray< Point >, Aleph::DynArray< size_t >, Aleph::DynArray< typename GT::Arc *>, Aleph::DynArray< typename GT::Node *>, Aleph::DynArray< void *>, Aleph::DynHashTable< Key, LhashTable, Cmp >, Aleph::DynHashTable< Key, LinearHashTable, Cmp >, Aleph::DynHashTable< std::pair< Key, Data >, HashTable, Dft_Pair_Cmp< Key, Data, Cmp > >, Aleph::DynSetTree< Arc *, Rand_Tree >, Aleph::DynSetTree< GT::Arc *, Tree, Compare >, Aleph::DynSetTree< GT::Node *, Tree, Compare >, Aleph::DynSetTree< GT_Arc *, Tree, Cmp_Arc >, Aleph::DynSetTree< GT_Node *, Rand_Tree, Aleph::less< GT_Node *> >, Aleph::DynSetTree< GT_Node *, Tree, Compare >, Aleph::DynSetTree< Key, Avl_Tree, Compare >, Aleph::DynSetTree< Key, BinTree, Compare >, Aleph::DynSetTree< Key, Rand_Tree, Compare >, Aleph::DynSetTree< Key, Rb_Tree, Compare >, Aleph::DynSetTree< Key, Splay_Tree, Compare >, Aleph::DynSetTree< Key, Treap, Compare >, Aleph::DynSetTree< Key, Treap_Rk, Compare >, Aleph::DynSetTree< Node *, Rand_Tree >, Aleph::DynSetTree< Node *>, Aleph::DynSetTree< Pair, Avl_Tree, Cmp >, Aleph::DynSetTree< std::pair< int, int >, Avl_Tree, Aleph::less< std::pair< int, int > > >, Aleph::DynSetTree< std::pair< Key, Data >, Tree, Dft_Pair_Cmp< Key, Data, Compare > >, Aleph::DynSetTree< std::pair< Key, Operation >, Avl_Tree, Dft_Pair_Cmp< Key, Operation, Aleph::less< Key > > >, Aleph::DynSetTree< std::pair< Key, Type >, Avl_Tree, Dft_Pair_Cmp< Key, Type, Compare > >, Aleph::DynSetTree< std::pair< Key, Type >, BinTree, Dft_Pair_Cmp< Key, Type, Compare > >, Aleph::DynSetTree< std::pair< Key, Type >, Rand_Tree, Dft_Pair_Cmp< Key, Type, Compare > >, Aleph::DynSetTree< std::pair< Key, Type >, Rb_Tree, Dft_Pair_Cmp< Key, Type, Compare > >, Aleph::DynSetTree< std::pair< Key, Type >, Splay_Tree, Dft_Pair_Cmp< Key, Type, Compare > >, Aleph::DynSetTree< std::pair< Key, Type >, Treap, Dft_Pair_Cmp< Key, Type, Compare > >, Aleph::DynSetTree< std::pair< Key, Type >, Treap_Rk, Dft_Pair_Cmp< Key, Type, Compare > >, Aleph::DynSetTree< std::pair< string, BitArray >, Treap_Vtl, Dft_Pair_Cmp< string, BitArray, Aleph::less< string > > >, Aleph::DynSetTree< std::pair< string, Huffman_Node * >, Treap_Vtl, Dft_Pair_Cmp< string, Huffman_Node *, Aleph::less< string > > >, and Aleph::FixedStack< Node *>.

Public Member Functions
DynList< T >	items () const
DynList< T >	keys () const

Detailed Description

template<class Container, typename T>
struct Aleph::GenericItems< Container, T >

Generic list of items stored in a container.

Member Function Documentation

items()

template<class Container, typename T>

DynList<T> Aleph::GenericItems< Container, T >::items ( ) const

inline

Return a list of all the elements of a container sorted by traversal order.

Returns

a DynList<T> containing all the elements of the container

Exceptions

bad_alloc

if there is no enough memory

keys()

template<class Container, typename T>

DynList<T> Aleph::GenericItems< Container, T >::keys ( ) const

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

Here is the caller graph for this function:

---

The documentation for this struct was generated from the following file:

• htlist.H