MimIR 0.1
MimIR is my Intermediate Representation
|
Go to the source code of this file.
Classes | |
class | mim::Vector< T, N, A > |
This is a thin wrapper for absl::InlinedVector<T, N, A> which is a drop-in replacement for std::vector<T, A> . More... | |
Namespaces | |
namespace | mim |
Functions | |
Deduction Guides | |
template<class I, class A = std::allocator<typename std::iterator_traits<I>::value_type>> | |
mim::Vector (I, I, A=A()) -> Vector< typename std::iterator_traits< I >::value_type, Default_Inlined_Size< typename std::iterator_traits< I >::value_type >, A > | |
erase | |
template<class T, size_t N, class A, class U> | |
Vector< T, N, A >::size_type | mim::erase (Vector< T, N, A > &c, const U &value) noexcept |
template<class T, size_t N, class A, class Pred> | |
Vector< T, N, A >::size_type | mim::erase_if (Vector< T, N, A > &c, Pred pred) noexcept |
Variables | |
template<class T> | |
static constexpr size_t | mim::Default_Inlined_Size = std::max((size_t)1, 4 * sizeof(size_t) / sizeof(T)) |
Use up to 4 words (i.e., 4 * sizeof(size_t)) of inlined storage, rounded up. | |