A class that represents an R-tree node. More...
#include <Node.h>
Public Types | |
| typedef te::sam::rtree::Branch< Node, DATATYPE > | BranchType | 
Public Member Functions | |
| void | init () | 
| This method is used during split when a node retained and used again (beeing re-filled).  More... | |
| bool | isInternalNode () const | 
| It returns true if this is a internal node.  More... | |
| bool | isLeaf () const | 
| It returns true if this is a leaf node.  More... | |
| Node () | |
| Constructor.  More... | |
Public Attributes | |
| BranchType | m_branch [MAXNODES] | 
| Branches.  More... | |
| int | m_count | 
| The number of elements in the node (count).  More... | |
| int | m_level | 
| Leaf is zero, others positive.  More... | |
Private Member Functions | |
| Node (const Node &rhs) | |
| No copy constructor allowed.  More... | |
| Node & | operator= (const Node &rhs) | 
| No assignment operator allowed.  More... | |
A class that represents an R-tree node.
Level 0 indicates that this is a leaf node, other values indicate that it is an internal node.
| typedef te::sam::rtree::Branch<Node, DATATYPE> te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::BranchType | 
      
  | 
  inline | 
Constructor.
Definition at line 52 of file Node.h.
Referenced by te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::init().
      
  | 
  private | 
No copy constructor allowed.
| rhs | The other geometry. | 
      
  | 
  inline | 
This method is used during split when a node retained and used again (beeing re-filled).
Definition at line 78 of file Node.h.
References te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::m_branch, te::sam::rtree::Branch< NODE, DATATYPE >::m_child, te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::m_count, te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::m_level, te::sam::rtree::Branch< NODE, DATATYPE >::m_mbr, te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::Node(), and te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::operator=().
Referenced by te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::getBranches().
      
  | 
  inline | 
It returns true if this is a internal node.
Definition at line 62 of file Node.h.
References te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::m_level.
Referenced by te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::remove2(), and te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::search().
      
  | 
  inline | 
It returns true if this is a leaf node.
Definition at line 72 of file Node.h.
References te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::m_level.
Referenced by te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::erase().
      
  | 
  private | 
No assignment operator allowed.
| rhs | The other geometry. | 
Referenced by te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::init().
| BranchType te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::m_branch[MAXNODES] | 
Branches.
Definition at line 112 of file Node.h.
Referenced by te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::addBranch(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::chooseLeaf(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::disconBranch(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::erase(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::getBranches(), te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::init(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::nodeCover(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::pickBranch(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::remove(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::remove2(), and te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::search().
| int te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::m_count | 
The number of elements in the node (count).
Definition at line 110 of file Node.h.
Referenced by te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::addBranch(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::disconBranch(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::erase(), te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::init(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::isEmpty(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::nodeCover(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::pickBranch(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::remove(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::remove2(), and te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::search().
| int te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::m_level | 
Leaf is zero, others positive.
Definition at line 111 of file Node.h.
Referenced by te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::chooseLeaf(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::clear(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::Index(), te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::init(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::insert(), te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::isInternalNode(), te::sam::rtree::Node< DATATYPE, MAXNODES, MINNODES >::isLeaf(), te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::remove(), and te::sam::rtree::Index< DATATYPE, MAXNODES, MINNODES >::splitNode().