testDynSetTree.C File Reference

#include <ctime>
#include <cerrno>
#include <climits>
#include <gsl/gsl_rng.h>
#include <cassert>
#include <iostream>
#include <ahFunctional.H>
#include <ahSort.H>
#include <tpl_sort_utils.H>
#include <tpl_dynMapTree.H>

Include dependency graph for testDynSetTree.C:

Go to the source code of this file.

Macros
#define	NumItems   10000

Functions
unsigned long	insert_n_random_items_in_set (DynSetTree< unsigned long > &table, DynArray< unsigned long > &keys, unsigned long n)
DynSetTree< unsigned long >	create_table (const DynSetTree< unsigned long > &other)
void	test_DynSet (size_t n)
unsigned long	insert_n_random_items_in_map (DynMapTree< unsigned long, long > &table, DynArray< unsigned long > &keys, unsigned long n)
void	test_DynMap (size_t n)
int	main (int argc, char *argv[])

Variables
gsl_rng *	r = nullptr

Macro Definition Documentation

NumItems

#define NumItems   10000

Definition at line 39 of file testDynSetTree.C.

Function Documentation

create_table()

DynSetTree< unsigned long > create_table

(

const DynSetTree< unsigned long > &

other

)

Definition at line 65 of file testDynSetTree.C.

References Aleph::divide_and_conquer_partition_dp(), FunctionalMethods< Container, T >::for_each(), and Aleph::DynSetTree< Key, Tree, Compare >::insert().

Referenced by test_DynSet().

insert_n_random_items_in_map()

unsigned long insert_n_random_items_in_map	(	DynMapTree< unsigned long, long > &	table,
		DynArray< unsigned long > &	keys,
		unsigned long	n
	)

Definition at line 230 of file testDynSetTree.C.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynMapTree< Key, Data, Tree, Compare >::has(), Aleph::DynMapTree< Key, Data, Tree, Compare >::insert(), keys, and r.

Referenced by test_DynMap().

insert_n_random_items_in_set()

unsigned long insert_n_random_items_in_set	(	DynSetTree< unsigned long > &	table,
		DynArray< unsigned long > &	keys,
		unsigned long	n
	)

Definition at line 45 of file testDynSetTree.C.

References Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::has(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), keys, and r.

Referenced by test_DynSet().

main()

int main	(	int	argc,
		char *	argv[]
	)

Definition at line 317 of file testDynSetTree.C.

References Aleph::divide_and_conquer_partition_dp(), NumItems, r, test_DynMap(), and test_DynSet().

test_DynMap()

void test_DynMap

(

size_t

n

)

Definition at line 247 of file testDynSetTree.C.

References Aleph::all(), Aleph::divide_and_conquer_partition_dp(), insert_n_random_items_in_map(), GenericItems< Container, T >::items(), k, GenericItems< Container, T >::keys(), and keys.

Referenced by main().

test_DynSet()

void test_DynSet

(

size_t

n

)

Definition at line 76 of file testDynSetTree.C.

References Aleph::all(), Aleph::and, Aleph::binary_search(), Aleph::contains(), create_table(), Aleph::divide_and_conquer_partition_dp(), Aleph::DynSetTree< Key, Tree, Compare >::empty(), EqualToMethod< Container >::equal_to(), Aleph::filter(), FunctionalMethods< Container, T >::filter(), Aleph::for_each(), Aleph::DynSetTree< Key, Tree, Compare >::has(), Aleph::HTList::Iterator::has_curr(), Aleph::DynSetTree< Key, Tree, Compare >::insert(), insert_n_random_items_in_set(), k, GenericItems< Container, T >::keys(), keys, l, r, Aleph::DynSetTree< Key, Tree, Compare >::remove(), Aleph::DynSetTree< Key, Tree, Compare >::search(), and Aleph::DynSetTree< Key, Tree, Compare >::size().

Referenced by main().

Variable Documentation

r

gsl_rng* r = nullptr

Definition at line 43 of file testDynSetTree.C.

Referenced by insert_n_random_items_in_map(), insert_n_random_items_in_set(), main(), and test_DynSet().