Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
testHash.C File Reference
#include <ctime>
#include <gsl/gsl_rng.h>
#include <tclap/CmdLine.h>
#include <iostream>
#include <aleph.H>
#include <tpl_dynSetHash.H>
#include <cassert>
Include dependency graph for testHash.C:

Go to the source code of this file.

Functions

void test (size_t n, unsigned long seed)
 
int main (int argc, char *argv[])
 

Variables

CmdLine cmd = { "testHash", ' ', "0" }
 
ValueArg< size_t > num_keys
 
ValueArg< size_t > seed
 

Function Documentation

◆ main()

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

Definition at line 91 of file testHash.C.

References cmd, Aleph::divide_and_conquer_partition_dp(), num_keys, seed, and test().

◆ test()

void test ( size_t  n,
unsigned long  seed 
)

Variable Documentation

◆ cmd

CmdLine cmd = { "testHash", ' ', "0" }

Definition at line 43 of file testHash.C.

Referenced by demo_command_autocomplete(), Aleph::execute_R_script(), main(), and main().

◆ num_keys

ValueArg<size_t> num_keys
Initial value:
=
{ "n", "num", "num of keys", false, 10, "num of keys", cmd }
CmdLine cmd
Definition testHash.C:43

Definition at line 45 of file testHash.C.

Referenced by main(), and TEST().

◆ seed

ValueArg<size_t> seed
Initial value:
= { "s", "seed", "seed", false, (size_t) time(nullptr),
"seed for random", cmd }
Divide_Conquer_DP_Result< Cost > divide_and_conquer_partition_dp(const size_t groups, const size_t n, Transition_Cost_Fn transition_cost, const Cost inf=dp_optimization_detail::default_inf< Cost >())
Optimize partition DP using divide-and-conquer optimization.

Definition at line 48 of file testHash.C.

Referenced by Aleph::Bloom_Filter< T >::Bloom_Filter(), Aleph::DynSkipList< Key, Compare >::DynSkipList(), Aleph::Gen_Interval_Tree< NodeType, T, Compare >::Gen_Interval_Tree(), Aleph::Gen_Rand_Tree< NodeType, Key, Compare >::Gen_Rand_Tree(), Aleph::Gen_Treap< NodeType, Key, Compare >::Gen_Treap(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::Gen_Treap_Rk(), gsl_rng_holder::gsl_rng_holder(), Aleph::Random_Graph_Base< GT, Init_Node, Init_Arc >::Random_Graph_Base(), Random_Network_Flow< Net >::Random_Network_Flow(), RandTree< T >::RandTree(), Aleph::SkipList< Key, Type >::SkipList(), Aleph::aleph_hash_value(), benchmark_comparison(), Aleph::planarity_detail::LR_Planarity_Checker< GT, SA >::build_combinatorial_embedding_linear_lr(), build_random_graph(), build_random_graph(), Aleph::Bloom_Filter< T >::contains(), create_random_list(), JohnsonTest::createCompleteGraph(), JohnsonTest::createSparseGraph(), demo_merge(), Aleph::dft_hash_fct(), Aleph::dft_hash_fct(), Aleph::dft_hash_fct(), Aleph::dft_seed_hash_ptr_fct(), example_merge(), example_parallel_building_blocks(), example_performance(), Aleph::detail::find_any_factor(), Aleph::gen_random_euclidian_graph(), Aleph::generate_bipartite_network(), Aleph::generate_layered_network(), generate_random_data(), generate_random_graph(), Aleph::generate_random_network(), Aleph::generate_random_network(), generate_random_values(), Aleph::hash_combine(), Aleph::Bloom_Filter< T >::hash_seeds(), Aleph::Bloom_Filter< T >::hashes(), Aleph::Gen_Interval_Tree< NodeType, T, Compare >::init(), Aleph::Gen_Treap< NodeType, Key, Compare >::init(), Aleph::Gen_Rand_Tree< NodeType, Key, Compare >::init(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::init(), Aleph::DynSkipList< Key, Compare >::init(), Aleph::SkipList< Key, Type >::init(), Aleph::init_jsw(), init_random(), Aleph::Bloom_Filter< T >::insert(), Aleph::jsw_fill_table(), main(), make_noisy_circle(), Aleph::detail::mix_codec_id(), monte_carlo_simulation(), Aleph::murmur3hash(), Aleph::murmur3hash(), Aleph::murmur3hash(), Aleph::MurmurHash3_x64_128(), Aleph::MurmurHash3_x86_128(), Aleph::MurmurHash3_x86_32(), Aleph::SweepLineSegmentIntersection::operator()(), Aleph::Aleph_Hash< T >::operator()(), Aleph::Aleph_Hash< double >::operator()(), Aleph::Aleph_Hash< float >::operator()(), Aleph::pair_dft_hash_fct(), Aleph::pair_snd_hash_fct(), Aleph::detail::pollard_rho_step(), ran_start(), Aleph::reservoir_sample(), run_full_benchmark(), run_performance_comparison(), Aleph::Gen_Interval_Tree< NodeType, T, Compare >::set_seed(), Aleph::Gen_Rand_Tree< NodeType, Key, Compare >::set_seed(), Aleph::Gen_Treap< NodeType, Key, Compare >::set_seed(), Aleph::Gen_Treap_Rk< NodeType, Key, Compare >::set_seed(), Aleph::Random_Set< T >::set_seed(), Aleph::DynSkipList< Key, Compare >::set_seed(), Aleph::SkipList< Key, Type >::set_seed(), Aleph::SuperFastHash(), Aleph::SuperFastHash(), Aleph::SuperFastHash(), Aleph::SuperFastHash(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), test(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TYPED_TEST(), visual_demonstration(), Aleph::wyhash_hash(), Aleph::wyhash_hash(), Aleph::wyhash_hash(), Aleph::wyhash_hash(), Aleph::xxhash64_hash(), Aleph::xxhash64_hash(), Aleph::xxhash64_hash(), and Aleph::xxhash64_hash().