dictionary.hpp

Go to the documentation of this file.

#pragma once
#include "helpers/allocator.hpp"
#include "helpers/equator.hpp"
#include "helpers/hasher.hpp"
#include "helpers/iterator.hpp"
#include "idictionary.hpp"
#include "key_not_found_exception.hpp"
#include "../../argument_out_of_range_exception.hpp"
#include "../../new_ptr.hpp"
#include "../../ptr.hpp"
#include <cmath>
#include <unordered_map>

namespace xtd {
  namespace collections {
    namespace generic {
      template<class key_t, class value_t, class hasher_t = helpers::hasher<key_t>, class equator_t = helpers::equator<key_t>, class allocator_t = helpers::allocator<std::pair<const key_t, value_t >>>
      class dictionary : public xtd::object, public xtd::collections::generic::idictionary<key_t, value_t> {
      public:
        
        struct hasher {
          
          using argument_type = key_t;
          using result_type = xtd::size;
          
          
          size_t operator()(const key_t& key) const {
            if (comparer) return comparer->get_hash_code(key);
            return hasher_t {}(key);
          }

          
private:
          friend class dictionary;
          hasher() = default;
          explicit hasher(const iequality_comparer<key_t>* comparer) : comparer {comparer} {}
          const iequality_comparer<key_t>* comparer = nullptr;
        };
        
        struct equator {
          
          using first_argument_type = key_t;
          using second_argument_type = key_t;
          using result_type = bool;
          
          
          bool operator()(const key_t & a, const key_t & b) const {
            if (&a == &b) return true;
            if (comparer) return comparer->equals(a, b);
            return equator_t {}(a, b);
          }

          
private:
          friend class dictionary;
          equator() = default;
          explicit equator(const iequality_comparer < key_t > * comparer) : comparer {comparer} {}
          const iequality_comparer < key_t > * comparer = nullptr;
        };

        
        
        using key_type = typename xtd::collections::generic::idictionary < key_t, value_t >::key_type;
        using mapped_type = typename xtd::collections::generic::idictionary < key_t, value_t >::mapped_type;
        using value_type = typename xtd::collections::generic::idictionary < key_type, mapped_type >::value_type;
        using size_type = xtd::size;
        using base_value_type = std::pair < const key_t, value_t >;
        using base_type = std::unordered_map < key_type, mapped_type, hasher, equator, allocator_t >;
        using key_collection = typename xtd::collections::generic::idictionary < key_type, mapped_type >::key_collection;
        using value_collection = typename xtd::collections::generic::idictionary < key_type, mapped_type >::value_collection;
        
        
        dictionary() noexcept = default;
        dictionary(const idictionary < key_t, value_t > & dictionary) {
          ensure_capacity(dictionary.count());
          for (const auto& item : dictionary)
            add(item);
        }

        dictionary(const ienumerable < value_type > & collection) {
          for (const auto& item : collection)
            add(item);
        }

        template < class equality_comparer_t >
        dictionary(const equality_comparer_t& comparer) : data_(xtd::new_ptr < dictionary_data > (new_ptr < equality_comparer_t > (comparer))) {}
        dictionary(size_t capacity) {
          ensure_capacity(capacity);
        }

        template < class equality_comparer_t >
        dictionary(size_t capacity, const equality_comparer_t& comparer) : data_(xtd::new_ptr < dictionary_data > (new_ptr < equality_comparer_t > (comparer))) {
          ensure_capacity(capacity);
        }

        template < class equality_comparer_t >
        dictionary(const idictionary < key_t, value_t > & dictionary, const equality_comparer_t& comparer) : data_(xtd::new_ptr < dictionary_data>(new_ptr < equality_comparer_t > (comparer))) {
          ensure_capacity(dictionary.count());
          for (const auto& item : dictionary)
            add(item);
        }

        template < class equality_comparer_t >
        dictionary(const ienumerable < value_type > & collection, const equality_comparer_t& comparer) : data_(xtd::new_ptr < dictionary_data>(new_ptr < equality_comparer_t > (comparer))) {
          for (const auto& item : collection)
            add(item);
        }

        template < class input_iterator_t >
        explicit dictionary(input_iterator_t first, input_iterator_t last) {
          for (auto iterator = first; iterator != last; ++iterator) {
            const auto& [key, value] = *iterator;
            add(key, value);
          }
        }

        dictionary(const dictionary & other) noexcept : data_(xtd::new_ptr < dictionary_data > (other.data_->comparer, other.data_->items, other.data_->version)) {}
        dictionary(const std::unordered_map < key_t, value_t > & other) {
          for (auto iterator = other.begin(); iterator != other.end(); ++iterator) {
            const auto& [key, value] = *iterator;
            add(key, value);
          }
        }

        dictionary(dictionary&& other) noexcept = default;
        dictionary(std::unordered_map < key_t, value_t > && other) noexcept : data_(xtd::new_ptr < dictionary_data>(std::move(other.data_->items))) {}
        dictionary(std::initializer_list < base_value_type > init) {
          for (const auto& [key, value] : init) {
            if (contains_key(key)) xtd::helpers::throw_helper::throws(xtd::helpers::exception_case::argument);
            self_[key] = value;
          }
        }

        template < class init_key_t, class init_value_t >
        explicit dictionary(std::initializer_list < key_value_pair < init_key_t, init_value_t>> init) {
          for (const auto& [key, value] : init) {
            if (contains_key(key)) xtd::helpers::throw_helper::throws(xtd::helpers::exception_case::argument);
            self_[key] = value;
          }
        }

        
        
        size_type capacity() const noexcept {return items().bucket_count();}
        
        const iequality_comparer < key_t > & comparer() const noexcept {
          if (data_->comparer) return *data_->comparer;
          return equality_comparer < key_t >::default_equality_comparer();
        }
        
        size_type count() const noexcept override {return data_->items.size();}
        
        virtual const base_type & items() const noexcept {return data_->items;}
        virtual base_type & items() noexcept {return data_->items;}
        
        key_collection keys() const noexcept override {
          auto keys = key_collection {};
          for (const auto& [key, value] : data_->items)
            keys.add(key);
          return keys;
        }
        
        value_collection values() const noexcept override {
          auto values = value_collection {};
          for (const auto& [key, value] : data_->items)
            values.add(value);
          return values;
        }

        
        
        void add(const key_t & key, const value_t value) override {
          if (!try_add(key, value)) xtd::helpers::throw_helper::throws(xtd::helpers::exception_case::argument);
        }
        
        void add(const value_type & item) override {
          add(item.key(), item.value());
        }
        
        void clear() noexcept override {
          data_->items.clear();
          ++data_->version;
        }
        
        bool contains(const value_type & item) const noexcept override {
          auto iterator = items().find(item.key());
          if (iterator == items().end()) return false;
          return iterator->second == item.value();
        }
        
        bool contains_key(const key_t & key) const noexcept override {
          return data_->items.find(key) != data_->items.end();
        }
        
        bool contains_value(const value_t& value) const noexcept {
          for (const auto& [item_key, item_value] : self_)
            if (item_value == value) return true;
          return false;
        }
        
        void copy_to(xtd::array < value_type > & array, xtd::size array_index) const override {
          if (array_index + count() > array.size()) xtd::helpers::throw_helper::throws(xtd::helpers::exception_case::argument);
          auto index = size_type {0};
          for (const auto& item : self_)
            array[array_index + index++] = item;
        }
        
        xtd::size ensure_capacity(xtd::size capacity) noexcept {
          data_->items.reserve(capacity);
          return this->capacity();
        }
        
        enumerator < value_type > get_enumerator() const noexcept override {
          struct internal_enumerator : public ienumerator < value_type > {
          public:
            explicit internal_enumerator(const dictionary & items, size_type version) : items_(items), version_(version) {}
            
            const value_type & current() const override {
              if (version_ != items_.data_->version) xtd::helpers::throw_helper::throws(xtd::helpers::exception_case::invalid_operation, "Collection was modified; enumeration operation may not execute.");
              if (iterator_ != items_.items().cend()) {
                static thread_local auto value = value_type {};
                value = value_type {*iterator_};
                return value;
              }
              static auto default_value_type = value_type {};
              return default_value_type;
            }
            
            bool move_next() override {
              if (version_ != items_.data_->version) xtd::helpers::throw_helper::throws(xtd::helpers::exception_case::invalid_operation, "Collection was modified; enumeration operation may not execute.");
              if (!reset_) return ++iterator_ != items_.items().cend();
              reset_ = false;
              iterator_ = items_.items().cbegin();
              return iterator_ != items_.items().cend();
            }
            
            void reset() override {
              reset_ = true;
              version_ = items_.data_->version;
              iterator_ = items_.items().cend();
            }
            
protected:
            bool reset_ = true;
            const dictionary& items_;
            typename dictionary::base_type::const_iterator iterator_ = items_.items().cend();
            size_type version_ = 0;
          };
          return {new_ptr < internal_enumerator > (self_, data_->version)};
        }
        
        bool remove(const key_t & key) noexcept override {
          return items().erase(key) == 1;
        }
        
        bool remove(const value_type & item) noexcept override {
          if (!contains_value(item.value())) return false;
          return items().erase(item.key()) == 1;
        }
        
        bool remove(const key_t & key, value_t& value) noexcept {
          auto iterator = items().find(key);
          if (iterator == items().end()) return false;
          value = iterator->value();
          return items().erase(iterator) != items().end();
        }
        
        xtd::string to_string() const noexcept override {return xtd::string::format("{{{}}}", xtd::string::join(", ", self_));}
        
        void trim_excess(size_type capacity) {
          if (capacity < count()) xtd::helpers::throw_helper::throws(xtd::helpers::exception_case::argument_out_of_range);
          items().rehash(capacity);
        }
        
        void trim_excess() {
          rehash(count());
        }
        
        bool try_add(const key_t & key, const value_t value) noexcept {
          const auto& [iterator, succeeded] = data_->items.insert(std::forward < base_value_type > ({key, value}));
          if (succeeded) ++data_->version;
          return succeeded;
        }
        
        bool try_get_value(const key_t & key, value_t& value) const override {
          auto iterator = items().find(key);
          if (iterator != items().end()) {
            value = iterator->second;
            return true;
          }
          value = value_t {};
          return false;
        }

        
        
        dictionary& operator =(dictionary&& other) noexcept {
          data_->comparer = std::move(other.data_->comparer);
          data_->items = std::move(other.data_->items);
          data_->version = std::move(other.data_->version);
          return self_;
        }

        dictionary& operator =(std::unordered_map < key_t, value_t > && other) noexcept {
          data_->items = std::move(other);
          ++data_->version;
          return self_;
        }

        dictionary& operator =(const dictionary & other) noexcept = default;
        dictionary& operator =(const std::unordered_map < key_t, value_t > & other) noexcept {
          data_->items.clear();
          for (const auto& [key, value] : other)
            add(key, value);
        }

        dictionary& operator =(std::initializer_list < base_value_type > ilist) {
          data_->items.clear();
          for (const auto& [key, value] : ilist)
            add(key, value);
        }

        template < class init_key_t, class init_value_t >
        dictionary& operator =(std::initializer_list < key_value_pair < init_key_t, init_value_t>> ilist) {
          data_->items.clear();
          for (const auto& [key, value] : ilist)
            add(key, value);
        }
        
        const value_t& operator [](const key_t & key) const override {
          auto iterator = data_->items.find(key);
          if (iterator == data_->items.end()) xtd::helpers::throw_helper::throws(xtd::helpers::exception_case::key_not_found);
          return iterator->second;
        }

        value_t& operator [](const key_t & key) override {
          ++data_->version;
          return data_->items[key];
        }
        
        operator const base_type & () const noexcept {return data_->items;}
        operator base_type & () noexcept {return data_->items;}
        
      private:
        bool is_read_only() const noexcept override {return false;}
        bool is_synchronized() const noexcept override {return false;}
        const xtd::object & sync_root() const noexcept override {return data_->sync_root;}
        
        struct dictionary_data {
          dictionary_data() : items {size_type {}, hasher {}, equator {}, allocator_t {}} {}
          dictionary_data(ptr < iequality_comparer < key_t>> comparer) : comparer {comparer},  items {size_type {}, hasher {comparer.get()}, equator {comparer.get()}, allocator_t {}} {}
          dictionary_data(ptr < iequality_comparer < key_t>> comparer, const base_type & items, size_type version) noexcept : comparer {comparer}, items {size_type {}, hasher {comparer.get()}, equator {comparer.get()}, allocator_t {}}, version {version} {
            for (const auto& item : items)
              this->items.insert(item);
          }
          dictionary_data(base_type&& items, size_type version) noexcept : items {size_type {}, hasher {}, equator {}, allocator_t {}}, version {version} {
            for (auto&& item : items)
              this->items.insert(item);
          }
          
          ptr < iequality_comparer < key_t>> comparer;
          base_type items;
          size_type version = 0;
          xtd::object sync_root;
        };
        xtd::ptr < dictionary_data > data_ = xtd::new_ptr < dictionary_data > ();
      };
      
      // C++17 deduction guides for xtd::collections::generic::dictionary
      // {
      template < class key_t, class value_t >
      dictionary(idictionary < key_t, value_t >) -> dictionary < key_t, value_t, helpers::hasher<key_t>, helpers::equator<key_t>, helpers::allocator < std::pair < const key_t, value_t >>>;
      
      template < class key_t, class value_t >
      dictionary(ienumerable < key_value_pair < key_t, value_t>>) -> dictionary<key_t, value_t, helpers::hasher<key_t>, helpers::equator<key_t >, helpers::allocator < std::pair < const key_t, value_t >>>;
      
      template < class key_t, class value_t >
      dictionary(std::initializer_list < key_value_pair < key_t, value_t>>) -> dictionary < key_t, value_t >;
      
      template < class key_t, class value_t >
      dictionary(std::initializer_list < std::pair < key_t, value_t>>) -> dictionary < key_t, value_t >;
      
      template < class input_iterator_t >
      dictionary(input_iterator_t, input_iterator_t) -> dictionary < helpers::iterator_key_t < input_iterator_t>, helpers::iterator_mapped_t<input_iterator_t >>;
      // }
    }
  }
}