Home
last modified time | relevance | path

Searched refs:iterator (Results 1 – 25 of 98) sorted by relevance

1234

/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/
D_slist.h61 typedef typename _Base::iterator _BaseIte;
77 typedef _STLP_PRIV _Slist_iterator<value_type, _Nonconst_traits<value_type> > iterator; typedef
186 iterator before_begin() { return iterator(_M_impl.before_begin()._M_node); } in before_begin()
189 iterator begin() { return iterator(_M_impl.begin()._M_node); } in begin()
192 iterator end() { return iterator(_M_impl.end()._M_node); } in end()
193 const_iterator end() const { return iterator(_M_impl.end()._M_node); } in end()
220 iterator previous(const_iterator __pos) in previous()
221 { return iterator(_M_impl.previous(_BaseConstIte(__pos._M_node))._M_node); } in previous()
226 …iterator insert_after(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type…
228 iterator insert_after(iterator __pos, const value_type& __x)
[all …]
D_list.h67 typedef typename _Base::iterator _BaseIte;
84 typedef _STLP_PRIV _List_iterator<value_type, _Nonconst_traits<value_type> > iterator; typedef
152 iterator begin() { return iterator(_M_impl.begin()._M_node); } in begin()
155 iterator end() { return iterator(_M_impl.end()._M_node); } in end()
180 iterator insert(iterator __pos, const_reference __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
182 iterator insert(iterator __pos, const_reference __x)
184 { return iterator(_M_impl.insert(_BaseIte(__pos._M_node),
191 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, in _M_insert_dispatch()
196 void _M_insert_dispatch(iterator __pos, in _M_insert_dispatch()
208 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { in insert()
[all …]
D_set.h96 typedef typename _Rep_type::iterator base_iterator;
104 typedef typename _Priv_Rep_type::iterator iterator;
117 static iterator _S_to_value_ite(const_base_iterator __ite)
118 { return iterator(__ite._Owner(), __ite._M_iterator._M_node); }
122 static iterator _S_to_value_ite(const_base_iterator __ite)
123 { return iterator(__ite._M_node); }
211 iterator begin() { return _S_to_value_ite(_M_t.begin()); }
212 iterator end() { return _S_to_value_ite(_M_t.end()); }
228 pair<iterator,bool> insert(const value_type& __x) {
230 return pair<iterator, bool>(_S_to_value_ite(ret.first), ret.second);
[all …]
D_vector.h64 typedef value_type* iterator; typedef
79 iterator begin() { return cast_traits::to_value_type_ptr(_M_impl.begin()); } in begin()
81 iterator end() { return cast_traits::to_value_type_ptr(_M_impl.end()); } in end()
176 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
178 iterator insert(iterator __pos, const value_type& __x)
185 iterator insert(iterator __pos) in insert()
196 void insert(iterator __pos, _InputIterator __first, _InputIterator __last) in insert()
199 void insert(iterator __pos, const_iterator __first, const_iterator __last) { in insert()
205 void insert (iterator __pos, size_type __n, const value_type& __x) { in insert()
210 iterator erase(iterator __pos) in erase()
[all …]
D_deque.h35 typedef _Deque_iterator<_ValueT, _Nonconst_traits<_ValueT> > iterator; typedef
41 static iterator to_value_type_ite (storage_iterator const& __ite) { in to_value_type_ite()
42 iterator tmp; in to_value_type_ite()
49 static storage_iterator to_storage_type_ite (iterator const& __ite) { in to_storage_type_ite()
121 typedef _STLP_PRIV _Deque_iterator<value_type, _Nonconst_traits<value_type> > iterator;
127 iterator begin() { return ite_cast_traits::to_value_type_ite(_M_impl.begin()); }
128 iterator end() { return ite_cast_traits::to_value_type_ite(_M_impl.end()); }
289 iterator insert(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type))
291 iterator insert(iterator __pos, const value_type& __x)
297 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(value_type)); }
[all …]
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/
D_tree.h105 typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_NonConstIteTraits> > iterator; typedef
112 void _Invalidate_iterator(const iterator& __it) in _STLP_KEY_TYPE_FOR_CONT_EXT()
114 void _Invalidate_iterators(const iterator& __first, const iterator& __last) in _Invalidate_iterators()
117 typedef typename _Base::iterator _Base_iterator;
156 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } in begin()
158 iterator end() { return iterator(&_M_iter_list, _M_non_dbg_impl.end()); } in end()
178 iterator find(const _KT& __k) in find()
179 { return iterator(&_M_iter_list, _M_non_dbg_impl.find(__k)); } in find()
185 iterator lower_bound(const _KT& __x) in lower_bound()
186 { return iterator(&_M_iter_list, _M_non_dbg_impl.lower_bound(__x)); } in lower_bound()
[all …]
D_slist.h91 …f _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _SlistDbgTraits<_Nonconst_traits<value_type> > > iterator; typedef
99 void _Invalidate_iterator(const iterator& __it) in _Invalidate_iterator()
101 void _Invalidate_iterators(const iterator& __first, const iterator& __last) in _Invalidate_iterators()
104 typedef typename _Base::iterator _Base_iterator;
184 iterator before_begin() in before_begin()
185 { return iterator(&_M_iter_list, _M_non_dbg_impl.before_begin()); } in before_begin()
189 iterator begin() in begin()
190 { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } in begin()
194 iterator end() in end()
195 { return iterator(&_M_iter_list, _M_non_dbg_impl.end()); } in end()
[all …]
D_list.h74 …ypedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_Nonconst_traits<value_type> > > iterator; typedef
83 void _Invalidate_iterator(const iterator& __it) in _Invalidate_iterator()
85 void _Invalidate_iterators(const iterator& __first, const iterator& __last) in _Invalidate_iterators()
88 typedef typename _Base::iterator _Base_iterator;
163 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } in begin()
166 iterator end() { return iterator(&_M_iter_list, _M_non_dbg_impl.end()); } in end()
206 iterator insert(iterator __pos, const _Tp& __x = _Tp()) {
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)); } in insert()
[all …]
D_deque.h69 …ypedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_Nonconst_traits<value_type> > > iterator; typedef
80 void _Invalidate_iterator(const iterator& __it) in _Invalidate_iterator()
82 void _Invalidate_iterators(const iterator& __first, const iterator& __last) in _Invalidate_iterators()
89 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } in begin()
90 iterator end() { return iterator(&_M_iter_list, _M_non_dbg_impl.end()); } in end()
286 iterator insert(iterator __pos, const value_type& __x = _Tp()) {
288 iterator insert(iterator __pos, const value_type& __x) {
292 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x));
296 iterator insert(iterator __pos) { in insert()
299 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator)); in insert()
[all …]
D_vector.h118 …V _DbgTraits<_STLP_PRIV _Vector_nonconst_traits<value_type, typename _Base::iterator> > > iterator;
121 …_STLP_PRIV _DbgTraits<_STLP_PRIV _Vector_const_traits<value_type, typename _Base::iterator> > > co…
126 void _Invalidate_iterator(const iterator& __it)
128 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
146 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); }
148 iterator end() { return iterator(&_M_iter_list, _M_non_dbg_impl.end()); }
274 iterator insert(iterator __pos, const _Tp& __x = _Tp()) {
276 iterator insert(iterator __pos, const _Tp& __x) {
280 return iterator(&_M_iter_list, _M_non_dbg_impl.insert(__pos._M_iterator, __x));
284 iterator insert(iterator __pos)
[all …]
D_hashtable.h110 typedef _STLP_PRIV _DBG_iter<_Base, _STLP_PRIV _DbgTraits<_NonConstTraits> > iterator; typedef
113 typedef iterator local_iterator;
117 typedef typename _Base::iterator _Base_iterator;
183 iterator begin() { return iterator(&_M_iter_list, _M_non_dbg_impl.begin()); } in begin()
184 iterator end() { return iterator(&_M_iter_list, _M_non_dbg_impl.end()); } in end()
209 pair<iterator, bool> insert_unique(const value_type& __obj) { in insert_unique()
211 return pair<iterator, bool>(iterator(&_M_iter_list, __res.first), __res.second); in insert_unique()
214 iterator insert_equal(const value_type& __obj) in insert_equal()
215 { return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__obj)); } in insert_equal()
217 pair<iterator, bool> insert_unique_noresize(const value_type& __obj) { in insert_unique_noresize()
[all …]
/ndk/sources/cxx-stl/stlport/stlport/stl/
D_slist.h91 typedef _Slist_iterator<_Tp, _NonConstTraits> iterator; typedef
100 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {} in _Slist_iterator()
239 typedef _STLP_PRIV _Slist_iterator<_Tp, _Nonconst_traits<_Tp> > iterator;
412 iterator before_begin() { return iterator(&this->_M_head._M_data); }
416 iterator begin() { return iterator(this->_M_head._M_data._M_next); }
420 iterator end() { return iterator(); }
458 iterator previous(const_iterator __pos) {
459 return iterator(_STLP_PRIV _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node));
558 splice_after(iterator(__pos), __tmp);
595 splice(iterator(__pos), __tmp);
[all …]
D_deque.c98 # define iterator __iterator__ macro
102 # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE deque<_Tp, _Alloc>::iterator
122 void deque<_Tp, _Alloc >::_M_fill_insert(iterator __pos, in _M_fill_insert()
128 iterator __new_start = _M_reserve_elements_at_front(__n); in _M_fill_insert()
136 iterator __new_finish = _M_reserve_elements_at_back(__n); in _M_fill_insert()
150 void deque<_Tp, _Alloc>::insert(iterator __pos, in insert()
157 iterator __new_start = _M_reserve_elements_at_front(__n); in insert()
165 iterator __new_finish = _M_reserve_elements_at_back(__n); in insert()
178 void deque<_Tp,_Alloc>::insert(iterator __pos, in insert()
185 iterator __new_start = _M_reserve_elements_at_front(__n); in insert()
[all …]
D_deque.h174 typedef _Deque_iterator<_Tp, _NonConstTraits> iterator; typedef
183 _Deque_iterator(const iterator& __x) : in _Deque_iterator()
351 typedef _Deque_iterator<_Tp, _Nonconst_traits<_Tp> > iterator;
385 iterator _M_start;
386 iterator _M_finish;
420 typedef typename _Base::iterator iterator;
432 iterator begin() { return this->_M_start; }
433 iterator end() { return this->_M_finish; }
460 iterator __tmp = this->_M_finish;
624 iterator __cur = begin();
[all …]
D_list.h104 typedef _List_iterator<_Tp, _NonConstTraits> iterator; typedef
116 _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} in _List_iterator()
275 typedef _STLP_PRIV _List_iterator<_Tp, _Nonconst_traits<_Tp> > iterator;
367 iterator begin() { return iterator(this->_M_node._M_data._M_next); }
370 iterator end() { return iterator(&this->_M_node._M_data); }
420 iterator insert(iterator __pos, const_reference __x = value_type())
422 iterator insert(iterator __pos, const_reference __x)
432 return iterator(__tmp);
438 void _M_insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
445 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
[all …]
D_vector.h124 typedef value_type* iterator; typedef
182 iterator begin() { return this->_M_start; } in begin()
184 iterator end() { return this->_M_finish; } in end()
328 iterator __tmp = _M_allocate_and_copy(__n, __first, __last);
333 iterator __new_finish = copy(__first, __last, this->_M_start);
349 iterator __cur = begin();
391 iterator insert(iterator __pos, const _Tp& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp));
393 iterator insert(iterator __pos, const _Tp& __x);
398 iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
411 …void _M_fill_insert_aux (iterator __pos, size_type __n, const _Tp& __x, const __true_type& /*_Mova…
[all …]
D_map.h85 typedef typename _Rep_type::iterator iterator; in _STLP_CREATE_ITERATOR_TRAITS() typedef
163 iterator begin() { return _M_t.begin(); } in _STLP_CREATE_ITERATOR_TRAITS()
165 iterator end() { return _M_t.end(); } in _STLP_CREATE_ITERATOR_TRAITS()
176 iterator __i = lower_bound(__k); in _STLP_CREATE_ITERATOR_TRAITS()
188 pair<iterator,bool> insert(const value_type& __x) in _STLP_CREATE_ITERATOR_TRAITS()
190 iterator insert(iterator __pos, const value_type& __x) in _STLP_CREATE_ITERATOR_TRAITS()
203 void erase(iterator __pos) { _M_t.erase(__pos); } in _STLP_CREATE_ITERATOR_TRAITS()
205 void erase(iterator __first, iterator __last) { _M_t.erase(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
210 iterator find(const _KT& __x) { return _M_t.find(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
216 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_set.h73 typedef typename _Rep_type::iterator iterator; in _STLP_CREATE_ITERATOR_TRAITS() typedef
151 iterator begin() { return _M_t.begin(); } in _STLP_CREATE_ITERATOR_TRAITS()
152 iterator end() { return _M_t.end(); } in _STLP_CREATE_ITERATOR_TRAITS()
168 pair<iterator,bool> insert(const value_type& __x) in _STLP_CREATE_ITERATOR_TRAITS()
170 iterator insert(iterator __pos, const value_type& __x) in _STLP_CREATE_ITERATOR_TRAITS()
182 void erase(iterator __pos) { _M_t.erase( __pos ); } in _STLP_CREATE_ITERATOR_TRAITS()
184 void erase(iterator __first, iterator __last) { _M_t.erase(__first, __last ); } in _STLP_CREATE_ITERATOR_TRAITS()
191 iterator find(const _KT& __x) { return _M_t.find(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
196 iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
200 iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_tree.h155 typedef _Rb_tree_iterator<_Value, _NonConstTraits> iterator; typedef
168 _Rb_tree_iterator(const iterator& __it) : _Rb_tree_base_iterator(__it._M_node) {} in _Rb_tree_iterator()
371 typedef _Rb_tree_iterator<value_type, _NonConstTraits> iterator;
376 …iterator _M_insert(_Base_ptr __parent, const value_type& __val, _Base_ptr __on_left = 0, _Base_ptr…
421 iterator begin() { return iterator(_M_leftmost()); }
423 iterator end() { return iterator(&this->_M_header._M_data); }
458 pair<iterator,bool> insert_unique(const value_type& __x);
459 iterator insert_equal(const value_type& __x);
461 iterator insert_unique(iterator __pos, const value_type& __x);
462 iterator insert_equal(iterator __pos, const value_type& __x);
[all …]
D_string_workaround.h346 iterator insert(iterator __p, _CharT __c) in insert()
349 void insert(iterator __p, size_t __n, _CharT __c) in insert()
355 void insert(iterator __p, _InputIter __first, _InputIter __last) { in insert()
362 void insert(iterator __p, const _CharT* __f, const _CharT* __l) { in insert()
369 void _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) { in _M_insert()
375 void _M_insert_overflow(iterator __pos, _ForwardIter __first, _ForwardIter __last, in _M_insert_overflow()
388 void _M_insertT(iterator __p, _InputIter __first, _InputIter __last, in _M_insertT()
397 void _M_insertT(iterator __pos, _ForwardIter __first, _ForwardIter __last, in _M_insertT()
427 void _M_insert_dispatch(iterator __p, _Integer __n, _Integer __x, in _M_insert_dispatch()
432 void _M_insert_dispatch(iterator __p, _InputIter __first, _InputIter __last, in _M_insert_dispatch()
[all …]
D_bvector.h375 typedef _STLP_PRIV _Bit_iterator iterator;
393 this->_M_start = iterator(__q, 0);
396 void _M_insert_aux(iterator __position, bool __x) {
406 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
411 this->_M_start = iterator(__q, 0);
419 this->_M_start = iterator();
420 this->_M_finish = iterator();
435 void _M_insert_range(iterator __pos,
445 void _M_insert_range(iterator __position,
459 iterator __i = _STLP_STD::copy(begin(), __position, iterator(__q, 0));
[all …]
/ndk/tests/device/test-stlport/unit/
Dmvctor_test.cpp239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end()); in deque_test()
247 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
267 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
278 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
287 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
298 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
307 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
318 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
331 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end()); in deque_test()
[all …]
Dhash_test.cpp93 pair<maptype::iterator, bool> p = m.insert(pair<const char, crope>('c', crope("100"))); in hmap1()
101 maptype::iterator ite(m.begin()); in hmap1()
126 mmap::iterator i = m.find('X'); // Find first match. in hmmap1()
143 mmap::iterator ite(m.begin()); in hmmap1()
207 for ( mapType::iterator i = m.begin(); i != m.end(); ++i ) { in check_keys()
209 pair<hashType::iterator,hashType::iterator> range = h.equal_range( i->first ); in check_keys()
210 for ( hashType::iterator j = range.first; j != range.second; ++j ) { in check_keys()
222 for (mapType::iterator mIter = m.begin(); mIter != m.end(); mIter++) { in check_keys()
230 pair<hashType::iterator,hashType::iterator> range = h.equal_range(mIter->first); in check_keys()
232 for (hashType::iterator h = range.first; h != range.second; h++) { in check_keys()
[all …]
/ndk/tests/device/test-gnustl-full/unit/
Dmvctor_test.cpp239 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end()); in deque_test()
247 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
258 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
267 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
278 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
287 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
298 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
307 deque<vector<int> >::iterator it = vect_deque.end() - 5; in deque_test()
318 deque<vector<int> >::iterator dit(vect_deque.begin()), ditEnd(vect_deque.end()); in deque_test()
331 deque<vector<int> >::iterator vdit(vect_deque.begin()), vditEnd(vect_deque.end()); in deque_test()
[all …]
Dhash_test.cpp93 pair<maptype::iterator, bool> p = m.insert(pair<const char, crope>('c', crope("100"))); in hmap1()
101 maptype::iterator ite(m.begin()); in hmap1()
126 mmap::iterator i = m.find('X'); // Find first match. in hmmap1()
143 mmap::iterator ite(m.begin()); in hmmap1()
207 for ( mapType::iterator i = m.begin(); i != m.end(); ++i ) { in check_keys()
209 pair<hashType::iterator,hashType::iterator> range = h.equal_range( i->first ); in check_keys()
210 for ( hashType::iterator j = range.first; j != range.second; ++j ) { in check_keys()
222 for (mapType::iterator mIter = m.begin(); mIter != m.end(); mIter++) { in check_keys()
230 pair<hashType::iterator,hashType::iterator> range = h.equal_range(mIter->first); in check_keys()
232 for (hashType::iterator h = range.first; h != range.second; h++) { in check_keys()
[all …]

1234