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

1 2

  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/profile/impl/
profiler_algos.h 52 typename _Container::iterator __it = __output.begin(); local
63 if (__it == __output.end())
66 if (*__it < __value)
69 ++__it;
73 __output.insert(__it, __value);
83 typename _Container::const_iterator __it; local
84 for (__it = __input.begin(); __it != __input.end(); ++__it)
85 __insert_top_n(__output, *__it, __n)
    [all...]
profiler_node.h 90 __stack_npt::const_iterator __it;
91 for (__it = __stack->begin(); __it != __stack->end(); ++__it)
92 std::fprintf(__f, "%p ", *__it);
106 __stack_npt::const_iterator __it; local
107 for (__it = __s->begin(); __it != __s->end(); ++__it)
108 __index += reinterpret_cast<__UINTPTR_TYPE__>(*__it);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/profile/impl/
profiler_algos.h 52 typename _Container::iterator __it = __output.begin(); local
63 if (__it == __output.end())
66 if (*__it < __value)
69 ++__it;
73 __output.insert(__it, __value);
83 typename _Container::const_iterator __it; local
84 for (__it = __input.begin(); __it != __input.end(); ++__it)
85 __insert_top_n(__output, *__it, __n)
    [all...]
profiler_node.h 90 __stack_npt::const_iterator __it;
91 for (__it = __stack->begin(); __it != __stack->end(); ++__it)
92 std::fprintf(__f, "%p ", *__it);
106 __stack_npt::const_iterator __it; local
107 for (__it = __s->begin(); __it != __s->end(); ++__it)
108 __index += reinterpret_cast<__UINTPTR_TYPE__>(*__it);
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/impl/
profiler_algos.h 52 typename _Container::iterator __it = __output.begin(); local
63 if (__it == __output.end())
66 if (*__it < __value)
69 ++__it;
73 __output.insert(__it, __value);
83 typename _Container::const_iterator __it; local
84 for (__it = __input.begin(); __it != __input.end(); ++__it)
85 __insert_top_n(__output, *__it, __n)
    [all...]
profiler_node.h 90 __stack_npt::const_iterator __it;
91 for (__it = __stack->begin(); __it != __stack->end(); ++__it)
92 std::fprintf(__f, "%p ", *__it);
106 __stack_npt::const_iterator __it; local
107 for (__it = __s->begin(); __it != __s->end(); ++__it)
108 __index += reinterpret_cast<__UINTPTR_TYPE__>(*__it);
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/impl/
profiler_algos.h 45 typename _Container::iterator __it = __output.begin(); local
56 if (__it == __output.end())
59 if (*__it < __value)
62 ++__it;
66 __output.insert(__it, __value);
76 typename _Container::const_iterator __it; local
77 for (__it = __input.begin(); __it != __input.end(); ++__it)
78 __insert_top_n(__output, *__it, __n)
    [all...]
profiler_node.h 83 __stack_npt::const_iterator __it;
84 for (__it = __stack->begin(); __it != __stack->end(); ++__it)
85 std::fprintf(__f, "%p ", *__it);
99 __stack_npt::const_iterator __it; local
100 for (__it = __s->begin(); __it != __s->end(); ++__it)
101 __index += reinterpret_cast<std::size_t>(*__it);
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/profile/impl/
profiler_algos.h 52 typename _Container::iterator __it = __output.begin(); local
63 if (__it == __output.end())
66 if (*__it < __value)
69 ++__it;
73 __output.insert(__it, __value);
83 typename _Container::const_iterator __it; local
84 for (__it = __input.begin(); __it != __input.end(); ++__it)
85 __insert_top_n(__output, *__it, __n)
    [all...]
profiler_node.h 90 __stack_npt::const_iterator __it;
91 for (__it = __stack->begin(); __it != __stack->end(); ++__it)
92 std::fprintf(__f, "%p ", *__it);
106 __stack_npt::const_iterator __it; local
107 for (__it = __s->begin(); __it != __s->end(); ++__it)
108 __index += reinterpret_cast<__UINTPTR_TYPE__>(*__it);
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/profile/impl/
profiler_algos.h 45 typename _Container::iterator __it = __output.begin(); local
56 if (__it == __output.end())
59 if (*__it < __value)
62 ++__it;
66 __output.insert(__it, __value);
76 typename _Container::const_iterator __it; local
77 for (__it = __input.begin(); __it != __input.end(); ++__it)
78 __insert_top_n(__output, *__it, __n)
    [all...]
profiler_node.h 83 __stack_npt::const_iterator __it;
84 for (__it = __stack->begin(); __it != __stack->end(); ++__it)
85 std::fprintf(__f, "%p ", *__it);
99 __stack_npt::const_iterator __it; local
100 for (__it = __s->begin(); __it != __s->end(); ++__it)
101 __index += reinterpret_cast<std::size_t>(*__it);
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/profile/impl/
profiler_algos.h 45 typename _Container::iterator __it = __output.begin(); local
56 if (__it == __output.end())
59 if (*__it < __value)
62 ++__it;
66 __output.insert(__it, __value);
76 typename _Container::const_iterator __it; local
77 for (__it = __input.begin(); __it != __input.end(); ++__it)
78 __insert_top_n(__output, *__it, __n)
    [all...]
profiler_node.h 83 __stack_npt::const_iterator __it;
84 for (__it = __stack->begin(); __it != __stack->end(); ++__it)
85 std::fprintf(__f, "%p ", *__it);
99 __stack_npt::const_iterator __it; local
100 for (__it = __s->begin(); __it != __s->end(); ++__it)
101 __index += reinterpret_cast<std::size_t>(*__it);
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/
list_partition.h 6 // software; you can redistribute __it and/or modify __it under the terms
11 // This library is distributed in the hope that __it will be useful, but
90 * @param __f Functor to be applied to each element by traversing __it
117 _IIter __prev = __begin, __it = __begin; local
122 while (__it != __end)
125 for (; __cur < __os_starts.size() and __it != __end; ++__cur)
128 __dist < __dist_limit and __it != __end; ++__dist)
130 __f(__it);
131 ++__it;
    [all...]
  /external/stlport/stlport/stl/
_hash_map.h 201 iterator __it = _M_ht.find(__key); local
202 return (__it == _M_ht.end() ?
204 (*__it).second );
219 void erase(iterator __it) { _M_ht.erase(__it); }
404 void erase(iterator __it) { _M_ht.erase(__it); }
_unordered_map.h 154 iterator __it = _M_ht.find(__key); local
155 return (__it == _M_ht.end() ?
157 (*__it).second );
171 void erase(const_iterator __it) { _M_ht.erase(__it); }
331 void erase(const_iterator __it) { _M_ht.erase(__it); }
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_hash_map.h 201 iterator __it = _M_ht.find(__key); local
202 return (__it == _M_ht.end() ?
204 (*__it).second );
219 void erase(iterator __it) { _M_ht.erase(__it); }
404 void erase(iterator __it) { _M_ht.erase(__it); }
_unordered_map.h 154 iterator __it = _M_ht.find(__key); local
155 return (__it == _M_ht.end() ?
157 (*__it).second );
171 void erase(const_iterator __it) { _M_ht.erase(__it); }
331 void erase(const_iterator __it) { _M_ht.erase(__it); }
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/debug/
safe_iterator.h 53 _M_Is(_BaseIt __it, const _Sequence* __seq)
356 _Self __it = *this; local
357 return __it._M_incrementable() && (++__it)._M_dereferenceable();
683 __base(_Iterator __it)
684 { return _Siter_base<_Iterator>::_S_base(__it); }
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/debug/
safe_iterator.h 53 _M_Is(_BaseIt __it, const _Sequence* __seq)
356 _Self __it = *this; local
357 return __it._M_incrementable() && (++__it)._M_dereferenceable();
683 __base(_Iterator __it)
684 { return _Siter_base<_Iterator>::_S_base(__it); }
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_hash_map.h 201 iterator __it = _M_ht.find(__key); local
202 return (__it == _M_ht.end() ?
204 (*__it).second );
219 void erase(iterator __it) { _M_ht.erase(__it); }
404 void erase(iterator __it) { _M_ht.erase(__it); }
_unordered_map.h 154 iterator __it = _M_ht.find(__key); local
155 return (__it == _M_ht.end() ?
157 (*__it).second );
171 void erase(const_iterator __it) { _M_ht.erase(__it); }
331 void erase(const_iterator __it) { _M_ht.erase(__it); }
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_hash_map.h 201 iterator __it = _M_ht.find(__key); local
202 return (__it == _M_ht.end() ?
204 (*__it).second );
219 void erase(iterator __it) { _M_ht.erase(__it); }
404 void erase(iterator __it) { _M_ht.erase(__it); }
_unordered_map.h 154 iterator __it = _M_ht.find(__key); local
155 return (__it == _M_ht.end() ?
157 (*__it).second );
171 void erase(const_iterator __it) { _M_ht.erase(__it); }
331 void erase(const_iterator __it) { _M_ht.erase(__it); }

Completed in 669 milliseconds

1 2