KeyValBox.h

/**************************************************************************
 * BASF2 (Belle Analysis Framework 2)                                     *
 * Copyright(C) 2015 - Belle II Collaboration                             *
 *                                                                        *
 * Author: The Belle II Collaboration                                     *
 * Contributors: Jakob Lettenbichler                                      *
 *                                                                        *
 * This software is provided "as is" without any warranty.                *
 **************************************************************************/
#pragma once
 
// stl:
#include <vector>
#include <utility> // for pair
#include <algorithm> // for find_if
 
 
namespace Belle2 {
  template<class KeyType, class ValueType>
  class KeyValBox {
  protected:
 
    std::vector<std::pair<KeyType, ValueType> > m_container;
 
  public:
 
    using BoxEntry = std::pair<KeyType, ValueType>;
 
 
    using Iterator = typename std::vector<BoxEntry>::iterator;
 
 
    using ConstIterator = typename std::vector<BoxEntry>::const_iterator;
 
 
    ValueType* find(const KeyType& aKey)
    {
      Iterator foundPos = std::find_if(
                            m_container.begin(),
                            m_container.end(),
                            [&](const BoxEntry & entry) -> bool
      { return entry.first == aKey; }
                          );
      return (foundPos == m_container.end() ? nullptr : &foundPos->second);
    }
 
 
    void push_back(std::pair<KeyType, ValueType>& newPair) { m_container.push_back(newPair); }
 
 
    void push_back(std::pair<KeyType, ValueType> newPair) { m_container.push_back(newPair); }
 
 
    Iterator begin() { return m_container.begin(); }
 
 
    ConstIterator begin() const { return m_container.begin(); }
 
 
    Iterator end() { return m_container.end(); }
 
 
    ConstIterator end() const { return m_container.end(); }
 
 
    unsigned int size() const { return m_container.size(); }
  };
 
}