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 114 of file SeedingTree.h.

Member Typedef Documentation

SingleSet

template<class DATA>

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

Definition at line 116 of file SeedingTree.h.

Constructor & Destructor Documentation

~SeedingTree()

template<class DATA>

SeedingTree< DATA >::~SeedingTree ( )

inline

Definition at line 186 of file SeedingTree.h.

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

Member Function Documentation

getRoot()

template<class DATA>

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

inline

Definition at line 159 of file SeedingTree.h.

Referenced by SeedFinder::iterateHits().

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

getSingleSet()

template<class DATA>

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

inline

Definition at line 144 of file SeedingTree.h.

Referenced by SeedFinder::iterateHits().

{ return _singleSet; }

insert()

template<class DATA>

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

inline

Definition at line 126 of file SeedingTree.h.

Referenced by SequenceTypes.Schedule::_replaceIfHeldDirectly(), and 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);
  }

numberOfNodes()

template<class DATA>

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

inline

Definition at line 157 of file SeedingTree.h.

Referenced by SeedFinder::getSeed().

{ return _allNodes.size(); }

numberOfRoots()

template<class DATA>

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

inline

Definition at line 155 of file SeedingTree.h.

Referenced by SeedFinder::iterateHits().

{ return _roots.size(); }

print()

template<class DATA>

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

inline

Definition at line 179 of file SeedingTree.h.

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

printOrdered()

template<class DATA>

void SeedingTree< DATA >::printOrdered ( ) const

inline

Definition at line 172 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();
    }
  }

printRecursive()

template<class DATA>

void SeedingTree< DATA >::printRecursive ( ) const

inline

Definition at line 166 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();
    }
  }

sort()

template<class DATA>

void SeedingTree< DATA >::sort ( )

inline

Definition at line 146 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

_allNodes

template<class DATA>

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

protected

Definition at line 120 of file SeedingTree.h.

Referenced by SeedingTree< TrackingLayer >::insert(), SeedingTree< TrackingLayer >::numberOfNodes(), SeedingTree< TrackingLayer >::print(), SeedingTree< TrackingLayer >::printOrdered(), SeedingTree< TrackingLayer >::printRecursive(), and SeedingTree< TrackingLayer >::sort().

_roots

template<class DATA>

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

protected

Definition at line 119 of file SeedingTree.h.

Referenced by SeedingTree< TrackingLayer >::getRoot(), SeedingTree< TrackingLayer >::insert(), SeedingTree< TrackingLayer >::numberOfRoots(), SeedingTree< TrackingLayer >::printRecursive(), SeedingTree< TrackingLayer >::sort(), and SeedingTree< TrackingLayer >::~SeedingTree().

_singleSet

template<class DATA>

SingleSet SeedingTree< DATA >::_singleSet

protected

Definition at line 122 of file SeedingTree.h.

Referenced by SeedingTree< TrackingLayer >::getSingleSet(), and SeedingTree< TrackingLayer >::insert().