HomeSort by relevance Sort by last modified time
    Searched defs:__fill (Results 1 - 24 of 24) sorted by null

  /external/stlport/stlport/stl/
_slist.c 191 int __fill = 0; local
195 while (__i < __fill && !__counter[__i].empty()) {
201 if (__i == __fill) {
202 ++__fill;
203 if (__fill >= NB) {
210 for (int __i = 1; __i < __fill; ++__i)
212 __that.swap(__counter[__fill-1]);
_list.c 215 int __fill = 0; local
219 while (__i < __fill && !__counter[__i].empty()) {
224 if (__i == __fill) {
225 ++__fill;
226 if (__fill >= NB) {
233 for (int __i = 1; __i < __fill; ++__i)
235 __that.swap(__counter[__fill - 1]);
_algobase.h 417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, function
451 _STLP_PRIV __fill(__first, __last, __val,
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_slist.c 191 int __fill = 0; local
195 while (__i < __fill && !__counter[__i].empty()) {
201 if (__i == __fill) {
202 ++__fill;
203 if (__fill >= NB) {
210 for (int __i = 1; __i < __fill; ++__i)
212 __that.swap(__counter[__fill-1]);
_list.c 215 int __fill = 0; local
219 while (__i < __fill && !__counter[__i].empty()) {
224 if (__i == __fill) {
225 ++__fill;
226 if (__fill >= NB) {
233 for (int __i = 1; __i < __fill; ++__i)
235 __that.swap(__counter[__fill - 1]);
_algobase.h 417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, function
451 _STLP_PRIV __fill(__first, __last, __val,
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_slist.c 191 int __fill = 0; local
195 while (__i < __fill && !__counter[__i].empty()) {
201 if (__i == __fill) {
202 ++__fill;
203 if (__fill >= NB) {
210 for (int __i = 1; __i < __fill; ++__i)
212 __that.swap(__counter[__fill-1]);
_list.c 215 int __fill = 0; local
219 while (__i < __fill && !__counter[__i].empty()) {
224 if (__i == __fill) {
225 ++__fill;
226 if (__fill >= NB) {
233 for (int __i = 1; __i < __fill; ++__i)
235 __that.swap(__counter[__fill - 1]);
_algobase.h 417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, function
451 _STLP_PRIV __fill(__first, __last, __val,
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_slist.c 191 int __fill = 0; local
195 while (__i < __fill && !__counter[__i].empty()) {
201 if (__i == __fill) {
202 ++__fill;
203 if (__fill >= NB) {
210 for (int __i = 1; __i < __fill; ++__i)
212 __that.swap(__counter[__fill-1]);
_list.c 215 int __fill = 0; local
219 while (__i < __fill && !__counter[__i].empty()) {
224 if (__i == __fill) {
225 ++__fill;
226 if (__fill >= NB) {
233 for (int __i = 1; __i < __fill; ++__i)
235 __that.swap(__counter[__fill - 1]);
_algobase.h 417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, function
451 _STLP_PRIV __fill(__first, __last, __val,
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_slist.c 191 int __fill = 0; local
195 while (__i < __fill && !__counter[__i].empty()) {
201 if (__i == __fill) {
202 ++__fill;
203 if (__fill >= NB) {
210 for (int __i = 1; __i < __fill; ++__i)
212 __that.swap(__counter[__fill-1]);
_list.c 215 int __fill = 0; local
219 while (__i < __fill && !__counter[__i].empty()) {
224 if (__i == __fill) {
225 ++__fill;
226 if (__fill >= NB) {
233 for (int __i = 1; __i < __fill; ++__i)
235 __that.swap(__counter[__fill - 1]);
_algobase.h 417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, function
451 _STLP_PRIV __fill(__first, __last, __val,
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_slist.c 191 int __fill = 0; local
195 while (__i < __fill && !__counter[__i].empty()) {
201 if (__i == __fill) {
202 ++__fill;
203 if (__fill >= NB) {
210 for (int __i = 1; __i < __fill; ++__i)
212 __that.swap(__counter[__fill-1]);
_list.c 215 int __fill = 0; local
219 while (__i < __fill && !__counter[__i].empty()) {
224 if (__i == __fill) {
225 ++__fill;
226 if (__fill >= NB) {
233 for (int __i = 1; __i < __fill; ++__i)
235 __that.swap(__counter[__fill - 1]);
_algobase.h 417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, function
451 _STLP_PRIV __fill(__first, __last, __val,
  /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/
_slist.c 191 int __fill = 0; local
195 while (__i < __fill && !__counter[__i].empty()) {
201 if (__i == __fill) {
202 ++__fill;
203 if (__fill >= NB) {
210 for (int __i = 1; __i < __fill; ++__i)
212 __that.swap(__counter[__fill-1]);
_list.c 215 int __fill = 0; local
219 while (__i < __fill && !__counter[__i].empty()) {
224 if (__i == __fill) {
225 ++__fill;
226 if (__fill >= NB) {
233 for (int __i = 1; __i < __fill; ++__i)
235 __that.swap(__counter[__fill - 1]);
_algobase.h 417 inline void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
425 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
432 void __fill(_ForwardIter __first, _ForwardIter __last, const _Tp& __val, function
440 void __fill(_RandomAccessIter __first, _RandomAccessIter __last, const _Tp& __val, function
451 _STLP_PRIV __fill(__first, __last, __val,
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/bits/
stropts.h 216 char __fill[8]; /* UnixWare/Solaris compatibility */ member in struct:strrecvfd
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/bits/
stropts.h 216 char __fill[8]; /* UnixWare/Solaris compatibility */ member in struct:strrecvfd
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/bits/
stropts.h 216 char __fill[8]; /* UnixWare/Solaris compatibility */ member in struct:strrecvfd

Completed in 1608 milliseconds