SeedingTree< DATA > Class Template Reference

#include <SeedingTree.h>

Public Types
typedef std::unordered_set< DATA, typename DATA::hashfct, typename DATA::eqfct >	SingleSet

Public Member Functions
const SeedingNode< DATA > *	getRoot (unsigned int i) const
const SingleSet &	getSingleSet () const
bool	insert (const std::vector< DATA > &dataList)
unsigned int	numberOfNodes () const
unsigned int	numberOfRoots () const
void	print () const
void	printOrdered () const
void	printRecursive () const
void	sort ()
	~SeedingTree ()

Protected Attributes
std::vector< SeedingNode< DATA > * >	_allNodes
std::vector< SeedingNode< DATA > * >	_roots
SingleSet	_singleSet

Detailed Description

template<class DATA>
class SeedingTree< DATA >

Definition at line 160 of file SeedingTree.h.

Member Typedef Documentation

template<class DATA>

typedef std::unordered_set<DATA,typename DATA:: hashfct, typename DATA:: eqfct> SeedingTree< DATA >::SingleSet

Definition at line 163 of file SeedingTree.h.

Constructor & Destructor Documentation

template<class DATA>

SeedingTree< DATA >::~SeedingTree ( )

inline

Definition at line 258 of file SeedingTree.h.

        {
            for (unsigned int iroot=0; iroot<_roots.size();++iroot)
            {
                delete _roots[iroot];
            }
            _roots.clear();
        }

Member Function Documentation

template<class DATA>

const SeedingNode<DATA>* SeedingTree< DATA >::getRoot ( unsigned int  i ) const

inline

Definition at line 223 of file SeedingTree.h.

Referenced by SeedFinder::iterateHits().

        {
            if (i<_roots.size())
            {
                return _roots[i];
            }
            return nullptr;
        }

template<class DATA>

const SingleSet& SeedingTree< DATA >::getSingleSet ( ) const

inline

Definition at line 195 of file SeedingTree.h.

Referenced by SeedFinder::iterateHits().

        {
            return _singleSet;
        }

template<class DATA>

bool SeedingTree< DATA >::insert ( const std::vector< DATA > &  dataList )

inline

Definition at line 172 of file SeedingTree.h.

Referenced by TrajectorySeedProducer::TrajectorySeedProducer().

        {
            for (unsigned int i = 0; i< dataList.size(); ++i)
            {
                _singleSet.insert(dataList[i]);
            }

            if (dataList.empty())
            {
                return false;
            }
            for (unsigned int iroot=0; iroot<_roots.size();++iroot)
            {
                if (_roots[iroot]->getData()==dataList[0])
                {
                    return _roots[iroot]->insert(dataList,_allNodes);
                }
            }
            SeedingNode<DATA>* node = new SeedingNode<DATA>(dataList[0],_allNodes);
            _roots.push_back(node);
            return node->insert(dataList,_allNodes);
        }

template<class DATA>

unsigned int SeedingTree< DATA >::numberOfNodes ( ) const

inline

Definition at line 218 of file SeedingTree.h.

Referenced by SeedFinder::getSeed().

        {
            return _allNodes.size();
        }

template<class DATA>

unsigned int SeedingTree< DATA >::numberOfRoots ( ) const

inline

Definition at line 213 of file SeedingTree.h.

Referenced by SeedFinder::iterateHits().

        {
            return _roots.size();
        }

template<class DATA>

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

inline

Definition at line 249 of file SeedingTree.h.

        {
            std::cout<<"SeedingTree: n="<<_allNodes.size()<<std::endl;
            for (unsigned int inode=0; inode<_allNodes.size();++inode)
            {
                _allNodes[inode]->print();
            }
        }

template<class DATA>

void SeedingTree< DATA >::printOrdered ( ) const

inline

Definition at line 240 of file SeedingTree.h.

        {
            std::cout<<"SeedingTree: n="<<_allNodes.size()<<" [ordered]"<<std::endl;
            for (unsigned int inode=0; inode<_allNodes.size();++inode)
            {
                _allNodes[inode]->print();
            }
        }

template<class DATA>

void SeedingTree< DATA >::printRecursive ( ) const

inline

Definition at line 232 of file SeedingTree.h.

        {
            std::cout<<"SeedingTree: n="<<_allNodes.size()<<" [recursive]"<<std::endl;
            for (unsigned int iroot=0; iroot<_roots.size();++iroot)
            {
                _roots[iroot]->printRecursive();
            }
        }

template<class DATA>

void SeedingTree< DATA >::sort ( )

inline

Definition at line 200 of file SeedingTree.h.

        {
            //this setups depth first ordered indexes.
            std::vector<SeedingNode<DATA>*> allNodes;
            for (unsigned int iroot=0; iroot<_roots.size();++iroot)
            {
                _roots[iroot]->sort(allNodes,-1);
            }
            _allNodes=allNodes;
        }

Member Data Documentation

template<class DATA>

std::vector<SeedingNode<DATA>*> SeedingTree< DATA >::_allNodes

protected

Definition at line 166 of file SeedingTree.h.

Referenced by Vispa.Views.LineDecayView.LineDecayContainer::autolayoutThreadFinished().

template<class DATA>

std::vector<SeedingNode<DATA>*> SeedingTree< DATA >::_roots

protected

Definition at line 165 of file SeedingTree.h.

template<class DATA>

SingleSet SeedingTree< DATA >::_singleSet

protected

Definition at line 168 of file SeedingTree.h.