polynomial_store.hpp

#pragma once
 
#include "barretenberg/common/assert.hpp"
#include "barretenberg/polynomials/polynomial.hpp"
#include <cstddef>
#include <map>
#include <string>
#include <unordered_map>
 
namespace proof_system {
 
template <typename Fr> class PolynomialStore {
  private:
    using Polynomial = barretenberg::Polynomial<Fr>;
    std::unordered_map<std::string, Polynomial> polynomial_map;
 
  public:
    void put(std::string const& key, Polynomial&& value);
 
    Polynomial get(std::string const& key);
 
    void remove(std::string const& key);
 
    size_t get_size_in_bytes() const;
 
    void print();
 
    // Basic map methods
    bool contains(std::string const& key) { return polynomial_map.contains(key); };
    size_t size() { return polynomial_map.size(); };
 
    // Allow for const range based for loop
    typename std::unordered_map<std::string, Polynomial>::const_iterator begin() const
    {
        return polynomial_map.begin();
    }
    typename std::unordered_map<std::string, Polynomial>::const_iterator end() const { return polynomial_map.end(); }
};
 
extern template class PolynomialStore<barretenberg::fr>;
 
} // namespace proof_system