Lines Matching refs:__table_
496 __table __table_;
536 {return allocator_type(__table_.__node_alloc());}
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();}
546 iterator begin() {return __table_.begin();}
548 iterator end() {return __table_.end();}
550 const_iterator begin() const {return __table_.begin();}
552 const_iterator end() const {return __table_.end();}
556 {return __table_.__insert_unique(__x);}
564 void erase(const_iterator __p) {__table_.erase(__p.__i_);}
566 size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);}
569 {__table_.erase(__first.__i_, __last.__i_);}
571 void clear() {__table_.clear();}
574 void swap(hash_map& __u) {__table_.swap(__u.__table_);}
578 {return __table_.hash_function().hash_function();}
581 {return __table_.key_eq().key_eq();}
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);}
591 {return __table_.__equal_range_unique(__k);}
594 {return __table_.__equal_range_unique(__k);}
599 size_type bucket_count() const {return __table_.bucket_count();}
601 size_type max_bucket_count() const {return __table_.max_bucket_count();}
605 {return __table_.bucket_size(__n);}
608 void resize(size_type __n) {__table_.__rehash_unique(__n);}
617 : __table_(__hf, __eql)
619 __table_.__rehash_unique(__n);
626 : __table_(__hf, __eql, __a)
628 __table_.__rehash_unique(__n);
644 : __table_(__hf, __eql)
646 __table_.__rehash_unique(__n);
655 : __table_(__hf, __eql, __a)
657 __table_.__rehash_unique(__n);
664 : __table_(__u.__table_)
666 __table_.__rehash_unique(__u.bucket_count());
674 __node_allocator& __na = __table_.__node_alloc();
691 __table_.__insert_unique(*__first);
702 std::pair<iterator, bool> __r = __table_.__node_insert_unique(__h.get());
769 __table __table_;
808 {return allocator_type(__table_.__node_alloc());}
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();}
818 iterator begin() {return __table_.begin();}
820 iterator end() {return __table_.end();}
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);}
835 void erase(const_iterator __p) {__table_.erase(__p.__i_);}
837 size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);}
840 {__table_.erase(__first.__i_, __last.__i_);}
842 void clear() {__table_.clear();}
845 void swap(hash_multimap& __u) {__table_.swap(__u.__table_);}
849 {return __table_.hash_function().hash_function();}
852 {return __table_.key_eq().key_eq();}
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);}
862 {return __table_.__equal_range_multi(__k);}
865 {return __table_.__equal_range_multi(__k);}
868 size_type bucket_count() const {return __table_.bucket_count();}
870 size_type max_bucket_count() const {return __table_.max_bucket_count();}
874 {return __table_.bucket_size(__n);}
877 void resize(size_type __n) {__table_.__rehash_multi(__n);}
883 : __table_(__hf, __eql)
885 __table_.__rehash_multi(__n);
892 : __table_(__hf, __eql, __a)
894 __table_.__rehash_multi(__n);
910 : __table_(__hf, __eql)
912 __table_.__rehash_multi(__n);
921 : __table_(__hf, __eql, __a)
923 __table_.__rehash_multi(__n);
930 : __table_(__u.__table_)
932 __table_.__rehash_multi(__u.bucket_count());
944 __table_.__insert_multi(*__first);