|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <ctime>#include <cstdlib>#include <cassert>#include <iostream>#include <string>#include <ahFunctional.H>#include <htlist.H>#include <tpl_dynDlist.H>Go to the source code of this file.
Functions | |
| void | imprime (DynDlist< int > &l) |
| void | imprime (DynDlist< DynDlist< int > > &l) |
| int | main (int argc, char *argv[]) |
Definition at line 50 of file testDynDlist.C.
References Aleph::divide_and_conquer_partition_dp(), imprime(), l, and Aleph::Dlink::next.
| void imprime | ( | DynDlist< int > & | l | ) |
Definition at line 41 of file testDynDlist.C.
References Aleph::divide_and_conquer_partition_dp(), Aleph::Dlink::Iterator::has_curr(), l, and Aleph::HTList::size().
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 61 of file testDynDlist.C.
References FunctionalMethods< Container, T >::all(), Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), FunctionalMethods< Container, T >::for_each(), Aleph::DynDlist< T >::get_first(), Aleph::Dlink::Iterator::has_curr(), imprime(), Aleph::DynDlist< T >::insert(), Aleph::Dlink::is_empty(), k, l, l1, m, and Aleph::range().