|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <iostream>#include <htlist.H>#include <tpl_dynDlist.H>#include <tpl_dynSetTree.H>#include <tpl_dynMapTree.H>#include <tpl_arrayStack.H>Go to the source code of this file.
Functions | |
| template<template< class > class Container, typename T > | |
| void | test_container (int n) |
| template<template< class, class > class Tree, typename T > | |
| void | test_tree (int n) |
| template<class Tree > | |
| void | test_map_tree (int n) |
| int | main (int argc, char *argv[]) |
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 121 of file test-forward.C.
References Aleph::divide_and_conquer_partition_dp().
| void test_container | ( | int | n | ) |
Definition at line 38 of file test-forward.C.
References Aleph::DynList< T >::append(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynList< T >::insert(), and l.
| void test_map_tree | ( | int | n | ) |
Definition at line 108 of file test-forward.C.
References Aleph::divide_and_conquer_partition_dp(), QuadTree::insert(), and Aleph::Tree.
| void test_tree | ( | int | n | ) |
Definition at line 75 of file test-forward.C.
References Aleph::divide_and_conquer_partition_dp(), FunctionalMethods< Container, T >::for_each(), Aleph::DynList< T >::insert(), and l.
Referenced by TEST().