Lines Matching refs:const
22 class Alloc = allocator<pair<const Key, T>>>
32 typedef pair<const key_type, mapped_type> value_type;
34 typedef const value_type& const_reference;
43 explicit hash_map(size_type n = 193, const hasher& hf = hasher(),
44 const key_equal& eql = key_equal(),
45 const allocator_type& a = allocator_type());
48 size_type n = 193, const hasher& hf = hasher(),
49 const key_equal& eql = key_equal(),
50 const allocator_type& a = allocator_type());
51 hash_map(const hash_map&);
53 hash_map& operator=(const hash_map&);
55 allocator_type get_allocator() const;
57 bool empty() const;
58 size_type size() const;
59 size_type max_size() const;
63 const_iterator begin() const;
64 const_iterator end() const;
66 pair<iterator, bool> insert(const value_type& obj);
71 size_type erase(const key_type& k);
77 hasher hash_funct() const;
78 key_equal key_eq() const;
80 iterator find(const key_type& k);
81 const_iterator find(const key_type& k) const;
82 size_type count(const key_type& k) const;
83 pair<iterator, iterator> equal_range(const key_type& k);
84 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
86 mapped_type& operator[](const key_type& k);
88 size_type bucket_count() const;
89 size_type max_bucket_count() const;
91 size_type elems_in_bucket(size_type n) const;
102 operator==(const hash_map<Key, T, Hash, Pred, Alloc>& x,
103 const hash_map<Key, T, Hash, Pred, Alloc>& y);
107 operator!=(const hash_map<Key, T, Hash, Pred, Alloc>& x,
108 const hash_map<Key, T, Hash, Pred, Alloc>& y);
111 class Alloc = allocator<pair<const Key, T>>>
121 typedef pair<const key_type, mapped_type> value_type;
123 typedef const value_type& const_reference;
132 explicit hash_multimap(size_type n = 193, const hasher& hf = hasher(),
133 const key_equal& eql = key_equal(),
134 const allocator_type& a = allocator_type());
137 size_type n = 193, const hasher& hf = hasher(),
138 const key_equal& eql = key_equal(),
139 const allocator_type& a = allocator_type());
140 explicit hash_multimap(const allocator_type&);
141 hash_multimap(const hash_multimap&);
143 hash_multimap& operator=(const hash_multimap&);
145 allocator_type get_allocator() const;
147 bool empty() const;
148 size_type size() const;
149 size_type max_size() const;
153 const_iterator begin() const;
154 const_iterator end() const;
156 iterator insert(const value_type& obj);
161 size_type erase(const key_type& k);
167 hasher hash_funct() const;
168 key_equal key_eq() const;
170 iterator find(const key_type& k);
171 const_iterator find(const key_type& k) const;
172 size_type count(const key_type& k) const;
173 pair<iterator, iterator> equal_range(const key_type& k);
174 pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
176 size_type bucket_count() const;
177 size_type max_bucket_count() const;
179 size_type elems_in_bucket(size_type n) const;
190 operator==(const hash_multimap<Key, T, Hash, Pred, Alloc>& x,
191 const hash_multimap<Key, T, Hash, Pred, Alloc>& y);
195 operator!=(const hash_multimap<Key, T, Hash, Pred, Alloc>& x,
196 const hash_multimap<Key, T, Hash, Pred, Alloc>& y);
233 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
234 _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return *this;}
236 size_t operator()(const _Tp& __x) const
237 {return static_cast<const _Hash&>(*this)(__x.first);}
239 size_t operator()(const typename _Tp::first_type& __x) const
240 {return static_cast<const _Hash&>(*this)(__x);}
249 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : __hash_(__h) {}
250 _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return __hash_;}
252 size_t operator()(const _Tp& __x) const
255 size_t operator()(const typename _Tp::first_type& __x) const
267 _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : _Pred(__p) {}
268 _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return *this;}
270 bool operator()(const _Tp& __x, const _Tp& __y) const
271 {return static_cast<const _Pred&>(*this)(__x.first, __y.first);}
273 bool operator()(const typename _Tp::first_type& __x, const _Tp& __y) const
274 {return static_cast<const _Pred&>(*this)(__x, __y.first);}
276 bool operator()(const _Tp& __x, const typename _Tp::first_type& __y) const
277 {return static_cast<const _Pred&>(*this)(__x.first, __y);}
279 bool operator()(const typename _Tp::first_type& __x,
280 const typename _Tp::first_type& __y) const
281 {return static_cast<const _Pred&>(*this)(__x, __y);}
290 _LIBCPP_INLINE_VISIBILITY __hash_map_equal(const _Pred& __p) : __pred_(__p) {}
291 _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return __pred_;}
293 bool operator()(const _Tp& __x, const _Tp& __y) const
296 bool operator()(const typename _Tp::first_type& __x, const _Tp& __y) const
299 bool operator()(const _Tp& __x, const typename _Tp::first_type& __y) const
302 bool operator()(const typename _Tp::first_type& __x,
303 const typename _Tp::first_type& __y) const
321 __hash_map_node_destructor& operator=(const __hash_map_node_destructor&);
345 __hash_map_node_destructor(const __hash_node_destructor<allocator_type>& __x)
371 typedef const typename _HashIterator::value_type::first_type key_type;
385 _LIBCPP_INLINE_VISIBILITY reference operator*() const {return *operator->();}
386 _LIBCPP_INLINE_VISIBILITY pointer operator->() const {return (pointer)__i_.operator->();}
398 bool operator==(const __hash_map_iterator& __x, const __hash_map_iterator& __y)
401 bool operator!=(const __hash_map_iterator& __x, const __hash_map_iterator& __y)
416 typedef const typename _HashIterator::value_type::first_type key_type;
422 typedef const value_type& reference;
423 typedef typename __rebind_pointer<typename _HashIterator::pointer, const value_type>::type
436 reference operator*() const {return *operator->();}
438 pointer operator->() const {return (pointer)__i_.operator->();}
451 bool operator==(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y)
454 bool operator!=(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y)
464 class _Alloc = allocator<pair<const _Key, _Tp> > >
475 typedef pair<const key_type, mapped_type> value_type;
477 typedef const value_type& const_reference;
508 explicit hash_map(size_type __n, const hasher& __hf = hasher(),
509 const key_equal& __eql = key_equal());
510 hash_map(size_type __n, const hasher& __hf,
511 const key_equal& __eql,
512 const allocator_type& __a);
517 size_type __n, const hasher& __hf = hasher(),
518 const key_equal& __eql = key_equal());
521 size_type __n, const hasher& __hf,
522 const key_equal& __eql,
523 const allocator_type& __a);
524 hash_map(const hash_map& __u);
527 allocator_type get_allocator() const
531 bool empty() const {return __table_.size() == 0;}
533 size_type size() const {return __table_.size();}
535 size_type max_size() const {return __table_.max_size();}
542 const_iterator begin() const {return __table_.begin();}
544 const_iterator end() const {return __table_.end();}
547 pair<iterator, bool> insert(const value_type& __x)
550 iterator insert(const_iterator, const value_type& __x) {return insert(__x).first;}
558 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
569 hasher hash_funct() const
572 key_equal key_eq() const
576 iterator find(const key_type& __k) {return __table_.find(__k);}
578 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
580 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
582 pair<iterator, iterator> equal_range(const key_type& __k)
585 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
588 mapped_type& operator[](const key_type& __k);
591 size_type bucket_count() const {return __table_.bucket_count();}
593 size_type max_bucket_count() const {return __table_.max_bucket_count();}
596 size_type elems_in_bucket(size_type __n) const
603 __node_holder __construct_node(const key_type& __k);
608 size_type __n, const hasher& __hf, const key_equal& __eql)
616 size_type __n, const hasher& __hf, const key_equal& __eql,
617 const allocator_type& __a)
636 const hasher& __hf, const key_equal& __eql)
647 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
656 const hash_map& __u)
665 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::__construct_node(const key_type& __k)
689 hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type& __k)
711 operator==(const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
712 const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
731 operator!=(const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
732 const hash_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
738 class _Alloc = allocator<pair<const _Key, _Tp> > >
749 typedef pair<const key_type, mapped_type> value_type;
751 typedef const value_type& const_reference;
781 explicit hash_multimap(size_type __n, const hasher& __hf = hasher(),
782 const key_equal& __eql = key_equal());
783 hash_multimap(size_type __n, const hasher& __hf,
784 const key_equal& __eql,
785 const allocator_type& __a);
790 size_type __n, const hasher& __hf = hasher(),
791 const key_equal& __eql = key_equal());
794 size_type __n, const hasher& __hf,
795 const key_equal& __eql,
796 const allocator_type& __a);
797 hash_multimap(const hash_multimap& __u);
800 allocator_type get_allocator() const
804 bool empty() const {return __table_.size() == 0;}
806 size_type size() const {return __table_.size();}
808 size_type max_size() const {return __table_.max_size();}
815 const_iterator begin() const {return __table_.begin();}
817 const_iterator end() const {return __table_.end();}
820 iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);}
822 iterator insert(const_iterator, const value_type& __x) {return insert(__x);}
830 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
841 hasher hash_funct() const
844 key_equal key_eq() const
848 iterator find(const key_type& __k) {return __table_.find(__k);}
850 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
852 size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
854 pair<iterator, iterator> equal_range(const key_type& __k)
857 pair<const_iterator, const_iterator> equal_range(const key_type& __k) const
861 size_type bucket_count() const {return __table_.bucket_count();}
863 size_type max_bucket_count() const {return __table_.max_bucket_count();}
866 size_type elems_in_bucket(size_type __n) const
875 size_type __n, const hasher& __hf, const key_equal& __eql)
883 size_type __n, const hasher& __hf, const key_equal& __eql,
884 const allocator_type& __a)
903 const hasher& __hf, const key_equal& __eql)
914 const hasher& __hf, const key_equal& __eql, const allocator_type& __a)
923 const hash_multimap& __u)
952 operator==(const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
953 const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
976 operator!=(const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
977 const hash_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)