#include <tree.hh>
Public Types | |
typedef F | CF |
Type of element (Real || Cmplx) | |
Public Member Functions | |
BiClNode00 (const concepts::Element< F > &elm, const cluster::BBall< F > &ball, BiClNode00< F > *lft) | |
BiClNode00 (uint idx, BiClNode00< F > &lft, BiClNode00< F > &rght, const concepts::Real3d &c, concepts::Real r, uint nleaf=0) | |
BiClNode00< F > * | child (uint j) const |
j-th child of the node | |
BiClNode00< F > * | lft () const |
Left child of the node. | |
BiClNode00< F > *& | lft () |
BiClNode00< F > * | rght () const |
Right child of the node. | |
const bem::Constant3d001< F > * | element () const |
Element of the node. | |
const concepts::Real3d & | center () const |
Cluster center. | |
uint | nleaf () const |
Number of leafs in the subtree of the node. | |
concepts::Real | radius () const |
Cluster radius. | |
uint | index () const |
Cluster number. | |
Friends | |
std::ostream & | operator<< (std::ostream &os, const BiClNode00< F > &nd) |
Output. | |
Binary node for the cluster and Haar wavelet agglomeration algorithm
typedef F aglowav::BiClNode00< F >::CF |
aglowav::BiClNode00< F >::BiClNode00 | ( | const concepts::Element< F > & | elm, |
const cluster::BBall< F > & | ball, | ||
BiClNode00< F > * | lft | ||
) |
Constructor 1 (for a list of leafs, next leaf = left child)
MissingFeature |
elm | Element |
ball | Bounding ball for a element |
chldlft | Left child (-> degenerate tree, list, only left child used) |
aglowav::BiClNode00< F >::BiClNode00 | ( | uint | idx, |
BiClNode00< F > & | lft, | ||
BiClNode00< F > & | rght, | ||
const concepts::Real3d & | c, | ||
concepts::Real | r, | ||
uint | nleaf = 0 |
||
) |
Constructor 2 (new node, no leaf)
idx | Node number |
chldlft | Left child |
chldrght | Right child |
c | Cluster center |
r | Cluster radius |
nleaf | Number of leafs |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
friend |