|
faunus
|
Container based on a vector suitable for system with a uniform and high member density. More...
#include <celllistimpl.h>


Public Types | |
| using | ContainerType = AbstractContainer< TMember, TIndex > |
| using | Index = TIndex |
| the cell index (key) type | |
| using | Members = std::vector< Member > |
| the cell members type | |
Public Types inherited from Faunus::CellList::Container::AbstractContainer< TMember, TIndex > | |
| using | ContainerType = AbstractContainer< TMember, TIndex > |
| using | Index = TIndex |
| the cell index (key) type | |
| using | Member = TMember |
| the cell member (primitive value) type | |
| using | Members = std::vector< Member > |
| the cell members type | |
Public Member Functions | |
| const Members & | get (Index index) const override |
| Gets cell members at the given cell index. | |
| Members & | get (Index index) override |
| Gets cell members at the given cell index. | |
| const Members & | getEmpty () const override |
| Gets cell members of an empty cell. Allows non-existing cells. | |
| std::vector< Index > | indices () const override |
| Return all cell indices that may contain members. More... | |
| DenseContainer (std::size_t size) | |
Protected Member Functions | |
| Index | indexEnd () const |
Container based on a vector suitable for system with a uniform and high member density.
As all cells (even the empty ones) reside in memory, the vector has size of gridBase::size(). Very fast access at the expense of a bigger memory footprint, expecialy in sparse systems.
| TMember | member (value) |
| TIndex | index (key); corresponds do the CellIndex of GridType |
|
inlineoverridevirtual |
Return all cell indices that may contain members.
It is not guaranteed that all returned cells are non-empty though. However all non-empty cells are returned.
Implements Faunus::CellList::Container::AbstractContainer< TMember, TIndex >.
1.8.13