| /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _set.h | 136 set(_InputIterator __first, _InputIterator __last)
140 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
142 _M_t.insert_unique(__first, __last);
148 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
152 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
154 _M_t.insert_unique(__first, __last);
159 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
164 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
166 _M_t.insert_unique(__first, __last);
170 set(const value_type* __first, const value_type* __last)
[all...] |
| _vector.h | 133 vector(_InputIterator __first, _InputIterator __last,
135 : _M_impl(__first, __last,
140 vector(_InputIterator __first, _InputIterator __last)
141 : _M_impl(__first, __last) {}
145 vector(const_iterator __first, const_iterator __last,
147 : _M_impl(cast_traits::to_storage_type_cptr(__first), cast_traits::to_storage_type_cptr(__last),
159 void assign(_InputIterator __first, _InputIterator __last)
160 { _M_impl.assign(__first, __last); }
162 void assign(const_iterator __first, const_iterator __last) {
164 cast_traits::to_storage_type_cptr(__last));
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } local
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/ |
| _bvector.h | 417 void _M_initialize_range(_InputIterator __first, _InputIterator __last,
422 for ( ; __first != __last; ++__first)
427 void _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
429 size_type __n = _STLP_STD::distance(__first, __last);
431 _STLP_STD::copy(__first, __last, this->_M_start);
436 _InputIterator __first, _InputIterator __last,
438 for ( ; __first != __last; ++__first) {
446 _ForwardIterator __first, _ForwardIterator __last,
448 if (__first != __last) {
449 size_type __n = _STLP_STD::distance(__first, __last);
633 insert(end(), __first, __last); local
646 insert(end(), __mid, __last); local
[all...] |
| _deque.h | 524 void _M_initialize_dispatch(_InputIter __first, _InputIter __last,
526 _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter));
532 deque(_InputIterator __first, _InputIterator __last,
536 _M_initialize_dispatch(__first, __last, _Integral());
541 deque(_InputIterator __first, _InputIterator __last)
544 _M_initialize_dispatch(__first, __last, _Integral());
549 deque(const value_type* __first, const value_type* __last,
551 : _STLP_PRIV _Deque_base<_Tp, _Alloc>(__a, __last - __first)
552 { _STLP_PRIV __ucopy(__first, __last, this->_M_start); }
554 deque(const_iterator __first, const_iterator __last,
630 insert(end(), __first, __last); local
657 insert(end(), __mid, __last); local
[all...] |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _set.h | 136 set(_InputIterator __first, _InputIterator __last)
140 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
142 _M_t.insert_unique(__first, __last);
148 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
152 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
154 _M_t.insert_unique(__first, __last);
159 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
164 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
166 _M_t.insert_unique(__first, __last);
170 set(const value_type* __first, const value_type* __last)
[all...] |
| _vector.h | 133 vector(_InputIterator __first, _InputIterator __last,
135 : _M_impl(__first, __last,
140 vector(_InputIterator __first, _InputIterator __last)
141 : _M_impl(__first, __last) {}
145 vector(const_iterator __first, const_iterator __last,
147 : _M_impl(cast_traits::to_storage_type_cptr(__first), cast_traits::to_storage_type_cptr(__last),
159 void assign(_InputIterator __first, _InputIterator __last)
160 { _M_impl.assign(__first, __last); }
162 void assign(const_iterator __first, const_iterator __last) {
164 cast_traits::to_storage_type_cptr(__last));
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } local
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/ |
| _bvector.h | 417 void _M_initialize_range(_InputIterator __first, _InputIterator __last,
422 for ( ; __first != __last; ++__first)
427 void _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
429 size_type __n = _STLP_STD::distance(__first, __last);
431 _STLP_STD::copy(__first, __last, this->_M_start);
436 _InputIterator __first, _InputIterator __last,
438 for ( ; __first != __last; ++__first) {
446 _ForwardIterator __first, _ForwardIterator __last,
448 if (__first != __last) {
449 size_type __n = _STLP_STD::distance(__first, __last);
633 insert(end(), __first, __last); local
646 insert(end(), __mid, __last); local
[all...] |
| _deque.h | 524 void _M_initialize_dispatch(_InputIter __first, _InputIter __last,
526 _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter));
532 deque(_InputIterator __first, _InputIterator __last,
536 _M_initialize_dispatch(__first, __last, _Integral());
541 deque(_InputIterator __first, _InputIterator __last)
544 _M_initialize_dispatch(__first, __last, _Integral());
549 deque(const value_type* __first, const value_type* __last,
551 : _STLP_PRIV _Deque_base<_Tp, _Alloc>(__a, __last - __first)
552 { _STLP_PRIV __ucopy(__first, __last, this->_M_start); }
554 deque(const_iterator __first, const_iterator __last,
630 insert(end(), __first, __last); local
657 insert(end(), __mid, __last); local
[all...] |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _set.h | 136 set(_InputIterator __first, _InputIterator __last)
140 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
142 _M_t.insert_unique(__first, __last);
148 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
152 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
154 _M_t.insert_unique(__first, __last);
159 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
164 _STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__last));
166 _M_t.insert_unique(__first, __last);
170 set(const value_type* __first, const value_type* __last)
[all...] |
| _vector.h | 133 vector(_InputIterator __first, _InputIterator __last,
135 : _M_impl(__first, __last,
140 vector(_InputIterator __first, _InputIterator __last)
141 : _M_impl(__first, __last) {}
145 vector(const_iterator __first, const_iterator __last,
147 : _M_impl(cast_traits::to_storage_type_cptr(__first), cast_traits::to_storage_type_cptr(__last),
159 void assign(_InputIterator __first, _InputIterator __last)
160 { _M_impl.assign(__first, __last); }
162 void assign(const_iterator __first, const_iterator __last) {
164 cast_traits::to_storage_type_cptr(__last));
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } local
[all...] |
| /external/stlport/stlport/stl/ |
| _deque.h | 524 void _M_initialize_dispatch(_InputIter __first, _InputIter __last,
526 _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter));
532 deque(_InputIterator __first, _InputIterator __last,
536 _M_initialize_dispatch(__first, __last, _Integral());
541 deque(_InputIterator __first, _InputIterator __last)
544 _M_initialize_dispatch(__first, __last, _Integral());
549 deque(const value_type* __first, const value_type* __last,
551 : _STLP_PRIV _Deque_base<_Tp, _Alloc>(__a, __last - __first)
552 { _STLP_PRIV __ucopy(__first, __last, this->_M_start); }
554 deque(const_iterator __first, const_iterator __last,
630 insert(end(), __first, __last); local
657 insert(end(), __mid, __last); local
[all...] |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _deque.h | 524 void _M_initialize_dispatch(_InputIter __first, _InputIter __last,
526 _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter));
532 deque(_InputIterator __first, _InputIterator __last,
536 _M_initialize_dispatch(__first, __last, _Integral());
541 deque(_InputIterator __first, _InputIterator __last)
544 _M_initialize_dispatch(__first, __last, _Integral());
549 deque(const value_type* __first, const value_type* __last,
551 : _STLP_PRIV _Deque_base<_Tp, _Alloc>(__a, __last - __first)
552 { _STLP_PRIV __ucopy(__first, __last, this->_M_start); }
554 deque(const_iterator __first, const_iterator __last,
630 insert(end(), __first, __last); local
657 insert(end(), __mid, __last); local
[all...] |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| /external/stlport/stlport/stl/pointers/ |
| _vector.h | 133 vector(_InputIterator __first, _InputIterator __last,
135 : _M_impl(__first, __last,
140 vector(_InputIterator __first, _InputIterator __last)
141 : _M_impl(__first, __last) {}
145 vector(const_iterator __first, const_iterator __last,
147 : _M_impl(cast_traits::to_storage_type_cptr(__first), cast_traits::to_storage_type_cptr(__last),
159 void assign(_InputIterator __first, _InputIterator __last)
160 { _M_impl.assign(__first, __last); }
162 void assign(const_iterator __first, const_iterator __last) {
164 cast_traits::to_storage_type_cptr(__last));
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } local
[all...] |
