Describe a Quad tree. More...

#include <PNTreeLightNode.h>

Public Member Functions
bool	addElement (T posData, U data, const T pos[N], const T size[N], const T sizeLimit)
	Add an element in the PNTreeLightNode.

void	clear ()
	Clear the PNTreeLightNode content.

PNTreeLightNode< T, U, N > *	getChild (unsigned char childId)
	Returns the child of the PNTreeLightNode.

const PNTreeLightNode< T, U, N > *	getChild (unsigned char childId) const
	Returns the child of the PNTreeLightNode.

PNTreeLightNode< T, U, N > *	getChildFromPos (T childPos[N], const T *posData, const T pos[N], const T size[N])
	Get the child of the PNTreeLightNode with a position.

const PNTreeLightNode< T, U, N > *	getChildFromPos (T childPos[N], const T *posData, const T pos[N], const T size[N]) const
	Get the child of the PNTreeLightNode with a position.

bool	getCloserData (U &closerData, T &distFromCloserData, bool tabIsNeighbourChecked, unsigned int nbNeighbour, const T *posData, const T pos[N], const T size[N]) const
	Get the closer data from the given position posData.

U *	getData ()

const U *	getData () const

T *	getDataPos ()
	Returns the data position.

const T *	getDataPos () const
	Returns the data position.

unsigned char	getFullIndexChild (unsigned char index[N]) const
	Get the full index position of a child.

void	getIndexOfChildFromPos (unsigned char index[N], const T posData[N], const T pos[N], const T size[N]) const

void	getIndexOfChildFromPos (unsigned char index[N], T posData[N], T pos[N], T size[N])

const U *	getLastData (const T *posData, const T pos[N], const T size[N]) const
	Get the data of the last node in the N tree.

PNTreeLightNode< T, U, N > *	getTabChildren ()
	Returns the table of children of the PNTreeLightNode.

const PNTreeLightNode< T, U, N > *	getTabChildren () const
	Returns the table of children of the PNTreeLightNode.

	PNTreeLightNode ()
	Default constructor of PNTreeLightNode.

bool	saveGnuplotData (const std::string &fileName, T pos[N], T size[N])
	Saves the PNTreeLightNode into a txt file for gnuplot.

bool	saveGnuplotData (std::ofstream &fs, T height, T pos[N], T size[N])
	Saves the PNTreeLightNode into a txt file for gnuplot.

virtual	~PNTreeLightNode ()
	Destructeur of PNTreeLightNode.

Protected Member Functions
void	copyPNTreeLightNode (const PNTreeLightNode< T, U, N > &other)
	Copy function of PNTreeLightNode.

Private Member Functions
void	initialisationPNTreeLightNode ()
	Initialisation function of the class PNTreeLightNode.

	PNTreeLightNode (const PNTreeLightNode< T, U, N > &other)
	Copy constructor of PNTreeLightNode.

bool	split (const T pos[N], const T size[N], T sizeLimit)
	Split the PNTreeLightNode.

Private Attributes
U *	p_data
	Data of the node.

T *	p_posData
	Position of the data in the cell.

PNTreeLightNode< T, U, N > *	p_tableChildren
	Position of the data in the hyper cube.

Detailed Description

template<typename T, typename U, unsigned char N>
class PNTreeLightNode< T, U, N >

Describe a Quad tree.

T : Type of the positions U : type of the data pointors to be stored N : number of dimensions of the N Tree

Definition at line 22 of file PNTreeLightNode.h.

Constructor & Destructor Documentation

◆ PNTreeLightNode() [1/2]

template<typename T, typename U, unsigned char N>

PNTreeLightNode< T, U, N >::PNTreeLightNode ( )

Default constructor of PNTreeLightNode.

Definition at line 19 of file PNTreeLightNode_impl.h.

                                         {
        initialisationPNTreeLightNode();
}

References initialisationPNTreeLightNode().

Referenced by addElement(), clear(), copyPNTreeLightNode(), getChild(), getChild(), getChildFromPos(), getChildFromPos(), getCloserData(), getData(), getIndexOfChildFromPos(), getLastData(), getTabChildren(), getTabChildren(), PNTreeLightNode(), and split().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ ~PNTreeLightNode()

template<typename T, typename U, unsigned char N>

PNTreeLightNode< T, U, N >::~PNTreeLightNode ( )

virtual

Destructeur of PNTreeLightNode.

Definition at line 33 of file PNTreeLightNode_impl.h.

                                          {
        clear();
}

References clear().

Here is the call graph for this function:

◆ PNTreeLightNode() [2/2]

template<typename T, typename U, unsigned char N>

PNTreeLightNode< T, U, N >::PNTreeLightNode ( const PNTreeLightNode< T, U, N > & other )

private

Copy constructor of PNTreeLightNode.

Parameters

other : class to copy

Definition at line 27 of file PNTreeLightNode_impl.h.

                                                                               {
        copyPNTreeLightNode(other);
}

References copyPNTreeLightNode(), and PNTreeLightNode().

Here is the call graph for this function:

Member Function Documentation

◆ addElement()

template<typename T, typename U, unsigned char N>

bool PNTreeLightNode< T, U, N >::addElement	(	T *	posData,
		U *	data,
		const T	pos[N],
		const T	size[N],
		const T	sizeLimit )

Add an element in the PNTreeLightNode.

Parameters

posData	: position of the data
data	: pointer to the data we want to sort
pos	: position of the current node
size	: size of the current node
sizeLimit	: limit of the cell size

Returns: true on success, false otherwise

Definition at line 70 of file PNTreeLightNode_impl.h.

                                                                                                            {
        if(!checkSizeLimitLight<T, N>(size, sizeLimit)){
                return false;
        }
        if(p_tableChildren == NULL){
                if(p_data == NULL){                   //The cell is empty
                        p_data = data;
                        p_posData = posData;
                        return true;
                }else{                                  //There is a data in the cell
                        if(!split(pos, size, sizeLimit)) return false;
                        return addElement(posData, data, pos, size, sizeLimit);
                }
        }else{                                          //There are children
                T childPos[N];
                PNTreeLightNode<T, U, N> * child = getChildFromPos(childPos, posData, pos, size);
                if(child == NULL){
                        return false;
                }else{
                        T childSize[N];
                        makeHalfSize<T,N>(childSize, size);
                        return child->addElement(posData, data, childPos, childSize, sizeLimit);
                }
        }
}

References addElement(), checkSizeLimitLight(), getChildFromPos(), makeHalfSize(), p_data, p_posData, p_tableChildren, PNTreeLightNode(), and split().

Referenced by addElement(), and split().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ clear()

template<typename T, typename U, unsigned char N>

void PNTreeLightNode< T, U, N >::clear ( )

Clear the PNTreeLightNode content.

Definition at line 176 of file PNTreeLightNode_impl.h.

                                    {
        if(p_tableChildren != NULL){
                for(unsigned char i(0); i < PPower<2, N>::Value; ++i){
                        PNTreeLightNode<T, U, N> * child = &(p_tableChildren[i]);
                        child->clear();
                }
                delete [] p_tableChildren;
                p_tableChildren = NULL;
        }
        p_data = NULL;
}

References clear(), p_data, p_tableChildren, and PNTreeLightNode().

Referenced by clear(), and ~PNTreeLightNode().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ copyPNTreeLightNode()

template<typename T, typename U, unsigned char N>

void PNTreeLightNode< T, U, N >::copyPNTreeLightNode ( const PNTreeLightNode< T, U, N > & other )

protected

Copy function of PNTreeLightNode.

Parameters

other : class to copy

Definition at line 453 of file PNTreeLightNode_impl.h.

                                                                                        {
        
}

References PNTreeLightNode().

Referenced by PNTreeLightNode().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ getChild() [1/2]

template<typename T, typename U, unsigned char N>

PNTreeLightNode< T, U, N > * PNTreeLightNode< T, U, N >::getChild ( unsigned char childId )

Returns the child of the PNTreeLightNode.

Parameters

childId : id of the child we want to have

Returns: pointer to the child or NULL if there is not

Definition at line 444 of file PNTreeLightNode_impl.h.

                                                                                  {
        if(p_tableChildren == NULL || childId >= PPower<2, N>::Value) return NULL;
        return &(p_tableChildren[childId]);
}

References p_tableChildren, PNTreeLightNode(), and PPower< V, N >::Value.

Here is the call graph for this function:

◆ getChild() [2/2]

template<typename T, typename U, unsigned char N>

const PNTreeLightNode< T, U, N > * PNTreeLightNode< T, U, N >::getChild ( unsigned char childId ) const

Returns the child of the PNTreeLightNode.

Parameters

childId : id of the child we want to have

Returns: pointer to the child or NULL if there is not

Definition at line 434 of file PNTreeLightNode_impl.h.

                                                                                              {
        if(p_tableChildren == NULL || childId >= PPower<2, N>::Value) return NULL;
        return &(p_tableChildren[childId]);
}

References p_tableChildren, PNTreeLightNode(), and PPower< V, N >::Value.

Here is the call graph for this function:

◆ getChildFromPos() [1/2]

template<typename T, typename U, unsigned char N>

PNTreeLightNode< T, U, N > * PNTreeLightNode< T, U, N >::getChildFromPos	(	T	childPos[N],
		const T *	posData,
		const T	pos[N],
		const T	size[N] )

Get the child of the PNTreeLightNode with a position.

Parameters

[out]	childPos	: position of the child
	posData	: position of the data
	pos	: position of the current node
	size	: size of the current node

Returns: child of the current PNTreeLightNode which contains the position (pos)

Definition at line 346 of file PNTreeLightNode_impl.h.

                                                                                                                                     {
        if(p_tableChildren == NULL) return NULL;
        unsigned char  posChild(0), base(1);
        bool cond;
        for(unsigned char j(0); j < N; ++j){
                cond = ((posData[j] - pos[j]) > size[j]*0.5);
                childPos[j] = pos[j] + cond*size[j]*0.5;
                posChild += cond*base;
                base *= 2;          //on poura faire du décalage de bit plus tard
        }
        if(posChild >= PPower<2, N>::Value) return NULL;
        else{
//              std::cerr << "PNTreeLightNode<T, U, N>::getChildFromPos : posChild = " << ((int)posChild) << std::endl;
                return &(p_tableChildren[posChild]);
        }
}

References p_tableChildren, PNTreeLightNode(), and PPower< V, N >::Value.

Here is the call graph for this function:

◆ getChildFromPos() [2/2]

template<typename T, typename U, unsigned char N>

const PNTreeLightNode< T, U, N > * PNTreeLightNode< T, U, N >::getChildFromPos	(	T	childPos[N],
		const T *	posData,
		const T	pos[N],
		const T	size[N] ) const

Get the child of the PNTreeLightNode with a position.

Parameters

[out]	childPos	: position of the child
	posData	: position of the data
	pos	: position of the current node
	size	: size of the current node

Returns: child of the current PNTreeLightNode which contains the position (pos)

Definition at line 324 of file PNTreeLightNode_impl.h.

                                                                                                                                                 {
        if(p_tableChildren == NULL) return NULL;
        unsigned char  posChild(0), base(1);
        bool cond;
        for(unsigned char j(0); j < N; ++j){
                cond = ((posData[j] - pos[j]) > size[j]*0.5);
                childPos[j] = pos[j] + cond*size[j]*0.5;
                posChild += cond*base;
                base *= 2;          //on poura faire du décalage de bit plus tard
        }
        if(posChild >= PPower<2, N>::Value) return NULL;
        else return &(p_tableChildren[posChild]);
}

References p_tableChildren, PNTreeLightNode(), and PPower< V, N >::Value.

Referenced by addElement(), getCloserData(), getLastData(), and split().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ getCloserData()

template<typename T, typename U, unsigned char N>

bool PNTreeLightNode< T, U, N >::getCloserData	(	U *&	closerData,
		T &	distFromCloserData,
		bool *	tabIsNeighbourChecked,
		unsigned int	nbNeighbour,
		const T *	posData,
		const T	pos[N],
		const T	size[N] ) const

Get the closer data from the given position posData.

Parameters

[out]	closerData	: pointer to the closer data found
[out]	distFromCloserData	: distance from the closer data to the search position posData
[out]	tabIsNeighbourChecked	: table of the checked neighbours (true), or unchecked neighbours (false)
	nbNeighbour	: size of the table of neighbours
	posData	: position used to search the closer data
	pos	: position of the current node
	size	: size of the current node

Returns: true if the closer data has been found, false if the parent needs to keep searching

Definition at line 258 of file PNTreeLightNode_impl.h.

{
        if(p_tableChildren == NULL){                 //If the node has no child
                if(p_data == NULL) return false;              //If the node has no data
                else{                                           //If the node has data
                        if(closerData == NULL){
                                closerData = p_data;
                                distFromCloserData = getDistanceFromData<T,N>(p_posData, posData);
                                return true;
                        }else{
                                T dist = getDistanceFromData<T,N>(p_posData, posData);
                                if(dist < distFromCloserData){
                                        distFromCloserData = dist;
                                        closerData = p_data;
                                }
                                return false;
                        }
                }
        }else{                                          //If the node has children
                T childPos[N];
                const PNTreeLightNode<T, U, N> * child = getChildFromPos(childPos, posData, pos, size);
                if(child == NULL) return false;
                else{
                        T childSize[N];
                        makeHalfSize<T,N>(childSize, size);
                        bool b = child->getCloserData(closerData, distFromCloserData, tabIsNeighbourChecked, nbNeighbour, posData, childPos, childSize);
                        if(b) return true;
                        else{
                                unsigned char indexChild[N], currentChildIndex[N];
                                T currentChildPos[N];
                                getIndexOfChildFromPos(indexChild, posData, pos, size);
                                unsigned char fullIndexChild(getFullIndexChild(indexChild));
                                
                                for(unsigned char i(0); i < PPower<2, N>::Value; ++i){
                                        if(i == fullIndexChild) continue;
                                        for(unsigned char j(0); j < N; ++j){
                                                currentChildIndex[j] = (i >> j) & 1;
                                                currentChildPos[j] = pos[j] + ((T)currentChildIndex[j])*childSize[j];
                                        }
                                        unsigned int indexCurrentNeighbour(getNeighbourCellIndex<N>(indexChild, currentChildIndex));
                                        //If the neighbours is already checked, skip it
                                        if(tabIsNeighbourChecked[indexCurrentNeighbour]) continue;
                                        //If the neighbours is not check yet, check it and write it in the tabIsNeighbourChecked
                                        tabIsNeighbourChecked[indexCurrentNeighbour] = true;
                                        if(child->getCloserData(closerData, distFromCloserData, tabIsNeighbourChecked, nbNeighbour,
                                                posData, currentChildPos, childSize))
                                        {
                                                return true;
                                        }
                                }
                                if(isNeighbourSearchFinised(tabIsNeighbourChecked, nbNeighbour)) return true;
                                return false;
                        }
                }
        }
}

References getChildFromPos(), getCloserData(), getDistanceFromData(), getFullIndexChild(), getIndexOfChildFromPos(), getNeighbourCellIndex(), isNeighbourSearchFinised(), makeHalfSize(), p_data, p_posData, p_tableChildren, and PNTreeLightNode().

Referenced by getCloserData().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ getData() [1/2]

template<typename T, typename U, unsigned char N>

U * PNTreeLightNode< T, U, N >::getData ( )

References PNTreeLightNode().

Here is the call graph for this function:

◆ getData() [2/2]

template<typename T, typename U, unsigned char N>

const U * PNTreeLightNode< T, U, N >::getData ( ) const

◆ getDataPos() [1/2]

template<typename T, typename U, unsigned char N>

T * PNTreeLightNode< T, U, N >::getDataPos ( )

Returns the data position.

Returns: data position

Definition at line 415 of file PNTreeLightNode_impl.h.

415{return p_posData;}

References p_posData.

◆ getDataPos() [2/2]

template<typename T, typename U, unsigned char N>

const T * PNTreeLightNode< T, U, N >::getDataPos ( ) const

Returns the data position.

Returns: data position

Definition at line 409 of file PNTreeLightNode_impl.h.

409{return p_posData;}

References p_posData.

◆ getFullIndexChild()

template<typename T, typename U, unsigned char N>

unsigned char PNTreeLightNode< T, U, N >::getFullIndexChild ( unsigned char index[N] ) const

Get the full index position of a child.

Parameters

index : vector of index position of a child

Returns: full index position of a child

Definition at line 396 of file PNTreeLightNode_impl.h.

                                                                                     {
        unsigned char  posChild(0), base(1);
        for(unsigned char j(0); j < N; ++j){
                posChild += (index[j])*base;
                base *= 2;          //on poura faire du décalage de bit plus tard
        }
        return posChild;
}

Referenced by getCloserData().

Here is the caller graph for this function:

◆ getIndexOfChildFromPos() [1/2]

template<typename T, typename U, unsigned char N>

void PNTreeLightNode< T, U, N >::getIndexOfChildFromPos	(	unsigned char	index[N],
		const T	posData[N],
		const T	pos[N],
		const T	size[N] ) const

Referenced by getCloserData().

Here is the caller graph for this function:

◆ getIndexOfChildFromPos() [2/2]

template<typename T, typename U, unsigned char N>

void PNTreeLightNode< T, U, N >::getIndexOfChildFromPos	(	unsigned char	index[N],
		T	posData[N],
		T	pos[N],
		T	size[N] )

References PNTreeLightNode().

Here is the call graph for this function:

◆ getLastData()

template<typename T, typename U, unsigned char N>

const U * PNTreeLightNode< T, U, N >::getLastData	(	const T *	posData,
		const T	pos[N],
		const T	size[N] ) const

Get the data of the last node in the N tree.

Parameters

posData	: position of the data
pos	: position of the current node
size	: size of the current node

Returns: data of the last node in the N tree

Definition at line 195 of file PNTreeLightNode_impl.h.

                                                                                                       {
        if(p_tableChildren == NULL){
                if(p_data == NULL) return NULL;
                else return p_data;
        }else{
                T childPos[N];
                const PNTreeLightNode<T, U, N> * child = getChildFromPos(childPos, posData, pos, size);
                if(child == NULL) return NULL;
                else{
                        T childSize[N];
                        makeHalfSize<T,N>(childSize, size);
                        return child->getLastData(posData, pos, childSize);
                }
        }
}

References getChildFromPos(), getLastData(), makeHalfSize(), p_data, p_tableChildren, and PNTreeLightNode().

Referenced by getLastData().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ getTabChildren() [1/2]

template<typename T, typename U, unsigned char N>

PNTreeLightNode< T, U, N > * PNTreeLightNode< T, U, N >::getTabChildren ( )

Returns the table of children of the PNTreeLightNode.

Returns: table of children of the PNTreeLightNode

Definition at line 427 of file PNTreeLightNode_impl.h.

427{return p_tableChildren;}

References p_tableChildren, and PNTreeLightNode().

Here is the call graph for this function:

◆ getTabChildren() [2/2]

template<typename T, typename U, unsigned char N>

const PNTreeLightNode< T, U, N > * PNTreeLightNode< T, U, N >::getTabChildren ( ) const

Returns the table of children of the PNTreeLightNode.

Returns: table of children of the PNTreeLightNode

Definition at line 421 of file PNTreeLightNode_impl.h.

421{return p_tableChildren;}

References p_tableChildren, and PNTreeLightNode().

Here is the call graph for this function:

◆ initialisationPNTreeLightNode()

template<typename T, typename U, unsigned char N>

void PNTreeLightNode< T, U, N >::initialisationPNTreeLightNode ( )

private

Initialisation function of the class PNTreeLightNode.

Definition at line 499 of file PNTreeLightNode_impl.h.

                                                            {
        p_posData = NULL;
        p_data = NULL;
        p_tableChildren = NULL;
}

References p_data, p_posData, and p_tableChildren.

Referenced by PNTreeLightNode().

Here is the caller graph for this function:

◆ saveGnuplotData() [1/2]

template<typename T, typename U, unsigned char N>

bool PNTreeLightNode< T, U, N >::saveGnuplotData	(	const std::string &	fileName,
		T	pos[N],
		T	size[N] )

Saves the PNTreeLightNode into a txt file for gnuplot.

Parameters

fileName	: name of the text file we want to write
pos	: position of the current node
size	: size of the current node

Returns: true on success, false otherwise

Definition at line 103 of file PNTreeLightNode_impl.h.

                                                                                             {
        if(fileName == "") return false;
        std::ofstream fs;
        fs.open(fileName);
        if(!fs.is_open()){return false;}
        bool b = saveGnuplotData(fs, 0, pos, size);
        fs.close();
        return b;
}

References saveGnuplotData().

Referenced by saveGnuplotData().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ saveGnuplotData() [2/2]

template<typename T, typename U, unsigned char N>

bool PNTreeLightNode< T, U, N >::saveGnuplotData	(	std::ofstream &	fs,
		T	height,
		T	pos[N],
		T	size[N] )

Saves the PNTreeLightNode into a txt file for gnuplot.

Parameters

fs	: text file we want to write
height	: height of the quad to draw
pos	: position of the current node
size	: size of the current node

Returns: true on success, false otherwise

Definition at line 121 of file PNTreeLightNode_impl.h.

                                                                                             {
        if(N == 2){
                fs << pos[0] << "\t" << pos[1] << "\t" << height << std::endl;
                fs << (pos[0] + size[0]) << "\t" << pos[1] << "\t" << height << std::endl;
                fs << (pos[0] + size[0]) << "\t" << (pos[1] + size[1]) << "\t" << height << std::endl;
                fs << pos[0] << "\t" << (pos[1] + size[1]) << "\t" << height << std::endl;
                fs << pos[0] << "\t" << pos[1] << "\t" << height << std::endl;
        }else if(N == 3){
                T px0(pos[0]), px1(pos[0] + size[0]);
                T py0(pos[1]), py1(pos[1] + size[1]);
                T pz0(pos[2]), pz1(pos[2] + size[2]);
                
                //lower quad
                fs << px0 << "\t" << py0 << "\t" << pz0 << std::endl;
                fs << px1 << "\t" << py0 << "\t" << pz0 << std::endl;
                fs << px1 << "\t" << py1 << "\t" << pz0 << std::endl;
                fs << px0 << "\t" << py1 << "\t" << pz0 << std::endl;
                fs << px0 << "\t" << py0 << "\t" << pz0 << std::endl;
                fs << std::endl;
                //upper quad
                fs << px0 << "\t" << py0 << "\t" << pz1 << std::endl;
                fs << px1 << "\t" << py0 << "\t" << pz1 << std::endl;
                fs << px1 << "\t" << py1 << "\t" << pz1 << std::endl;
                fs << px0 << "\t" << py1 << "\t" << pz1 << std::endl;
                fs << px0 << "\t" << py0 << "\t" << pz1 << std::endl;
                fs << std::endl;
                //Lines on Oz axis
                fs << px0 << "\t" << py0 << "\t" << pz0 << std::endl;
                fs << px0 << "\t" << py0 << "\t" << pz1 << std::endl;
                fs << std::endl;
                fs << px0 << "\t" << py1 << "\t" << pz0 << std::endl;
                fs << px0 << "\t" << py1 << "\t" << pz1 << std::endl;
                fs << std::endl;
                fs << px1 << "\t" << py1 << "\t" << pz0 << std::endl;
                fs << px1 << "\t" << py1 << "\t" << pz1 << std::endl;
                fs << std::endl;
                fs << px1 << "\t" << py0 << "\t" << pz0 << std::endl;
                fs << px1 << "\t" << py0 << "\t" << pz1 << std::endl;
        }
        fs << std::endl;
        if(p_tableChildren != NULL){
                T childSize[N], posChild[N];
                makeHalfSize<T,N>(childSize, size);
                for(unsigned char i(0); i < PPower<2, N>::Value; ++i){
                        for(unsigned char k(0); k < N; ++k){
                                posChild[k] = pos[k] + ((i >> k) & 1)*childSize[k];
                        }
                        p_tableChildren[i].saveGnuplotData(fs, height + 1, posChild, childSize);
                }
        }
        return true;
}

References makeHalfSize(), and p_tableChildren.

Here is the call graph for this function:

◆ split()

template<typename T, typename U, unsigned char N>

bool PNTreeLightNode< T, U, N >::split	(	const T	pos[N],
		const T	size[N],
		T	sizeLimit )

private

Split the PNTreeLightNode.

Parameters

pos	: position of the current node
size	: size of the current node
sizeLimit	: limit of the cell size

Returns: true on success, false otherwise

Definition at line 464 of file PNTreeLightNode_impl.h.

                                                                                {
        if(p_tableChildren != NULL || p_data == NULL){
                std::cerr << "PNTreeLightNode<T, U, N>::split() : current node already split" << std::endl;
                return false;
        }
//      std::cerr << "PNTreeLightNode<T, U, N>::split() : begin" << std::endl;
        T halfSizeChild[N];
        makeHalfSize<T, N>(halfSizeChild, size);
        if(!checkSizeLimitLight<T, N>(halfSizeChild, sizeLimit)){
//              std::cerr << "PNTreeLightNode<T, U, N>::split : can't split more, child sizes less than " << sizeLimit << std::endl;
                return false;
        }
        unsigned char nbChildren(PPower<2, N>::Value);
        p_tableChildren = new PNTreeLightNode<T, U, N>[nbChildren];
        for(unsigned char i(0); i < nbChildren; ++i){
                PNTreeLightNode<T, U, N> * child = &(p_tableChildren[i]);
                child->p_tableChildren = NULL;
                child->p_data = NULL;
                child->p_posData = NULL;
        }
//      std::cerr << "PNTreeLightNode<T, U, N>::split : replace child" << std::endl;
        T childPos[N];
        PNTreeLightNode<T, U, N> * child = getChildFromPos(childPos, p_posData, pos, size);
        bool b = true;;
        if(child == NULL) return false;
        else{
                b = child->addElement(p_posData, p_data, childPos, halfSizeChild, sizeLimit);
        }
        p_data = NULL;
        p_posData = NULL;
        return b;
}

References addElement(), checkSizeLimitLight(), getChildFromPos(), makeHalfSize(), p_data, p_posData, p_tableChildren, PNTreeLightNode(), and PPower< V, N >::Value.

Referenced by addElement().

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

◆ p_data

template<typename T, typename U, unsigned char N>

U* PNTreeLightNode< T, U, N >::p_data

private

Data of the node.

Definition at line 66 of file PNTreeLightNode.h.

Referenced by addElement(), clear(), getCloserData(), getLastData(), initialisationPNTreeLightNode(), and split().

◆ p_posData

template<typename T, typename U, unsigned char N>

T* PNTreeLightNode< T, U, N >::p_posData

private

Position of the data in the cell.

Definition at line 64 of file PNTreeLightNode.h.

Referenced by addElement(), getCloserData(), getDataPos(), getDataPos(), initialisationPNTreeLightNode(), and split().

◆ p_tableChildren

template<typename T, typename U, unsigned char N>

PNTreeLightNode<T,U,N>* PNTreeLightNode< T, U, N >::p_tableChildren

private

Position of the data in the hyper cube.

Definition at line 68 of file PNTreeLightNode.h.

Referenced by addElement(), clear(), getChild(), getChild(), getChildFromPos(), getChildFromPos(), getCloserData(), getLastData(), getTabChildren(), getTabChildren(), initialisationPNTreeLightNode(), saveGnuplotData(), and split().

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

/builds/CTA-LAPP/PHOENIX_LIBS2/graph/PhoenixGraph/src/Tree/PNTreeLightNode.h
/builds/CTA-LAPP/PHOENIX_LIBS2/graph/PhoenixGraph/src/Tree/PNTreeLightNode_impl.h

Public Member Functions

Protected Member Functions

Private Member Functions

Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ PNTreeLightNode() [1/2]

◆ ~PNTreeLightNode()

◆ PNTreeLightNode() [2/2]

Member Function Documentation

◆ addElement()

◆ clear()

◆ copyPNTreeLightNode()

◆ getChild() [1/2]

◆ getChild() [2/2]

◆ getChildFromPos() [1/2]

◆ getChildFromPos() [2/2]

◆ getCloserData()

◆ getData() [1/2]

◆ getData() [2/2]

◆ getDataPos() [1/2]

◆ getDataPos() [2/2]

◆ getFullIndexChild()

◆ getIndexOfChildFromPos() [1/2]

◆ getIndexOfChildFromPos() [2/2]

◆ getLastData()

◆ getTabChildren() [1/2]

◆ getTabChildren() [2/2]

◆ initialisationPNTreeLightNode()

◆ saveGnuplotData() [1/2]

◆ saveGnuplotData() [2/2]

◆ split()

Member Data Documentation

◆ p_data

◆ p_posData

◆ p_tableChildren