AnalysisUtils::Permutation< COLL > Class Template Reference

permutation More...

#include <AnalysisPermutation.h>

Collaboration diagram for AnalysisUtils::Permutation< COLL >:

Public Member Functions
	Permutation (COLL *coll, const unsigned int nElement)
	constructor
	~Permutation ()
	destructor
	Permutation (const Permutation &)=delete
Permutation &	operator= (const Permutation &)=delete
template<class OUT>
bool	get (OUT &perm)
	get a permutation.
template<class CALLER, class OUT, class CRITERIA>
bool	goodOnes (CALLER *caller, OUT &perm, CRITERIA criteria)
	get a permutation which passes a selection criteria

Private Attributes
Combination< std::vector< unsigned int * > > *	m_comb
	combination
COLL *	m_coll
	collection
std::vector< unsigned int * >	m_index_for_comb
	indices of elements
std::vector< unsigned int * >	m_index
bool	m_first
	flag to check if first

Detailed Description

template<class COLL>
class AnalysisUtils::Permutation< COLL >

permutation

Definition at line 23 of file AnalysisPermutation.h.

Constructor & Destructor Documentation

Permutation() [1/2]

template<class COLL>

AnalysisUtils::Permutation< COLL >::Permutation ( COLL * coll, const unsigned int nElement )

inline

constructor

Parameters

coll	collection

Definition at line 30 of file AnalysisPermutation.h.

      : m_coll(coll), m_first(true)
    {
      // init indices
      for (unsigned int i=0; i<coll->size(); ++i)
    m_index_for_comb.push_back(new unsigned int(i));
 
      m_comb = new Combination<std::vector<unsigned int *> > (&m_index_for_comb, nElement);
    }

~Permutation()

template<class COLL>

AnalysisUtils::Permutation< COLL >::~Permutation ( )

inline

destructor

Definition at line 42 of file AnalysisPermutation.h.

    {
      delete m_comb;
 
      for (unsigned int i=0; i<m_index_for_comb.size(); ++i)
    delete m_index_for_comb[i];
    }

Permutation() [2/2]

template<class COLL>

AnalysisUtils::Permutation< COLL >::Permutation ( const Permutation< COLL > & )

delete

Member Function Documentation

get()

template<class COLL>

template<class OUT>

bool AnalysisUtils::Permutation< COLL >::get ( OUT & perm )

inline

get a permutation.

This method changes the sequence in increasing order and return true if succeeds. If the current sequence is the last permutation, return false

Parameters

perm	a vector for permutation

Definition at line 59 of file AnalysisPermutation.h.

    {
      // init returned vector
      perm.clear();
 
      // get combination if first
      if (m_first)
    {
      m_first=false;
      if (! m_comb->get(m_index)) return false;
      std::sort(m_index.begin(), m_index.end());
    }
      else
    {
      // change sequence. if this is the last permutation. get next combination
      if (! std::next_permutation (m_index.begin(), m_index.end()))
        {
          if (! m_comb->get(m_index)) return false;
          std::sort(m_index.begin(), m_index.end());
        }
    }
      
      // assign
      std::vector<unsigned int *>::const_iterator it  = m_index.begin();
      std::vector<unsigned int *>::const_iterator itE = m_index.end();
      for (; it!=itE; ++it)
    perm.push_back((*m_coll)[**it]);
 
      return true;
    }

goodOnes()

template<class COLL>

template<class CALLER, class OUT, class CRITERIA>

bool AnalysisUtils::Permutation< COLL >::goodOnes ( CALLER * caller, OUT & perm, CRITERIA criteria )

inline

get a permutation which passes a selection criteria

Parameters

perm	a vector for permutation
criteria	a function pointer of selection criteria

Definition at line 95 of file AnalysisPermutation.h.

    {
      get(perm);
      
      // check if this passes the criteria
      if (criteria(caller,perm)) return true;
 
      // if not, look for next combination
      return goodOnes(caller, perm, criteria);
    }

operator=()

template<class COLL>

Permutation & AnalysisUtils::Permutation< COLL >::operator= ( const Permutation< COLL > & )

delete

Member Data Documentation

m_coll

template<class COLL>

COLL* AnalysisUtils::Permutation< COLL >::m_coll

private

collection

Definition at line 113 of file AnalysisPermutation.h.

m_comb

template<class COLL>

Combination<std::vector<unsigned int *> >* AnalysisUtils::Permutation< COLL >::m_comb

private

combination

Definition at line 110 of file AnalysisPermutation.h.

m_first

template<class COLL>

bool AnalysisUtils::Permutation< COLL >::m_first

private

flag to check if first

Definition at line 120 of file AnalysisPermutation.h.

m_index

template<class COLL>

std::vector<unsigned int *> AnalysisUtils::Permutation< COLL >::m_index

private

Definition at line 117 of file AnalysisPermutation.h.

m_index_for_comb

template<class COLL>

std::vector<unsigned int *> AnalysisUtils::Permutation< COLL >::m_index_for_comb

private

indices of elements

Definition at line 116 of file AnalysisPermutation.h.

---

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

• AnalysisPermutation.h