maph 1.0.0 High-Performance Memory-Mapped Key-Value Database with O(1) Lookups

Loading...
Searching...
No Matches
Classes | Namespaces | Functions
maph_fast.hpp File Reference

Zero-mercy speed version - reuse perfect hash's hash. More...

`#include <sys/mman.h>`
`#include <fcntl.h>`
`#include <unistd.h>`
`#include <cstring>`
`#include <atomic>`
Include dependency graph for maph_fast.hpp:

Go to the source code of this file.

## Classes
struct | maph::FastSlot
struct | maph::PerfectHashWithHash< Key >
| Perfect hash that RETURNS BOTH hash and index This way we compute hash once and reuse it. More...
struct | maph::PerfectHashWithHash< Key >::Result
class | maph::FastMaph

## Namespaces
namespace | maph

## Functions
void | maph::benchmark_hash_reuse ()

## Detailed Description

Zero-mercy speed version - reuse perfect hash's hash.

Key insight: Perfect hash already computed hash(key), reuse it! No double hashing, no wasted cycles.

Definition in file maph_fast.hpp.

## Class Documentation

## ◆ maph::PerfectHashWithHash::Result

struct maph::PerfectHashWithHash::Result

template<typename Key>
struct maph::PerfectHashWithHash< Key >::Result

Definition at line 53 of file maph_fast.hpp.

Collaboration diagram for maph::PerfectHashWithHash< Key >::Result:

Class Members
uint32_t | hash |
uint32_t | index |