Lines Matching refs:__table_

238     __table __table_;
269 {return allocator_type(__table_.__node_alloc());}
272 bool empty() const {return __table_.size() == 0;}
274 size_type size() const {return __table_.size();}
276 size_type max_size() const {return __table_.max_size();}
279 iterator begin() {return __table_.begin();}
281 iterator end() {return __table_.end();}
283 const_iterator begin() const {return __table_.begin();}
285 const_iterator end() const {return __table_.end();}
289 {return __table_.__insert_unique(__x);}
297 void erase(const_iterator __p) {__table_.erase(__p);}
299 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
302 {__table_.erase(__first, __last);}
304 void clear() {__table_.clear();}
307 void swap(hash_set& __u) {__table_.swap(__u.__table_);}
310 hasher hash_funct() const {return __table_.hash_function();}
312 key_equal key_eq() const {return __table_.key_eq();}
315 iterator find(const key_type& __k) {return __table_.find(__k);}
317 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
319 size_type count(const key_type& __k) const {return __table_.__count_unique(__k);}
322 {return __table_.__equal_range_unique(__k);}
325 {return __table_.__equal_range_unique(__k);}
328 size_type bucket_count() const {return __table_.bucket_count();}
330 size_type max_bucket_count() const {return __table_.max_bucket_count();}
333 size_type elems_in_bucket(size_type __n) const {return __table_.bucket_size(__n);}
336 void resize(size_type __n) {__table_.__rehash_unique(__n);}
342 : __table_(__hf, __eql)
344 __table_.__rehash_unique(__n);
350 : __table_(__hf, __eql, __a)
352 __table_.__rehash_unique(__n);
368 : __table_(__hf, __eql)
370 __table_.__rehash_unique(__n);
379 : __table_(__hf, __eql, __a)
381 __table_.__rehash_unique(__n);
388 : __table_(__u.__table_)
390 __table_.__rehash_unique(__u.bucket_count());
402 __table_.__insert_unique(*__first);
459 __table __table_;
490 {return allocator_type(__table_.__node_alloc());}
493 bool empty() const {return __table_.size() == 0;}
495 size_type size() const {return __table_.size();}
497 size_type max_size() const {return __table_.max_size();}
500 iterator begin() {return __table_.begin();}
502 iterator end() {return __table_.end();}
504 const_iterator begin() const {return __table_.begin();}
506 const_iterator end() const {return __table_.end();}
509 iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);}
517 void erase(const_iterator __p) {__table_.erase(__p);}
519 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
522 {__table_.erase(__first, __last);}
524 void clear() {__table_.clear();}
527 void swap(hash_multiset& __u) {__table_.swap(__u.__table_);}
530 hasher hash_funct() const {return __table_.hash_function();}
532 key_equal key_eq() const {return __table_.key_eq();}
535 iterator find(const key_type& __k) {return __table_.find(__k);}
537 const_iterator find(const key_type& __k) const {return __table_.find(__k);}
539 size_type count(const key_type& __k) const {return __table_.__count_multi(__k);}
542 {return __table_.__equal_range_multi(__k);}
545 {return __table_.__equal_range_multi(__k);}
548 size_type bucket_count() const {return __table_.bucket_count();}
550 size_type max_bucket_count() const {return __table_.max_bucket_count();}
553 size_type elems_in_bucket(size_type __n) const {return __table_.bucket_size(__n);}
556 void resize(size_type __n) {__table_.__rehash_multi(__n);}
562 : __table_(__hf, __eql)
564 __table_.__rehash_multi(__n);
571 : __table_(__hf, __eql, __a)
573 __table_.__rehash_multi(__n);
589 : __table_(__hf, __eql)
591 __table_.__rehash_multi(__n);
600 : __table_(__hf, __eql, __a)
602 __table_.__rehash_multi(__n);
609 : __table_(__u.__table_)
611 __table_.__rehash_multi(__u.bucket_count());
623 __table_.__insert_multi(*__first);