|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Go to the source code of this file.
Classes | |
| struct | Par |
Typedefs | |
| typedef Filter_Iterator< DynList< int >, DynList< int >::Iterator, Par > | It |
Functions | |
| void | print (HTList &l) |
| int | main (int argc, char *argv[]) |
| typedef Filter_Iterator<DynList<int>, DynList<int>::Iterator, Par> It |
Definition at line 56 of file test_htlist.C.
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 59 of file test_htlist.C.
References Aleph::and, Aleph::DynList< T >::append(), Aleph::HTList::append(), Aleph::HTList::cut(), Aleph::divide_and_conquer_partition_dp(), Aleph::HTList::Iterator::get_curr(), Aleph::HTList::Iterator::has_curr(), Aleph::DynList< T >::insert(), Aleph::HTList::insert(), Aleph::HTList::is_empty(), l, l1, l2, Aleph::HTList::Iterator::next(), print(), Aleph::HTList::remove_all_and_delete(), Aleph::HTList::remove_first(), Aleph::HTList::reverse(), Aleph::DynList< T >::reverse(), and Aleph::HTList::split_list().
| void print | ( | HTList & | l | ) |
Definition at line 37 of file test_htlist.C.
References Aleph::divide_and_conquer_partition_dp(), Aleph::Snodenc< T >::get_data(), Aleph::HTList::Iterator::has_curr(), and l.
Referenced by main().