41 string a =
"hello world";
43 Foo(
const string & str) :
a(str) {}
51 return p1.first == p2.first;
75 for (
size_t i = 0; i < 1000; ++i)
81 static_cast<void>(
m.
insert(make_pair(make_pair(f1.get(), f2.get()),
82 f1->a +
" " + f2->a)));
84 for (
auto it =
foos.get_it(); it.has_curr(); it.next())
86 auto f1 = it.get_curr().get();
87 for (
auto it =
foos.get_it(); it.has_curr(); it.next())
88 static_cast<void>(
m.
insert(make_pair(make_pair(f1, it.get_curr().get()),
89 f1->a +
" " + it.get_curr()->a)));
92 for (
auto it =
foos.get_it(); it.has_curr(); it.next())
94 auto f1 = it.get_curr().get();
95 for (
auto it =
foos.get_it(); it.has_curr(); it.next())
96 m.
remove(make_pair(make_pair(f1, it.get_curr().get()),
""));
99 for (
auto it =
m.
get_it(); it.has_curr(); it.next())
101 auto p = it.get_curr();
102 cout << p.second <<
endl;
T & append()
Allocate a new entry to the end of array.
Open addressing hash table with double hashing collision resolution.
void remove(const Key &key)
Remove a key from the hash table.
auto get_it() const
Return a properly initialized iterator positioned at the first item on the container.
Key * insert(const Key &key)
Inserts a key into the hash table (copy version).
size_t blossom_maximum_cardinality_matching(const GT &g, DynDlist< typename GT::Arc * > &matching, SA sa=SA())
Alias of compute_maximum_cardinality_general_matching().
size_t pair_snd_hash_fct(const std::pair< K1, K2 > &p) noexcept
std::pair< First, Second > pair
Alias to std::pair kept for backwards compatibility.
size_t pair_dft_hash_fct(const std::pair< K1, K2 > &p) noexcept
std::string to_string(const time_t t, const std::string &format)
Format a time_t value into a string using format.
bool operator()(const pair< pair< const Foo *, const Foo * >, string > &p1, const pair< pair< const Foo *, const Foo * >, string > &p2) const
static size_t fst_unit_pair_hash(const pair< pair< const Foo *, const Foo * >, string > &p)
static size_t snd_unit_pair_hash(const pair< pair< const Foo *, const Foo * >, string > &p)
FooMap m(5, fst_unit_pair_hash, snd_unit_pair_hash)
Open addressing hash table with double hashing.