• Home
  • Raw
  • Download

Lines Matching refs:__n

376     explicit unordered_set(size_type __n, const hasher& __hf = hasher(),
380 unordered_set(size_type __n, const allocator_type& __a)
381 : unordered_set(__n, hasher(), key_equal(), __a) {}
383 unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a)
384 : unordered_set(__n, __hf, key_equal(), __a) {}
386 unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql,
392 size_type __n, const hasher& __hf = hasher(),
396 size_type __n, const hasher& __hf, const key_equal& __eql,
402 size_type __n, const allocator_type& __a)
403 : unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
406 size_type __n, const hasher& __hf, const allocator_type& __a)
407 : unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
419 unordered_set(initializer_list<value_type> __il, size_type __n,
422 unordered_set(initializer_list<value_type> __il, size_type __n,
427 unordered_set(initializer_list<value_type> __il, size_type __n,
429 : unordered_set(__il, __n, hasher(), key_equal(), __a) {}
431 unordered_set(initializer_list<value_type> __il, size_type __n,
433 : unordered_set(__il, __n, __hf, key_equal(), __a) {}
578 size_type bucket_size(size_type __n) const {return __table_.bucket_size(__n);}
583 local_iterator begin(size_type __n) {return __table_.begin(__n);}
585 local_iterator end(size_type __n) {return __table_.end(__n);}
587 const_local_iterator begin(size_type __n) const {return __table_.cbegin(__n);}
589 const_local_iterator end(size_type __n) const {return __table_.cend(__n);}
591 const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);}
593 const_local_iterator cend(size_type __n) const {return __table_.cend(__n);}
602 void rehash(size_type __n) {__table_.rehash(__n);}
604 void reserve(size_type __n) {__table_.reserve(__n);}
612 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
613 {return __table_.__addable(__i, __n);}
614 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
615 {return __table_.__addable(__i, __n);}
622 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
629 __table_.rehash(__n);
633 unordered_set<_Value, _Hash, _Pred, _Alloc>::unordered_set(size_type __n,
640 __table_.rehash(__n);
657 _InputIterator __first, _InputIterator __last, size_type __n,
664 __table_.rehash(__n);
671 _InputIterator __first, _InputIterator __last, size_type __n,
678 __table_.rehash(__n);
768 initializer_list<value_type> __il, size_type __n, const hasher& __hf,
775 __table_.rehash(__n);
781 initializer_list<value_type> __il, size_type __n, const hasher& __hf,
788 __table_.rehash(__n);
911 explicit unordered_multiset(size_type __n, const hasher& __hf = hasher(),
913 unordered_multiset(size_type __n, const hasher& __hf,
917 unordered_multiset(size_type __n, const allocator_type& __a)
918 : unordered_multiset(__n, hasher(), key_equal(), __a) {}
920 unordered_multiset(size_type __n, const hasher& __hf, const allocator_type& __a)
921 : unordered_multiset(__n, __hf, key_equal(), __a) {}
927 size_type __n, const hasher& __hf = hasher(),
931 size_type __n , const hasher& __hf,
937 size_type __n, const allocator_type& __a)
938 : unordered_multiset(__first, __last, __n, hasher(), key_equal(), __a) {}
942 size_type __n, const hasher& __hf, const allocator_type& __a)
943 : unordered_multiset(__first, __last, __n, __hf, key_equal(), __a) {}
955 unordered_multiset(initializer_list<value_type> __il, size_type __n,
958 unordered_multiset(initializer_list<value_type> __il, size_type __n,
963 unordered_multiset(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
964 : unordered_multiset(__il, __n, hasher(), key_equal(), __a) {}
966 …unordered_multiset(initializer_list<value_type> __il, size_type __n, const hasher& __hf, const all…
967 : unordered_multiset(__il, __n, __hf, key_equal(), __a) {}
1080 size_type bucket_size(size_type __n) const {return __table_.bucket_size(__n);}
1085 local_iterator begin(size_type __n) {return __table_.begin(__n);}
1087 local_iterator end(size_type __n) {return __table_.end(__n);}
1089 const_local_iterator begin(size_type __n) const {return __table_.cbegin(__n);}
1091 const_local_iterator end(size_type __n) const {return __table_.cend(__n);}
1093 const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);}
1095 const_local_iterator cend(size_type __n) const {return __table_.cend(__n);}
1104 void rehash(size_type __n) {__table_.rehash(__n);}
1106 void reserve(size_type __n) {__table_.reserve(__n);}
1114 bool __addable(const const_iterator* __i, ptrdiff_t __n) const
1115 {return __table_.__addable(__i, __n);}
1116 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const
1117 {return __table_.__addable(__i, __n);}
1125 size_type __n, const hasher& __hf, const key_equal& __eql)
1131 __table_.rehash(__n);
1136 size_type __n, const hasher& __hf, const key_equal& __eql,
1143 __table_.rehash(__n);
1160 _InputIterator __first, _InputIterator __last, size_type __n,
1167 __table_.rehash(__n);
1174 _InputIterator __first, _InputIterator __last, size_type __n,
1181 __table_.rehash(__n);
1271 initializer_list<value_type> __il, size_type __n, const hasher& __hf,
1278 __table_.rehash(__n);
1284 initializer_list<value_type> __il, size_type __n, const hasher& __hf,
1291 __table_.rehash(__n);