ComboIterator.h

Go to the documentation of this file.

/*
  Copyright (C) 2002-2017 CERN for the benefit of the ATLAS collaboration
*/
 
#ifndef TRIGNAVSTRUCTURE_ComboIterator_H
#define TRIGNAVSTRUCTURE_ComboIterator_H
 
#include <vector>
#include <set>
#include "TrigNavStructure/Types.h"
 
namespace HLT {
  class TriggerElement;
  typedef std::vector<HLT::TriggerElement*> TEVec;
 
  class TrigNavStructure;
 

 
  class ComboIteratorBase {
 
  public:

    ComboIteratorBase() {}

    virtual ~ComboIteratorBase() {}

    virtual bool rewind() = 0;

    virtual TEVec& operator*() = 0;

    virtual bool isValid() const = 0;

    virtual TEVec& combination() = 0;

    virtual ComboIteratorBase& operator++(int) = 0;

    virtual ComboIteratorBase& operator++() = 0;
   
  };
 

 
  class ComboIterator : public ComboIteratorBase {
 
  public:
    ComboIterator(const std::vector<TEVec>& tes, const TrigNavStructure* nav);

    bool rewind();

    TEVec& operator*() { return combination(); }

    bool isValid() const { return m_valid; }

    TEVec& combination() { return m_comb; }

    ComboIterator& operator++(int) { return operator++(); }

    ComboIterator& operator++();
   
  protected:

    virtual bool overlaps(const TriggerElement* t1, const TriggerElement* t2) const;

    bool overlaps(const TriggerElement* t1, 
          const TEVec& teVec, int idx = -1) const;

    bool incrementByOne(int pos, bool& ok);

    bool increment     (int pos);

    bool     reset     (int pos);

    void invalidate();

    void print() const;

    TEVec m_comb;

    std::vector<int> m_idx;

    std::vector<TEVec> m_tes;

    bool m_valid;

    const TrigNavStructure* m_nav;
  };
 
 
 

 
  class ComboIteratorTopo : public ComboIterator {
  public:
    ComboIteratorTopo(const std::vector<TEVec>& tes, const TrigNavStructure* nav, HLT::te_id_type topoSpan);
 
  protected:
    // on top of same RoI adds check if TEs are span by the topological TE of give id
    // think ... is not combination which was ever (sucesfullly) considered by topo algorithm
    virtual bool overlaps(const TriggerElement* t1, const TriggerElement* t2) const;
  private:
    void traverseUntilSeedsTopo(const TriggerElement* start, std::set<const TriggerElement*>& topos) const;
    HLT::te_id_type m_spanId;
    
  };
 
} // eof namespace
 
#endif //#ifndef