| /external/stlport/stlport/stl/ |
| _bvector.h | 417 void _M_initialize_range(_InputIterator __first, _InputIterator __last,
422 for ( ; __first != __last; ++__first)
423 push_back(*__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) {
633 insert(end(), __first, __last); local
[all...] |
| concept_checks.h | 64 #define _STLP_BINARY_FUNCTION_CHECK(__func, __ret, __first, __second) \
66 #define _STLP_CLASS_BINARY_FUNCTION_CHECK(__func, __ret, __first, __second) \
67 static int __##__func##__ret##__first##__second##_binary_function_check
68 #define _STLP_REQUIRES_BINARY_OP(__opname, __ret, __first, __second) \
70 #define _STLP_CLASS_REQUIRES_BINARY_OP(__opname, __ret, __first, __second) \
71 static int __##__opname##__ret##__first##__second##_require_binary_op
131 #define _STLP_BINARY_FUNCTION_CHECK(__func, __ret, __first, __second) \
133 __ret (*__x)( __func&, const __first&, const __second& ) = \
135 __func, __ret, __first, __second>::__binary_function_requirement_violation; \
139 #define _STLP_REQUIRES_BINARY_OP(__opname, __ret, __first, __second)
[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);
630 insert(end(), __first, __last); local
[all...] |
| _time_facets.c | 78 __match(_InIt& __first, _InIt& __last, _NameIt __name, _NameIt __name_end) {
89 while (__first != __last) {
93 if (*__first == __name[__i][__pos]) {
100 ++__first;
120 ++__first; ++__pos;
149 __get_formatted_time _STLP_WEAK (_InIt1 __first, _InIt1 __last,
157 while (__first != __last && __format != __format_end) {
171 size_t __index = __match(__first, __last,
182 size_t __index = __match(__first, __last,
191 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mday, __STATIC_CAST(_Ch*, 0))
[all...] |
| _tree.h | 465 template<class _II> void insert_equal(_II __first, _II __last) {
466 for ( ; __first != __last; ++__first)
467 insert_equal(*__first);
469 template<class _II> void insert_unique(_II __first, _II __last) {
470 for ( ; __first != __last; ++__first)
471 insert_unique(*__first);
474 void insert_unique(const_iterator __first, const_iterator __last) {
475 for ( ; __first != __last; ++__first
[all...] |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
188 priority_queue(_InputIterator __first,
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...] |
| _deque.c | 151 const value_type* __first, const value_type* __last) {
155 size_type __n = __last - __first;
159 _STLP_PRIV __ucopy(__first, __last, __new_start);
167 _STLP_PRIV __ucopy(__first, __last, this->_M_finish);
174 _M_insert_range_aux(__pos, __first, __last, __n, _Movable());
179 const_iterator __first, const_iterator __last) {
183 size_type __n = __last - __first;
187 _STLP_PRIV __ucopy(__first, __last, __new_start);
195 _STLP_PRIV __ucopy(__first, __last, this->_M_finish);
202 _M_insert_range_aux(__pos, __first, __last, __n, _Movable())
[all...] |
| _tempbuf.h | 111 _Temporary_buffer(_ForwardIterator __first, _ForwardIterator __last) {
119 _M_len = _STLP_STD::distance(__first, __last);
122 _M_initialize_buffer(*__first, _Trivial());
150 temporary_buffer(_ForwardIterator __first, _ForwardIterator __last)
151 : _Temporary_buffer<_ForwardIterator, _Tp>(__first, __last) {}
|
| _list.h | 67 _Node_base* __first, _Node_base* __last);
324 list(_InputIterator __first, _InputIterator __last,
327 { _M_insert(begin(), __first, __last); } local
331 list(_InputIterator __first, _InputIterator __last)
333 { _M_insert(begin(), __first, __last); } local
336 list(const value_type* __first, const value_type* __last,
339 { _M_insert(begin(), __first, __last); } local
340 list(const_iterator __first, const_iterator __last,
343 { _M_insert(begin(), __first, __last); } local
438 void _M_insert(iterator __pos, _InputIterator __first, _InputIterator __last)
635 iterator __first = begin(); local
[all...] |
| _string.h | 456 _Self& _M_append(const _CharT* __first, const _CharT* __last);
460 _Self& _M_appendT(_InputIter __first, _InputIter __last,
462 for ( ; __first != __last ; ++__first)
463 push_back(*__first);
468 _Self& _M_appendT(_ForwardIter __first, _ForwardIter __last,
470 if (__first != __last) {
471 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last));
476 __new_finish = uninitialized_copy(__first, __last, __new_finish);
482 _Traits::assign(*this->_M_finish, *__first++)
[all...] |
| _num_get.c | 118 __get_integer(_InputIter& __first, _InputIter& __last,
130 for ( ; __first != __last ; ++__first) {
132 const _CharT __c = *__first;
178 __get_integer(_InputIter& __first, _InputIter& __last,
190 for ( ; __first != __last ; ++__first) {
192 const _CharT __c = *__first;
239 __get_decimal_integer(_InputIter& __first, _InputIter& __last, _Integer& __val, _CharT* /*dummy*/) {
242 return __get_integer(__first, __last, 10, __val, 0, false, _CharT() /*separator*/, __grp, __false_type())
[all...] |
| _string.c | 196 basic_string<_CharT, _Traits, _Alloc>::_M_append(const _CharT* __first, const _CharT* __last) {
197 if (__first != __last) {
198 size_type __n = __STATIC_CAST(size_type, __last - __first);
203 __new_finish = _STLP_PRIV __ucopy(__first, __last, __new_finish);
209 const _CharT* __f1 = __first;
213 _Traits::assign(*end(), *__first); local
315 const _CharT* __first, const _CharT* __last,
318 if (__first != __last) {
319 const size_t __n = __last - __first;
328 _M_copy(__first, __last, __pos)
[all...] |
| _hashtable.h | 500 _ElemsIte __first(_M_buckets[__n]);
502 for ( ; (__first != __last) && !_M_equals(_M_get_key(*__first), __key); ++__first);
503 if (__first != __last)
504 return __first;
538 for (_ElemsIte __first(_M_buckets[__n]), __last(_M_buckets[__n + 1]);
539 __first != __last; ++__first) {
540 if (_M_equals(_M_get_key(*__first), __key))
[all...] |
| _monetary.c | 51 pair<_InIt1, bool> __get_string( _InIt1 __first, _InIt1 __last,
53 while ( __first != __last && __str_first != __str_last && *__first == *__str_first ) {
54 ++__first;
57 return make_pair(__first, __str_first == __str_last);
62 __get_monetary_value(_InIt& __first, _InIt __last, _OuIt __out_ite,
66 if (__first == __last || !_c_type.is(ctype_base::digit, *__first))
73 while (__first != __last) {
74 if (_c_type.is(ctype_base::digit, *__first)) {
[all...] |
| _slist_base.c | 64 _Slist_node_base* __first = __before_first->_M_next; local
67 __pos->_M_next = __first;
|
| _iterator_base.h | 315 __distance(const _InputIterator& __first, const _InputIterator& __last,
318 _InputIterator __it(__first);
328 __distance(const _ForwardIterator& __first, const _ForwardIterator& __last,
331 _ForwardIterator __it(__first);
340 __distance(const _BidirectionalIterator& __first, const _BidirectionalIterator& __last,
343 _BidirectionalIterator __it(__first);
353 __distance(const _RandomAccessIterator& __first, const _RandomAccessIterator& __last,
355 { return __last - __first; }
361 distance(_InputIterator __first, _InputIterator __last)
362 { return _STLP_PRIV __distance(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
[all...] |
| _hashtable.c | 63 const size_t* __first = _S_primes(__size); local
64 return *(__first + __size - 1);
71 const size_t* __first = _S_primes(__size); local
72 const size_t* __last = __first + __size;
73 const size_t* pos = __lower_bound(__first, __last, __n,
334 ::erase(const_iterator __first, const_iterator __last) {
335 if (__first == __last)
337 size_type __f_bucket = _M_bkt_num(*__first);
342 if (__cur == __first._M_ite) {
348 for (; (__cur != __last) && (__cur != __first._M_ite); ++__prev, ++__cur)
406 const size_type *__first; local
[all...] |
| _istream.c | 88 operator()(const char_type* __first, const char_type* __last) const {
89 return _M_ctype->scan_is(ctype_base::space, __first, __last);
104 operator()(const char_type* __first, const char_type* __last) const {
105 __last = find_if(__first, __last,
107 return _M_ctype->scan_is(ctype_base::space, __first, __last);
122 operator()(const char_type* __first, const char_type* __last) const {
123 return _M_ctype->scan_not(ctype_base::space, __first, __last);
139 operator()(const char_type* __first, const char_type* __last) const {
140 return find_if(__first, __last, _Eq_char_bound<_Traits>(_M_val));
157 operator()(const char_type* __first, const char_type* __last) const
[all...] |
| _num_put.c | 42 __copy_float_and_fill(const _CharT* __first, const _CharT* __last,
47 if (__width <= __last - __first)
48 return _STLP_STD::copy(__first, __last, __oi);
50 streamsize __pad = __width - (__last - __first);
54 __oi = _STLP_STD::copy(__first, __last, __oi);
57 else if (__dir == ios_base::internal && __first != __last &&
58 (*__first == __xplus || *__first == __xminus)) {
59 *__oi++ = *__first++;
61 return _STLP_STD::copy(__first, __last, __oi)
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _tree.h | 114 void _Invalidate_iterators(const iterator& __first, const iterator& __last)
115 { _STLP_PRIV __invalidate_range(&_M_iter_list, __first, __last); }
241 void insert_equal(_InputIterator __first, _InputIterator __last) {
242 _STLP_DEBUG_CHECK(__check_range(__first,__last))
243 _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
246 void insert_unique(_InputIterator __first, _InputIterator __last) {
247 _STLP_DEBUG_CHECK(__check_range(__first,__last))
248 _M_non_dbg_impl.insert_unique(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
251 void insert_unique(const_iterator __first, const_iterator __last) {
252 _STLP_DEBUG_CHECK(__check_range(__first,__last)
[all...] |
| _debug.c | 47 stlp_in_range_aux(const _Iterator& __it, const _Iterator& __first,
49 return ( __it >= __first &&
56 inline bool _STLP_CALL stlp_in_range_aux(_Iterator1 __it, const _Iterator& __first,
58 inline bool _STLP_CALL stlp_in_range_aux(const _Iterator1& __it, const _Iterator& __first,
61 _Iterator1 __i(__first);
69 stlp_in_range_aux(const _Iterator1& __it, const _Iterator& __first,
71 _Iterator1 __i(__first);
78 bool _STLP_CALL __check_range_aux(const _Iterator& __first, const _Iterator& __last,
80 _STLP_VERBOSE_RETURN(__valid_range(__first,__last), _StlMsg_INVALID_RANGE )
85 bool _STLP_CALL __check_range_aux(_Integral /*__first*/, _Integral /*__last*/
[all...] |
| _string.h | 244 _Self& append(_InputIter __first, _InputIter __last) {
245 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
247 _M_non_dbg_impl.append(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
362 inline _Self& assign(_InputIter __first, _InputIter __last) {
363 _STLP_FIX_LITERAL_BUG(__first) _STLP_FIX_LITERAL_BUG(__last)
364 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))
366 _M_non_dbg_impl.assign(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
443 void insert(iterator __p, _InputIter __first, _InputIter __last) {
445 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first,__last))
449 _STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last))
[all...] |
| /external/stlport/stlport/stl/pointers/ |
| _set.h | 136 set(_InputIterator __first, _InputIterator __last)
139 _M_t.insert_unique(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first),
142 _M_t.insert_unique(__first, __last);
148 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp)
151 _M_t.insert_unique(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first),
154 _M_t.insert_unique(__first, __last);
159 set(_InputIterator __first, _InputIterator __last, const _Compare& __comp,
163 _M_t.insert_unique(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first),
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) {
163 _M_impl.assign(cast_traits::to_storage_type_cptr(__first),
197 { _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __first, __last); } local
[all...] |
| /external/stlport/src/ |
| num_put.cpp | 84 Char __first = *iostr.begin(); local
86 if (__first == Plus || __first == Minus) {
|
