| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _num_get.c | 119 int __base, _Integer& __val,
164 __val = __ovflow ? __is_negative ? (numeric_limits<_Integer>::min)()
179 int __base, _Integer& __val,
224 __val = __ovflow ? (numeric_limits<_Integer>::max)()
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());
248 ios_base::iostate& __err, _Integer& __val, _CharT* /*__pc*/) {
266 __val = 0;
279 __result = __get_integer(__in_ite, __end, __base, __val, __got, __negative, __np.thousands_sep(), __np.grouping(), __true_type() );
281 __result = __get_integer(__in_ite, __end, __base, __val, __got, __negative, __np.thousands_sep(), __np.grouping(), __false_type() )
591 unsigned _STLP_LONG_LONG __val; local
[all...] |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /development/ndk/platforms/android-L/include/ |
| stdatomic.h | 90 #define ATOMIC_VAR_INIT(value) { .__val = (value) }
91 #define atomic_init(obj, value) ((void)((obj)->__val = (value)))
178 __atomic_is_lock_free(sizeof((obj)->__val), &(obj)->__val)
181 ((void)(obj), sizeof((obj)->__val) <= sizeof(void *))
193 #define _Atomic(T) struct { T volatile __val; }
270 __atomic_compare_exchange_n(&(object)->__val, expected, \
274 __atomic_compare_exchange_n(&(object)->__val, expected, \
277 __atomic_exchange_n(&(object)->__val, desired, order)
279 __atomic_fetch_add(&(object)->__val, operand, order
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| predefined_ops.h | 53 operator()(_Iterator __it, _Value& __val) const
54 { return *__it < __val; }
69 operator()(_Value& __val, _Iterator __it) const
70 { return __val < *__it; }
97 operator()(_Iterator __it, _Value& __val) const
98 { return *__it == __val; }
140 operator()(_Iterator __it, _Value& __val)
141 { return bool(_M_comp(*__it, __val)); }
165 operator()(_Value& __val, _Iterator __it)
166 { return bool(_M_comp(__val, *__it));
[all...] |
| /external/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 351 const _Value& __val,
359 __new_node = _M_create_node(__val);
366 _M_key_compare( _KeyOfValue()(__val), _S_key(__parent) ) ) ) {
367 __new_node = _M_create_node(__val);
373 __new_node = _M_create_node(__val);
387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) {
392 if (_M_key_compare(_KeyOfValue()(__val), _S_key(__x))) {
398 return _M_insert(__y, __val, __x);
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) {
411 __comp = _M_key_compare(_KeyOfValue()(__val), _S_key(__x))
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
55 _RandomAccessIterator __result, _Tp __val, _Distance*)
58 __adjust_heap(__first, _Distance(0), _Distance(__last - __first), __val);
69 _Distance __len, _Tp __val, _Compare __comp);
75 _RandomAccessIterator __result, _Tp __val, _Compare __comp,
80 __val, __comp);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.6/x86_64-linux/include/c++/4.6/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
| functional_hash.h | 48 operator()(_Tp __val) const;
64 hash<_Tp>::operator()(_Tp __val) const \
65 { return static_cast<size_t>(__val); }
146 hash(const _Tp& __val)
147 { return hash(&__val, sizeof(__val)); }
153 hash<float>::operator()(float __val) const
156 return __val != 0.0f ? std::tr1::_Fnv_hash::hash(__val) : 0;
162 hash<double>::operator()(double __val) cons
[all...] |
