FPGATrackSimBinArray.h

Go to the documentation of this file.

// Copyright (C) 2002-2024 CERN for the benefit of the ATLAS collaboration
#ifndef FPGATrackSimBinArray_H
#define FPGATrackSimBinArray_H

 
 
#include <vector>
#include <string>
#include <stdexcept>
#include <utility>
 
#include "CxxUtils/checker_macros.h"
 
template <typename T>
class FPGATrackSimBinArray
{
public:
    // constructors
    FPGATrackSimBinArray() = default;
    FPGATrackSimBinArray(const std::vector<unsigned int> &dims, const T &initval)
    {
        setsize(dims, initval);
    }
 
    // resize the array (need to provide reference to initialize elements to)
    void setsize(const std::vector<unsigned int> &dims, const T &initval)
    {
        m_dims = dims;
 
        // Caclulate the number of entries and a "step"-size needed for translating
        // N-dim indices into a 1-d index
        m_entries = 1;
        for (auto &dim : dims)
        {
            m_step.push_back(m_entries);
            m_entries *= dim;
        }
 
        // Allocate 1-d array
        m_data.resize(m_entries, initval);
    }
 
    // full size of the array (i.e. product of the size in each dimension)
    unsigned int size() const { return m_entries; }
 
    // access to internal 1-d std::vector as a const so that you can
    // use various std::count and std::for_each on the elements
    // note you can change the vector because it's const, but you can
    // change the elements
    const std::vector<T>& flatdata() const {return m_data;}
 
    // get the array with the size in each dimension of the
    const std::vector<unsigned int> &dims() const { return m_dims; }
 
    // Check if index is a valid entry
    bool isValid(const std::vector<unsigned int> &idx) const {
        if (idx.size() != m_dims.size()) return false;
        for (unsigned int i = 0; i < m_dims.size(); i++)
        {
            if (idx[i]>=m_dims[i]) return false;            
        }
        return true;
    }
 
    // look up content by idx specified as a std::vector<unsigned int>
    const T &operator[](const std::vector<unsigned int> &idx) const
    {
        if(idx.size() != m_step.size()) {
            throw std::runtime_error("FPGATrackSimBinArray: index size does not match array dimensions");
        }
 
        // Translate N-dim index to 1-d index
        unsigned int offset = 0;
        for (unsigned int i = 0; i < m_step.size(); i++)
        {
            if (idx.at(i) >= m_dims.at(i))
            {
                throw std::runtime_error("FPGATrackSimBinArray: index out of range i=" + std::to_string(i) +
                     " idx[i]=" + std::to_string(idx.at(i)) +
                     " dims[i]=" + std::to_string(m_dims.at(i)) + "\n");
            }
            offset += idx.at(i) * m_step.at(i);
        }
 
        // Return data from 1-d vector
        return m_data.at(offset);
    }
 
    // convient to also be able to use a signed integer vector
    const T &operator[](const std::vector<int> &idx) const
    {
        std::vector<unsigned int> idx_unsigned;
        for (auto &d : idx)
            idx_unsigned.push_back(d);
        return (*this)[idx_unsigned];
    }
 
    // make non-const version of the operator[] 
    // just call the const version and cast away the constness
    // of the return value
    T& operator[](const std::vector<int> &idx) {
      T& retv ATLAS_THREAD_SAFE = const_cast<T&>(std::as_const(*this)[idx]);
      return retv;
    }
    T& operator[](const std::vector<unsigned> &idx) {
      T &retv ATLAS_THREAD_SAFE = const_cast<T &>(std::as_const(*this)[idx]);
      return retv;
    }
 
    // ConstIterator implemenation
    struct ConstIterator
    {
      using value_type = FPGATrackSimBinArray<T>::ConstIterator;
      using iterator_category = std::forward_iterator_tag;
      using container_type = const FPGATrackSimBinArray<T>;
      using difference_type = void;
      using pointer = FPGATrackSimBinArray<T>::ConstIterator*;
      using reference = FPGATrackSimBinArray<T>::ConstIterator &;
 
      // Constructor
      ConstIterator(const std::vector<unsigned int> &idx,
               const FPGATrackSimBinArray<T> &itrdata)
          : m_idx(idx), m_itrdata(itrdata) {
        if (m_idx.size() != m_itrdata.dims().size()) {
          throw std::runtime_error(
              "FPGATrackSimBinArray::Interator array size mismatch in "
              "constructor");
        }
        }
 
        ConstIterator &operator*()  { return *this; }
        ConstIterator *operator->() { return this; }
 
        // Prefix increment
        ConstIterator &operator++()
        {
            ++m_idx.at(0);
            for (unsigned int i = 0; i < m_idx.size() - 1; i++)
            {
                if (m_idx.at(i) >= m_itrdata.dims().at(i))
                {
                    ++m_idx.at(i + 1);
                    m_idx.at(i) = 0;
                }
            }
            return *this;
        }
 
        const std::vector<unsigned int> &idx() const { return m_idx; }
        const T &data() { return m_itrdata[m_idx]; }
 
        // Postfix increment
        ConstIterator operator++(int)
        {
            ConstIterator tmp = *this;
            ++(*this);
            return tmp;
        }
 
        friend bool operator==(const ConstIterator &a, const ConstIterator &b) { return a.m_idx == b.m_idx; };
        friend bool operator!=(const ConstIterator &a, const ConstIterator &b)
        {
            return a.m_idx != b.m_idx;
        };
 
    private:
        // current state of the iterator
        std::vector<unsigned int> m_idx;
 
        // reference back to the array being iterated over
        const FPGATrackSimBinArray<T> &m_itrdata;
    };
 
    // Iterator implemenation
    struct Iterator : public ConstIterator
    {
      using value_type = FPGATrackSimBinArray<T>::Iterator;
      using iterator_category = std::forward_iterator_tag;
      using container_type = FPGATrackSimBinArray<T>;
      using difference_type = void;
      using pointer = FPGATrackSimBinArray<T>::Iterator*;
      using reference = FPGATrackSimBinArray<T>::Iterator &;
 
      // Constructor
      Iterator(const std::vector<unsigned int> &idx,
               FPGATrackSimBinArray<T> &itrdata)
          : ConstIterator(idx,itrdata) {}
 
        Iterator &operator*()  { return *this; }
        Iterator *operator->() { return this; }
 
        // Prefix increment
        Iterator &operator++()
        {
            ++(*(ConstIterator*)this);
            return *this;
        }
 
        // Call const version and cast away const
        T &data() {
            T &retv ATLAS_THREAD_SAFE = const_cast<T &>(((ConstIterator*)this)->data());
            return retv;
        }
 
        // Postfix increment
        Iterator operator++(int)
        {
            Iterator tmp = *this;
            ++(*this);
            return tmp;
        }
 
        friend bool operator==(const Iterator &a, const Iterator &b) { return (ConstIterator&)a == (ConstIterator&)b; }
        friend bool operator!=(const Iterator &a, const Iterator &b) { return (ConstIterator&)a != (ConstIterator&)b; }        
    };
 
    // ussual std iterator meanings of begin, end, and size
    Iterator begin() { return Iterator(std::vector<unsigned int>(m_dims.size(), 0), *this); }
    Iterator end() 
    {
        std::vector<unsigned int> retv;
        for (auto &d : m_dims)
            retv.push_back(d - 1);
        return ++Iterator(retv, *this);
    }
 
    auto begin() const { return ConstIterator(std::vector<unsigned int>(m_dims.size(), 0), *this); }
    auto end() const
    {
        std::vector<unsigned int> retv;
        for (auto &d : m_dims)
            retv.push_back(d - 1);
        return ++ConstIterator(retv, *this);
    }
 
 
private:
    unsigned int m_entries{};
    std::vector<unsigned int> m_dims{};
    std::vector<unsigned int> m_step{};
    std::vector<T> m_data{};
};
 
#endif // FPGATrackSimBinArray_H