Auctioneer.hpp

Go to the documentation of this file. Or view the newest version in sPHENIX GitHub for file Auctioneer.hpp

// This file is part of the Acts project.
//
// Copyright (C) 2016-2018 CERN for the benefit of the Acts project
//
// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.

#pragma once

#include <algorithm>
#include <array>

namespace Acts {
namespace detail {

struct VoidAuctioneer {
  VoidAuctioneer() = default;

  template <long unsigned int N>
  std::array<bool, N> operator()(std::array<int, N> vCandidates) const {
    std::array<bool, N> valids{};

    for (unsigned int i = 0; i < vCandidates.size(); i++) {
      valids[i] = (vCandidates[i] > 0) ? true : false;
    }
    return valids;
  }
};

struct FirstValidAuctioneer {
  FirstValidAuctioneer() = default;

  template <long unsigned int N>
  std::array<bool, N> operator()(std::array<int, N> vCandidates) const {
    std::array<bool, N> valids = {};

    for (unsigned int i = 0; i < vCandidates.size(); i++) {
      if (vCandidates[i] > 0) {
        valids[i] = true;
        return valids;
      }
    }
    return valids;
  }
};

struct HighestValidAuctioneer {
  HighestValidAuctioneer() = default;

  template <long unsigned int N>
  std::array<bool, N> operator()(std::array<int, N> vCandidates) const {
    std::array<bool, N> valids = {};

    auto highscore = std::max_element(vCandidates.begin(), vCandidates.end());
    valids.at(std::distance(vCandidates.begin(), highscore)) = true;

    return valids;
  }
};

}  // namespace detail
}  // namespace Acts