#include <vector>#include <iostream>#include <array>#include <queue>#include <cstring>#include <list>#include "hash.h"#include "io_helper.h"#include "disjointset.h"#include <set>

Go to the source code of this file.
Classes | |
| class | Othello< keyType > |
| Describes the data structure l-Othello. It classifies keys of keyType into 2^L classes. More... | |
Macros | |
| #define | MAX_REHASH 20 |
| Maximum number of rehash tries before report an error. If this limit is reached, Othello build fails. | |
| #define | LMASK ((L==64)?(~0ULL):((1ULL<<L)-1)) |
| #define | FILLCNTLEN (sizeof(uint32_t)*8) |
Functions | |
| double | getrate (uint32_t ma, uint32_t mb, uint32_t da, uint32_t db) |
Describes the data structure l-Othello...