Evolving surface finite element method
v0.3.0-14-g3598512
Numerical experiments for my papers
|
Evolution via a hash map. More...
#include <grid_GridAndTime_impl.h>
Classes | |
struct | bad |
Reports errors. More... | |
Public Member Functions | |
grid ()=default | |
Empty map. | |
grid (const std::string &fname) | |
Read first list from file name. | |
grid (const Grid::Vec_FEfun &init_keys) | |
Get first list. More... | |
grid & | operator= (const Grid::Vec_FEfun &value_list) |
Get new list. | |
const range & | operator[] (const range &) const |
Checked access. More... | |
Private Types | |
using | map = std::unordered_map< key, range > |
Hash map type. | |
using | seq = std::vector< key > |
Sequence. | |
Private Attributes | |
map | m |
Map. | |
seq | ol |
Original list. | |
Static Private Attributes | |
static constexpr auto | dim = range::dimension |
Short alias for dimension. | |
Evolution via a hash map.
I use boost functions to combine hash values of doubles.
Definition at line 139 of file grid_GridAndTime_impl.h.
|
explicit |
Get first list.
Definition at line 268 of file grid_GridAndTime_impl.cpp.
auto grid::operator[] | ( | const range & | k | ) | const |
Checked access.
bad | as a nested object if the point does not exists |
Definition at line 299 of file grid_GridAndTime_impl.cpp.