28 template <
typename T, std::
size_t N>
32 typedef typename std::array<T, N>::iterator
iterator;
59 mooseError(
"Out of space in StaticallyAllocatedSet (size = ",
N,
")");
95 for (std::size_t i = 0; i <
_end_pos; i++)
iterator end()
Iterator for the last entry.
std::array< T, N >::const_iterator const_iterator
void swap(StaticallyAllocatedSet< T, N > &other)
Swap the contents of this set with another.
Optimized set with static allocation.
void mooseError(Args &&... args)
Emit an error message with the given stringified, concatenated args and terminate the application...
void swap(std::vector< T > &data, const std::size_t idx0, const std::size_t idx1, const libMesh::Parallel::Communicator &comm)
Swap function for serial or distributed vector of data.
iterator begin()
Iterator for the first entry.
const_iterator end() const
Const iterator for the last entry.
std::array< T, N > _data
The data.
std::size_t _end_pos
Save the ending as positions internally.
Real value(unsigned n, unsigned alpha, unsigned beta, Real x)
StaticallyAllocatedSet()
Create a set.
std::size_t size() const
Number of entries.
bool contains(const T &value) const
Whether or not the set contains the given item.
void clear()
Remove all entries.
bool empty() const
Whether or not the set is empty.
std::array< T, N >::iterator iterator
std::size_t dataEndPos() const
Expert interface: the current ending position.
void insert(const T &value)
Add a new entry to the set.
const_iterator begin() const
Const iterator for the first entry.