Lines Matching refs:const
21 class Alloc = allocator<pair<const Key, T>>>
31 typedef pair<const key_type, mapped_type> value_type;
33 typedef const value_type& const_reference;
43 explicit hash_map(size_type n, const hasher& hf = hasher(),
44 const key_equal& eql = key_equal(),
45 const allocator_type& a = allocator_type());
50 size_type n, const hasher& hf = hasher(),
51 const key_equal& eql = key_equal(),
52 const allocator_type& a = allocator_type());
53 hash_map(const hash_map&);
55 hash_map& operator=(const hash_map&);
57 allocator_type get_allocator() const;
59 bool empty() const;
60 size_type size() const;
61 size_type max_size() const;
65 const_iterator begin() const;
66 const_iterator end() const;
68 pair<iterator, bool> insert(const value_type& obj);
73 size_type erase(const key_type& k);
79 hasher hash_funct() const;
80 key_equal key_eq() const;
82 iterator find(const key_type& k);
83 const_iterator find(const key_type& k) const;
84 size_type count(const key_type& k) const;
85 pair<iterator, iterator> equal_range(const key_type& k);
86 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
88 mapped_type& operator[](const key_type& k);
90 size_type bucket_count() const;
91 size_type max_bucket_count() const;
93 size_type elems_in_bucket(size_type n) const;
104 operator==(const hash_map<Key, T, Hash, Pred, Alloc>& x,
105 const hash_map<Key, T, Hash, Pred, Alloc>& y);
109 operator!=(const hash_map<Key, T, Hash, Pred, Alloc>& x,
110 const hash_map<Key, T, Hash, Pred, Alloc>& y);
113 class Alloc = allocator<pair<const Key, T>>>
123 typedef pair<const key_type, mapped_type> value_type;
125 typedef const value_type& const_reference;
134 explicit hash_multimap(size_type n = 193, const hasher& hf = hasher(),
135 const key_equal& eql = key_equal(),
136 const allocator_type& a = allocator_type());
139 size_type n = 193, const hasher& hf = hasher(),
140 const key_equal& eql = key_equal(),
141 const allocator_type& a = allocator_type());
142 explicit hash_multimap(const allocator_type&);
143 hash_multimap(const hash_multimap&);
145 hash_multimap& operator=(const hash_multimap&);
147 allocator_type get_allocator() const;
149 bool empty() const;
150 size_type size() const;
151 size_type max_size() const;
155 const_iterator begin() const;
156 const_iterator end() const;
158 iterator insert(const value_type& obj);
163 size_type erase(const key_type& k);
169 hasher hash_funct() const;
170 key_equal key_eq() const;
172 iterator find(const key_type& k);
173 const_iterator find(const key_type& k) const;
174 size_type count(const key_type& k) const;
175 pair<iterator, iterator> equal_range(const key_type& k);
176 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
178 size_type bucket_count() const;
179 size_type max_bucket_count() const;
181 size_type elems_in_bucket(size_type n) const;
192 operator==(const hash_multimap<Key, T, Hash, Pred, Alloc>& x,
193 const hash_multimap<Key, T, Hash, Pred, Alloc>& y);
197 operator!=(const hash_multimap<Key, T, Hash, Pred, Alloc>& x,
198 const hash_multimap<Key, T, Hash, Pred, Alloc>& y);
239 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
240 _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return *this;}
242 size_t operator()(const _Tp& __x) const
243 {return static_cast<const _Hash&>(*this)(__x.first);}
245 size_t operator()(const typename _Tp::first_type& __x) const
246 {return static_cast<const _Hash&>(*this)(__x);}
255 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : __hash_(__h) {}
256 _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return __hash_;}
258 size_t operator()(const _Tp& __x) const
261 size_t operator()(const typename _Tp::first_type& __x) const
273 _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : _Pred(__p) {}
274 _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return *this;}
276 bool operator()(const _Tp& __x, const _Tp& __y) const
277 {return static_cast<const _Pred&>(*this)(__x.first, __y.first);}
279 bool operator()(const typename _Tp::first_type& __x, const _Tp& __y) const
280 {return static_cast<const _Pred&>(*this)(__x, __y.first);}
282 bool operator()(const _Tp& __x, const typename _Tp::first_type& __y) const
283 {return static_cast<const _Pred&>(*this)(__x.first, __y);}
285 bool operator()(const typename _Tp::first_type& __x,
286 const typename _Tp::first_type& __y) const
287 {return static_cast<const _Pred&>(*this)(__x, __y);}
296 _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : __pred_(__p) {}
297 _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return __pred_;}
299 bool operator()(const _Tp& __x, const _Tp& __y) const
302 bool operator()(const typename _Tp::first_type& __x, const _Tp& __y) const
305 bool operator()(const _Tp& __x, const typename _Tp::first_type& __y) const
308 bool operator()(const typename _Tp::first_type& __x,
309 const typename _Tp::first_type& __y) const
331 __hash_map_node_destructor(__hash_map_node_destructor const&) = default;
332 __hash_map_node_destructor& operator=(const __hash_map_node_destructor&) = delete;
352 __hash_map_node_destructor(const std::__hash_node_destructor<allocator_type>& __x)
378 typedef const typename _HashIterator::value_type::first_type key_type;
392 _LIBCPP_INLINE_VISIBILITY reference operator*() const {return *operator->();}
393 _LIBCPP_INLINE_VISIBILITY pointer operator->() const {return (pointer)__i_.operator->();}
405 bool operator==(const __hash_map_iterator& __x, const __hash_map_iterator& __y)
408 bool operator!=(const __hash_map_iterator& __x, const __hash_map_iterator& __y)
423 typedef const typename _HashIterator::value_type::first_type key_type;
429 typedef const value_type& reference;
430 typedef typename std::__rebind_pointer<typename _HashIterator::pointer, const value_type>::type
443 reference operator*() const {return *operator->();}
445 pointer operator->() const {return (pointer)__i_.operator->();}
458 bool operator==(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y)
461 bool operator!=(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y)
471 class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
482 typedef std::pair<const key_type, mapped_type> value_type;
484 typedef const value_type& const_reference;
516 explicit hash_map(size_type __n, const hasher& __hf = hasher(),
517 const key_equal& __eql = key_equal());
518 hash_map(size_type __n, const hasher& __hf,
519 const key_equal& __eql,
520 const allocator_type& __a);
525 size_type __n, const hasher& __hf = hasher(),
526 const key_equal& __eql = key_equal());
529 size_type __n, const hasher& __hf,
530 const key_equal& __eql,
531 const allocator_type& __a);
532 hash_map(const hash_map& __u);
535 allocator_type get_allocator() const
539 bool empty() const {return __table_.size() == 0;}
541 size_type size() const {return __table_.size();}
543 size_type max_size() const {return __table_.max_size();}
550 const_iterator begin() const {return __table_.begin();}
552 const_iterator end() const {return __table_.end();}
555 std::pair<iterator, bool> insert(const value_type& __x)
558 iterator insert(const_iterator, const value_type& __x) {return insert(__x).first;}
566 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
577 hasher hash_funct() const
580 key_equal key_eq() const
584 iterator find(const key_type& __k) {return __table_.find(__k);}
586 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
588 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
590 std::pair<iterator, iterator> equal_range(const key_type& __k)
593 std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
596 mapped_type& operator[](const key_type& __k);
599 size_type bucket_count() const {return __table_.bucket_count();}
601 size_type max_bucket_count() const {return __table_.max_bucket_count();}
604 size_type elems_in_bucket(size_type __n) const
611 __node_holder __construct_node(const key_type& __k);
616 size_type __n, const hasher& __hf, const key_equal& __eql)
624 size_type __n, const hasher& __hf, const key_equal& __eql,
625 const allocator_type& __a)
643 const hasher& __hf, const key_equal& __eql)
654 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
663 const hash_map& __u)
672 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node(const key_type& __k)
696 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
718 operator==(const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
719 const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
738 operator!=(const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
739 const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
745 class _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
756 typedef std::pair<const key_type, mapped_type> value_type;
758 typedef const value_type& const_reference;
788 explicit hash_multimap(size_type __n, const hasher& __hf = hasher(),
789 const key_equal& __eql = key_equal());
790 hash_multimap(size_type __n, const hasher& __hf,
791 const key_equal& __eql,
792 const allocator_type& __a);
797 size_type __n, const hasher& __hf = hasher(),
798 const key_equal& __eql = key_equal());
801 size_type __n, const hasher& __hf,
802 const key_equal& __eql,
803 const allocator_type& __a);
804 hash_multimap(const hash_multimap& __u);
807 allocator_type get_allocator() const
811 bool empty() const {return __table_.size() == 0;}
813 size_type size() const {return __table_.size();}
815 size_type max_size() const {return __table_.max_size();}
822 const_iterator begin() const {return __table_.begin();}
824 const_iterator end() const {return __table_.end();}
827 iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);}
829 iterator insert(const_iterator, const value_type& __x) {return insert(__x);}
837 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
848 hasher hash_funct() const
851 key_equal key_eq() const
855 iterator find(const key_type& __k) {return __table_.find(__k);}
857 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
859 size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
861 std::pair<iterator, iterator> equal_range(const key_type& __k)
864 std::pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
868 size_type bucket_count() const {return __table_.bucket_count();}
870 size_type max_bucket_count() const {return __table_.max_bucket_count();}
873 size_type elems_in_bucket(size_type __n) const
882 size_type __n, const hasher& __hf, const key_equal& __eql)
890 size_type __n, const hasher& __hf, const key_equal& __eql,
891 const allocator_type& __a)
909 const hasher& __hf, const key_equal& __eql)
920 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
929 const hash_multimap& __u)
958 operator==(const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
959 const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
982 operator!=(const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
983 const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)