Lines Matching refs:__n
125 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) in _GLIBCXX_VISIBILITY()
126 : _M_cur(__n), _M_ht(__tab) { } in _GLIBCXX_VISIBILITY()
177 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) in _GLIBCXX_VISIBILITY()
178 : _M_cur(__n), _M_ht(__tab) { } in _GLIBCXX_VISIBILITY()
238 __stl_next_prime(unsigned long __n) in _GLIBCXX_VISIBILITY()
242 const unsigned long* pos = std::lower_bound(__first, __last, __n); in _GLIBCXX_VISIBILITY()
337 hashtable(size_type __n, const _HashFcn& __hf, in _GLIBCXX_VISIBILITY()
342 { _M_initialize_buckets(__n); } in _GLIBCXX_VISIBILITY()
344 hashtable(size_type __n, const _HashFcn& __hf, in _GLIBCXX_VISIBILITY()
349 { _M_initialize_buckets(__n); } in _GLIBCXX_VISIBILITY()
399 for (size_type __n = 0; __n < _M_buckets.size(); ++__n) in _GLIBCXX_VISIBILITY()
400 if (_M_buckets[__n]) in _GLIBCXX_VISIBILITY()
401 return iterator(_M_buckets[__n], this); in _GLIBCXX_VISIBILITY()
412 for (size_type __n = 0; __n < _M_buckets.size(); ++__n) in _GLIBCXX_VISIBILITY()
413 if (_M_buckets[__n]) in _GLIBCXX_VISIBILITY()
414 return const_iterator(_M_buckets[__n], this); in _GLIBCXX_VISIBILITY()
443 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next) in _GLIBCXX_VISIBILITY()
501 size_type __n = distance(__f, __l); in _GLIBCXX_VISIBILITY()
502 resize(_M_num_elements + __n); in _GLIBCXX_VISIBILITY()
503 for ( ; __n > 0; --__n, ++__f) in _GLIBCXX_VISIBILITY()
512 size_type __n = distance(__f, __l); in _GLIBCXX_VISIBILITY()
513 resize(_M_num_elements + __n); in _GLIBCXX_VISIBILITY()
514 for ( ; __n > 0; --__n, ++__f) in _GLIBCXX_VISIBILITY()
524 size_type __n = _M_bkt_num_key(__key); in _GLIBCXX_VISIBILITY()
526 for (__first = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
536 size_type __n = _M_bkt_num_key(__key); in _GLIBCXX_VISIBILITY()
538 for (__first = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
548 const size_type __n = _M_bkt_num_key(__key); in _GLIBCXX_VISIBILITY()
551 for (const _Node* __cur = _M_buckets[__n]; __cur; in _GLIBCXX_VISIBILITY()
587 _M_next_size(size_type __n) const in _GLIBCXX_VISIBILITY()
588 { return __stl_next_prime(__n); } in _GLIBCXX_VISIBILITY()
591 _M_initialize_buckets(size_type __n) in _GLIBCXX_VISIBILITY()
593 const size_type __n_buckets = _M_next_size(__n); in _GLIBCXX_VISIBILITY()
608 _M_bkt_num_key(const key_type& __key, size_t __n) const in _GLIBCXX_VISIBILITY()
609 { return _M_hash(__key) % __n; } in _GLIBCXX_VISIBILITY()
612 _M_bkt_num(const value_type& __obj, size_t __n) const in _GLIBCXX_VISIBILITY()
613 { return _M_bkt_num_key(_M_get_key(__obj), __n); } in _GLIBCXX_VISIBILITY()
618 _Node* __n = _M_get_node(); in _GLIBCXX_VISIBILITY()
619 __n->_M_next = 0; in _GLIBCXX_VISIBILITY()
622 this->get_allocator().construct(&__n->_M_val, __obj); in _GLIBCXX_VISIBILITY()
623 return __n; in _GLIBCXX_VISIBILITY()
627 _M_put_node(__n); in _GLIBCXX_VISIBILITY()
633 _M_delete_node(_Node* __n) in _GLIBCXX_VISIBILITY()
635 this->get_allocator().destroy(&__n->_M_val); in _GLIBCXX_VISIBILITY()
636 _M_put_node(__n); in _GLIBCXX_VISIBILITY()
640 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last); in _GLIBCXX_VISIBILITY()
643 _M_erase_bucket(const size_type __n, _Node* __last); in _GLIBCXX_VISIBILITY()
715 for (size_t __n = 0; __n < __ht1._M_buckets.size(); ++__n) in _GLIBCXX_VISIBILITY()
717 _Node* __cur1 = __ht1._M_buckets[__n]; in _GLIBCXX_VISIBILITY()
718 _Node* __cur2 = __ht2._M_buckets[__n]; in _GLIBCXX_VISIBILITY()
726 for (__cur1 = __ht1._M_buckets[__n] ; __cur1; in _GLIBCXX_VISIBILITY()
730 for (__cur2 = __ht2._M_buckets[__n]; in _GLIBCXX_VISIBILITY()
764 const size_type __n = _M_bkt_num(__obj); in _GLIBCXX_VISIBILITY()
765 _Node* __first = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
773 _M_buckets[__n] = __tmp; in _GLIBCXX_VISIBILITY()
783 const size_type __n = _M_bkt_num(__obj); in _GLIBCXX_VISIBILITY()
784 _Node* __first = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
798 _M_buckets[__n] = __tmp; in _GLIBCXX_VISIBILITY()
810 size_type __n = _M_bkt_num(__obj); in _GLIBCXX_VISIBILITY()
811 _Node* __first = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
819 _M_buckets[__n] = __tmp; in _GLIBCXX_VISIBILITY()
831 const size_type __n = _M_bkt_num_key(__key); in _GLIBCXX_VISIBILITY()
833 for (_Node* __first = _M_buckets[__n]; __first; in _GLIBCXX_VISIBILITY()
841 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m) in _GLIBCXX_VISIBILITY()
857 const size_type __n = _M_bkt_num_key(__key); in _GLIBCXX_VISIBILITY()
859 for (const _Node* __first = _M_buckets[__n]; __first; in _GLIBCXX_VISIBILITY()
869 for (size_type __m = __n + 1; __m < _M_buckets.size(); ++__m) in _GLIBCXX_VISIBILITY()
884 const size_type __n = _M_bkt_num_key(__key); in _GLIBCXX_VISIBILITY()
885 _Node* __first = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
929 _M_buckets[__n] = __first->_M_next; in _GLIBCXX_VISIBILITY()
945 const size_type __n = _M_bkt_num(__p->_M_val); in _GLIBCXX_VISIBILITY()
946 _Node* __cur = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
950 _M_buckets[__n] = __cur->_M_next; in _GLIBCXX_VISIBILITY()
994 for (size_type __n = __f_bucket + 1; __n < __l_bucket; ++__n) in _GLIBCXX_VISIBILITY()
995 _M_erase_bucket(__n, 0); in _GLIBCXX_VISIBILITY()
1027 const size_type __n = _M_next_size(__num_elements_hint); in _GLIBCXX_VISIBILITY()
1028 if (__n > __old_n) in _GLIBCXX_VISIBILITY()
1030 _Vector_type __tmp(__n, (_Node*)(0), _M_buckets.get_allocator()); in _GLIBCXX_VISIBILITY()
1039 __n); in _GLIBCXX_VISIBILITY()
1069 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last) in _GLIBCXX_VISIBILITY()
1071 _Node* __cur = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
1073 _M_erase_bucket(__n, __last); in _GLIBCXX_VISIBILITY()
1094 _M_erase_bucket(const size_type __n, _Node* __last) in _GLIBCXX_VISIBILITY()
1096 _Node* __cur = _M_buckets[__n]; in _GLIBCXX_VISIBILITY()
1102 _M_buckets[__n] = __cur; in _GLIBCXX_VISIBILITY()