The ntree topology represents a binary, quad or octree stored/accessed using a hashtable. More...
Classes | |
struct | access |
See specialization_base::interface. More... | |
Static Public Member Functions | |
static void | make_tree (typename Policy::slot &ts) |
Build the local tree and share the tree boundaries. | |
static void | reset (typename Policy::slot &ts) |
Reset the ntree topology. | |
static void | share_ghosts (typename Policy::slot &ts) |
Search entities' neighbors and complete the hmap, create copy plans (or buffer) | |
Static Public Attributes | |
static const field< Color >::template definition< Policy, entities > | e_colors |
Entities color field. This represent which color owns an entity. | |
static const field< entity_data >::template definition< Policy, entities > | e_i |
Field containing the structure for entities interation from the specialization. | |
static const field< util::id >::definition< Policy, entities > | e_ids |
Entities ids field. | |
static const field< key_t >::template definition< Policy, entities > | e_keys |
Entities keys field. | |
static const field< node_data >::template definition< Policy, nodes > | n_i |
Field containing the structure for nodes interation from the specialization. | |
static const field< key_t >::template definition< Policy, nodes > | n_keys |
Node keys field. | |
Private Types | |
using | hcell_t |
Type store in the hastable. It can represent both node or entity. | |
using | hmap_t |
Hashing table type. | |
Additional Inherited Members | |
![]() | |
enum | index_space { } |
Index spaces used for the ntree topology. More... | |
using | index_spaces |
The specialization developer is required to use the index spaces provided by the N-Tree. | |
enum | ptype_t { exclusive , ghost , all } |
Parallel types for nodes and entities. More... | |
enum | ttype_t { preorder , postorder , reverse_preorder , reverse_postorder } |
Traversal types for DFS. More... | |
![]() | |
![]() | |
![]() |
The ntree topology represents a binary, quad or octree stored/accessed using a hashtable.
The creation of the N-Tree requires three steps, after filling the appropriate index spaces data:
Policy | the specialization, following ntree_specialization |
|
private |
Type store in the hastable. It can represent both node or entity.
|
private |
Hashing table type.
|
static |
Build the local tree and share the tree boundaries.
|
static |
Search entities' neighbors and complete the hmap, create copy plans (or buffer)
|
static |
Reset the ntree topology.
After this call the ntree can be re-build with make_tree and share_ghosts.
|
static |
Entities keys field.
Entities ids field.
This field can be used to identify entities with the same key.
|
static |
Entities color field. This represent which color owns an entity.
|
static |
Field containing the structure for entities interation from the specialization.
Node keys field.