ordered_trie_hash.hpp

Go to the documentation of this file.

#ifndef KAGOME_ORDERED_TRIE_HASH_HPP
#define KAGOME_ORDERED_TRIE_HASH_HPP

#include "common/buffer.hpp"
#include "crypto/hasher.hpp"
#include "scale/scale.hpp"
#include "storage/trie/polkadot_trie/polkadot_trie_impl.hpp"
#include "storage/trie/serialization/polkadot_codec.hpp"

namespace kagome::storage::trie {

  template <typename It>
  outcome::result<common::Buffer> calculateOrderedTrieHash(const It &begin,
                                                           const It &end) {
    PolkadotTrieImpl trie;
    PolkadotCodec codec;
    // empty root
    if (begin == end) {
      static const auto empty_root =
          common::Buffer{}.put(codec.hash256(common::Buffer{0}));
      return empty_root;
    }
    static_assert(
        std::is_same_v<std::decay_t<decltype(*begin)>, common::Buffer>);
    It it = begin;
    scale::CompactInteger key = 0;
    while (it != end) {
      OUTCOME_TRY(enc, scale::encode(key++));
      OUTCOME_TRY(trie.put(common::Buffer{enc}, *it));
      it++;
    }
    OUTCOME_TRY(enc, codec.encodeNode(*trie.getRoot()));
    return common::Buffer{codec.hash256(enc)};
  }

  template <typename ContainerType>
  inline outcome::result<common::Buffer> calculateOrderedTrieHash(
      const ContainerType &container) {
    return calculateOrderedTrieHash(container.begin(), container.end());
  }

}  // namespace kagome::storage::trie

#endif  // KAGOME_ORDERED_TRIE_HASH_HPP