Changeset 170761c in mainline

Timestamp:

2018-07-05T21:41:21Z (6 years ago)

Author:

Dzejrou <dzejrou@…>

Branches:

lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export

Children:

b044f66

Parents:

8ec1cd2

git-author:

Dzejrou <dzejrou@…> (2018-04-24 20:22:34)

git-committer:

Dzejrou <dzejrou@…> (2018-07-05 21:41:21)

Message:

cpp: added partial definition of unordered_map - that is, all function declaration and implementation of some that consisted only of relying the arguments into the underlying hash table

File:

• uspace/lib/cpp/include/impl/unordered_map.hpp (modified) (1 diff)

uspace/lib/cpp/include/impl/unordered_map.hpp

@@ -48 +48 @@
         class Alloc = allocator<pair<const Key, Value>>
     >
-    class unordered_map;
+    class unordered_map
+    {
+        public:
+            using key_type        = Key;
+            using mapped_type     = Value;
+            using value_type      = pair<const key_type, mapped_type>;
+            using hasher          = Hash;
+            using key_equal       = Pred;
+            using allocator_type  = Alloc;
+            using pointer         = typename allocator_traits<allocator_type>::pointer;
+            using const_pointer   = typename allocator_traits<allocator_type>::const_pointer;
+            using reference       = value_type&;
+            using const_reference = const value_type&;
+            using size_type       = size_t;
+            using difference_type = ptrdiff_t;
+
+            using iterator             = aux::hash_table_iterator<
+                value_type, reference, pointer, size_type
+            >;
+            using const_iterator       = aux::hash_table_const_iterator<
+                value_type, const_reference, const_pointer, size_type
+            >;
+            using local_iterator       = aux::hash_table_local_iterator<
+                value_type, reference, pointer
+            >;
+            using const_local_iterator = aux::hash_table_const_local_iterator<
+                value_type, const_reference, const_pointer
+            >;
+
+            unordered_map()
+                : unordered_map{default_bucket_count_}
+            { /* DUMMY BODY */ }
+
+            explicit unordered_map(size_type bucket_count = default_bucket_count_,
+                                   const hasher& hf = hasher{},
+                                   const key_equal& eql = key_equal{},
+                                   const allocator_type& alloc = allocator_type{})
+                : table_{bucket_count, hf, eql}, allocator_{alloc}
+            { /* DUMMY BODY */ }
+
+            template<class InputIterator>
+            unordered_map(InputIterator first, InputIterator last,
+                          size_type bucket_count = default_bucket_count_,
+                          const hasher& hf = hasher{},
+                          const key_equal& eql = key_equal{},
+                          const allocator_type& alloc = allocator_type{})
+                : unordered_map{bucket_count, hf, eql, alloc}
+            {
+                // TODO: insert the range
+            }
+
+            unordered_map(const unordered_map& other)
+                : unordered_map{other, other.allocator_}
+            { /* DUMMY BODY */ }
+
+            unordered_map(unordered_map&& other)
+                : table_{move(other.table_)}, allocator_{move(other.allocator_)}
+            { /* DUMMY BODY */ }
+
+            explicit unordered_map(const allocator_type& alloc)
+                : table_{default_bucket_count_}, allocator_{alloc}
+            { /* DUMMY BODY */ }
+
+            unordered_map(const unordered_map& other, const allocator_type& alloc)
+                : table_{other.table_}, allocator_{alloc}
+            { /* DUMMY BODY */ }
+
+            unordered_map(unordered_map&& other, const allocator_type& alloc)
+                : table_{move(other.table_)}, allocator_{alloc}
+            { /* DUMMY BODY */ }
+
+            unordered_map(initializer_list<value_type> init,
+                          size_type bucket_count = default_bucket_count_,
+                          const hasher& hf = hasher{},
+                          const key_equal& eql = key_equal{},
+                          const allocator_type& alloc = allocator_type{})
+                : unordered_map{bucket_count, hf, eql, alloc}
+            {
+                // TODO: insert the range
+            }
+
+            unordered_map(size_type bucket_count, const allocator_type& alloc)
+                : unordered_map{bucket_count, hasher{}, key_equal{}, alloc}
+            { /* DUMMY BODY */ }
+
+            unordered_map(size_type bucket_count, const hasher& hf, const allocator_type& alloc)
+                : unordered_map{bucket_count, hf, key_equal{}, alloc}
+            { /* DUMMY BODY */ }
+
+            template<class InputIterator>
+            unordered_map(InputIterator first, InputIterator last,
+                          size_type bucket_count, const allocator_type& alloc)
+                : unordered_map{first, last, bucket_count, hasher{}, key_equal{}, alloc}
+            { /* DUMMY BODY */ }
+
+            template<class InputIterator>
+            unordered_map(InputIterator first, InputIterator last,
+                          size_type bucket_count, const hasher& hf, const allocator_type& alloc)
+                : unordered_map{first, last, bucket_count, hf, key_equal{}, alloc}
+            { /* DUMMY BODY */ }
+
+            unordered_map(initializer_list<value_type> init, size_type bucket_count,
+                          const allocator_type& alloc)
+                : unordered_map{init, bucket_count, hasher{}, key_equal{}, alloc}
+            { /* DUMMY BODY */ }
+
+            unordered_map(initializer_list<value_type> init, size_type bucket_count,
+                          const hasher& hf, const allocator_type& alloc)
+                : unordered_map{init, bucket_count, hf, key_equal{}, alloc}
+            { /* DUMMY BODY */ }
+
+            ~unordered_map()
+            { /* DUMMY BODY */ }
+
+            unordered_map& operator=(const unordered_map& other)
+            {
+                // TODO: implement
+                return *this;
+            }
+
+            unordered_map& operator=(unordered_map&& other)
+                noexcept(allocator_traits<allocator_type>::is_always_equal::value &&
+                         is_nothrow_move_assignable<hasher>::value &&
+                         is_nothrow_move_assignable<key_equal>::value)
+            {
+                // TODO: implement
+                return *this;
+            }
+
+            unordered_map& operator=(initializer_list<value_type>& init)
+            {
+                // TODO: implement
+                return *this;
+            }
+
+            allocator_type get_allocator() const noexcept
+            {
+                return allocator_;
+            }
+
+            bool empty() const noexcept
+            {
+                return table_.empty();
+            }
+
+            size_type size() const noexcept
+            {
+                return table_.size();
+            }
+
+            size_type max_size() const noexcept
+            {
+                return table_.max_size();
+            }
+
+            iterator begin() noexcept
+            {
+                return table_.begin();
+            }
+
+            const_iterator begin() const noexcept
+            {
+                return table_.begin();
+            }
+
+            iterator end() noexcept
+            {
+                return table_.end();
+            }
+
+            const_iterator end() const noexcept
+            {
+                return table_.end();
+            }
+
+            const_iterator cbegin() const noexcept
+            {
+                return table_.cbegin();
+            }
+
+            const_iterator cend() const noexcept
+            {
+                return table_.cend();
+            }
+
+            template<class... Args>
+            pair<iterator, bool> emplace(Args&&... args)
+            {
+                // TODO: implement
+            }
+
+            template<class... Args>
+            iterator emplace_hint(const_iterator position, Args&&... args)
+            {
+                // TODO: implement
+            }
+
+            pair<iterator, bool> insert(const value_type& val)
+            {
+                // TODO: implement
+            }
+
+            pair<iterator, bool> insert(value_type&& val)
+            {
+                // TODO: implement
+            }
+
+            template<class T>
+            pair<iterator, bool> insert(T&& val)
+            {
+                // TODO: implement
+            }
+
+            iterator insert(const_iterator hint, const value_type& val)
+            {
+                // TODO: implement
+            }
+
+            iterator insert(const_iterator hint, value_type&& val)
+            {
+                // TODO: implement
+            }
+
+            template<class T>
+            iterator insert(const_iterator hint, T&& val)
+            {
+                // TODO: implement
+            }
+
+            template<class InputIterator>
+            void insert(InputIterator first, InputIterator last)
+            {
+                // TODO: implement
+            }
+
+            void insert(initializer_list<value_type> init)
+            {
+                insert(init.begin(), init.end());
+            }
+
+            template<class... Args>
+            pair<iterator, bool> try_emplace(const key_type& key, Args&&... args)
+            {
+                // TODO: implement
+            }
+
+            template<class... Args>
+            pair<iterator, bool> try_emplace(key_type&& key, Args&&... args)
+            {
+                // TODO: implement
+            }
+
+            template<class... Args>
+            iterator try_emplace(const_iterator hint, const key_type& key, Args&&... args)
+            {
+                // TODO: implement
+            }
+
+            template<class... Args>
+            iterator try_emplace(const_iterator hint, key_type&& key, Args&&... args)
+            {
+                // TODO: implement
+            }
+
+            template<class T>
+            pair<iterator, bool> insert_or_assign(const key_type& key, T&& val)
+            {
+                // TODO: implement
+            }
+
+            template<class T>
+            pair<iterator, bool> insert_or_assign(key_type&& key, T&& val)
+            {
+                // TODO: implement
+            }
+
+            template<class T>
+            iterator insert_or_assign(const_iterator hint, const key_type& key, T&& val)
+            {
+                // TODO: implement
+            }
+
+            template<class T>
+            iterator insert_or_assign(const_iterator hint, key_type&& key, T&& val)
+            {
+                // TODO: implement
+            }
+
+            iterator erase(const_iterator position)
+            {
+                // TODO: implement
+            }
+
+            size_type erase(const key_type& key)
+            {
+                // TODO: implement
+            }
+
+            iterator erase(const_iterator first, const_iterator last)
+            {
+                // TODO: implement
+            }
+
+            void clear() noexcept
+            {
+                table_.clear();
+            }
+
+            void swap(unordered_map& other)
+                noexcept(allocator_traits<allocator_type>::is_always_equal::value &&
+                         noexcept(std::swap(declval<hasher>(), declval<hasher>())) &&
+                         noexcept(std::swap(declval<key_equal>(), declval<key_equal>())))
+            {
+                table_.swap(other.table_);
+                std::swap(allocator_, other.allocator_);
+            }
+
+            hasher hash_function() const
+            {
+                return table_.hash_function();
+            }
+
+            key_equal key_eq() const
+            {
+                return table_.key_eq();
+            }
+
+            iterator find(const key_type& key)
+            {
+                // TODO: implement
+            }
+
+            const_iterator find(const key_type& key) const
+            {
+                // TODO: implement
+            }
+
+            size_type count(const key_type& key) const
+            {
+                // TODO: implement
+            }
+
+            pair<iterator, iterator> equal_range(const key_type& key)
+            {
+                // TODO: implement
+            }
+
+            pair<const_iterator, const_iterator> equal_range(const key_type& key) const
+            {
+                // TODO: implement
+            }
+
+            mapped_type& operator[](const key_type& key)
+            {
+                // TODO: implement
+            }
+
+            mapped_type& operator[](key_type&& key)
+            {
+                // TODO: implement
+            }
+
+            mapped_type& at(const key_type& key)
+            {
+                // TODO: implement
+            }
+
+            const mapped_type& at(const key_type& key) const
+            {
+                // TODO: implement
+            }
+
+            size_type bucket_count() const noexcept
+            {
+                return table_.bucket_count();
+            }
+
+            size_type max_bucket_count() const noexcept
+            {
+                return table_.max_bucket_count();
+            }
+
+            size_type bucket_size(size_type idx) const
+            {
+                return table_.bucket_size(idx);
+            }
+
+            size_type bucket(const key_type& key) const
+            {
+                return table_.bucket(key);
+            }
+
+            local_iterator begin(size_type idx)
+            {
+                return table_.begin(idx);
+            }
+
+            const_local_iterator begin(size_type idx) const
+            {
+                return table_.begin(idx);
+            }
+
+            local_iterator end(size_type idx)
+            {
+                return table_.end(idx);
+            }
+
+            const_local_iterator end(size_type idx) const
+            {
+                return table_.end(idx);
+            }
+
+            const_local_iterator cbegin(size_type idx) const
+            {
+                return table_.cbegin(idx);
+            }
+
+            const_local_iterator cend(size_type idx) const
+            {
+                return table_.cend(idx);
+            }
+
+            float load_factor() const noexcept
+            {
+                return table_.load_factor();
+            }
+
+            float max_load_factor() const noexcept
+            {
+                return table_.max_load_factor();
+            }
+
+            void max_load_factor(float factor)
+            {
+                table_.max_load_factor(factor);
+            }
+
+            void rehash(size_type bucket_count)
+            {
+                table_.rehash(bucket_count);
+            }
+
+            void reserve(size_type count)
+            {
+                table_.reserve(count);
+            }
+
+        private:
+            aux::hash_map<
+                value_type, key_type, aux::key_value_key_extractor<key_type, mapped_type>,
+                hasher, key_equal, allocator_type, size_type,
+                iterator, const_iterator, local_iterator, const_local_iterator,
+                aux::hash_single_policy
+            > table_;
+
+            allocator_type allocator_;
+
+            static constexpr size_type default_bucket_count_{16};
+    };
 
     /**