Geant4  10.02.p01
G4KDTreeResult.cc
Go to the documentation of this file.
1 //
2 // ********************************************************************
3 // * License and Disclaimer *
4 // * *
5 // * The Geant4 software is copyright of the Copyright Holders of *
6 // * the Geant4 Collaboration. It is provided under the terms and *
7 // * conditions of the Geant4 Software License, included in the file *
8 // * LICENSE and available at http://cern.ch/geant4/license . These *
9 // * include a list of copyright holders. *
10 // * *
11 // * Neither the authors of this software system, nor their employing *
12 // * institutes,nor the agencies providing financial support for this *
13 // * work make any representation or warranty, express or implied, *
14 // * regarding this software system or assume any liability for its *
15 // * use. Please see the license in the file LICENSE and URL above *
16 // * for the full disclaimer and the limitation of liability. *
17 // * *
18 // * This code implementation is the result of the scientific and *
19 // * technical work of the GEANT4 collaboration. *
20 // * By using, copying, modifying or distributing the software (or *
21 // * any work based on the software) you agree to acknowledge its *
22 // * use in resulting scientific publications, and indicate your *
23 // * acceptance of all terms of the Geant4 Software license. *
24 // ********************************************************************
25 //
26 // $Id: G4KDTreeResult.cc 91584 2015-07-27 13:01:48Z gcosmo $
27 //
28 // Author: Mathieu Karamitros (kara (AT) cenbg . in2p3 . fr)
29 //
30 // History:
31 // -----------
32 // 10 Oct 2011 M.Karamitros created
33 //
34 // -------------------------------------------------------------------
35 
36 #include "G4KDTreeResult.hh"
37 
38 using namespace std;
39 
40 struct ResNode
41 {
42 public:
43  ResNode():fNode(0),fDistanceSqr(0){;}
44  ResNode(double distsqr, G4KDNode_Base* node):fNode(node),fDistanceSqr(distsqr){;}
46  {
47  fNode = right.fNode;
48  fDistanceSqr= right.fDistanceSqr;
49  }
50  ~ResNode(){;}
51 
52  bool operator<(const ResNode& right) const
53  {
54  return (fDistanceSqr < right.fDistanceSqr);
55  }
56 
57  G4KDNode_Base* GetNode() { return fNode;}
58  double GetDistanceSqr() { return fDistanceSqr;}
59 
60 protected:
62  double fDistanceSqr;
63 
64 private:
65  ResNode& operator=(const ResNode& rhs)
66  {
67  if(this == &rhs) return *this;
68  fNode = rhs.fNode;
69  fDistanceSqr= rhs.fDistanceSqr;
70  return *this;
71  }
72 };
73 
74 // comparison
75 bool CompareResNode(const ResNode& left, const ResNode& right)
76 {
77  return left < right;
78 }
79 
81 {
82  fTree = tree;
83 }
84 
86 {
87  std::list<ResNode>::erase(begin(),end());
88 }
89 
90 void G4KDTreeResult::Insert(double dis_sq, G4KDNode_Base* node)
91 {
92  std::list<ResNode>::push_back(ResNode(dis_sq,node));
93 }
94 
96 {
97  std::list<ResNode>::erase(begin(),end());
98  fIterator = std::list<ResNode>::begin();
99 }
100 
102 {
103  std::list<ResNode>::sort(CompareResNode);
104 }
105 
107 {
108  return std::list<ResNode>::size();
109 }
110 
111 size_t G4KDTreeResult::size() const
112 {
113  return std::list<ResNode>::size();
114 }
115 
117 {
118  fIterator = begin();
119 }
120 
122 {
123  return (fIterator == end());
124 }
125 
127 {
128  fIterator++;
129 }
130 
132 {
133  return (*fIterator).GetDistanceSqr();
134 }
135 
137  return (*fIterator).GetNode();
138 }
G4KDNode_Base * fNode
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.
Definition: G4KDTree.hh:72
virtual ~G4KDTreeResult()
G4KDTreeResult(G4KDTree *)
double fDistanceSqr
double GetDistanceSqr()
size_t GetSize() const
ResNode & operator=(const ResNode &rhs)
double GetDistanceSqr() const
G4KDNode_Base * GetNode()
std::list< ResNode >::iterator fIterator
G4KDNode_Base * GetNode() const
size_t size() const
void Insert(double, G4KDNode_Base *)
G4KDTree * fTree
ResNode(double distsqr, G4KDNode_Base *node)