Loading...
Searching...
No Matches
indexedOctreeBase::node Class Reference

Tree node. Has up pointer and down pointers. More...

#include <indexedOctree.H>

Collaboration diagram for indexedOctreeBase::node:
Collaboration graph
[legend]

Public Attributes

treeBoundBox bb_
 Bounding box of this node.
label parent_ = -1
 Parent node (index into flat list addressing for tree).
FixedList< labelBits, 8 > subNodes_
 IDs of the 8 nodes on all sides of the mid point.

Static Public Attributes

static constexpr direction nChildren = 8
 Has exactly 8 sub-nodes (octants).

Friends

bool operator== (const node &a, const node &b)
bool operator!= (const node &a, const node &b)
Ostream & operator<< (Ostream &os, const node &n)
Istream & operator>> (Istream &is, node &n)

Detailed Description

Tree node. Has up pointer and down pointers.

Definition at line 76 of file indexedOctree.H.

◆ operator==

bool operator== ( const node & a,
const node & b )
friend

Definition at line 103 of file indexedOctree.H.

References b, bb_, parent_, and subNodes_.

◆ operator!=

bool operator!= ( const node & a,
const node & b )
friend

Definition at line 113 of file indexedOctree.H.

References b.

◆ operator<<

Ostream & operator<< ( Ostream & os,
const node & n )
friend

Definition at line 118 of file indexedOctree.H.

References n, os(), and token::SPACE.

◆ operator>>

Istream & operator>> ( Istream & is,
node & n )
friend

Definition at line 124 of file indexedOctree.H.

References n.

Member Data Documentation

◆ nChildren

direction nChildren = 8
staticconstexpr

Has exactly 8 sub-nodes (octants).

Definition at line 83 of file indexedOctree.H.

Referenced by dynamicIndexedOctree< Type >::insertIndex(), dynamicIndexedOctree< Type >::print(), and dynamicIndexedOctree< Type >::removeIndex().

◆ bb_

treeBoundBox bb_

Bounding box of this node.

Definition at line 88 of file indexedOctree.H.

Referenced by dynamicIndexedOctree< Foam::dynamicTreeDataPoint >::dynamicIndexedOctree(), dynamicIndexedOctree< Type >::findNearest(), indexedOctree< Type >::findNearest(), dynamicIndexedOctree< Type >::findNode(), indexedOctree< Type >::findNode(), operator==, dynamicIndexedOctree< Type >::print(), and indexedOctree< Type >::print().

◆ parent_

label parent_ = -1

Parent node (index into flat list addressing for tree).

Definition at line 93 of file indexedOctree.H.

Referenced by operator==, dynamicIndexedOctree< Type >::print(), and indexedOctree< Type >::print().

◆ subNodes_

FixedList<labelBits, 8> subNodes_

IDs of the 8 nodes on all sides of the mid point.

Definition at line 98 of file indexedOctree.H.

Referenced by dynamicIndexedOctree< Foam::dynamicTreeDataPoint >::dynamicIndexedOctree(), dynamicIndexedOctree< Type >::findIndices(), indexedOctree< Type >::findIndices(), dynamicIndexedOctree< Type >::findInside(), indexedOctree< Type >::findInside(), dynamicIndexedOctree< Type >::findNearest(), indexedOctree< Type >::findNearest(), dynamicIndexedOctree< Type >::findNode(), indexedOctree< Type >::findNode(), operator==, dynamicIndexedOctree< Type >::print(), and indexedOctree< Type >::print().

The documentation for this class was generated from the following file: