47 #ifndef G4KDTREERESULT_HH
48 #define G4KDTREERESULT_HH
68 #define KDTR_parent std::vector<ResNode>
82 inline void *
operator new(size_t);
84 inline void *
operator new(
size_t sz,
void* p)
87 inline void operator delete(
void*);
113 template<
typename Po
intT>
116 template<
typename Po
intT>
122 #if defined G4EM_ALLOC_EXPORT
128 inline void * G4KDTreeResult::operator
new(size_t)
134 inline void G4KDTreeResult::operator
delete(
void * object)
139 template<
typename Po
intT>
146 template<
typename Po
intT>
150 return this->GetItem<PointT>();
153 #endif // G4KDTREERESULT_HH
G4KDTree is used by the ITManager to locate the neareast neighbours.
virtual ~G4KDTreeResult()
G4KDTreeResult(G4KDTree *)
KDTR_parent::iterator fIterator
double GetDistanceSqr() const
G4KDNode stores one entity in G4KDTree This class is for internal use only.
#define KDTR_parent
G4KDTreeResult enables to go through the nearest entities found by G4KDTree.
G4ReferenceCountedHandle< ResNode > ResNodeHandle
G4DLLIMPORT G4ThreadLocal G4Allocator< G4KDTreeResult > * aKDTreeAllocator
G4KDNode_Base * GetNode() const
void Insert(double, G4KDNode_Base *)
PointT * GetItemNDistanceSQ(double &) const
G4ReferenceCountedHandle< G4KDTreeResult > G4KDTreeResultHandle