Murats trie optimization

This commit is contained in:
Valentin Balaschenko
2025-06-12 14:36:55 +01:00
parent 6071c08a0e
commit 010e23ae9c

View File

@@ -35,8 +35,8 @@ namespace {
// element must be the number of children in a dense array.
constexpr std::array<std::uint8_t, 4> boundaries{
2,
4,
6,
3,
5,
SHAMapInnerNode::branchFactor};
static_assert(
boundaries.size() <= 4,