MimIR 0.1
MimIR is my Intermediate Representation
|
#include <algorithm>
#include <iterator>
#include <absl/container/flat_hash_set.h>
#include <fe/arena.h>
#include "mim/util/util.h"
Go to the source code of this file.
Classes | |
class | mim::PooledSet< T > |
Ordered set maintained in a consecutive buffer and unified in Pool. More... | |
struct | mim::PooledSet< T >::Data |
struct | mim::PooledSet< T >::Data::Equal |
class | mim::Pool< T > |
Maintains PooledSets within a fe::Arena and unifies them in a absl::flat_hash_set . More... | |
Namespaces | |
namespace | mim |
Variables | |
template<class T > | |
static constexpr size_t | mim::SizeOf = sizeof(std::conditional_t<std::is_pointer_v<T>, uintptr_t, T>) |