38 return (*lhs)[fDimension] < (*rhs)[fDimension];
42 fSortOutNDim(dimension)
47 fContainer(right.fContainer), fSortOutNDim(right.fSortOutNDim)
59 main_middle = (size_t) ceil(contSize / 2.);
92 vector<_deq_iterator>& vit =
fMap[
pos];
100 for (
size_t i = 0; i <
fSortOut.size(); ++i)
140 G4cout <<
"G4KDMap::PopOutMiddle ( "<< dimension <<
" )" <<
G4endl;
145 if(output_node == 0)
return 0;
150 std::map<G4KDNode_Base*, std::vector<_deq_iterator> >::iterator fMap_it
151 =
fMap.find(output_node);
154 if(fMap_it ==
fMap.end())
161 std::vector<_deq_iterator>& vit = fMap_it->second;
172 for(
size_t i = 0; i <
fSortOut.size(); i++)
198 for (
size_t i = 0; i <
fSortOut.size(); ++i)
G4KDNode_Base * GetMidle(size_t &)
static const G4double pos
std::deque< G4KDNode_Base * >::iterator Insert(G4KDNode_Base *)
G4KDNode_Base * PopOutMiddle(size_t dimension)
G4KDNode_Base * PopOutMiddle()
void Erase(std::deque< G4KDNode_Base * >::iterator &)
std::map< G4KDNode_Base *, std::vector< std::deque< G4KDNode_Base * >::iterator > > fMap
std::deque< G4KDNode_Base * > fContainer
__1DSortOut(size_t dimension)
std::vector< __1DSortOut > fSortOut
G4GLOB_DLL std::ostream G4cout
void Insert(G4KDNode_Base *pos)
std::deque< G4KDNode_Base * >::iterator _deq_iterator
bool operator()(G4KDNode_Base *const &lhs, G4KDNode_Base *const &rhs)