__1DSortOut Class Reference

#include <G4KDMap.hh>

Collaboration diagram for __1DSortOut:

Classes
struct	sortOutNDim

Public Member Functions
	__1DSortOut (size_t dimension)
	__1DSortOut (const __1DSortOut &right)
int	GetDimension ()
G4KDNode_Base *	GetMidle (int &)
std::deque< G4KDNode_Base * >::iterator	Insert (G4KDNode_Base *)
G4KDNode_Base *	PopOutMiddle ()
void	Sort ()
void	Erase (std::deque< G4KDNode_Base *>::iterator &)
size_t	Size ()

Protected Attributes
std::deque< G4KDNode_Base * >	fContainer
sortOutNDim	fSortOutNDim

Detailed Description

Definition at line 57 of file G4KDMap.hh.

Constructor & Destructor Documentation

__1DSortOut() [1/2]

__1DSortOut::__1DSortOut

(

size_t

dimension

)

Definition at line 41 of file G4KDMap.cc.

                                         :
    fSortOutNDim(dimension)
{
}

__1DSortOut() [2/2]

__1DSortOut::__1DSortOut

(

const __1DSortOut &

right

)

Definition at line 46 of file G4KDMap.cc.

                                                 :
    fContainer(right.fContainer), fSortOutNDim(right.fSortOutNDim)
{
}

Member Function Documentation

Erase()

void __1DSortOut::Erase

(

std::deque< G4KDNode_Base *>::iterator &

deq_pos

)

Definition at line 85 of file G4KDMap.cc.

{
  fContainer.erase(deq_pos);
}

GetDimension()

int __1DSortOut::GetDimension

(

)

Definition at line 51 of file G4KDMap.cc.

{
  return fSortOutNDim.fDimension;
}

GetMidle()

G4KDNode_Base * __1DSortOut::GetMidle

(

int &

main_middle

)

Definition at line 56 of file G4KDMap.cc.

{
  int contSize = fContainer.size();
  main_middle = (int) ceil(contSize / 2.); // ceil = round up
  return fContainer[main_middle];
}

Here is the caller graph for this function:

Insert()

_deq_iterator __1DSortOut::Insert

(

G4KDNode_Base *

pos

)

Definition at line 63 of file G4KDMap.cc.

{
  return fContainer.insert(fContainer.end(), pos);
}

Here is the caller graph for this function:

PopOutMiddle()

G4KDNode_Base * __1DSortOut::PopOutMiddle

(

)

Definition at line 68 of file G4KDMap.cc.

{
  int middle;
  G4KDNode_Base* pos = GetMidle(middle);
  _deq_iterator deq_pos = fContainer.begin() + middle;

  if(deq_pos == fContainer.end()) return 0; // this is a double check

  fContainer.erase(deq_pos);
  return pos;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Size()

size_t __1DSortOut::Size ( )

inline

Definition at line 69 of file G4KDMap.hh.

    {
      return fContainer.size();
    }

Sort()

void __1DSortOut::Sort

(

)

Definition at line 80 of file G4KDMap.cc.

{
  sort(fContainer.begin(), fContainer.end(), fSortOutNDim);
}

Here is the caller graph for this function:

Member Data Documentation

fContainer

std::deque<G4KDNode_Base*> __1DSortOut::fContainer

protected

Definition at line 85 of file G4KDMap.hh.

fSortOutNDim

sortOutNDim __1DSortOut::fSortOutNDim

protected

Definition at line 86 of file G4KDMap.hh.

---

The documentation for this class was generated from the following files:

• G4KDMap.hh
• G4KDMap.cc