|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <iostream>#include <gsl/gsl_rng.h>#include <tpl_dynarray_set.H>#include <tpl_splay_tree.H>#include <string>#include <cassert>Go to the source code of this file.
Functions | |
| void | print_node (Splay_Tree< int >::Node *p, int, int) |
| void | write_node (Splay_Tree< int >::Node *p, int, int) |
| int | main (int argc, char *argv[]) |
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 50 of file test_splay_tree.C.
References AH_ERROR, Aleph::DynArray< T >::append(), Aleph::destroyRec(), Aleph::divide_and_conquer_partition_dp(), Aleph::for_each(), GenTdSplayTree< NodeType, Key, Compare >::getRoot(), Aleph::inOrderRec(), GenTdSplayTree< NodeType, Key, Compare >::insert(), k, Aleph::preOrderRec(), print_node(), r, GenTdSplayTree< NodeType, Key, Compare >::remove(), Aleph::DynArray< T >::remove(), GenTdSplayTree< NodeType, Key, Compare >::search(), seed, and Aleph::DynArray< T >::size().
| void print_node | ( | Splay_Tree< int >::Node * | p, |
| int | , | ||
| int | |||
| ) |
| void write_node | ( | Splay_Tree< int >::Node * | p, |
| int | , | ||
| int | |||
| ) |
Definition at line 44 of file test_splay_tree.C.
References KEY.