testDynSetHash.C File Reference

#include <ctime>
#include <gsl/gsl_rng.h>
#include <cassert>
#include <iostream>
#include <ahFunctional.H>
#include <ahSort.H>
#include <tpl_sort_utils.H>
#include <tpl_dynSetHash.H>
#include <tpl_dynMapOhash.H>
#include <string>

Include dependency graph for testDynSetHash.C:

Go to the source code of this file.

Macros
#define	NumItems   10000

Functions
template<template< typename, class > class SetType>
unsigned long	insert_n_random_items_in_set (SetType< unsigned long, Aleph::equal_to< unsigned long > > &table, DynArray< unsigned long > &keys, unsigned long n)
template<template< typename, class > class HashTable>
HashTable< unsigned long, Aleph::equal_to< unsigned long > >	create_table (const HashTable< unsigned long, Aleph::equal_to< unsigned long > > &other)
template<template< typename, class > class HashTable>
void	test_DynSetLinHash (size_t n)
template<class HashTable >
unsigned long	insert_n_random_items_in_map (HashTable &table, DynArray< unsigned long > &keys, unsigned long n)
template<template< typename, typename, class > class HashTable>
void	test_DynMapLinHash (size_t n)
int	main (int argc, char *argv[])

Variables
gsl_rng *	r = NULL

Macro Definition Documentation

NumItems

#define NumItems   10000

Definition at line 38 of file testDynSetHash.C.

Function Documentation

create_table()

template<template< typename, class > class HashTable>

HashTable< unsigned long, Aleph::equal_to< unsigned long > > create_table

(

const HashTable< unsigned long, Aleph::equal_to< unsigned long > > &

other

)

Definition at line 76 of file testDynSetHash.C.

References Aleph::divide_and_conquer_partition_dp().

Referenced by test_DynSetLinHash().

insert_n_random_items_in_map()

template<class HashTable >

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

Definition at line 259 of file testDynSetHash.C.

References Aleph::divide_and_conquer_partition_dp(), k, keys, r, and Aleph::sort().

Referenced by test_DynMapLinHash().

insert_n_random_items_in_set()

template<template< typename, class > class SetType>

unsigned long insert_n_random_items_in_set	(	SetType< unsigned long, Aleph::equal_to< unsigned long > > &	table,
		DynArray< unsigned long > &	keys,
		unsigned long	n
	)

Definition at line 45 of file testDynSetHash.C.

References Aleph::divide_and_conquer_partition_dp(), keys, and r.

Referenced by test_DynSetLinHash().

main()

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

Definition at line 405 of file testDynSetHash.C.

References Primes::check_primes_database(), Aleph::divide_and_conquer_partition_dp(), Primes::next_prime(), NumItems, and r.

test_DynMapLinHash()

template<template< typename, typename, class > class HashTable>

void test_DynMapLinHash

(

size_t

n

)

Definition at line 299 of file testDynSetHash.C.

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

test_DynSetLinHash()

template<template< typename, class > class HashTable>

void test_DynSetLinHash

(

size_t

n

)

Definition at line 88 of file testDynSetHash.C.

References Aleph::all(), Aleph::and, Aleph::DynArray< T >::append(), Aleph::binary_search(), Aleph::contains(), create_table(), Aleph::divide_and_conquer_partition_dp(), Aleph::filter(), FunctionalMethods< Container, T >::filter(), Aleph::for_each(), Aleph::HTList::Iterator::has_curr(), insert_n_random_items_in_set(), k, GenericItems< Container, T >::keys(), keys, l, and r.

Variable Documentation

r

gsl_rng* r = NULL

Definition at line 42 of file testDynSetHash.C.

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