MimIR 0.1
MimIR is my Intermediate Representation
Loading...
Searching...
No Matches
Friends | List of all members
mim::Pool< T > Class Template Reference

Maintains PooledSets within a fe::Arena and unifies them in a absl::flat_hash_set. More...

#include <mim/util/pool.h>

Inheritance diagram for mim::Pool< T >:
[legend]

Public Member Functions

Construction & Destruction
Pool & operator= (const Pool &)=delete
 
 Pool ()=default
 
 Pool (const Pool &)=delete
 
 Pool (Pool &&other)
 
Set Operations
Note
These operations do not modify the input set(s); they create a new PooledSet.
PooledSet< T > create (T elem)
 Create a PooledSet wih a single element: $\{elem\}$.
 
template<class I >
PooledSet< T > create (I begin, I end)
 Create a PooledSet wih all elements in the given range.
 
PooledSet< T > merge (PooledSet< T > a, PooledSet< T > b)
 Yields $a \cup b$.
 
PooledSet< T > intersect (PooledSet< T > a, PooledSet< T > b)
 Yields $a \cap b$.
 
PooledSet< T > insert (PooledSet< T > a, const T &elem)
 Yields $a \cup \{elem\}$.
 
PooledSet< T > erase (PooledSet< T > a, const T &elem)
 Yields $a \setminus elem$.
 

Friends

void swap (Pool &p1, Pool &p2) noexcept
 

Detailed Description

template<class T>
class mim::Pool< T >

Maintains PooledSets within a fe::Arena and unifies them in a absl::flat_hash_set.

Definition at line 125 of file pool.h.

Constructor & Destructor Documentation

◆ Pool() [1/3]

template<class T >
mim::Pool< T >::Pool ( )
default

◆ Pool() [2/3]

template<class T >
mim::Pool< T >::Pool ( const Pool< T > & )
delete

◆ Pool() [3/3]

template<class T >
mim::Pool< T >::Pool ( Pool< T > && other)
inline

Definition at line 135 of file pool.h.

References mim::Pool< T >::swap.

Member Function Documentation

◆ create() [1/2]

template<class T >
template<class I >
PooledSet< T > mim::Pool< T >::create ( I begin,
I end )
inlinenodiscard

Create a PooledSet wih all elements in the given range.

Definition at line 153 of file pool.h.

◆ create() [2/2]

template<class T >
PooledSet< T > mim::Pool< T >::create ( T elem)
inlinenodiscard

Create a PooledSet wih a single element: $\{elem\}$.

Definition at line 146 of file pool.h.

Referenced by mim::Pool< T >::insert().

◆ erase()

template<class T >
PooledSet< T > mim::Pool< T >::erase ( PooledSet< T > a,
const T & elem )
inlinenodiscard

Yields $a \setminus elem$.

Definition at line 222 of file pool.h.

References mim::binary_find().

◆ insert()

template<class T >
PooledSet< T > mim::Pool< T >::insert ( PooledSet< T > a,
const T & elem )
inlinenodiscard

Yields $a \cup \{elem\}$.

Definition at line 219 of file pool.h.

References mim::Pool< T >::create(), and mim::Pool< T >::merge().

◆ intersect()

template<class T >
PooledSet< T > mim::Pool< T >::intersect ( PooledSet< T > a,
PooledSet< T > b )
inlinenodiscard

Yields $a \cap b$.

Definition at line 197 of file pool.h.

References mim::PooledSet< T >::begin(), mim::PooledSet< T >::end(), and mim::PooledSet< T >::size().

◆ merge()

template<class T >
PooledSet< T > mim::Pool< T >::merge ( PooledSet< T > a,
PooledSet< T > b )
inlinenodiscard

Yields $a \cup b$.

Definition at line 169 of file pool.h.

References mim::PooledSet< T >::begin(), mim::PooledSet< T >::end(), and mim::PooledSet< T >::size().

Referenced by mim::Pool< T >::insert().

◆ operator=()

template<class T >
Pool & mim::Pool< T >::operator= ( const Pool< T > & )
delete

Friends And Related Symbol Documentation

◆ swap

template<class T >
void swap ( Pool< T > & p1,
Pool< T > & p2 )
friend

Definition at line 236 of file pool.h.

Referenced by mim::Pool< T >::Pool().

The documentation for this class was generated from the following file: