60 if(node ==
nullptr)
return;
75 fLeft(0), fRight(0), fParent(parent)
84 fLeft(0), fRight(0), fParent(0)
93 if (
this == &right)
return *
this;
129 if((*newNode)[aParent->
fAxis] > (*aParent)[aParent->
fAxis])
131 aParent->
fRight = newNode ;
136 aParent->
fLeft = newNode ;
137 newNode->
fSide = -1 ;
169 output.push_back(
this);
182 for (
int i=0; i<level; i++)
void Free(G4KDNode_Base *&)
void RetrieveNodeList(std::list< G4KDNode_Base * > &node_list)
G4KDNode_Base * Insert(PointT *point)
G4KDNode_Base * FindParent(const Position &x0)
G4KDNode_Base & operator=(const G4KDNode_Base &right)
void Print(std::ostream &out, int level=0) const
void NoticeNodeDeactivation()
G4KDNode_Base(G4KDTree *, G4KDNode_Base *)
virtual void InactiveNode()
void InactiveNode(G4KDNode_Base *)