SeedingNode< DATA > Class Template Reference

#include <SeedingTree.h>

Public Member Functions
const SeedingNode< DATA > *	firstChild () const
const SeedingNode< DATA > *	getChild (unsigned int ichild) const
unsigned int	getChildIndex () const
unsigned int	getChildrenSize () const
const DATA &	getData () const
unsigned int	getDepth () const
unsigned int	getIndex () const
const SeedingNode *	getParent () const
bool	insert (const std::vector< DATA > &dataList, std::vector< SeedingNode< DATA > * > &allNodes)
const SeedingNode< DATA > *	next () const
void	print () const
void	printRecursive () const
	SeedingNode (const DATA &data, std::vector< SeedingNode * > &allNodes, int parentIndex=-1)
void	sort (std::vector< SeedingNode< DATA > * > &allNodes, unsigned int parentIndex)

Protected Attributes
const std::vector< SeedingNode < DATA > * > &	_allNodes
int	_childIndex
std::vector< unsigned int >	_children
const DATA	_data
unsigned int	_depth
unsigned int	_index
int	_parentIndex

Detailed Description

template<class DATA>
class SeedingNode< DATA >

Definition at line 10 of file SeedingTree.h.

Constructor & Destructor Documentation

template<class DATA>

SeedingNode< DATA >::SeedingNode ( const DATA &  data, std::vector< SeedingNode< DATA > * > &  allNodes, int  parentIndex = -1  )

inline

Definition at line 22 of file SeedingTree.h.

References SeedingNode< DATA >::_childIndex, SeedingNode< DATA >::_children, SeedingNode< DATA >::_depth, SeedingNode< DATA >::_index, SeedingNode< DATA >::_parentIndex, and confdb::parent.

                                                                                            :
            _data(data),
            _allNodes(allNodes),
            _index(allNodes.size()),
            _parentIndex(parentIndex)
        {
            allNodes.push_back(this);
        
            if (_parentIndex>=0)
            {
                SeedingNode* parent = allNodes[_parentIndex];
                _depth=parent->_depth+1;
                _childIndex=parent->_children.size();
                parent->_children.push_back(_index);
                
            }
            else
            {
                _depth=0;
                _childIndex=-1;
            }
        }

Member Function Documentation

template<class DATA>

const SeedingNode<DATA>* SeedingNode< DATA >::firstChild ( ) const

inline

Definition at line 98 of file SeedingTree.h.

References SeedingNode< DATA >::_allNodes, and SeedingNode< DATA >::_children.

        {
            if (_children.size()>0)
            {
                return _allNodes[_children[0]];
            }
            return nullptr;
        }

template<class DATA>

const SeedingNode<DATA>* SeedingNode< DATA >::getChild ( unsigned int  ichild ) const

inline

Definition at line 126 of file SeedingTree.h.

References SeedingNode< DATA >::_allNodes, and SeedingNode< DATA >::_children.

Referenced by TrajectorySeedProducer::insertHit().

        {
            return _allNodes[_children[ichild]];
        }

template<class DATA>

unsigned int SeedingNode< DATA >::getChildIndex ( ) const

inline

Definition at line 131 of file SeedingTree.h.

References SeedingNode< DATA >::_childIndex.

        {
            return _childIndex;
        }

template<class DATA>

unsigned int SeedingNode< DATA >::getChildrenSize ( ) const

inline

Definition at line 121 of file SeedingTree.h.

References SeedingNode< DATA >::_children.

Referenced by TrajectorySeedProducer::insertHit().

        {
            return _children.size();
        }

template<class DATA>

const DATA& SeedingNode< DATA >::getData ( void  ) const

inline

Definition at line 136 of file SeedingTree.h.

References SeedingNode< DATA >::_data.

Referenced by SeedingNode< DATA >::insert(), and TrajectorySeedProducer::insertHit().

        {
            return _data;
        }

template<class DATA>

unsigned int SeedingNode< DATA >::getDepth ( void  ) const

inline

Definition at line 84 of file SeedingTree.h.

References SeedingNode< DATA >::_depth.

Referenced by SeedingNode< DATA >::insert(), TrajectorySeedProducer::iterateHits(), and TrajectorySeedProducer::passHitTuplesCuts().

        {
            return _depth;
        }

template<class DATA>

unsigned int SeedingNode< DATA >::getIndex ( ) const

inline

Definition at line 107 of file SeedingTree.h.

References SeedingNode< DATA >::_index.

Referenced by TrajectorySeedProducer::insertHit(), TrajectorySeedProducer::iterateHits(), and TrajectorySeedProducer::passHitTuplesCuts().

        {
            return _index;
        }

template<class DATA>

const SeedingNode* SeedingNode< DATA >::getParent ( ) const

inline

Definition at line 112 of file SeedingTree.h.

References SeedingNode< DATA >::_allNodes, and SeedingNode< DATA >::_parentIndex.

Referenced by TrajectorySeedProducer::insertHit(), TrajectorySeedProducer::iterateHits(), and TrajectorySeedProducer::passHitTuplesCuts().

        {
            if (_parentIndex>=0)
            {
                return _allNodes[_parentIndex];
            }
            return nullptr;
        }

template<class DATA>

bool SeedingNode< DATA >::insert ( const std::vector< DATA > &  dataList, std::vector< SeedingNode< DATA > * > &  allNodes  )

inline

Definition at line 60 of file SeedingTree.h.

References SeedingNode< DATA >::_children, SeedingNode< DATA >::_depth, SeedingNode< DATA >::_index, SeedingNode< DATA >::getData(), SeedingNode< DATA >::getDepth(), and SeedingNode< DATA >::insert().

Referenced by BeautifulSoup.PageElement::_invert(), SeedingNode< DATA >::insert(), and SeedingTree< TrackingLayer >::insert().

        {
            if (_depth+1>=dataList.size())
            {
                //std::cout<<"\tSeedingNode::insert: return"<<std::endl;
                return false;
            }
            for (unsigned int ichild=0; ichild<_children.size();++ichild)
            {
                if (allNodes[_children[ichild]]->getData()==dataList[_depth+1])
                {
                    //std::cout<<"\tSeedingNode::insert: has child "<<dataList[_depth+1].print()<<std::endl;
                    return allNodes[_children[ichild]]->insert(dataList,allNodes);
                }
            }
            //std::cout<<"\tSeedingNode::insert: create child "<<dataList[_depth+1].print()<<std::endl;
            SeedingNode<DATA>* node = new SeedingNode<DATA>(dataList[_depth+1],allNodes,_index);
            if (node->getDepth()+1>=dataList.size())
            {
                return true;
            }
            return node->insert(dataList,allNodes);
        }

template<class DATA>

const SeedingNode<DATA>* SeedingNode< DATA >::next ( void  ) const

inline

Definition at line 89 of file SeedingTree.h.

References SeedingNode< DATA >::_allNodes, and SeedingNode< DATA >::_index.

Referenced by BeautifulSoup.PageElement::_invert().

        {
            if (_index+1<_allNodes.size())
            {
                return _allNodes[_index+1];
            }
            return nullptr;
        }

template<class DATA>

void SeedingNode< DATA >::print ( void  ) const

inline

Definition at line 141 of file SeedingTree.h.

References SeedingNode< DATA >::_childIndex, SeedingNode< DATA >::_data, SeedingNode< DATA >::_depth, SeedingNode< DATA >::_index, gather_cfg::cout, and i.

Referenced by SeedingNode< DATA >::printRecursive().

        {
            
            printf("index=%3i, depth=%2i, childIndex=%2i:  ",_index,_depth,_childIndex);
            for (unsigned int i=0;i<_depth;++i)
            {
                std::cout<<" -- ";
            }
            printf("[%s, %s] \r\n",_data.toString().c_str(),_data.toIdString().c_str());
            
        }

template<class DATA>

void SeedingNode< DATA >::printRecursive ( ) const

inline

Definition at line 152 of file SeedingTree.h.

References SeedingNode< DATA >::_allNodes, SeedingNode< DATA >::_children, and SeedingNode< DATA >::print().

        {
            print();
            for (unsigned int ichild=0; ichild<_children.size(); ++ichild)
            {
                _allNodes[_children[ichild]]->printRecursive();
            }
        }

template<class DATA>

void SeedingNode< DATA >::sort ( std::vector< SeedingNode< DATA > * > &  allNodes, unsigned int  parentIndex  )

inline

Definition at line 45 of file SeedingTree.h.

References SeedingNode< DATA >::_allNodes, SeedingNode< DATA >::_childIndex, SeedingNode< DATA >::_children, SeedingNode< DATA >::_index, and SeedingNode< DATA >::_parentIndex.

        {
            _parentIndex=parentIndex;
            _index=allNodes.size();
            if (_parentIndex>=0)
            {
                allNodes[_parentIndex]->_children[_childIndex]=_index;
            }
            allNodes.push_back(this);
            for (unsigned int ichild=0; ichild<_children.size();++ichild)
            {
                _allNodes[_children[ichild]]->sort(allNodes,_index);
            }
        }

Member Data Documentation

template<class DATA>

const std::vector<SeedingNode<DATA>*>& SeedingNode< DATA >::_allNodes

protected

Definition at line 14 of file SeedingTree.h.

Referenced by Vispa.Views.LineDecayView.LineDecayContainer::autolayoutThreadFinished(), SeedingNode< DATA >::firstChild(), SeedingNode< DATA >::getChild(), SeedingNode< DATA >::getParent(), SeedingNode< DATA >::next(), SeedingNode< DATA >::printRecursive(), and SeedingNode< DATA >::sort().

template<class DATA>

int SeedingNode< DATA >::_childIndex

protected

Definition at line 17 of file SeedingTree.h.

Referenced by SeedingNode< DATA >::getChildIndex(), SeedingNode< DATA >::print(), SeedingNode< DATA >::SeedingNode(), and SeedingNode< DATA >::sort().

template<class DATA>

std::vector<unsigned int> SeedingNode< DATA >::_children

protected

Definition at line 19 of file SeedingTree.h.

Referenced by SeedingNode< DATA >::firstChild(), SeedingNode< DATA >::getChild(), SeedingNode< DATA >::getChildrenSize(), SeedingNode< DATA >::insert(), SeedingNode< DATA >::printRecursive(), SeedingNode< DATA >::SeedingNode(), and SeedingNode< DATA >::sort().

template<class DATA>

const DATA SeedingNode< DATA >::_data

protected

Definition at line 13 of file SeedingTree.h.

Referenced by XML2Python.DataNode::__init__(), python.XML2Python.DataNode::__nonzero__(), XML2Python.DataNode::__nonzero__(), python.XML2Python.DataNode::__repr__(), XML2Python.DataNode::__repr__(), XML2Python.DataNode::__str__(), python.XML2Python.DataNode::__str__(), cfg-viewer.unscheduled::_proceed(), cfg-viewer.unscheduled::_saveData(), SeedingNode< DATA >::getData(), SeedingNode< DATA >::print(), and XML2Python.DataNode::stringify().

template<class DATA>

unsigned int SeedingNode< DATA >::_depth

protected

Definition at line 18 of file SeedingTree.h.

Referenced by SeedingNode< DATA >::getDepth(), SeedingNode< DATA >::insert(), SeedingNode< DATA >::print(), and SeedingNode< DATA >::SeedingNode().

template<class DATA>

unsigned int SeedingNode< DATA >::_index

protected

Definition at line 15 of file SeedingTree.h.

Referenced by python.cmstools.EventTree::__getitem__(), python.cmstools.EventTree::__iter__(), python.cmstools.EventBranch::__readData(), python.cmstools.EventTree::__setBranchIndicies(), Vispa.Share.FindAlgorithm.FindAlgorithm::currentNumber(), Vispa.Share.FindAlgorithm.FindAlgorithm::findUsingFindDialog(), SeedingNode< DATA >::getIndex(), python.cmstools.EventTree::index(), SeedingNode< DATA >::insert(), SeedingNode< DATA >::next(), Vispa.Share.FindAlgorithm.FindAlgorithm::next(), Vispa.Share.FindAlgorithm.FindAlgorithm::previous(), SeedingNode< DATA >::print(), SeedingNode< DATA >::SeedingNode(), python.cmstools.EventBranch::setIndex(), SeedingNode< DATA >::sort(), and html.HtmlReport::write().

template<class DATA>

int SeedingNode< DATA >::_parentIndex

protected

Definition at line 16 of file SeedingTree.h.

Referenced by SeedingNode< DATA >::getParent(), SeedingNode< DATA >::SeedingNode(), and SeedingNode< DATA >::sort().