maps.h

Go to the documentation of this file.

#ifndef MAPS_H
#define MAPS_H
 
#include "allocator.h"
#include "couple.h"
#include "hash.h"
#include "hashTable.h"
#include "map.h"
#include "ownerPtr.h"
#include "comparator.h"
#include "RBTree.h"
 
 
namespace original {
 
    template <typename K_TYPE,
              typename V_TYPE,
              typename HASH = hash<K_TYPE>,
              typename ALLOC = allocator<couple<const K_TYPE, V_TYPE>>>
    class hashMap final
                : public hashTable<K_TYPE, V_TYPE, ALLOC, HASH>,
                  public map<K_TYPE, V_TYPE, ALLOC>,
                  public iterable<couple<const K_TYPE, V_TYPE>>,
                  public printable{
 
        using hashNode = typename hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::hashNode;
 
        using rebind_alloc_pointer = typename hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::rebind_alloc_pointer;
    public:
 
            class Iterator final : public hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator,
                                   public baseIterator<couple<const K_TYPE, V_TYPE>> {
 
                explicit Iterator(vector<hashNode*, rebind_alloc_pointer>* buckets = nullptr,
                                  u_integer bucket = 0, hashNode* node = nullptr);
 
                bool equalPtr(const iterator<couple<const K_TYPE, V_TYPE>>* other) const override;
            public:
                friend class hashMap;
 
                Iterator(const Iterator& other);
 
                Iterator& operator=(const Iterator& other);
 
                Iterator* clone() const override;
 
                [[nodiscard]] std::string className() const override;
 
                void operator+=(integer steps) const override;
 
                void operator-=(integer steps) const override;
 
                integer operator-(const iterator<couple<const K_TYPE, V_TYPE>> &other) const override;
 
                [[nodiscard]] bool hasNext() const override;
 
                [[nodiscard]] bool hasPrev() const override;
 
                bool atPrev(const iterator<couple<const K_TYPE, V_TYPE>>* other) const override;
 
                bool atNext(const iterator<couple<const K_TYPE, V_TYPE>>* other) const override;
 
                void next() const override;
 
                void prev() const override;
 
                Iterator* getPrev() const override;
 
                couple<const K_TYPE, V_TYPE> &get() override;
 
                couple<const K_TYPE, V_TYPE> get() const override;
 
                void set(const couple<const K_TYPE, V_TYPE> &data) override;
 
                [[nodiscard]] bool isValid() const override;
 
                ~Iterator() override = default;
            };
 
            explicit hashMap(HASH hash = HASH{}, ALLOC alloc = ALLOC{});
 
            hashMap(const hashMap& other);
 
            hashMap& operator=(const hashMap& other);
 
            hashMap(hashMap&& other) noexcept;
 
            hashMap& operator=(hashMap&& other) noexcept;
 
            [[nodiscard]] u_integer size() const override;
 
            bool contains(const couple<const K_TYPE, V_TYPE> &e) const override;
 
            bool add(const K_TYPE &k, const V_TYPE &v) override;
 
            bool remove(const K_TYPE &k) override;
 
            [[nodiscard]] bool containsKey(const K_TYPE &k) const override;
 
            V_TYPE get(const K_TYPE &k) const override;
 
            bool update(const K_TYPE &key, const V_TYPE &value) override;
 
            const V_TYPE & operator[](const K_TYPE &k) const override;
 
            V_TYPE & operator[](const K_TYPE &k) override;
 
            Iterator* begins() const override;
 
            Iterator* ends() const override;
 
            [[nodiscard]] std::string className() const override;
 
            [[nodiscard]] std::string toString(bool enter) const override;
 
            ~hashMap() override;
    };
 
    template <typename K_TYPE,
              typename V_TYPE,
              typename Compare = increaseComparator<K_TYPE>,
              typename ALLOC = allocator<couple<const K_TYPE, V_TYPE>>>
    class treeMap final : public RBTree<K_TYPE, V_TYPE, ALLOC, Compare>,
                          public map<K_TYPE, V_TYPE, ALLOC>,
                          public iterable<couple<const K_TYPE, V_TYPE>>,
                          public printable {
 
        using RBTreeType = RBTree<K_TYPE, V_TYPE, ALLOC, Compare>;
 
        using RBNode = typename RBTreeType::RBNode;
    public:
 
        class Iterator final : public RBTreeType::Iterator,
                               public baseIterator<couple<const K_TYPE, V_TYPE>> {
        explicit Iterator(RBTreeType* tree, RBNode* cur);
 
        bool equalPtr(const iterator<couple<const K_TYPE, V_TYPE>>* other) const override;
    public:
        friend class treeMap;
 
        Iterator(const Iterator& other);
 
        Iterator& operator=(const Iterator& other);
 
        Iterator* clone() const override;
 
        [[nodiscard]] std::string className() const override;
 
        void operator+=(integer steps) const override;
 
        void operator-=(integer steps) const override;
 
        integer operator-(const iterator<couple<const K_TYPE, V_TYPE>> &other) const override;
 
        [[nodiscard]] bool hasNext() const override;
 
        [[nodiscard]] bool hasPrev() const override;
 
        bool atPrev(const iterator<couple<const K_TYPE, V_TYPE>>* other) const override;
 
        bool atNext(const iterator<couple<const K_TYPE, V_TYPE>>* other) const override;
 
        void next() const override;
 
        void prev() const override;
 
        Iterator* getPrev() const override;
 
        couple<const K_TYPE, V_TYPE> &get() override;
 
        couple<const K_TYPE, V_TYPE> get() const override;
 
        void set(const couple<const K_TYPE, V_TYPE> &data) override;
 
        [[nodiscard]] bool isValid() const override;
 
        ~Iterator() override = default;
    };
 
        friend class Iterator;
 
        explicit treeMap(Compare comp = Compare{}, ALLOC alloc = ALLOC{});
 
        treeMap(const treeMap& other);
 
        treeMap& operator=(const treeMap& other);
 
        treeMap(treeMap&& other) noexcept;
 
        treeMap& operator=(treeMap&& other) noexcept;
 
        [[nodiscard]] u_integer size() const override;
 
        bool contains(const couple<const K_TYPE, V_TYPE> &e) const override;
 
        bool add(const K_TYPE &k, const V_TYPE &v) override;
 
        bool remove(const K_TYPE &k) override;
 
        [[nodiscard]] bool containsKey(const K_TYPE &k) const override;
 
        V_TYPE get(const K_TYPE &k) const override;
 
        bool update(const K_TYPE &key, const V_TYPE &value) override;
 
        const V_TYPE & operator[](const K_TYPE &k) const override;
 
        V_TYPE & operator[](const K_TYPE &k) override;
 
        Iterator* begins() const override;
 
        Iterator* ends() const override;
 
        [[nodiscard]] std::string className() const override;
 
        [[nodiscard]] std::string toString(bool enter) const override;
 
        ~treeMap() override;
    };
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::Iterator(
    vector<hashNode *, rebind_alloc_pointer> *buckets, u_integer bucket, hashNode *node)
    : hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator(
        const_cast<vector<hashNode*, rebind_alloc_pointer>*>(buckets), bucket, node) {}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::equalPtr(
        const iterator<couple<const K_TYPE, V_TYPE>>* other) const {
    auto other_it = dynamic_cast<const Iterator*>(other);
    return other_it &&
           this->p_buckets == other_it->p_buckets &&
           this->cur_bucket == other_it->cur_bucket &&
           this->p_node == other_it->p_node;
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::Iterator(const Iterator &other) : Iterator() {
    this->operator=(other);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
typename original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator&
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::operator=(const Iterator &other) {
    if (this == &other)
        return *this;
 
    hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator::operator=(other);
    return *this;
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
typename original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator*
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::clone() const {
    return new Iterator(*this);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
std::string original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::className() const {
    return "hashMap::Iterator";
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
void original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::operator+=(integer steps) const {
    hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator::operator+=(steps);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
void original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::operator-=(integer) const {
    throw unSupportedMethodError();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::integer original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::operator-(
        const iterator<couple<const K_TYPE, V_TYPE>>&) const {
    throw unSupportedMethodError();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::hasNext() const {
    return hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator::hasNext();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::hasPrev() const {
    throw unSupportedMethodError();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::atPrev(
        const iterator<couple<const K_TYPE, V_TYPE>> *other) const {
    auto other_it = dynamic_cast<const Iterator*>(other);
    if (!other_it) {
        return false;
    }
    auto next = ownerPtr(this->clone());
    if (!next->isValid()){
        return false;
    }
 
    next->next();
    return next->equalPtr(other_it);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::atNext(
        const iterator<couple<const K_TYPE, V_TYPE>> *other) const {
    return other->atPrev(*this);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
void original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::next() const {
    hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator::next();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
void original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::prev() const {
    throw unSupportedMethodError();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
typename original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator*
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::getPrev() const {
    throw unSupportedMethodError();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::couple<const K_TYPE, V_TYPE>&
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::get() {
    return hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator::get();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::couple<const K_TYPE, V_TYPE>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::get() const {
    return hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator::get();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
void original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::set(const couple<const K_TYPE, V_TYPE>&) {
    throw unSupportedMethodError();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator::isValid() const {
    return hashTable<K_TYPE, V_TYPE, ALLOC, HASH>::Iterator::isValid();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::hashMap(HASH hash, ALLOC alloc)
    : hashTable<K_TYPE, V_TYPE, ALLOC, HASH>(std::move(hash)),
      map<K_TYPE, V_TYPE, ALLOC>(std::move(alloc)) {}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::hashMap(const hashMap &other) : hashMap() {
    this->operator=(other);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>&
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::operator=(const hashMap &other) {
    if (this == &other) {
        return *this;
    }
 
    this->buckets = this->bucketsCopy(other.buckets);
    this->size_ = other.size_;
    if constexpr(ALLOC::propagate_on_container_copy_assignment::value) {
        this->allocator = other.allocator;
        this->rebind_alloc = other.rebind_alloc;
    }
    return *this;
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::hashMap(hashMap &&other) noexcept : hashMap() {
    this->operator=(std::move(other));
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>&
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::operator=(hashMap &&other) noexcept {
    if (this == &other) {
        return *this;
    }
 
    this->buckets = std::move(other.buckets);
    this->size_ = other.size_;
    other.size_ = 0;
    if constexpr(ALLOC::propagate_on_container_move_assignment::value) {
        this->allocator = std::move(other.allocator);
        this->rebind_alloc = std::move(other.rebind_alloc);
    }
    return *this;
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::u_integer
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::size() const {
    return this->size_;
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::contains(const couple<const K_TYPE, V_TYPE> &e) const {
    return this->containsKey(e.first()) && this->get(e.first()) == e.second();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::add(const K_TYPE &k, const V_TYPE &v) {
    return this->insert(k, v);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::remove(const K_TYPE &k) {
    return this->erase(k);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::containsKey(const K_TYPE &k) const {
    return this->find(k);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
V_TYPE original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::get(const K_TYPE &k) const {
    auto node = this->find(k);
    if (!node)
        throw noElementError();
    return node->getValue();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
bool original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::update(const K_TYPE &key, const V_TYPE &value) {
    return this->modify(key, value);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
const V_TYPE& original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::operator[](const K_TYPE &k) const {
    auto node = this->find(k);
    if (!node)
        throw noElementError();
    return node->getValue();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
V_TYPE& original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::operator[](const K_TYPE &k) {
    auto node = this->find(k);
    if (!node) {
        this->insert(k, V_TYPE{});
        node = this->find(k);
    }
    return node->getValue();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
typename original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator*
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::begins() const {
    auto p_buckets = const_cast<vector<hashNode*, rebind_alloc_pointer>*>(&this->buckets);
    if (this->buckets[0]) {
        return new Iterator(p_buckets, 0, this->buckets[0]);
    }
    auto bucket = Iterator::findNextValidBucket(p_buckets, 0);
    return new Iterator(p_buckets, bucket, p_buckets->get(bucket));
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
typename original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::Iterator*
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::ends() const {
    auto p_buckets = const_cast<vector<hashNode*, rebind_alloc_pointer>*>(&this->buckets);
    auto bucket = Iterator::findPrevValidBucket(p_buckets, this->buckets.size());
    auto node = this->buckets[bucket];
    while (node && node->getPNext()) {
        node = node->getPNext();
    }
    return new Iterator(p_buckets, bucket, node);
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
std::string original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::className() const {
    return "hashMap";
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
std::string original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::toString(const bool enter) const {
    std::stringstream ss;
    ss << this->className();
    ss << "(";
    bool first = true;
    for (auto it = this->begin(); it != this->end(); it.next()){
        if (!first){
            ss << ", ";
        }
        ss << "{" << printable::formatString(it.get().template get<0>()) << ": "
           << printable::formatString(it.get().template get<1>()) << "}";
        first = false;
    }
    ss << ")";
    if (enter)
        ss << "\n";
    return ss.str();
}
 
template<typename K_TYPE, typename V_TYPE, typename HASH, typename ALLOC>
original::hashMap<K_TYPE, V_TYPE, HASH, ALLOC>::~hashMap() = default;
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::Iterator(RBTreeType* tree, RBNode* cur)
    : RBTreeType::Iterator(tree, cur)  {}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::equalPtr(
    const iterator<couple<const K_TYPE, V_TYPE>>* other) const
{
    auto other_it = dynamic_cast<const Iterator*>(other);
    return other_it &&
           this->tree_ == other_it->tree_ &&
           this->cur_ == other_it->cur_;
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::Iterator(const Iterator& other) : Iterator(nullptr, nullptr)
{
    this->operator=(other);
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
typename original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator&
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::operator=(const Iterator& other)
{
    if (this == &other) {
        return *this;
    }
 
    this->tree_ = other.tree_;
    this->cur_ = other.cur_;
    return *this;
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
typename original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator*
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::clone() const
{
    return new Iterator(*this);
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
std::string original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::className() const
{
    return "treeMap::Iterator";
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
void original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::operator+=(integer steps) const
{
    RBTreeType::Iterator::operator+=(steps);
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
void original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::operator-=(integer steps) const
{
    RBTreeType::Iterator::operator-=(steps);
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::integer
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::operator-(
    const iterator<couple<const K_TYPE, V_TYPE>>& other) const
{
    throw unSupportedMethodError();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::hasNext() const
{
    return RBTreeType::Iterator::hasNext();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::hasPrev() const
{
    return RBTreeType::Iterator::hasPrev();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::atPrev(
    const iterator<couple<const K_TYPE, V_TYPE>>* other) const
{
    auto other_it = dynamic_cast<const Iterator*>(other);
    if (!other_it) {
        return false;
    }
    auto next = ownerPtr(this->clone());
    if (!next->isValid()){
        return false;
    }
 
    next->next();
    return next->equalPtr(other_it);
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::atNext(
    const iterator<couple<const K_TYPE, V_TYPE>>* other) const
{
    return other->atNext(*this);
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
void original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::next() const
{
    RBTreeType::Iterator::next();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
void original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::prev() const
{
    RBTreeType::Iterator::prev();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
typename original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator*
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::getPrev() const
{
    auto it = this->clone();
    it->prev();
    return it;
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::couple<const K_TYPE, V_TYPE>& original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::get()
{
    return RBTreeType::Iterator::get();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::couple<const K_TYPE, V_TYPE> original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::get() const
{
    return RBTreeType::Iterator::get();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
void original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::set(const couple<const K_TYPE, V_TYPE>& data)
{
    throw unSupportedMethodError();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator::isValid() const
{
    return RBTreeType::Iterator::isValid();
}
 
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::treeMap(Compare comp, ALLOC alloc)
    : RBTreeType(std::move(comp)),
      map<K_TYPE, V_TYPE, ALLOC>(std::move(alloc)) {}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::treeMap(const treeMap& other) : treeMap() {
    this->operator=(other);
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>&
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::operator=(const treeMap& other) {
    if (this == &other){
        return *this;
    }
 
    this->destroyTree();
    this->root_ = other.treeCopy();
    this->size_ = other.size_;
    if constexpr(ALLOC::propagate_on_container_copy_assignment::value) {
        this->allocator = other.allocator;
        this->rebind_alloc = other.rebind_alloc;
    }
    return *this;
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::treeMap(treeMap&& other) noexcept : treeMap() {
    this->operator=(std::move(other));
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>&
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::operator=(treeMap&& other) noexcept {
    if (this == &other){
        return *this;
    }
 
    this->root_ = other.root_;
    other.root_ = nullptr;
    this->size_ = other.size_;
    other.size_ = 0;
    if constexpr(ALLOC::propagate_on_container_move_assignment::value) {
        this->allocator = std::move(other.allocator);
        this->rebind_alloc = std::move(other.rebind_alloc);
    }
    return *this;
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::u_integer original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::size() const {
    return this->size_;
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::contains(const couple<const K_TYPE, V_TYPE> &e) const {
    return this->containsKey(e.first()) && this->get(e.first()) == e.second();
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::add(const K_TYPE &k, const V_TYPE &v) {
    return this->insert(k, v);
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::remove(const K_TYPE &k) {
    return this->erase(k);
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::containsKey(const K_TYPE &k) const {
    return this->find(k);
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
V_TYPE original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::get(const K_TYPE &k) const {
    auto node = this->find(k);
    if (!node)
        throw noElementError();
    return node->getValue();
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
bool original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::update(const K_TYPE &key, const V_TYPE &value) {
    return this->modify(key, value);
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
const V_TYPE &original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::operator[](const K_TYPE &k) const {
    auto node = this->find(k);
    if (!node)
        throw noElementError();
    return node->getValue();
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
V_TYPE &original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::operator[](const K_TYPE &k) {
    auto node = this->find(k);
    if (!node) {
        this->insert(k, V_TYPE{});
        node = this->find(k);
    }
    return node->getValue();
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
typename original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator*
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::begins() const
{
    return new Iterator(const_cast<treeMap*>(this), this->getMinNode());
}
 
template <typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
typename original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::Iterator*
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::ends() const
{
    return new Iterator(const_cast<treeMap*>(this), this->getMaxNode());
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
std::string original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::className() const {
    return "treeMap";
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
std::string original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::toString(const bool enter) const {
    std::stringstream ss;
    ss << this->className();
    ss << "(";
    bool first = true;
    for (auto it = this->begin(); it != this->end(); it.next()){
        if (!first){
            ss << ", ";
        }
        ss << "{" << printable::formatString(it.get().template get<0>()) << ": "
           << printable::formatString(it.get().template get<1>()) << "}";
        first = false;
    }
    ss << ")";
    if (enter)
        ss << "\n";
    return ss.str();
}
 
template<typename K_TYPE, typename V_TYPE, typename Compare, typename ALLOC>
original::treeMap<K_TYPE, V_TYPE, Compare, ALLOC>::~treeMap() = default;
 
#endif //MAPS_H