G4KDMap Class Reference

#include <G4KDMap.hh>

Public Member Functions
	G4KDMap (int dimensions)
void	Insert (G4KDNode *pos)
void	Sort ()
G4KDNode *	PopOutMiddle (int dimension)
int	GetDimension ()
size_t	GetSize ()

Detailed Description

Definition at line 73 of file G4KDMap.hh.

Constructor & Destructor Documentation

G4KDMap::G4KDMap ( int  dimensions )

inline

Definition at line 76 of file G4KDMap.hh.

                            : fSortOut(dimensions)
    {
        fIsSorted = false;
        for(int i = 0 ; i < dimensions ; i++)
        {
            fSortOut[i] = new __1DSortOut(i);
        }
    }

Member Function Documentation

int G4KDMap::GetDimension ( )

inline

Definition at line 89 of file G4KDMap.hh.

    {
        return fSortOut.size();
    }

size_t G4KDMap::GetSize ( )

inline

Definition at line 94 of file G4KDMap.hh.

Referenced by G4KDTree::Build().

    {
        return fMap.size();
    }

void G4KDMap::Insert

(

G4KDNode *

pos

)

Definition at line 73 of file G4KDMap.cc.

Referenced by G4KDTree::InsertMap().

{
    vector<_deq_iterator>& vit = fMap[pos];

    size_t maxSize = fSortOut.size();

    cout <<  maxSize << endl;
    cout <<  fSortOut.capacity() << endl;

    vit.reserve(maxSize);

    for (size_t i = 0; i < fSortOut.size(); ++i)
    {
        vit[i]=fSortOut[i]->Insert(pos);
    }

    fIsSorted = false;
}

G4KDNode * G4KDMap::PopOutMiddle

(

int

dimension

)

Definition at line 92 of file G4KDMap.cc.

References int(), and Sort().

Referenced by G4KDTree::Build().

{
    if(fIsSorted == false) Sort();
    G4KDNode* output_node = fSortOut[dimension]->PopOutMiddle();

    std::map<G4KDNode*, std::vector<_deq_iterator> >::iterator fMap_it
    = fMap.find(output_node);

    std::vector<_deq_iterator>&  vit = fMap_it->second;

    for(int i = 0 ; i < (int) fSortOut.size() ; i++)
    {
        if(i != dimension) fSortOut[i]->Erase(vit[i]);
    }

    fMap.erase(fMap_it);

    return output_node;
}

void G4KDMap::Sort

(

)

Definition at line 112 of file G4KDMap.cc.

Referenced by PopOutMiddle().

{
    for (size_t i = 0; i < fSortOut.size(); ++i)
    {
        fSortOut[i]->Sort();
    }

    fIsSorted = true;
}

---

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

• G4KDMap.hh
• G4KDMap.cc