LoAdSG
|
#include <index.h>
Public Member Functions | |
IndexOneD | nextLeft () |
next left index on same level | |
IndexOneD | nextRight () |
next right index on same level | |
IndexOneD | nextLeft (int level) |
next left index on level \(\geq\) depth | |
IndexOneD | nextRight (int level) |
| |
bool | operator== (const IndexOneD I) const |
| |
Elementary base class for one dimensional data
Tree structure depth 0 --------------- 1 0 / / / / / / / / 10 1 / \ / \ 100 101 2 this means: left adds 0, right adds 1 / \ / \ 0 1 Indices (and coordinates) 0 --------------- 1 / / / / / / / / 2 (0.5) / \ / \ 4 5 (0.25) (0.75)
|
inline |
|
inline |
next left index on level \(\geq\) depth
Example: