| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/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);
|
| _heap.c | 43 _Distance __holeIndex, _Distance __topIndex, _Tp __val)
46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) {
51 *(__first + __holeIndex) = __val;
77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 *(__first + __holeIndex) = __val;
112 _Distance __len, _Tp __val) {
126 __push_heap(__first, __holeIndex, __topIndex, __val);
147 _Distance __len, _Tp __val, _Compare __comp
[all...] |
| _algobase.c | 113 const _Tp& __val,
118 if (*__first == __val) return __first;
121 if (*__first == __val) return __first;
124 if (*__first == __val) return __first;
127 if (*__first == __val) return __first;
133 if (*__first == __val) return __first;
136 if (*__first == __val) return __first;
139 if (*__first == __val) return __first;
148 __find(char* __first, char* __last, char __val, const random_access_iterator_tag &) {
149 void *res = memchr(__first, __val, __last - __first)
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/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);
|
| _heap.c | 43 _Distance __holeIndex, _Distance __topIndex, _Tp __val)
46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) {
51 *(__first + __holeIndex) = __val;
77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 *(__first + __holeIndex) = __val;
112 _Distance __len, _Tp __val) {
126 __push_heap(__first, __holeIndex, __topIndex, __val);
147 _Distance __len, _Tp __val, _Compare __comp
[all...] |
| _algobase.c | 113 const _Tp& __val,
118 if (*__first == __val) return __first;
121 if (*__first == __val) return __first;
124 if (*__first == __val) return __first;
127 if (*__first == __val) return __first;
133 if (*__first == __val) return __first;
136 if (*__first == __val) return __first;
139 if (*__first == __val) return __first;
148 __find(char* __first, char* __last, char __val, const random_access_iterator_tag &) {
149 void *res = memchr(__first, __val, __last - __first)
[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);
|
| _heap.c | 43 _Distance __holeIndex, _Distance __topIndex, _Tp __val)
46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) {
51 *(__first + __holeIndex) = __val;
77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 *(__first + __holeIndex) = __val;
112 _Distance __len, _Tp __val) {
126 __push_heap(__first, __holeIndex, __topIndex, __val);
147 _Distance __len, _Tp __val, _Compare __comp
[all...] |
| _algobase.c | 113 const _Tp& __val,
118 if (*__first == __val) return __first;
121 if (*__first == __val) return __first;
124 if (*__first == __val) return __first;
127 if (*__first == __val) return __first;
133 if (*__first == __val) return __first;
136 if (*__first == __val) return __first;
139 if (*__first == __val) return __first;
148 __find(char* __first, char* __last, char __val, const random_access_iterator_tag &) {
149 void *res = memchr(__first, __val, __last - __first)
[all...] |
| _algobase.h | 411 void __fill_fwd(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) {
413 *__first = __val;
417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
419 _STLP_PRIV __fill_fwd(__first, __last, __val);
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
427 _STLP_PRIV __fill_fwd(__first, __last, __val);
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
434 _STLP_PRIV __fill_fwd(__first, __last, __val);
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val,
443 *__first = __val;
[all...] |
| _carray.h | 37 _CArray (const _Tp& __val) {
39 _Copy_Construct(__REINTERPRET_CAST(_Tp*, _M_data + __i * sizeof(_Tp)), __val); local
|
| /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);
|
| _heap.c | 43 _Distance __holeIndex, _Distance __topIndex, _Tp __val)
46 while (__holeIndex > __topIndex && *(__first + __parent) < __val) {
51 *(__first + __holeIndex) = __val;
77 _Distance __topIndex, _Tp __val, _Compare __comp)
80 while (__holeIndex > __topIndex && __comp(*(__first + __parent), __val)) {
81 _STLP_VERBOSE_ASSERT(!__comp(__val, *(__first + __parent)), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
86 *(__first + __holeIndex) = __val;
112 _Distance __len, _Tp __val) {
126 __push_heap(__first, __holeIndex, __topIndex, __val);
147 _Distance __len, _Tp __val, _Compare __comp
[all...] |
| _algobase.c | 113 const _Tp& __val,
118 if (*__first == __val) return __first;
121 if (*__first == __val) return __first;
124 if (*__first == __val) return __first;
127 if (*__first == __val) return __first;
133 if (*__first == __val) return __first;
136 if (*__first == __val) return __first;
139 if (*__first == __val) return __first;
148 __find(char* __first, char* __last, char __val, const random_access_iterator_tag &) {
149 void *res = memchr(__first, __val, __last - __first)
[all...] |
| _algobase.h | 411 void __fill_fwd(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) {
413 *__first = __val;
417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
419 _STLP_PRIV __fill_fwd(__first, __last, __val);
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
427 _STLP_PRIV __fill_fwd(__first, __last, __val);
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val,
434 _STLP_PRIV __fill_fwd(__first, __last, __val);
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val,
443 *__first = __val;
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| functional_hash.h | 41 operator()(_Tp __val) const;
57 hash<_Tp>::operator()(_Tp __val) const \
58 { return static_cast<size_t>(__val); }
133 hash<float>::operator()(float __val) const
138 if (__val != 0.0f)
139 __result = _Fnv_hash<>::hash(reinterpret_cast<const char*>(&__val),
140 sizeof(__val));
147 hash<double>::operator()(double __val) const
152 if (__val != 0.0)
153 __result = _Fnv_hash<>::hash(reinterpret_cast<const char*>(&__val),
[all...] |
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| functional_hash.h | 41 operator()(_Tp __val) const;
57 hash<_Tp>::operator()(_Tp __val) const \
58 { return static_cast<size_t>(__val); }
133 hash<float>::operator()(float __val) const
138 if (__val != 0.0f)
139 __result = _Fnv_hash<>::hash(reinterpret_cast<const char*>(&__val),
140 sizeof(__val));
147 hash<double>::operator()(double __val) const
152 if (__val != 0.0)
153 __result = _Fnv_hash<>::hash(reinterpret_cast<const char*>(&__val),
[all...] |
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| functional_hash.h | 41 operator()(_Tp __val) const;
57 hash<_Tp>::operator()(_Tp __val) const \
58 { return static_cast<size_t>(__val); }
133 hash<float>::operator()(float __val) const
138 if (__val != 0.0f)
139 __result = _Fnv_hash<>::hash(reinterpret_cast<const char*>(&__val),
140 sizeof(__val));
147 hash<double>::operator()(double __val) const
152 if (__val != 0.0)
153 __result = _Fnv_hash<>::hash(reinterpret_cast<const char*>(&__val),
[all...] |
| /external/kernel-headers/original/asm-arm/ |
| cacheflush.h | 373 unsigned int __val = read_cpuid(CPUID_CACHETYPE); \
374 __cacheid_vipt_nonaliasing(__val); \
379 unsigned int __val = read_cpuid(CPUID_CACHETYPE); \
380 __cacheid_vipt_aliasing(__val); \
387 unsigned int __val = read_cpuid(CPUID_CACHETYPE); \
388 (!__cacheid_present(__val)) || __cacheid_vivt(__val); \
393 unsigned int __val = read_cpuid(CPUID_CACHETYPE); \
394 __cacheid_present(__val) && __cacheid_vipt(__val); \
[all...] |
