Geant4  v4-10.4-release
 모두 클래스 네임스페이스들 파일들 함수 변수 타입정의 열거형 타입 열거형 멤버 Friends 매크로 그룹들 페이지들
G4KDTreeResult.cc
이 파일의 문서화 페이지로 가기
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 110873 2018-06-22 13:11:22Z 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 
41 {
43  return _instance;
44 }
45 
46 struct ResNode
47 {
48 public:
49  ResNode():fNode(0),fDistanceSqr(0){;}
50  ResNode(double distsqr, G4KDNode_Base* node):
51  fNode(node),fDistanceSqr(distsqr)
52  {;}
53 
55  {
56  fNode = right.fNode;
57  fDistanceSqr= right.fDistanceSqr;
58  }
59  ResNode& operator=(const ResNode& rhs)
60  {
61  if(this == &rhs) return *this;
62  fNode = rhs.fNode;
63  fDistanceSqr= rhs.fDistanceSqr;
64  return *this;
65  }
66  ~ResNode(){;}
67 
68  bool operator<(const ResNode& right) const
69  {
70  return (fDistanceSqr < right.fDistanceSqr);
71  }
72 
73  G4KDNode_Base* GetNode() { return fNode;}
74  double GetDistanceSqr() { return fDistanceSqr;}
75 
76 protected:
78  double fDistanceSqr;
79 };
80 
81 // comparison
83  const ResNode& right)
84 {
85  return left < right;
86 }
87 
89 //std::list<ResNode>()
91 {
92  fTree = tree;
93 }
94 
96 {
97  KDTR_parent::erase(begin(),end());
98  //std::list<ResNode>::erase(begin(),end());
99 }
100 
101 void G4KDTreeResult::Insert(double dis_sq, G4KDNode_Base* node)
102 {
103  //std::list<ResNode>::push_back(ResNode(dis_sq,node));
104  KDTR_parent::push_back(ResNode(dis_sq,node));
105 }
106 
108 {
109 // std::list<ResNode>::erase(begin(),end());
110 // fIterator = std::list<ResNode>::begin();
111  KDTR_parent::erase(begin(),end());
112  fIterator = KDTR_parent::begin();
113 }
114 
116 {
117  //std::list<ResNode>::sort(CompareResNode);
118  std::sort(begin(), end(), CompareResNode);
119 }
120 
122 {
123  //return std::list<ResNode>::size();
124  return KDTR_parent::size();
125 }
126 
127 size_t G4KDTreeResult::size() const
128 {
129  return KDTR_parent::size();
130  //return std::list<ResNode>::size();
131 }
132 
134 {
135  fIterator = begin();
136 }
137 
139 {
140  return (fIterator == end());
141 }
142 
144 {
145  ++fIterator;
146 }
147 
149 {
150  return (*fIterator).GetDistanceSqr();
151 }
152 
154  return (*fIterator).GetNode();
155 }
G4KDTree * fTree
size_t size() const
double GetDistanceSqr() const
void Insert(double, G4KDNode_Base *)
bool CompareResNode(const ResNode &left, const ResNode &right)
#define KDTR_parent
#define G4ThreadLocalStatic
Definition: tls.hh:68
ResNode(double distsqr, G4KDNode_Base *node)
G4DLLIMPORT G4Allocator< G4KDTreeResult > *& aKDTreeAllocator()
double fDistanceSqr
virtual ~G4KDTreeResult()
G4KDNode_Base * GetNode()
bool operator<(const ResNode &right) const
KDTR_parent::iterator fIterator
ResNode & operator=(const ResNode &rhs)
ResNode(const ResNode &right)
size_t GetSize() const
G4KDNode_Base * fNode
double GetDistanceSqr()
G4KDTreeResult(G4KDTree *)
G4KDNode_Base * GetNode() const