35# include <gsl/gsl_rng.h>
37# include <tclap/CmdLine.h>
51 {
"n",
"num",
"num of keys",
false, 10,
"num of keys",
cmd };
54 "seed for random",
cmd };
64 for (
size_t i = 0; i < n; ++i)
72 tbl.for_each([] (
auto p) { cout << p.first <<
", " << p.second <<
endl; });
74 for (
auto it =
tbl.get_it(); it.has_curr(); it.next())
76 auto p = it.get_curr();
78 auto ptr =
tbl.search(key);
79 cout << key <<
" == " << ptr->first <<
" " << p.second <<
" == "
80 << ptr->second <<
endl;
82 assert(p.second == ptr->second);
85 for (
size_t i = 0; i < n; ++i)
88 auto ptr =
tbl.search(p1.first);
89 assert(p1.first == ptr->first);
90 assert(p1.second == ptr->second);
Core header for the Aleph-w library.
T & append()
Allocate a new entry to the end of array.
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
MapOLhash< int, Foo > tbl
std::string to_string(const time_t t, const std::string &format)
Format a time_t value into a string using format.
ValueArg< size_t > num_keys
Dynamic set implementations based on hash tables.