IdealBTree.hpp

Go to the documentation of this file.

#ifndef _IDEALBTREE_HPP_INCLUDED_
#define _IDEALBTREE_HPP_INCLUDED_

#include "BTree.hpp"


template <typename T, unsigned int BlockSize>
constexpr auto maxBTreeOrder() {
    constexpr auto c = 3 * sizeof(long) + sizeof(bool) + sizeof(std::size_t) + sizeof(T);
    static_assert(c < BlockSize, "B-tree order will be negative, consider increasing blockSize");

    constexpr auto M = (BlockSize - c) / (2 * (sizeof(T) + sizeof(long)));
    static_assert(M >= 1, "Type T too big, consider increasing blockSize");

    return M;
}


template <typename T, unsigned int BlockSize = BLOCK_SIZE>
using IdealBTree = BTree<T, maxBTreeOrder<T, BlockSize>(), BlockSize>;

#endif //_IDEALBTREE_HPP_INCLUDED_