de_rank< T > Struct Template Reference

— order candidates — More...

#include <DEcompare.h>

Inheritance diagram for de_rank< T >:

Public Types
typedef de_trait::cand_type	cand_type
typedef DEtrait< T >	de_trait
Public Types inherited from DEutils< T >
typedef de_trait::cand_type	cand_type
typedef T::const_iterator	col_cit
typedef T::iterator	col_it
typedef T::size_type	col_sz
typedef de_trait::coll_type	coll_type
typedef DEtrait< T >	de_trait

Public Member Functions
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
template<>
bool	operator() (const cand_type &x, const cand_type &y) const
Public Member Functions inherited from DEutils< T >
bool	de_equal (const cand_type &, const cand_type &)
	— candidate match definition — More...
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal (const cand_type &lhs, const cand_type &rhs)
bool	de_equal_loc (const cand_type &, const cand_type &)
	— candidate location-match definition — More...
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
template<>
bool	de_equal_loc (const cand_type &lhs, const cand_type &rhs)
col_it	de_find (col_it, col_it, const cand_type &)
	— find candidate — More...
bool	de_nequal (const cand_type &, const cand_type &)
bool	de_nequal_loc (const cand_type &, const cand_type &)
int	de_type () const
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int ctype)
	— form de-digi — More...
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
template<>
L1DataEmulDigi	DEDigi (col_cit itd, col_cit itm, int aflag)
	DEutils ()
std::string	GetName (int i=0) const
	— name candidate — More...
bool	is_empty (col_cit) const
	— candidate emptiness definition — More...
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
template<>
bool	is_empty (col_cit it) const
std::string	print (col_cit) const
	— print candidate — More...
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
template<>
std::string	print (col_cit it) const
	~DEutils ()

Detailed Description

template<typename T>
struct de_rank< T >

— order candidates —

Definition at line 18 of file DEcompare.h.

Member Typedef Documentation

template<typename T >

typedef de_trait::cand_type de_rank< T >::cand_type

Definition at line 1525 of file DEutils.h.

template<typename T >

typedef DEtrait<T> de_rank< T >::de_trait

Definition at line 1524 of file DEutils.h.

Member Function Documentation

template<typename T >

bool de_rank< T >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1526 of file DEutils.h.

                                                                {
    return false;  //default
  }

template<>

bool de_rank< EcalTrigPrimDigiCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1532 of file DEutils.h.

                                                                                                        {
  return x.compressedEt() > y.compressedEt();
}

template<>

bool de_rank< HcalTrigPrimDigiCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1536 of file DEutils.h.

                                                                                                        {
  return x.SOI_compressedEt() > y.SOI_compressedEt();
}

template<>

bool de_rank< L1CaloEmCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1541 of file DEutils.h.

                                                                                                {
  if (x.rank() != y.rank()) {
    return (x.rank() < y.rank());
  } else if (x.isolated() != y.isolated()) {
    return (x.isolated()) ? true : false;
  } else if (x.rctRegion() != y.rctRegion()) {
    return (x.rctRegion() < y.rctRegion());
  } else if (x.rctCrate() != y.rctCrate()) {
    return (x.rctCrate() < y.rctCrate());
  } else if (x.rctCard() != y.rctCard()) {
    return (x.rctCard() < y.rctCard());
  } else {
    return x.raw() < y.raw();
  }
}

template<>

bool de_rank< L1CaloRegionCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1558 of file DEutils.h.

                                                                                                    {
  return x.et() < y.et();
}

template<>

bool de_rank< L1GctEmCandCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1563 of file DEutils.h.

                                                                                                   {
  if (x.rank() != y.rank()) {
    return x.rank() < y.rank();
  } else {
    if (x.etaIndex() != y.etaIndex()) {
      return y.etaIndex() < x.etaIndex();
    } else {
      return x.phiIndex() < y.phiIndex();
    }
  }
}

template<>

bool de_rank< L1GctJetCandCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1575 of file DEutils.h.

                                                                                                    {
  if (x.rank() != y.rank()) {
    return x.rank() < y.rank();
  } else {
    if (x.etaIndex() != y.etaIndex()) {
      return y.etaIndex() < x.etaIndex();
    } else {
      return x.phiIndex() < y.phiIndex();
    }
  }
}

template<>

bool de_rank< L1MuDTChambPhDigiCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1595 of file DEutils.h.

                                                                                                         {
  if (x.whNum() != y.whNum()) {
    return x.whNum() < y.whNum();
  } else {
    if (x.scNum() != y.scNum()) {
      return y.scNum() < x.scNum();
    } else {
      return x.stNum() < y.stNum();
    }
  }
}

template<>

bool de_rank< L1MuDTChambThDigiCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1607 of file DEutils.h.

                                                                                                         {
  if (x.whNum() != y.whNum()) {
    return x.whNum() < y.whNum();
  } else {
    if (x.scNum() != y.scNum()) {
      return y.scNum() < x.scNum();
    } else {
      return x.stNum() < y.stNum();
    }
  }
}

template<>

bool de_rank< L1MuRegionalCandCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1620 of file DEutils.h.

                                                                                                        {
  if (x.phi_packed() != y.phi_packed()) {
    return x.phi_packed() < y.phi_packed();
  } else {
    if (x.eta_packed() != y.eta_packed()) {
      return y.eta_packed() < x.eta_packed();
    } else {
      return x.quality_packed() < y.quality_packed();
    }
  }
}

template<>

bool de_rank< L1MuGMTCandCollection >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1633 of file DEutils.h.

                                                                                                   {
  if (x.bx() != y.bx()) {
    return x.bx() < y.bx();
  } else if (x.ptIndex() != y.ptIndex()) {
    return x.ptIndex() < y.ptIndex();
  } else {
    return x.quality() < y.quality();
  }
}

template<>

bool de_rank< CSCCorrelatedLCTDigiCollection_ >::operator() ( const cand_type &  x, const cand_type &  y  ) const

inline

Definition at line 1644 of file DEutils.h.

                                                                                                             {
  if (x.getTrknmb() != y.getTrknmb()) {
    return x.getTrknmb() < y.getTrknmb();
  } else {
    if (x.getKeyWG() != y.getKeyWG()) {
      return y.getKeyWG() < x.getKeyWG();
    } else {
      return x.getQuality() < y.getQuality();
    }
  }
}