G4KDNode_Base Class Reference

#include <G4KDNode.hh>

Inheritance diagram for G4KDNode_Base:

Collaboration diagram for G4KDNode_Base:

Public Member Functions
	G4KDNode_Base (G4KDTree *, G4KDNode_Base *)
virtual	~G4KDNode_Base ()
virtual double	operator[] (size_t) const =0
virtual void	InactiveNode ()
virtual bool	IsValid () const
G4KDTree *	GetTree () const
void	SetTree (G4KDTree *tree)
int	GetDim () const
int	GetAxis () const
G4KDNode_Base *	GetParent ()
G4KDNode_Base *	GetLeft ()
G4KDNode_Base *	GetRight ()
template<typename Position >
G4KDNode_Base *	FindParent (const Position &x0)
template<typename PointT >
G4KDNode_Base *	Insert (PointT *point)
template<typename PointT >
G4KDNode_Base *	Insert (const PointT &point)
int	Insert (G4KDNode_Base *newNode)
void	PullSubTree ()
void	RetrieveNodeList (std::list< G4KDNode_Base *> &node_list)
void	Print (std::ostream &out, int level=0) const

Protected Attributes
size_t	fAxis
int	fSide
G4KDTree *	fTree
G4KDNode_Base *	fLeft
G4KDNode_Base *	fRight
G4KDNode_Base *	fParent

Private Member Functions
	G4KDNode_Base (const G4KDNode_Base &right)
G4KDNode_Base &	operator= (const G4KDNode_Base &right)

Detailed Description

Definition at line 63 of file G4KDNode.hh.

Constructor & Destructor Documentation

G4KDNode_Base() [1/2]

G4KDNode_Base::G4KDNode_Base	(	G4KDTree *	tree,
		G4KDNode_Base *	parent
	)

Definition at line 72 of file G4KDNode.cc.

                              :
                            fTree(tree),
                            fLeft(0), fRight(0), fParent(parent)
{
    fSide = 0;
    fAxis = fParent == 0? 0 : fParent->fAxis +1 < fTree->fDim? fParent->fAxis+1:0;
}

~G4KDNode_Base()

G4KDNode_Base::~G4KDNode_Base ( )

virtual

Definition at line 103 of file G4KDNode.cc.

{
}

G4KDNode_Base() [2/2]

G4KDNode_Base::G4KDNode_Base ( const G4KDNode_Base &  right )

private

Definition at line 82 of file G4KDNode.cc.

                                                 :
                            fTree(0),
                            fLeft(0), fRight(0), fParent(0)
{
    fSide = 0;
    fAxis = 0;
}

Member Function Documentation

FindParent()

template<typename Position >

G4KDNode_Base* G4KDNode_Base::FindParent

(

const Position &

x0

)

Here is the caller graph for this function:

GetAxis()

int G4KDNode_Base::GetAxis ( ) const

inline

Definition at line 81 of file G4KDNode.hh.

{return fAxis;}

Here is the caller graph for this function:

GetDim()

int G4KDNode_Base::GetDim

(

)

const

Definition at line 112 of file G4KDNode.cc.

{
    if(fTree)
        return fTree->GetDim();
    else
        return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

GetLeft()

G4KDNode_Base* G4KDNode_Base::GetLeft ( )

inline

Definition at line 83 of file G4KDNode.hh.

{return fLeft;}

Here is the caller graph for this function:

GetParent()

G4KDNode_Base* G4KDNode_Base::GetParent ( )

inline

Definition at line 82 of file G4KDNode.hh.

{return fParent;}

GetRight()

G4KDNode_Base* G4KDNode_Base::GetRight ( )

inline

Definition at line 84 of file G4KDNode.hh.

{return fRight;}

Here is the call graph for this function:

Here is the caller graph for this function:

GetTree()

G4KDTree* G4KDNode_Base::GetTree ( ) const

inline

Definition at line 76 of file G4KDNode.hh.

{return fTree;}

InactiveNode()

void G4KDNode_Base::InactiveNode ( )

virtual

Reimplemented in G4KDNodeCopy< PointCopyT >, and G4KDNode< PointT >.

Definition at line 107 of file G4KDNode.cc.

{
    fTree->NoticeNodeDeactivation();
}

Here is the call graph for this function:

Here is the caller graph for this function:

Insert() [1/3]

template<typename PointT >

G4KDNode_Base* G4KDNode_Base::Insert

(

PointT *

point

)

Here is the caller graph for this function:

Insert() [2/3]

template<typename PointT >

G4KDNode_Base* G4KDNode_Base::Insert

(

const PointT &

point

)

Insert() [3/3]

int G4KDNode_Base::Insert

(

G4KDNode_Base *

newNode

)

Definition at line 120 of file G4KDNode.cc.

{
    G4KDNode_Base* aParent = FindParent(*newNode);
    // TODO check p == aParent->pos
    // Exception

    newNode->fAxis = aParent->fAxis +1 < fTree->GetDim()? aParent->fAxis+1:0;
    newNode->fParent = aParent ;

    if((*newNode)[aParent->fAxis] > (*aParent)[aParent->fAxis])
    {
        aParent->fRight = newNode ;
        newNode->fSide = 1 ;
    }
    else
    {
        aParent->fLeft = newNode ;
        newNode->fSide = -1 ;
    }

    newNode->fRight = 0;
    newNode->fLeft = 0;

    return 0 ;
}

Here is the call graph for this function:

IsValid()

virtual bool G4KDNode_Base::IsValid ( void  ) const

inlinevirtual

Reimplemented in G4KDNodeCopy< PointCopyT >, and G4KDNode< PointT >.

Definition at line 73 of file G4KDNode.hh.

{ return true; }

operator=()

G4KDNode_Base & G4KDNode_Base::operator= ( const G4KDNode_Base &  right )

private

Definition at line 91 of file G4KDNode.cc.

{
    if (this == &right) return *this;
    fTree = right.fTree;
    fLeft = right.fLeft;
    fRight = right.fRight;
    fParent = right.fParent;
    fSide = right.fSide;
    fAxis = right.fAxis;
    return *this;
}

operator[]()

virtual double G4KDNode_Base::operator[] ( size_t  ) const

pure virtual

Implemented in G4KDNodeCopy< PointCopyT >, and G4KDNode< PointT >.

Print()

void G4KDNode_Base::Print	(	std::ostream &	out,
		int	level = 0
	)		const

Definition at line 178 of file G4KDNode.cc.

{
    // Print node level
    out << G4endl;
    for (int i=0; i<level; i++)         // Indent to level
    {
        out << "  ";
    }
    out << level;

    // Print children
    if(fLeft)
    {
        fLeft->Print(out, level + 1);
    }
    if(fRight)
    {
        fRight->Print(out, level + 1);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

PullSubTree()

void G4KDNode_Base::PullSubTree

(

)

Definition at line 147 of file G4KDNode.cc.

{
    if(fParent)
    {
        if(fSide == -1)
        {
            fParent->fLeft = 0;
        }
        else
            fParent->fRight = 0;
    }
    if(fLeft) fLeft -> PullSubTree();
    if(fRight) fRight-> PullSubTree();

    fParent  = 0 ;
    fRight   = 0 ;
    fLeft    = 0 ;
    fTree    = 0 ;
}

Here is the caller graph for this function:

RetrieveNodeList()

void G4KDNode_Base::RetrieveNodeList

(

std::list< G4KDNode_Base *> &

node_list

)

Definition at line 167 of file G4KDNode.cc.

{
    output.push_back(this);

    if(fLeft)
        fLeft->RetrieveNodeList(output);

    if(fRight)
        fRight->RetrieveNodeList(output);
}

Here is the call graph for this function:

Here is the caller graph for this function:

SetTree()

void G4KDNode_Base::SetTree ( G4KDTree *  tree )

inline

Definition at line 77 of file G4KDNode.hh.

{fTree = tree;}

Here is the call graph for this function:

Member Data Documentation

fAxis

size_t G4KDNode_Base::fAxis

protected

Definition at line 108 of file G4KDNode.hh.

fLeft

G4KDNode_Base* G4KDNode_Base::fLeft

protected

Definition at line 116 of file G4KDNode.hh.

fParent

G4KDNode_Base * G4KDNode_Base::fParent

protected

Definition at line 116 of file G4KDNode.hh.

fRight

G4KDNode_Base * G4KDNode_Base::fRight

protected

Definition at line 116 of file G4KDNode.hh.

fSide

int G4KDNode_Base::fSide

protected

Definition at line 109 of file G4KDNode.hh.

fTree

G4KDTree* G4KDNode_Base::fTree

protected

Definition at line 115 of file G4KDNode.hh.

---

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

• G4KDNode.hh
• G4KDNode.cc