MimIR 0.1
MimIR is my Intermediate Representation
|
Ordered set maintained in a consecutive buffer and unified in Pool. More...
#include <mim/util/pool.h>
Classes | |
struct | Data |
Public Member Functions | |
Getters | |
constexpr | operator bool () const noexcept |
Is not empty? | |
constexpr bool | empty () const noexcept |
constexpr size_t | size () const noexcept |
constexpr const T & | operator[] (size_t i) const |
constexpr const T & | front () const |
constexpr const T * | elems () const |
constexpr bool | contains (const T &elem) const |
Comparisons | |
constexpr bool | operator== (PooledSet< T > other) const noexcept |
constexpr bool | operator!= (PooledSet< T > other) const noexcept |
Iterators | |
constexpr auto | begin () const noexcept |
constexpr auto | end () const noexcept |
constexpr auto | cbegin () const noexcept |
constexpr auto | cend () const noexcept |
constexpr auto | rbegin () const noexcept |
constexpr auto | rend () const noexcept |
constexpr auto | crbegin () const noexcept |
constexpr auto | crend () const noexcept |
Friends | |
class | Pool< T > |
template<class H > | |
H | AbslHashValue (H h, PooledSet< T > set) |
Construction & Destruction | |
constexpr | PooledSet () noexcept=default |
constexpr | PooledSet (const PooledSet &) noexcept=default |
constexpr PooledSet & | operator= (const PooledSet &) noexcept=default |
constexpr void | clear () noexcept |
Ordered set maintained in a consecutive buffer and unified in Pool.
|
constexprdefaultnoexcept |
|
constexprdefaultnoexcept |
|
inlineconstexprnoexcept |
Definition at line 77 of file pool.h.
References mim::PooledSet< T >::elems().
Referenced by mim::PooledSet< T >::contains(), mim::Pool< T >::erase(), mim::Pool< T >::has_intersection(), mim::Pool< T >::merge(), and mim::PooledSet< T >::rend().
|
inlineconstexprnoexcept |
Definition at line 79 of file pool.h.
References mim::PooledSet< T >::elems().
|
inlineconstexprnoexcept |
Definition at line 80 of file pool.h.
References mim::PooledSet< T >::end().
|
inlineconstexprnoexcept |
|
inlineconstexpr |
Definition at line 66 of file pool.h.
References mim::PooledSet< T >::begin(), mim::binary_find(), and mim::PooledSet< T >::end().
Referenced by mim::Arr::immutabilize(), mim::Pack::immutabilize(), mim::Pi::immutabilize(), and mim::Sigma::immutabilize().
|
inlineconstexprnoexcept |
Definition at line 83 of file pool.h.
References mim::PooledSet< T >::rbegin().
|
inlineconstexprnoexcept |
Definition at line 84 of file pool.h.
References mim::PooledSet< T >::rend().
|
inlineconstexpr |
Definition at line 65 of file pool.h.
References mim::PooledSet< T >::Data::elems.
Referenced by mim::PooledSet< T >::begin(), mim::PooledSet< T >::cbegin(), and mim::PooledSet< T >::end().
|
inlineconstexprnoexcept |
Definition at line 61 of file pool.h.
Referenced by mim::Def::is_closed(), mim::Def::is_open(), mim::VarRewriter::rewrite_imm(), and mim::PooledSet< T >::size().
|
inlineconstexprnoexcept |
Definition at line 78 of file pool.h.
References mim::PooledSet< T >::elems(), and mim::PooledSet< T >::size().
Referenced by mim::PooledSet< T >::cend(), mim::PooledSet< T >::contains(), mim::Pool< T >::erase(), mim::Pool< T >::has_intersection(), mim::Pool< T >::merge(), and mim::PooledSet< T >::rbegin().
|
inlineconstexpr |
|
inlineexplicitconstexprnoexcept |
|
inlineconstexprnoexcept |
|
constexprdefaultnoexcept |
|
inlineconstexprnoexcept |
|
inlineconstexpr |
Definition at line 63 of file pool.h.
References mim::PooledSet< T >::Data::elems.
|
inlineconstexprnoexcept |
Definition at line 81 of file pool.h.
References mim::PooledSet< T >::end().
Referenced by mim::PooledSet< T >::crbegin().
|
inlineconstexprnoexcept |
Definition at line 82 of file pool.h.
References mim::PooledSet< T >::begin().
Referenced by mim::PooledSet< T >::crend().
|
inlineconstexprnoexcept |
Definition at line 62 of file pool.h.
References mim::PooledSet< T >::empty(), and mim::PooledSet< T >::Data::size.
Referenced by mim::PooledSet< T >::end(), mim::Pool< T >::erase(), and mim::Pool< T >::merge().