|
FE 0.17.1
Fast, Effecient FrontEnds
|
#include <concepts>#include <cstddef>#include <functional>#include <stdexcept>#include <type_traits>#include <utility>#include <ankerl/unordered_dense.h>Go to the source code of this file.
Classes | |
| class | fe::BiMap< L, R, LHash, LEq, RHash, REq > |
A bijection between L and R, kept as one ankerl::unordered_dense::map per direction. More... | |
| class | fe::BiNodeMap< L, R, LHash, LEq, RHash, REq > |
A bijection between L and R that stores every pair once, in an ankerl::unordered_dense::segmented_map. More... | |
Namespaces | |
| namespace | fe |