trie_node.cpp

Go to the documentation of this file.

#include "storage/trie/polkadot_trie/trie_node.hpp"

namespace kagome::storage::trie {

  int BranchNode::getType() const {
    return static_cast<int>(value ? TrieNode::Type::BranchWithValue
                                  : TrieNode::Type::BranchEmptyValue);
  }

  uint16_t BranchNode::childrenBitmap() const {
    uint16_t bitmap = 0u;
    for (auto i = 0u; i < kMaxChildren; i++) {
      if (children.at(i)) {
        bitmap = bitmap | 1u << i;
      }
    }
    return bitmap;
  }

  uint8_t BranchNode::childrenNum() const {
    return std::count_if(children.begin(),
                         children.end(),
                         [](const auto &child) { return child; });
  }

  int LeafNode::getType() const {
    return static_cast<int>(TrieNode::Type::Leaf);
  }

  int BranchContainingHashesNode::getType() const {
    return static_cast<int>(TrieNode::Type::BranchContainingHashes);
  }

  uint16_t BranchContainingHashesNode::childrenBitmap() const {
    uint16_t bitmap = 0u;
    for (auto i = 0u; i < kMaxChildren; i++) {
      if (children.at(i)) {
        bitmap = bitmap | 1u << i;
      }
    }
    return bitmap;
  }

  uint8_t BranchContainingHashesNode::childrenNum() const {
    return std::count_if(children.begin(),
                         children.end(),
                         [](const auto &child) { return child; });
  }

  int LeafContainingHashesNode::getType() const {
    return static_cast<int>(TrieNode::Type::LeafContainingHashes);
  }

}  // namespace kagome::storage::trie