HomeSort by relevance Sort by last modified time
    Searched defs:__n (Results 1 - 25 of 360) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/
stl_iterator_base_funcs.h 76 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
80 ++__n;
82 return __n;
119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
123 while (__n--)
129 __advance(_BidirectionalIterator& __i, _Distance __n,
135 if (__n > 0)
136 while (__n--)
139 while (__n++)
145 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/
stl_iterator_base_funcs.h 79 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
83 ++__n;
85 return __n;
122 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
126 while (__n--)
132 __advance(_BidirectionalIterator& __i, _Distance __n,
138 if (__n > 0)
139 while (__n--)
142 while (__n++)
148 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/
stl_iterator_base_funcs.h 79 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
83 ++__n;
85 return __n;
122 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
126 while (__n--)
132 __advance(_BidirectionalIterator& __i, _Distance __n,
138 if (__n > 0)
139 while (__n--)
142 while (__n++)
148 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_iterator_base_funcs.h 76 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
80 ++__n;
82 return __n;
119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
123 while (__n--)
129 __advance(_BidirectionalIterator& __i, _Distance __n,
135 if (__n > 0)
136 while (__n--)
139 while (__n++)
145 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_iterator_base_funcs.h 76 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
80 ++__n;
82 return __n;
119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
123 while (__n--)
129 __advance(_BidirectionalIterator& __i, _Distance __n,
135 if (__n > 0)
136 while (__n--)
139 while (__n++)
145 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/
stl_iterator_base_funcs.h 76 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
80 ++__n;
82 return __n;
119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
123 while (__n--)
129 __advance(_BidirectionalIterator& __i, _Distance __n,
135 if (__n > 0)
136 while (__n--)
139 while (__n++)
145 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/
stl_iterator_base_funcs.h 76 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
80 ++__n;
82 return __n;
119 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
123 while (__n--)
129 __advance(_BidirectionalIterator& __i, _Distance __n,
135 if (__n > 0)
136 while (__n--)
139 while (__n++)
145 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/
stl_iterator_base_funcs.h 79 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
83 ++__n;
85 return __n;
122 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
126 while (__n--)
132 __advance(_BidirectionalIterator& __i, _Distance __n,
138 if (__n > 0)
139 while (__n--)
142 while (__n++)
148 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_iterator_base_funcs.h 79 typename iterator_traits<_InputIterator>::difference_type __n = 0; local
83 ++__n;
85 return __n;
123 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
127 while (__n--)
133 __advance(_BidirectionalIterator& __i, _Distance __n,
139 if (__n > 0)
140 while (__n--)
143 while (__n++)
149 __advance(_RandomAccessIterator& __i, _Distance __n,
    [all...]
  /external/stlport/stlport/stl/
_numeric.c 74 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr) {
76 if (__n == 0)
79 while ((__n & 1) == 0) {
80 __n >>= 1;
85 __n >>= 1; local
86 while (__n != 0) {
88 if ((__n & 1) != 0)
90 __n >>= 1;
_string_operators.h 51 const size_t __n = _Traits::length(__s); local
53 _Str __result = _Str(_Reserve_t(), __n + __y.size(), __y.get_allocator());
55 _Str __result(_Reserve_t(), __n + __y.size(), __y.get_allocator());
57 __result.append(__s, __s + __n);
85 const size_t __n = _Traits::length(__s); local
87 _Str __result = _Str(_Reserve_t(), __x.size() + __n, __x.get_allocator());
89 _Str __result(_Reserve_t(), __x.size() + __n, __x.get_allocator());
92 __result.append(__s, __s + __n);
171 const size_t __n = _Traits::length(__s);
175 __root_type __root(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator()))
314 size_t __n = _Traits::length(__s); local
323 size_t __n = _Traits::length(__s); local
333 size_t __n = _Traits::length(__s); local
342 size_t __n = _Traits::length(__s); local
380 size_t __n = _Traits::length(__s); local
390 size_t __n = _Traits::length(__s); local
401 size_t __n = _Traits::length(__s); local
411 size_t __n = _Traits::length(__s); local
    [all...]
_string_io.c 18 streamsize __n) {
20 for (streamsize __i = 0; __i < __n; ++__i) {
43 size_type __n = __s.size(); local
48 const bool __need_pad = (((sizeof(streamsize) > sizeof(size_t)) && (__STATIC_CAST(streamsize, __n) < __w)) ||
49 ((sizeof(streamsize) <= sizeof(size_t)) && (__n < __STATIC_CAST(size_t, __w))));
50 streamsize __pad_len = __need_pad ? __w - __n : 0;
55 __ok = __ok && (__buf->sputn(__s.data(), streamsize(__n)) == streamsize(__n));
87 size_type __n; local
89 __n = __s.max_size()
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_numeric.c 74 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr) {
76 if (__n == 0)
79 while ((__n & 1) == 0) {
80 __n >>= 1;
85 __n >>= 1; local
86 while (__n != 0) {
88 if ((__n & 1) != 0)
90 __n >>= 1;
_string_operators.h 51 const size_t __n = _Traits::length(__s); local
53 _Str __result = _Str(_Reserve_t(), __n + __y.size(), __y.get_allocator());
55 _Str __result(_Reserve_t(), __n + __y.size(), __y.get_allocator());
57 __result.append(__s, __s + __n);
85 const size_t __n = _Traits::length(__s); local
87 _Str __result = _Str(_Reserve_t(), __x.size() + __n, __x.get_allocator());
89 _Str __result(_Reserve_t(), __x.size() + __n, __x.get_allocator());
92 __result.append(__s, __s + __n);
171 const size_t __n = _Traits::length(__s);
175 __root_type __root(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator()))
314 size_t __n = _Traits::length(__s); local
323 size_t __n = _Traits::length(__s); local
333 size_t __n = _Traits::length(__s); local
342 size_t __n = _Traits::length(__s); local
380 size_t __n = _Traits::length(__s); local
390 size_t __n = _Traits::length(__s); local
401 size_t __n = _Traits::length(__s); local
411 size_t __n = _Traits::length(__s); local
    [all...]
_string_io.c 18 streamsize __n) {
20 for (streamsize __i = 0; __i < __n; ++__i) {
43 size_type __n = __s.size(); local
48 const bool __need_pad = (((sizeof(streamsize) > sizeof(size_t)) && (__STATIC_CAST(streamsize, __n) < __w)) ||
49 ((sizeof(streamsize) <= sizeof(size_t)) && (__n < __STATIC_CAST(size_t, __w))));
50 streamsize __pad_len = __need_pad ? __w - __n : 0;
55 __ok = __ok && (__buf->sputn(__s.data(), streamsize(__n)) == streamsize(__n));
87 size_type __n; local
89 __n = __s.max_size()
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_numeric.c 74 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr) {
76 if (__n == 0)
79 while ((__n & 1) == 0) {
80 __n >>= 1;
85 __n >>= 1; local
86 while (__n != 0) {
88 if ((__n & 1) != 0)
90 __n >>= 1;
_string_operators.h 51 const size_t __n = _Traits::length(__s); local
53 _Str __result = _Str(_Reserve_t(), __n + __y.size(), __y.get_allocator());
55 _Str __result(_Reserve_t(), __n + __y.size(), __y.get_allocator());
57 __result.append(__s, __s + __n);
85 const size_t __n = _Traits::length(__s); local
87 _Str __result = _Str(_Reserve_t(), __x.size() + __n, __x.get_allocator());
89 _Str __result(_Reserve_t(), __x.size() + __n, __x.get_allocator());
92 __result.append(__s, __s + __n);
171 const size_t __n = _Traits::length(__s);
175 __root_type __root(_STLP_PRIV __cstr_wrapper<_CharT>(__s, __n), _STLP_PRIV __sum_storage_elem<_CharT, _Traits, _Alloc>(__x.get_allocator()))
314 size_t __n = _Traits::length(__s); local
323 size_t __n = _Traits::length(__s); local
333 size_t __n = _Traits::length(__s); local
342 size_t __n = _Traits::length(__s); local
380 size_t __n = _Traits::length(__s); local
390 size_t __n = _Traits::length(__s); local
401 size_t __n = _Traits::length(__s); local
411 size_t __n = _Traits::length(__s); local
    [all...]
_string_io.c 18 streamsize __n) {
20 for (streamsize __i = 0; __i < __n; ++__i) {
43 size_type __n = __s.size(); local
48 const bool __need_pad = (((sizeof(streamsize) > sizeof(size_t)) && (__STATIC_CAST(streamsize, __n) < __w)) ||
49 ((sizeof(streamsize) <= sizeof(size_t)) && (__n < __STATIC_CAST(size_t, __w))));
50 streamsize __pad_len = __need_pad ? __w - __n : 0;
55 __ok = __ok && (__buf->sputn(__s.data(), streamsize(__n)) == streamsize(__n));
87 size_type __n; local
89 __n = __s.max_size()
    [all...]