Home
last modified time | relevance | path

Searched refs:insert_equal (Results 1 – 6 of 6) sorted by relevance

/haiku/headers/cpp/
H A Dstl_multiset.h85 { _M_t.insert_equal(__first, __last); } in multiset()
91 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t()
97 { _M_t.insert_equal(__first, __last); } in multiset()
102 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t()
106 { _M_t.insert_equal(__first, __last); } in multiset()
111 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t()
139 return _M_t.insert_equal(__x); in insert()
143 return _M_t.insert_equal((_Rep_iterator&)__position, __x); in insert()
149 _M_t.insert_equal(__first, __last); in insert()
153 _M_t.insert_equal(__first, __last); in insert()
[all …]
H A Dstl_multimap.h98 { _M_t.insert_equal(__first, __last); } in multimap()
104 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t()
108 { _M_t.insert_equal(__first, __last); } in multimap()
112 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t()
116 { _M_t.insert_equal(__first, __last); } in multimap()
120 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _M_t()
151 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } in insert()
153 return _M_t.insert_equal(__position, __x); in insert()
158 _M_t.insert_equal(__first, __last); in insert()
162 _M_t.insert_equal(__first, __last); in insert()
[all …]
H A Dstl_hash_map.h278 { _M_ht.insert_equal(__f, __l); } in hash_multimap()
282 { _M_ht.insert_equal(__f, __l); } in hash_multimap()
287 { _M_ht.insert_equal(__f, __l); } in hash_multimap()
293 { _M_ht.insert_equal(__f, __l); } in _M_ht()
298 { _M_ht.insert_equal(__f, __l); } in hash_multimap()
301 { _M_ht.insert_equal(__f, __l); } in hash_multimap()
305 { _M_ht.insert_equal(__f, __l); } in hash_multimap()
310 { _M_ht.insert_equal(__f, __l); } in _M_ht()
314 { _M_ht.insert_equal(__f, __l); } in hash_multimap()
317 { _M_ht.insert_equal(__f, __l); } in hash_multimap()
[all …]
H A Dstl_hash_set.h272 { _M_ht.insert_equal(__f, __l); } in hash_multiset()
276 { _M_ht.insert_equal(__f, __l); } in hash_multiset()
281 { _M_ht.insert_equal(__f, __l); } in hash_multiset()
287 { _M_ht.insert_equal(__f, __l); } in _M_ht()
292 { _M_ht.insert_equal(__f, __l); } in hash_multiset()
295 { _M_ht.insert_equal(__f, __l); } in hash_multiset()
299 { _M_ht.insert_equal(__f, __l); } in hash_multiset()
304 { _M_ht.insert_equal(__f, __l); } in _M_ht()
308 { _M_ht.insert_equal(__f, __l); } in hash_multiset()
311 { _M_ht.insert_equal(__f, __l); } in hash_multiset()
[all …]
H A Dstl_tree.h711 iterator insert_equal(const value_type& __x);
714 iterator insert_equal(iterator __position, const value_type& __x);
720 void insert_equal(_InputIterator __first, _InputIterator __last);
724 void insert_equal(const_iterator __first, const_iterator __last);
725 void insert_equal(const value_type* __first, const value_type* __last);
859 ::insert_equal(const _Value& __v) in insert_equal() function
936 ::insert_equal(iterator __position, const _Val& __v) in insert_equal() function
944 return insert_equal(__v); in insert_equal()
949 return insert_equal(__v); in insert_equal()
961 return insert_equal(__v); in insert_equal()
[all …]
H A Dstl_hashtable.h360 iterator insert_equal(const value_type& __obj)
377 void insert_equal(_InputIterator __f, _InputIterator __l)
379 insert_equal(__f, __l, __ITERATOR_CATEGORY(__f));
391 void insert_equal(_InputIterator __f, _InputIterator __l,
395 insert_equal(*__f);
410 void insert_equal(_ForwardIterator __f, _ForwardIterator __l,
429 void insert_equal(const value_type* __f, const value_type* __l)
446 void insert_equal(const_iterator __f, const_iterator __l)