#include <tree03.hh>


Public Types | |
| typedef Traits::F | F |
| Field (Real or Cmplx) | |
| typedef CNode | Node |
| Node type of the tree used for the interface of the far field matrices. | |
| typedef TreeTraits03< CNode > | Traits |
| Interface of the tree. | |
Public Member Functions | |
| virtual std::ostream & | info (std::ostream &os) const |
| uint | nclst () const |
| Number of clusters. | |
| uint | nleaf () const |
| Number of leafs. | |
| const CNode * | root () const |
| Root node of the tree. | |
| void | sketch (std::ostream &os, const CNode *lnk=0, uint l=0) |
| Sketch of a subtree. | |
| const concepts::Space< F > & | space () const |
| Space of the tree. | |
| Tree03 (const concepts::Space< F > &spc, const BBall< F > &ball, uint nlfmin=1) | |
| Constructor. | |
| ~Tree03 () | |
Private Member Functions | |
| CNode * | concat_ (CNode *a, CNode *b) |
| Concats two lists. | |
| CNode * | constructor_ (CNode *lfset, CebyCenter< CNode > &cby) |
| Constructor used for recursive calls. | |
| void | destructor_ (CNode *clst) |
| Destructor used for recursive calls. | |
Private Attributes | |
| uint | nclst_ |
| Number of clusters in the tree. | |
| uint | nlf_ |
| Number of leafs in the tree. | |
| uint | nlfmin_ |
| Minimal leafs contained in a cluster. | |
| CNode * | root_ |
| Root of the cluster tree. | |
Cluster tree.
The clusters are approximated by the Cebysev ball. The subdivision is done by cutting the ball by a plane perpendicular to the longest vector in between two extremal points.
| CNode | Node type of the cluster tree |
| typedef Traits::F cluster::Tree03< CNode >::F |
Field (Real or Cmplx)
Reimplemented from cluster::Tree< CNode >.
typedef CNode cluster::Tree< CNode >::Node [inherited] |
| typedef TreeTraits03<CNode> cluster::Tree03< CNode >::Traits |
Interface of the tree.
Reimplemented from cluster::Tree< CNode >.
| cluster::Tree03< CNode >::Tree03 | ( | const concepts::Space< F > & | spc, |
| const BBall< F > & | ball, | ||
| uint | nlfmin = 1 |
||
| ) |
Constructor.
| MissingFeature |
| spc | Space which elements should be clusterd |
| ball | Bounding ball for the elements of the space |
| nlfmin | Minimal leafs contained in a cluster |
| cluster::Tree03< CNode >::~Tree03 | ( | ) | [inline] |
| CNode* cluster::Tree03< CNode >::concat_ | ( | CNode * | a, |
| CNode * | b | ||
| ) | [private] |
Concats two lists.
| CNode* cluster::Tree03< CNode >::constructor_ | ( | CNode * | lfset, |
| CebyCenter< CNode > & | cby | ||
| ) | [private] |
Constructor used for recursive calls.
| MissingFeature |
| void cluster::Tree03< CNode >::destructor_ | ( | CNode * | clst | ) | [private] |
Destructor used for recursive calls.
| std::ostream & cluster::Tree< CNode >::info | ( | std::ostream & | os | ) | const [virtual, inherited] |
| uint cluster::Tree03< CNode >::nclst | ( | ) | const [inline, virtual] |
| uint cluster::Tree03< CNode >::nleaf | ( | ) | const [inline, virtual] |
| const CNode* cluster::Tree03< CNode >::root | ( | ) | const [inline, virtual] |
| void cluster::Tree03< CNode >::sketch | ( | std::ostream & | os, |
| const CNode * | lnk = 0, |
||
| uint | l = 0 |
||
| ) |
Sketch of a subtree.
| os | Output stream |
| lnk | Root of the subtree which is sketched |
| l | Level, number of blanks printed on the left side |
| const concepts::Space<F>& cluster::Tree< CNode >::space | ( | ) | const [inline, inherited] |
uint cluster::Tree03< CNode >::nclst_ [private] |
uint cluster::Tree03< CNode >::nlf_ [private] |
uint cluster::Tree03< CNode >::nlfmin_ [private] |
CNode* cluster::Tree03< CNode >::root_ [private] |