CppUtils::Container::BTree::Node<class K, class V>

Types publics

Key

using CppUtils::Container::BTree::Node<K, V>::Key = K;

Value

using CppUtils::Container::BTree::Node<K, V>::Value = V;

Attributs publics

bool isLeaf = true;

std::size_t maxNumberOfKeys;

std::vector<Key> keys;

std::vector<std::unique_ptr<Value>> values;

std::vector<std::unique_ptr<Node>> children;

Méthodes publiques

explicit Node::Node(bool isLeaf = true, std::size_t maxNumberOfKeys = 4);

[[nodiscard]] constexpr auto Node::size() const noexcept -> std::size_t;

[[nodiscard]] constexpr auto Node::exists(const Key& key) const noexcept -> bool;

[[nodiscard]] constexpr auto Node::empty() const noexcept -> bool;

auto Node::clear() noexcept -> void;

[[nodiscard]] auto Node::get(const Key& key) -> decltype(auto);

auto Node::add(const Key& key, Value&& value) -> void;

auto Node::remove(const Key& key) -> void;

[[nodiscard]] auto Node::operator[](const Key& key) -> decltype(auto);