souffle
2.0.2-371-g6315b36
|
#include "souffle/datastructure/LambdaBTree.h"
#include "souffle/datastructure/PiggyList.h"
#include <atomic>
#include <cstddef>
#include <cstdint>
#include <functional>
#include <utility>
Go to the source code of this file.
Data Structures | |
class | souffle::DisjointSet |
Structure that emulates a Disjoint Set, i.e. More... | |
struct | souffle::EqrelMapComparator< StorePair > |
class | souffle::SparseDisjointSet< SparseDomain > |
Namespaces | |
souffle | |
Macros | |
#define | likely(x) __builtin_expect((x), 1) |
#define | unlikely(x) __builtin_expect((x), 0) |
Typedefs | |
using | souffle::block_t = uint64_t |
using | souffle::parent_t = uint64_t |
using | souffle::rank_t = uint8_t |
Variables | |
constexpr block_t | souffle::rank_mask = (1ul << split_size) - 1 |
constexpr uint8_t | souffle::split_size = 8u |
#define likely | ( | x | ) | __builtin_expect((x), 1) |
Definition at line 37 of file UnionFind.h.
#define unlikely | ( | x | ) | __builtin_expect((x), 0) |
Definition at line 36 of file UnionFind.h.