KnownFormats.h

#pragma once
 
#include <xrpl/basics/contract.h>
#include <xrpl/beast/type_name.h>
#include <xrpl/protocol/SOTemplate.h>
 
#include <boost/container/flat_map.hpp>
 
#include <algorithm>
#include <forward_list>
 
namespace xrpl {
 
template <class KeyType, class Derived>
class KnownFormats
{
public:
    class Item
    {
    public:
        Item(
            char const* name,
            KeyType type,
            std::initializer_list<SOElement> uniqueFields,
            std::initializer_list<SOElement> commonFields)
            : soTemplate_(uniqueFields, commonFields), name_(name), type_(type)
        {
            // Verify that KeyType is appropriate.
            static_assert(
                std::is_enum<KeyType>::value || std::is_integral<KeyType>::value,
                "KnownFormats KeyType must be integral or enum.");
        }
 
        std::string const&
        getName() const
        {
            return name_;
        }
 
        KeyType
        getType() const
        {
            return type_;
        }
 
        SOTemplate const&
        getSOTemplate() const
        {
            return soTemplate_;
        }
 
    private:
        SOTemplate soTemplate_;
        std::string const name_;
        KeyType const type_;
    };
 
    KnownFormats() : name_(beast::type_name<Derived>())
    {
    }
 
    virtual ~KnownFormats() = default;
    KnownFormats(KnownFormats const&) = delete;
    KnownFormats&
    operator=(KnownFormats const&) = delete;
 
    KeyType
    findTypeByName(std::string const& name) const
    {
        if (auto const result = findByName(name))
            return result->getType();
        Throw<std::runtime_error>(
            name_ + ": Unknown format name '" + name.substr(0, std::min(name.size(), std::size_t(32))) + "'");
    }
 
    Item const*
    findByType(KeyType type) const
    {
        auto const itr = types_.find(type);
        if (itr == types_.end())
            return nullptr;
        return itr->second;
    }
 
    // begin() and end() are provided for testing purposes.
    typename std::forward_list<Item>::const_iterator
    begin() const
    {
        return formats_.begin();
    }
 
    typename std::forward_list<Item>::const_iterator
    end() const
    {
        return formats_.end();
    }
 
protected:
    Item const*
    findByName(std::string const& name) const
    {
        auto const itr = names_.find(name);
        if (itr == names_.end())
            return nullptr;
        return itr->second;
    }
 
    Item const&
    add(char const* name,
        KeyType type,
        std::initializer_list<SOElement> uniqueFields,
        std::initializer_list<SOElement> commonFields = {})
    {
        if (auto const item = findByType(type))
        {
            LogicError(std::string("Duplicate key for item '") + name + "': already maps to " + item->getName());
        }
 
        formats_.emplace_front(name, type, uniqueFields, commonFields);
        Item const& item{formats_.front()};
 
        names_[name] = &item;
        types_[type] = &item;
 
        return item;
    }
 
private:
    std::string name_;
 
    // One of the situations where a std::forward_list is useful.  We want to
    // store each Item in a place where its address won't change.  So a node-
    // based container is appropriate.  But we don't need searchability.
    std::forward_list<Item> formats_;
 
    boost::container::flat_map<std::string, Item const*> names_;
    boost::container::flat_map<KeyType, Item const*> types_;
};
 
}  // namespace xrpl