#include <vector>#include <initializer_list>#include <algorithm>#include <iterator>#include <sstream>#include "typedefs.hpp"#include "assert.hpp"Go to the source code of this file.
Classes | |
| class | belfem::Cell< T > |
| Cell is a wrapper around the standard vector. More... | |
Namespaces | |
| namespace | belfem |
| USER GUIDES: | |
| namespace | belfem::cell |
Functions | |
| void | belfem::cell::error_out_of_bounds (const index_t aI, const index_t aN) |
| template<typename T> | |
| void | belfem::sort (Cell< T > &aCell) |
| template<typename T, class C> | |
| void | belfem::sort (Cell< T > &aCell, C &aComp, const size_t aNumberOfItems=0) |
| template<typename T> | |
| void | belfem::unique (Cell< T > &aCell) |
| template<typename T> | |
| index_t | belfem::find_index_in_unique_cell (const Cell< T > &aCell, const T &aMember) |
| returns the position of a member inside a cell. | |
| template<typename T> | |
| void | belfem::reverse (Cell< T > &aCell) |
| template<typename T> | |
| void | belfem::append (Cell< T > &aA, const Cell< T > &aB) |
| template<typename T> | |
| void | belfem::append_move (Cell< T > &aTarget, Cell< T > &aSource) |
| template<typename T> | |
| void | belfem::swap (Cell< T > &aA, Cell< T > &aB) noexcept |
| Swap specialization for Cell. | |