/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/ |
new_allocator.h | 104 construct(pointer __p, const _Tp& __val) 105 { ::new((void *)__p) _Tp(__val); }
|
/prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
_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...] |
_num_put.c | 421 bool __val) const { 424 return do_put(__s, __f, __fill, __STATIC_CAST(long, __val)); 426 return _STLP_PRIV __do_put_bool(__s, __f, __fill, __val); 433 long __val) const 434 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 439 unsigned long __val) const 440 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 445 double __val) const 446 { return _STLP_PRIV __do_put_float(__s, __f, __fill, __val); } 452 long double __val) cons [all...] |
_algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { 109 if (*__first == __val) 127 // search_n. Search for __count consecutive copies of __val. 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) { 242 if (!(*__first == __val)) { 265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { 267 __first = find(__first, __last, __val); 272 return remove_copy(++__next, __last, __first, __val); [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/ |
new_allocator.h | 104 construct(pointer __p, const _Tp& __val) 105 { ::new((void *)__p) _Tp(__val); }
|
/prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
_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...] |
_num_put.c | 421 bool __val) const { 424 return do_put(__s, __f, __fill, __STATIC_CAST(long, __val)); 426 return _STLP_PRIV __do_put_bool(__s, __f, __fill, __val); 433 long __val) const 434 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 439 unsigned long __val) const 440 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 445 double __val) const 446 { return _STLP_PRIV __do_put_float(__s, __f, __fill, __val); } 452 long double __val) cons [all...] |
_algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { 109 if (*__first == __val) 127 // search_n. Search for __count consecutive copies of __val. 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) { 242 if (!(*__first == __val)) { 265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { 267 __first = find(__first, __last, __val); 272 return remove_copy(++__next, __last, __first, __val); [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/ |
new_allocator.h | 104 construct(pointer __p, const _Tp& __val) 105 { ::new((void *)__p) _Tp(__val); }
|
/prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
_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...] |
_num_put.c | 421 bool __val) const { 424 return do_put(__s, __f, __fill, __STATIC_CAST(long, __val)); 426 return _STLP_PRIV __do_put_bool(__s, __f, __fill, __val); 433 long __val) const 434 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 439 unsigned long __val) const 440 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 445 double __val) const 446 { return _STLP_PRIV __do_put_float(__s, __f, __fill, __val); } 452 long double __val) cons [all...] |
_algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { 109 if (*__first == __val) 127 // search_n. Search for __count consecutive copies of __val. 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) { 242 if (!(*__first == __val)) { 265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { 267 __first = find(__first, __last, __val); 272 return remove_copy(++__next, __last, __first, __val); [all...] |
/prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
_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...] |
_num_put.c | 421 bool __val) const { 424 return do_put(__s, __f, __fill, __STATIC_CAST(long, __val)); 426 return _STLP_PRIV __do_put_bool(__s, __f, __fill, __val); 433 long __val) const 434 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 439 unsigned long __val) const 440 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 445 double __val) const 446 { return _STLP_PRIV __do_put_float(__s, __f, __fill, __val); } 452 long double __val) cons [all...] |
_algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { 109 if (*__first == __val) 127 // search_n. Search for __count consecutive copies of __val. 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) { 242 if (!(*__first == __val)) { 265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { 267 __first = find(__first, __last, __val); 272 return remove_copy(++__next, __last, __first, __val); [all...] |
/external/stlport/stlport/stl/ |
_num_put.c | 421 bool __val) const { 424 return do_put(__s, __f, __fill, __STATIC_CAST(long, __val)); 426 return _STLP_PRIV __do_put_bool(__s, __f, __fill, __val); 433 long __val) const 434 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 439 unsigned long __val) const 440 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 445 double __val) const 446 { return _STLP_PRIV __do_put_float(__s, __f, __fill, __val); } 452 long double __val) cons [all...] |
_algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { 109 if (*__first == __val) 127 // search_n. Search for __count consecutive copies of __val. 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) { 242 if (!(*__first == __val)) { 265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { 267 __first = find(__first, __last, __val); 272 return remove_copy(++__next, __last, __first, __val); [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_num_put.c | 421 bool __val) const { 424 return do_put(__s, __f, __fill, __STATIC_CAST(long, __val)); 426 return _STLP_PRIV __do_put_bool(__s, __f, __fill, __val); 433 long __val) const 434 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 439 unsigned long __val) const 440 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 445 double __val) const 446 { return _STLP_PRIV __do_put_float(__s, __f, __fill, __val); } 452 long double __val) cons [all...] |
_algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { 109 if (*__first == __val) 127 // search_n. Search for __count consecutive copies of __val. 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) { 242 if (!(*__first == __val)) { 265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { 267 __first = find(__first, __last, __val); 272 return remove_copy(++__next, __last, __first, __val); [all...] |
/prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
_num_put.c | 421 bool __val) const { 424 return do_put(__s, __f, __fill, __STATIC_CAST(long, __val)); 426 return _STLP_PRIV __do_put_bool(__s, __f, __fill, __val); 433 long __val) const 434 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 439 unsigned long __val) const 440 { return _STLP_PRIV __do_put_integer(__s, __f, __fill, __val); } 445 double __val) const 446 { return _STLP_PRIV __do_put_float(__s, __f, __fill, __val); } 452 long double __val) cons [all...] |
_algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { 109 if (*__first == __val) 127 // search_n. Search for __count consecutive copies of __val. 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) { 242 if (!(*__first == __val)) { 265 remove(_ForwardIter __first, _ForwardIter __last, const _Tp& __val) { 267 __first = find(__first, __last, __val); 272 return remove_copy(++__next, __last, __first, __val); [all...] |
/bionic/libc/kernel/arch-arm/asm/ |
posix_types.h | 61 int __val[2];
|
/development/ndk/platforms/android-3/arch-arm/include/asm/ |
posix_types.h | 50 int __val[2];
|
/external/kernel-headers/original/asm-arm/ |
posix_types.h | 57 int __val[2];
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/bits/ |
typesizes.h | 59 #define __FSID_T_TYPE struct { int __val[2]; }
|