67 if(
this == &rhs)
return *
this;
87 std::list<ResNode>::erase(begin(),end());
92 std::list<ResNode>::push_back(
ResNode(dis_sq,node));
97 std::list<ResNode>::erase(begin(),end());
108 return std::list<ResNode>::size();
113 return std::list<ResNode>::size();
133 return (*fIterator).GetDistanceSqr();
137 return (*fIterator).GetNode();
ResNode(const ResNode &right)
bool CompareResNode(const ResNode &left, const ResNode &right)
bool operator<(const ResNode &right) const
G4KDTree is used by the ITManager to locate the neareast neighbours.
virtual ~G4KDTreeResult()
G4KDTreeResult(G4KDTree *)
ResNode & operator=(const ResNode &rhs)
double GetDistanceSqr() const
G4KDNode_Base * GetNode()
std::list< ResNode >::iterator fIterator
G4KDNode_Base * GetNode() const
void Insert(double, G4KDNode_Base *)
ResNode(double distsqr, G4KDNode_Base *node)