cpp/GpHashtable.cpp

• View this file on GitHub
• Last update: 2024-08-04 10:51:43+00:00
• Link: http://codeforces.com/blog/entry/60737

Code

/**
 * Author: Igor Markelov
 * Date: 2022-11-05
 * Source: http://codeforces.com/blog/entry/60737
 * Description: Hash map with mostly the same API as unordered\_map, but
 * \tilde 3x faster. Uses 1.5x memory. Initial capacity must be a power of
 * 2 (if provided).
 */

#include <ext/pb_ds/assoc_container.hpp> /** keep-include */
#include <ext/pb_ds/tree_policy.hpp>     /** keep-include */
using namespace __gnu_pbds;

const int RANDOM =
    chrono::high_resolution_clock::now().time_since_epoch().count();
struct hasher {
    int operator()(int x) const { return x ^ RANDOM; }
};

gp_hash_table<int, int, hasher> table;

#line 1 "cpp/GpHashtable.cpp"
/**
 * Author: Igor Markelov
 * Date: 2022-11-05
 * Source: http://codeforces.com/blog/entry/60737
 * Description: Hash map with mostly the same API as unordered\_map, but
 * \tilde 3x faster. Uses 1.5x memory. Initial capacity must be a power of
 * 2 (if provided).
 */

#include <ext/pb_ds/assoc_container.hpp> /** keep-include */
#include <ext/pb_ds/tree_policy.hpp>     /** keep-include */
using namespace __gnu_pbds;

const int RANDOM =
    chrono::high_resolution_clock::now().time_since_epoch().count();
struct hasher {
    int operator()(int x) const { return x ^ RANDOM; }
};

gp_hash_table<int, int, hasher> table;

Back to top page