Home
last modified time | relevance | path

Searched refs:__val (Results 1 – 25 of 62) sorted by relevance

123

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_num_get.h65 ios_base::iostate& __err, bool& __val) const in get() argument
66 { return do_get(__ii, __end, __str, __err, __val); } in get()
71 ios_base::iostate& __err, short& __val) const in get() argument
72 { return do_get(__ii, __end, __str, __err, __val); } in get()
75 ios_base::iostate& __err, int& __val) const in get() argument
76 { return do_get(__ii, __end, __str, __err, __val); } in get()
80 ios_base::iostate& __err, long& __val) const in get() argument
81 { return do_get(__ii, __end, __str, __err, __val); } in get()
84 ios_base::iostate& __err, unsigned short& __val) const in get() argument
85 { return do_get(__ii, __end, __str, __err, __val); } in get()
[all …]
D_num_put.h61 bool __val) const { in put() argument
62 return do_put(__s, __f, __fill, __val); in put()
66 long __val) const { in put() argument
67 return do_put(__s, __f, __fill, __val); in put()
71 unsigned long __val) const { in put() argument
72 return do_put(__s, __f, __fill, __val); in put()
77 _STLP_LONG_LONG __val) const { in put() argument
78 return do_put(__s, __f, __fill, __val); in put()
82 unsigned _STLP_LONG_LONG __val) const { in put() argument
83 return do_put(__s, __f, __fill, __val); in put()
[all …]
D_construct.h118 inline void _Copy_Construct_aux(_Tp* __p, const _Tp& __val, const __false_type&) { in _Copy_Construct_aux() argument
119 new(__p) _Tp(__val); in _Copy_Construct_aux()
123 inline void _Copy_Construct_aux(_Tp* __p, const _Tp& __val, const __true_type&) { in _Copy_Construct_aux() argument
126 *__p = __val; in _Copy_Construct_aux()
130 inline void _Copy_Construct(_Tp* __p, const _Tp& __val) { in _Copy_Construct() argument
134 _Copy_Construct_aux(__p, __val, _Is_POD(__p)._Answer()); in _Copy_Construct()
138 inline void _Param_Construct_aux(_T1* __p, const _T2& __val, const __false_type&) { in _Param_Construct_aux() argument
139 new(__p) _T1(__val); in _Param_Construct_aux()
143 inline void _Param_Construct_aux(_T1* __p, const _T2& __val, const __true_type&) { in _Param_Construct_aux() argument
146 *__p = _T1(__val); in _Param_Construct_aux()
[all …]
D_ctraits_fns.h45 typename _Traits::char_type __val; member
46 _Eq_char_bound(typename _Traits::char_type __c) : __val(__c) {} in _Eq_char_bound()
48 { return _Traits::eq(__x, __val); } in operator()
55 typename _Traits::char_type __val; member
56 _Neq_char_bound(typename _Traits::char_type __c) : __val(__c) {} in _Neq_char_bound()
58 { return !_Traits::eq(__x, __val); } in operator()
64 typename _Traits::int_type __val; member
66 _Eq_int_bound(typename _Traits::int_type __c) : __val(__c) {} in _Eq_int_bound()
68 { return _Traits::eq_int_type(_Traits::to_int_type(__x), __val); } in operator()
D_tree.c351 const _Value& __val, in _M_insert() argument
359 __new_node = _M_create_node(__val); in _M_insert()
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) { in _M_insert()
367 __new_node = _M_create_node(__val); in _M_insert()
373 __new_node = _M_create_node(__val); in _M_insert()
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) { in insert_equal() argument
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) { in insert_equal()
398 return _M_insert(__y, __val, __x); in insert_equal()
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { in insert_unique() argument
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x)); in insert_unique()
[all …]
D_numeric.c46 _Tp __val = *__first; in __partial_sum() local
48 __val = __binary_op(__val, *__first); in __partial_sum()
49 *++__result = __val; in __partial_sum()
63 _Tp __val = *__first; in __adjacent_difference() local
66 *++__result = __binary_op(__tmp, __val); in __adjacent_difference()
67 __val = __tmp; in __adjacent_difference()
D_num_get.c119 int __base, _Integer& __val, in __get_integer() argument
164 __val = __ovflow ? __is_negative ? (numeric_limits<_Integer>::min)() in __get_integer()
179 int __base, _Integer& __val, in __get_integer() argument
224 __val = __ovflow ? (numeric_limits<_Integer>::max)() in __get_integer()
239 __get_decimal_integer(_InputIter& __first, _InputIter& __last, _Integer& __val, _CharT* /*dummy*/) { in __get_decimal_integer() argument
242 …return __get_integer(__first, __last, 10, __val, 0, false, _CharT() /*separator*/, __grp, __false_… in __get_decimal_integer()
248 ios_base::iostate& __err, _Integer& __val, _CharT* /*__pc*/) { in __do_get_integer() argument
266 __val = 0; in __do_get_integer()
279 …__result = __get_integer(__in_ite, __end, __base, __val, __got, __negative, __np.thousands_sep(),… in __do_get_integer()
281 …__result = __get_integer(__in_ite, __end, __base, __val, __got, __negative, __np.thousands_sep(),… in __do_get_integer()
[all …]
D_heap.h50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*) in __pop_heap() argument
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val); in __pop_heap()
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp, in __pop_heap() argument
80 __val, __comp); in __pop_heap()
D_algobase.h411 void __fill_fwd(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { in __fill_fwd() argument
413 *__first = __val; in __fill_fwd()
417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, in __fill() argument
419 _STLP_PRIV __fill_fwd(__first, __last, __val); in __fill()
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, in __fill() argument
427 _STLP_PRIV __fill_fwd(__first, __last, __val); in __fill()
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, in __fill() argument
434 _STLP_PRIV __fill_fwd(__first, __last, __val); in __fill()
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, in __fill() argument
443 *__first = __val; in __fill()
[all …]
D_heap.c43 _Distance __holeIndex, _Distance __topIndex, _Tp __val) in __push_heap() argument
46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) { in __push_heap()
51 *(__first + __holeIndex) = __val; in __push_heap()
77 _Distance __topIndex, _Tp __val, _Compare __comp) in __push_heap() argument
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) { in __push_heap()
81 … _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE) in __push_heap()
86 *(__first + __holeIndex) = __val; in __push_heap()
112 _Distance __len, _Tp __val) { in __adjust_heap() argument
126 __push_heap(__first, __holeIndex, __topIndex, __val); in __adjust_heap()
147 _Distance __len, _Tp __val, _Compare __comp) in __adjust_heap() argument
[all …]
D_algobase.c113 const _Tp& __val, in __find() argument
118 if (*__first == __val) return __first; in __find()
121 if (*__first == __val) return __first; in __find()
124 if (*__first == __val) return __first; in __find()
127 if (*__first == __val) return __first; in __find()
133 if (*__first == __val) return __first; in __find()
136 if (*__first == __val) return __first; in __find()
139 if (*__first == __val) return __first; in __find()
148 __find(char* __first, char* __last, char __val, const random_access_iterator_tag &) { in __find() argument
149 void *res = memchr(__first, __val, __last - __first); in __find()
[all …]
D_istream.h101 _Self& operator>> (short& __val);
102 _Self& operator>> (int& __val);
103 _Self& operator>> (unsigned short& __val);
104 _Self& operator>> (unsigned int& __val);
105 _Self& operator>> (long& __val);
106 _Self& operator>> (unsigned long& __val);
108 _Self& operator>> (_STLP_LONG_LONG& __val);
109 _Self& operator>> (unsigned _STLP_LONG_LONG& __val);
111 _Self& operator>> (float& __val);
112 _Self& operator>> (double& __val);
[all …]
D_algo.h106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { in count() argument
109 if (*__first == __val) in count()
130 _Integer __count, const _Tp& __val);
133 _Integer __count, const _Tp& __val, _BinaryPred __binary_pred);
239 remove_copy(_InputIter __first, _InputIter __last,_OutputIter __result, const _Tp& __val) { in remove_copy() argument
242 if (!(*__first == __val)) { in remove_copy()
265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { in remove() argument
267 __first = find(__first, __last, __val); in remove()
272 return remove_copy(++__next, __last, __first, __val); in remove()
482 const _Tp& __val) { in lower_bound() argument
[all …]
D_num_put.c421 bool __val) const { in do_put() argument
424 return do_put(__s, __f, __fill, __STATIC_CAST(long, __val)); in do_put()
426 return _STLP_PRIV __do_put_bool(__s, __f, __fill, __val); in do_put()
433 long __val) const in do_put() argument
434 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } in do_put()
439 unsigned long __val) const in do_put() argument
440 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } in do_put()
445 double __val) const in do_put() argument
446 { return _STLP_PRIV __do_put_float(__s, __f, __fill, __val); } in do_put()
452 long double __val) const in do_put() argument
[all …]
D_carray.h37 _CArray (const _Tp& __val) { in _CArray()
39 _Copy_Construct(__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)), __val); in _CArray()
D_istream.c136 _Scan_for_char_val(char_type __val) : _M_val(__val) {} in _Scan_for_char_val()
154 _Scan_for_int_val(int_type __val) : _M_val(__val) {} in _Scan_for_int_val()
186 __get_num(basic_istream<_CharT, _Traits>& __that, _Number& __val) { in __get_num() argument
196 0, __that, __err, __val); in __get_num()
209 basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>::operator>> (short& __val) {
222 __val = __tmp;
227 basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>::operator>> (int& __val) {
240 __val = __tmp;
245 basic_istream<_CharT, _Traits>& basic_istream<_CharT, _Traits>::operator>> (unsigned short& __val) {
246 _STLP_PRIV __get_num(*this, __val);
[all …]
D_uninitialized.h266 const unsigned char& __val) { in uninitialized_fill() argument
267 unsigned char __tmp = __val; in uninitialized_fill()
272 const signed char& __val) { in uninitialized_fill() argument
273 signed char __tmp = __val; in uninitialized_fill()
277 inline void uninitialized_fill(char* __first, char* __last, const char& __val) { in uninitialized_fill() argument
278 char __tmp = __val; in uninitialized_fill()
329 inline _ForwardIter __uinit_aux_aux(_ForwardIter __first, _Size __n, const _Tp& __val, in __uinit_aux_aux() argument
331 { return __uninitialized_fill_n(__first, __n, __val); } in __uinit_aux_aux()
346 inline _ForwardIter __uinit_aux(_ForwardIter __first, _Size __n, const _Tp& __val, in __uinit_aux() argument
348 { return __uinit_aux_aux(__first, __n, __val, _HasDefaultZeroValue(__first)._Answer()); } in __uinit_aux()
[all …]
D_iterator.h177 _Self& operator=(const typename _Container::value_type& __val) {
178 container->push_back(__val);
206 _Self& operator=(const typename _Container::value_type& __val) {
207 container->push_front(__val);
238 _Self& operator=(const typename _Container::value_type& __val) {
239 _M_iter = container->insert(_M_iter, __val);
D_vector.h227 void _M_initialize(size_type __n, const _Tp& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp))
228 { this->_M_finish = _STLP_PRIV __uninitialized_init(this->_M_start, __n, __val); }
233 vector(size_type __n, const _Tp& __val, const allocator_type& __a = allocator_type())
238 vector(size_type __n, const _Tp& __val) in vector() argument
240 { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); } in vector()
241 vector(size_type __n, const _Tp& __val, const allocator_type& __a) in vector() argument
244 { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); } in vector()
261 void _M_initialize_aux(_Integer __n, _Integer __val, in _M_initialize_aux() argument
266 this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); in _M_initialize_aux()
315 void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); } in assign() argument
[all …]
D_slist.c91 void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) { in _M_fill_assign() argument
95 __STATIC_CAST(_Node*, __node)->_M_data = __val; in _M_fill_assign()
100 _M_insert_after_fill(__prev, __n, __val); in _M_fill_assign()
119 void slist<_Tp,_Alloc>::remove(const _Tp& __val) { in remove() argument
122 if (__STATIC_CAST(_Node*, __cur->_M_next)->_M_data == __val) in remove()
/ndk/tests/device/test-gnustl-full/unit/
Diota.h8 void __iota(_It __first, _It __last, _Tp __val) { in __iota() argument
10 iota(__first, __last, __val); in __iota()
13 *__first++ = __val++; in __iota()
/ndk/tests/device/test-stlport/unit/
Diota.h8 void __iota(_It __first, _It __last, _Tp __val) { in __iota() argument
10 std::iota(__first, __last, __val); in __iota()
13 *__first++ = __val++; in __iota()
/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/
D_list.h96 explicit list(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
98 list(size_type __n, const value_type& __val,
101 : _M_impl(__n, cast_traits::to_storage_type_cref(__val), in _M_impl() argument
191 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, in _M_insert_dispatch() argument
193 { _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); } in _M_insert_dispatch()
255 void assign(size_type __n, const value_type& __val) in assign() argument
256 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); } in assign()
262 void _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type&) in _M_assign_dispatch() argument
263 { _M_impl.assign(__n, __val); } in _M_assign_dispatch()
301 void remove(const_reference __val) in remove() argument
[all …]
D_deque.h165 explicit deque(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
167 deque(size_type __n, const value_type& __val,
170 …: _M_impl(__n, cast_traits::to_storage_type_cref(__val), _STLP_CONVERT_ALLOCATOR(__a, _StorageType…
227 void assign(size_type __n, const value_type& __val) {
228 _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val));
235 void _M_assign_dispatch(_Integer __n, _Integer __val,
237 { _M_impl.assign(__n, __val); }
307 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
309 _M_impl.insert(ite_cast_traits::to_storage_type_ite(__pos), __n, __val);
D_slist.h145 void assign(size_type __n, const value_type& __val) in assign() argument
146 { _M_impl.assign(__n, cast_traits::to_storage_type_cref(__val)); } in assign()
152 void _M_assign_dispatch(_Integer __n, _Integer __val, in _M_assign_dispatch() argument
154 { _M_impl.assign(__n, __val); } in _M_assign_dispatch()
245 void _M_insert_after_dispatch(iterator __pos, _Integer __n, _Integer __val, in _M_insert_after_dispatch() argument
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val); in _M_insert_after_dispatch()
306 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, in _M_insert_dispatch() argument
308 _M_impl.insert(_BaseIte(__pos._M_node), __n, __val); in _M_insert_dispatch()
383 void remove(const value_type& __val) { _M_impl.remove(cast_traits::to_storage_type_cref(__val)); } in remove() argument

123