/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/detail/ |
H A D | sequence.hpp | 26 // insert helpers -------------------------------------------------// 29 inline void insert( function in namespace:boost::algorithm::detail 35 Input.insert( At, Begin, End ); 39 inline void insert( function in namespace:boost::algorithm::detail 44 ::boost::algorithm::detail::insert( Input, At, ::boost::begin(Insert), ::boost::end(Insert) ); 65 // Assumption: insert and erase are expensive 87 // Replace sequence is longer, insert it 88 Input.insert( InputIt, InsertIt, End ); 104 // Const-time erase and insert methods -> use them 118 Input.insert( A [all...] |
/ndk/tests/device/test-gnustl-full/unit/ |
H A D | slist_test.cpp | 39 CPPUNIT_TEST(insert); 47 void insert(); 151 void SlistTest::insert() function in class:SlistTest 156 //insert 160 sl.insert(sl.begin(), 5); 165 //sl.insert(sl.before_begin(), array, array + 5); 167 sl.insert(sl.begin(), array, array + 5);
|
H A D | deque_test.cpp | 25 CPPUNIT_TEST(insert); 37 void insert(); 80 void DequeTest::insert() function in class:DequeTest 91 dit = d.insert(d.begin(), 3); 98 dit = d.insert(d.begin() + 1, 4); 105 dit = d.insert(d.end(), 5); 112 dit = d.insert(d.end() - 1, 6); 119 d.insert(d.begin(), 2, 7); 125 //There is more elements to insert than elements before insertion position 126 d.insert( [all...] |
H A D | set_test.cpp | 23 CPPUNIT_TEST(insert); 40 void insert(); 60 s.insert(42); 62 s.insert(42); 72 pair<int_set::iterator, bool> p = s.insert(42); 74 p = s.insert(42); 78 s.insert(array1, array1 + 4); 97 s.insert(1); 105 void SetTest::insert() function in class:SetTest 108 set<int>::iterator i = s.insert( [all...] |
/ndk/tests/device/test-stlport/unit/ |
H A D | slist_test.cpp | 39 CPPUNIT_TEST(insert); 47 void insert(); 151 void SlistTest::insert() function in class:SlistTest 156 //insert 160 sl.insert(sl.begin(), 5); 165 //sl.insert(sl.before_begin(), array, array + 5); 167 sl.insert(sl.begin(), array, array + 5);
|
H A D | deque_test.cpp | 25 CPPUNIT_TEST(insert); 37 void insert(); 80 void DequeTest::insert() function in class:DequeTest 91 dit = d.insert(d.begin(), 3); 98 dit = d.insert(d.begin() + 1, 4); 105 dit = d.insert(d.end(), 5); 112 dit = d.insert(d.end() - 1, 6); 119 d.insert(d.begin(), 2, 7); 125 //There is more elements to insert than elements before insertion position 126 d.insert( [all...] |
H A D | set_test.cpp | 23 CPPUNIT_TEST(insert); 40 void insert(); 60 s.insert(42); 62 s.insert(42); 72 pair<int_set::iterator, bool> p = s.insert(42); 74 p = s.insert(42); 78 s.insert(array1, array1 + 4); 97 s.insert(1); 105 void SetTest::insert() function in class:SetTest 108 set<int>::iterator i = s.insert( [all...] |
/ndk/sources/cxx-stl/stlport/src/ |
H A D | messages.cpp | 29 void _Catalog_locale_map::insert(nl_catd_type key, const locale& L) { function in class:_Catalog_locale_map 46 M->insert(map_type::value_type(key, L)); 72 messages_base::catalog _Catalog_nl_catd_map::insert(nl_catd_type cat) { function in class:_Catalog_nl_catd_map 130 _M_map->insert(result, L); 132 return _STLP_MUTABLE(_Messages_impl, _M_cat).insert( result );
|
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _vector.c | 223 vector<_Tp, _Alloc>::insert(iterator __pos, const _Tp& __x) { function in class:_Alloc
|
H A D | _map.h | 179 __i = insert(__i, value_type(__k, _STLP_DEFAULT_CONSTRUCTED(_Tp))); 187 // insert/erase 188 pair<iterator,bool> insert(const value_type& __x) function in class:map 190 iterator insert(iterator __pos, const value_type& __x) function in class:map 194 void insert(_InputIterator __first, _InputIterator __last) function in class:map 197 void insert(const value_type* __first, const value_type* __last) function in class:map 199 void insert(const_iterator __first, const_iterator __last) function in class:map 365 // insert/erase 366 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } function in class:multimap 367 iterator insert(iterato function in class:multimap 370 void insert(_InputIterator __first, _InputIterator __last) function in class:multimap 373 void insert(const value_type* __first, const value_type* __last) function in class:multimap 375 void insert(const_iterator __first, const_iterator __last) function in class:multimap [all...] |
H A D | _set.h | 167 // insert/erase 168 pair<iterator,bool> insert(const value_type& __x) function in class:set 170 iterator insert(iterator __pos, const value_type& __x) function in class:set 174 void insert(_InputIterator __first, _InputIterator __last) function in class:set 177 void insert(const_iterator __first, const_iterator __last) function in class:set 179 void insert(const value_type* __first, const value_type* __last) function in class:set 338 // insert/erase 339 iterator insert(const value_type& __x) function in class:multiset 341 iterator insert(iterator __pos, const value_type& __x) function in class:multiset 346 void insert(_InputIterato function in class:multiset 349 void insert(const value_type* __first, const value_type* __last) function in class:multiset 351 void insert(const_iterator __first, const_iterator __last) function in class:multiset [all...] |
H A D | _deque.c | 115 insert(this->_M_finish, __mid, __x.end()); 150 void deque<_Tp, _Alloc>::insert(iterator __pos, function in class:_Alloc 178 void deque<_Tp,_Alloc>::insert(iterator __pos, function in class:_Alloc
|
H A D | _hash_map.h | 179 pair<iterator,bool> insert(const value_type& __obj) function in class:hash_map 183 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_map 186 void insert(const value_type* __f, const value_type* __l) function in class:hash_map 188 void insert(const_iterator __f, const_iterator __l) function in class:hash_map 371 iterator insert(const value_type& __obj) function in class:hash_multimap 375 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_multimap 378 void insert(const value_type* __f, const value_type* __l) { function in class:hash_multimap 381 void insert(const_iterator __f, const_iterator __l) function in class:hash_multimap 458 container->insert(__val); 485 container->insert(__va [all...] |
H A D | _hash_set.h | 181 pair<iterator, bool> insert(const value_type& __obj) function in class:hash_set 185 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_set 187 void insert(const_iterator __f, const_iterator __l) 189 void insert(const value_type* __f, const value_type* __l) 363 iterator insert(const value_type& __obj) { return _M_ht.insert_equal(__obj); } function in class:hash_multiset 366 void insert(_InputIterator __f, _InputIterator __l) function in class:hash_multiset 369 void insert(const value_type* __f, const value_type* __l) function in class:hash_multiset 371 void insert(const_iterator __f, const_iterator __l) function in class:hash_multiset 453 container->insert(__val); 480 container->insert(__va [all...] |
H A D | _string.c | 280 void basic_string<_CharT,_Traits,_Alloc>::insert(iterator __pos, function in class:_Alloc 382 insert(__last, __n - __len, __c); 406 // We have to deal with possible reallocation because we do insert first.
|
H A D | _string_workaround.h | 319 _Self& insert(size_type __pos, const _Self& __s) { function in class:basic_string 320 _Base::insert(__pos, __s); 324 _Self& insert(size_type __pos, const _Self& __s, function in class:basic_string 326 _Base::insert(__pos, __s, __beg, __n); 329 _Self& insert(size_type __pos, const _CharT* __s, size_type __n) { function in class:basic_string 331 _Base::insert(__pos, __s, __n); 335 _Self& insert(size_type __pos, const _CharT* __s) { function in class:basic_string 337 _Base::insert(__pos, __s); 341 _Self& insert(size_type __pos, size_type __n, _CharT __c) { function in class:basic_string 342 _Base::insert(__po 346 iterator insert(iterator __p, _CharT __c) function in class:basic_string 349 void insert(iterator __p, size_t __n, _CharT __c) function in class:basic_string 355 void insert(iterator __p, _InputIter __first, _InputIter __last) { function in class:basic_string 362 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { function in class:basic_string [all...] |
H A D | _unordered_map.h | 133 pair<iterator,bool> insert(const value_type& __obj) function in class:unordered_map 135 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_map 139 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_map 141 void insert(const value_type* __f, const value_type* __l) 143 void insert(const_iterator __f, const_iterator __l) 301 iterator insert(const value_type& __obj) function in class:unordered_multimap 303 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_multimap 307 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_multimap 309 void insert(const value_type* __f, const value_type* __l) 311 void insert(const_iterato [all...] |
H A D | _unordered_set.h | 127 pair<iterator, bool> insert(const value_type& __obj) function in class:unordered_set 129 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_set 133 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_set 135 void insert(const_iterator __f, const_iterator __l) 137 void insert(const value_type* __f, const value_type* __l) 277 iterator insert(const value_type& __obj) function in class:unordered_multiset 279 iterator insert(const_iterator /*__hint*/, const value_type& __obj) function in class:unordered_multiset 283 void insert(_InputIterator __f, _InputIterator __l) function in class:unordered_multiset 285 void insert(const value_type* __f, const value_type* __l) 287 void insert(const_iterato [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/support/ |
H A D | nasty_containers.hpp | 103 iterator insert(const_iterator pos, const value_type& x) { return v_.insert(pos, x); } function in class:nasty_vector 105 iterator insert(const_iterator pos, value_type&& x) { return v_.insert(pos, std::forward<value_type>(x)); } function in class:nasty_vector 107 iterator insert(const_iterator pos, size_type n, const value_type& x) { return v_.insert(pos, n, x); } function in class:nasty_vector 109 iterator insert(const_iterator pos, InputIterator first, InputIterator last) function in class:nasty_vector 110 { return v_.insert(pos, first, last); } 113 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return v_.insert(po function in class:nasty_vector 224 iterator insert(const_iterator pos, const value_type& x) { return l_.insert(pos, x); } function in class:nasty_list 226 iterator insert(const_iterator pos, value_type&& x) { return l_.insert(pos, std::forward<value_type>(x)); } function in class:nasty_list 228 iterator insert(const_iterator pos, size_type n, const value_type& x) { return l_.insert(pos, n, x); } function in class:nasty_list 230 iterator insert(const_iterator pos, InputIterator first, InputIterator last) function in class:nasty_list 234 iterator insert(const_iterator pos, std::initializer_list<value_type> il) { return l_.insert(pos, il); } function in class:nasty_list [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
H A D | _list.h | 206 iterator insert(iterator __pos, const _Tp& __x = _Tp()) { function in class:list 208 iterator insert(iterator __pos, const _Tp& __x) { 211 return iterator(&_M_iter_list,_M_non_dbg_impl.insert(__pos._M_iterator, __x) ); 215 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); } function in class:list 220 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:list 223 _M_non_dbg_impl.insert(__pos._M_iterator, 229 void insert(iterator __pos, const _Tp* __first, const _Tp* __last) { function in class:list 232 _M_non_dbg_impl.insert(__pos._M_iterator, __first, __last); 237 void insert(iterato function in class:list 246 void insert(iterator __pos, function in class:list 257 void insert(iterator __pos, size_type __n, const _Tp& __x) { function in class:list [all...] |
H A D | _slist.h | 290 void insert(iterator __pos, _InIter __first, _InIter __last) { function in class:slist 294 _M_non_dbg_impl.insert(__pos._M_iterator, 313 void insert(iterator __pos, const_iterator __first, const_iterator __last) { function in class:slist 317 _M_non_dbg_impl.insert(__pos._M_iterator, __first._M_iterator, __last._M_iterator); 319 void insert(iterator __pos, const value_type* __first, function in class:slist 324 _M_non_dbg_impl.insert(__pos._M_iterator, __first, __last); 329 iterator insert(iterator __pos, const value_type& __x = _Tp()) { function in class:slist 331 iterator insert(iterator __pos, const value_type& __x) { 335 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x)); 339 iterator insert(iterato function in class:slist 344 void insert(iterator __pos, size_type __n, const value_type& __x) { function in class:slist [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
H A D | _vector.h | 176 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:vector 178 iterator insert(iterator __pos, const value_type& __x) 180 { return cast_traits::to_value_type_ptr(_M_impl.insert(cast_traits::to_storage_type_ptr(__pos), 185 iterator insert(iterator __pos) function in class:vector 186 { return _M_impl.insert(cast_traits::to_storage_type_ptr(__pos)); } 196 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) function in class:vector 197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } 199 void insert(iterator __pos, const_iterator __first, const_iterator __last) { function in class:vector 200 _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), cast_traits::to_storage_type_cptr(__first), 205 void insert (iterato function in class:vector [all...] |
H A D | _deque.h | 187 insert(end(), __first, __last); 197 { insert(end(), __first, __last); } 289 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:deque 291 iterator insert(iterator __pos, const value_type& __x) 293 { return ite_cast_traits::to_value_type_ite(_M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), 297 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(value_type)); } function in class:deque 300 void insert(iterator __pos, size_type __n, const value_type& __x) function in class:deque 301 { _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, cast_traits::to_storage_type_cref(__x)); } 309 _M_impl.insert(ite_cast_trait 325 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:deque 336 void insert(iterator __pos, function in class:deque 342 void insert(iterator __pos, function in class:deque [all...] |
H A D | _list.h | 117 insert(begin(), __first, __last); 127 { insert(begin(), __first, __last); } 180 iterator insert(iterator __pos, const_reference __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:list 182 iterator insert(iterator __pos, const_reference __x) 184 { return iterator(_M_impl.insert(_BaseIte(__pos._M_node), 193 { _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); } 199 _M_impl.insert(_BaseIte(__pos._M_node), 208 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:list 214 _M_impl.insert(_BaseIte(__pos._M_node), __first, __last); 218 void insert(iterato function in class:list 221 void insert(iterator __pos, const_iterator __first, const_iterator __last) function in class:list 225 void insert(iterator __pos, size_type __n, const value_type& __x) function in class:list 232 iterator insert(iterator __pos) { return iterator(_M_impl.insert(__pos._M_node)._M_node); } function in class:list [all...] |
H A D | _set.h | 227 // insert/erase 228 pair<iterator,bool> insert(const value_type& __x) { function in class:set 232 iterator insert(iterator __pos, const value_type& __x) function in class:set 237 void insert(_InputIterator __first, _InputIterator __last) { function in class:set 246 void insert(const_iterator __first, const_iterator __last) function in class:set 248 void insert(const value_type* __first, const value_type* __last) { function in class:set 480 // insert/erase 481 iterator insert(const value_type& __x) function in class:multiset 483 iterator insert(iterator __pos, const value_type& __x) { function in class:multiset 490 void insert(_InputIterato function in class:multiset 499 void insert(const value_type* __first, const value_type* __last) { function in class:multiset 503 void insert(const_iterator __first, const_iterator __last) function in class:multiset [all...] |