|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <iostream>#include <aleph.H>#include <tpl_binTree.H>#include <tpl_avl.H>#include <tpl_treap.H>#include <tpl_splay_tree.H>#include <tpl_rb_tree.H>#include <tpl_rand_tree.H>#include <tpl_dynMapTree.H>#include <ran_array.h>#include <ctime>#include <gsl/gsl_rng.h>#include <argp.h>Go to the source code of this file.
Classes | |
| struct | Parameters |
Enumerations | |
| enum | TreeType { INVALID , BIN , AVL , SPLAY , TREAP , RB , RAND , BIN , AVL , AVL_RK , SPLAY , SPLAY_RK , TREAP , TREAP_RK , RB , RB_RK , TD_RB , TD_RB_RK , RAND } |
Functions | |
| template<class Node > | |
| static void | printNode (Node *node, int, int) |
| template<template< typename, class > class TreeType> | |
| void | test (unsigned long n, gsl_rng *r) |
| static error_t | parser_opt (int key, char *, struct argp_state *state) |
| int | main (int argc, char *argv[]) |
Variables | |
| const char * | argp_program_version = "testAllTree 0.0" |
| const char * | argp_program_bug_address = "aleph-bugs@aleph.ula.ve" |
| static char | doc [] = "testAllTree -- A tester for all binary trees" |
| static char | argDoc [] = "-n num_nodes -m seed_for_random -<tree type>\n" |
| static struct argp_option | options [] |
| static struct argp | argDefs = { options, parser_opt, argDoc, doc, 0, 0, 0 } |
| enum TreeType |
| Enumerator | |
|---|---|
| INVALID | |
| BIN | |
| AVL | |
| SPLAY | |
| TREAP | |
| RB | |
| RAND | |
| BIN | |
| AVL | |
| AVL_RK | |
| SPLAY | |
| SPLAY_RK | |
| TREAP | |
| TREAP_RK | |
| RB | |
| RB_RK | |
| TD_RB | |
| TD_RB_RK | |
| RAND | |
Definition at line 113 of file testAllTree.C.
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 213 of file testAllTree.C.
References AH_ERROR, argDefs, AVL, BIN, Aleph::divide_and_conquer_partition_dp(), INVALID, Parameters::n, r, RAND, RB, Parameters::seed, SPLAY, Parameters::str, TREAP, and Parameters::type.
|
static |
Definition at line 154 of file testAllTree.C.
References AVL, BIN, Aleph::divide_and_conquer_partition_dp(), INVALID, RAND, RB, SPLAY, and TREAP.
Definition at line 44 of file testAllTree.C.
| void test | ( | unsigned long | n, |
| gsl_rng * | r | ||
| ) |
Definition at line 53 of file testAllTree.C.
References Aleph::divide_and_conquer_partition_dp(), Aleph::DynMapTree< Key, Data, Tree, Compare >::find(), Aleph::DynSetTree< Key, Tree, Compare >::height(), Aleph::DynMapTree< Key, Data, Tree, Compare >::insert(), Aleph::DynSetTree< Key, Tree, Compare >::internal_path_length(), max(), r, Aleph::DynMapTree< Key, Data, Tree, Compare >::remove(), and Aleph::DynSetTree< Key, Tree, Compare >::size().
|
static |
Definition at line 211 of file testAllTree.C.
Referenced by main().
Definition at line 137 of file testAllTree.C.
| const char* argp_program_bug_address = "aleph-bugs@aleph.ula.ve" |
Definition at line 134 of file testAllTree.C.
| const char* argp_program_version = "testAllTree 0.0" |
Definition at line 133 of file testAllTree.C.
|
static |
Definition at line 136 of file testAllTree.C.
|
static |
Definition at line 140 of file testAllTree.C.