SharingHitsMatcher.h

/**************************************************************************
 * basf2 (Belle II Analysis Software Framework)                           *
 * Author: The Belle II Collaboration                                     *
 *                                                                        *
 * See git log for contributors and copyright holders.                    *
 * This file is licensed under LGPL-3.0, see LICENSE.md.                  *
 **************************************************************************/
#pragma once
 
#include <tracking/trackFindingCDC/collectors/matchers/MatcherInterface.h>
 
#include <tracking/trackFindingCDC/ca/AutomatonCell.h>
 
#include <map>
#include <vector>
 
namespace Belle2 {
  namespace TrackFindingCDC {
    class CDCWireHit;
 
    template <class ACollectorItem, class ACollectionItem>
    class SharingHitsMatcher : public MatcherInterface<ACollectorItem, ACollectionItem> {
 
      using Super = MatcherInterface<ACollectorItem, ACollectionItem>;
 
    public:
      void beginEvent() override
      {
        m_hitLookup.clear();
      }
 
      void apply(std::vector<ACollectorItem>& collectorItems, const std::vector<ACollectionItem>& collectionItems,
                 std::vector<typename Super::WeightedRelationItem>& weightedRelations) override
      {
 
        for (const ACollectionItem& collectionItem : collectionItems) {
          const AutomatonCell& automatonCell = collectionItem.getAutomatonCell();
 
          if (automatonCell.hasTakenFlag() or collectionItem.empty()) {
            continue;
          }
 
          for (const auto& hit : collectionItem) {
            const CDCWireHit& wireHit = hit.getWireHit();
 
            // cppcheck-suppress danglingLifetime
            m_hitLookup.insert(std::make_pair(&wireHit, &collectionItem));
          }
        }
 
        Super::apply(collectorItems, collectionItems, weightedRelations);
      }
 
    private:
      void match(ACollectorItem& collectorItem, const std::vector<ACollectionItem>& collectionItems,
                 std::vector<typename Super::WeightedRelationItem>& relationsForCollector) override
      {
        std::map<const ACollectionItem*, unsigned int> numberOfIntersectionsMap;
 
        // Set the number of intersections to 0
        for (const ACollectionItem& collectionItem : collectionItems) {
          numberOfIntersectionsMap[&collectionItem] = 0;
        }
 
        // For each hit in the collector item: Get all collection items for this hit and increase the number of intersections
        for (const auto& hit : collectorItem) {
          const CDCWireHit& wireHit = hit.getWireHit();
 
          // Get all matched collection items
          const auto& relatedCollectionItems = m_hitLookup.equal_range(&wireHit);
 
          for (auto& relatedCollectionItemIterator : asRange(relatedCollectionItems)) {
            const ACollectionItem* collectionItem = relatedCollectionItemIterator.second;
            numberOfIntersectionsMap[collectionItem] += 1;
          }
        }
 
        // Add new relations to the list
        for (const auto& collectionWithIntersections : numberOfIntersectionsMap) {
          const ACollectionItem* collectionItem = collectionWithIntersections.first;
          unsigned int numberOfIntersections = collectionWithIntersections.second;
 
          relationsForCollector.emplace_back(&collectorItem, numberOfIntersections, collectionItem);
        }
      }
 
      std::multimap<const CDCWireHit*, const ACollectionItem*> m_hitLookup;
    };
  }
}