HomeSort by relevance Sort by last modified time
    Searched full:__key (Results 51 - 75 of 249) sorted by null

1 23 4 5 6 7 8 910

  /prebuilts/ndk/current/platforms/android-17/arch-x86/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-18/arch-arm/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-18/arch-mips/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-18/arch-x86/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-19/arch-arm/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-19/arch-mips/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-19/arch-x86/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-3/arch-arm/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-4/arch-arm/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-5/arch-arm/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-8/arch-arm/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-9/arch-arm/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-9/arch-mips/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/ndk/current/platforms/android-9/arch-x86/usr/include/linux/
mutex.h 35 #define mutex_init(mutex) do { static struct lock_class_key __key; __mutex_init((mutex), #mutex, &__key); } while (0)
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/
losertree.h 126 * @brief Initializes the sequence "_M_source" with the element "__key".
128 * @param __key the element to insert
134 __insert_start(const _Tp& __key, int __source, bool __sup)
142 ::new(&(_M_losers[__i]._M_key)) _Tp(__key);
146 _M_losers[__pos]._M_key = __key;
219 // Do not pass a const reference since __key will be used as
222 __delete_min_insert(_Tp __key, bool __sup)
238 && ((_M_comp(_M_losers[__pos]._M_key, __key))
239 || (!_M_comp(__key, _M_losers[__pos]._M_key)
245 swap(_M_losers[__pos]._M_key, __key);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/
losertree.h 126 * @brief Initializes the sequence "_M_source" with the element "__key".
128 * @param __key the element to insert
134 __insert_start(const _Tp& __key, int __source, bool __sup)
142 ::new(&(_M_losers[__i]._M_key)) _Tp(__key);
146 _M_losers[__pos]._M_key = __key;
219 // Do not pass a const reference since __key will be used as
222 __delete_min_insert(_Tp __key, bool __sup)
238 && ((_M_comp(_M_losers[__pos]._M_key, __key))
239 || (!_M_comp(__key, _M_losers[__pos]._M_key)
245 swap(_M_losers[__pos]._M_key, __key);
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
losertree.h 126 * @brief Initializes the sequence "_M_source" with the element "__key".
128 * @param __key the element to insert
134 __insert_start(const _Tp& __key, int __source, bool __sup)
142 ::new(&(_M_losers[__i]._M_key)) _Tp(__key);
146 _M_losers[__pos]._M_key = __key;
219 // Do not pass a const reference since __key will be used as
222 __delete_min_insert(_Tp __key, bool __sup)
238 && ((_M_comp(_M_losers[__pos]._M_key, __key))
239 || (!_M_comp(__key, _M_losers[__pos]._M_key)
245 swap(_M_losers[__pos]._M_key, __key);
    [all...]
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
losertree.h 126 * @brief Initializes the sequence "_M_source" with the element "__key".
128 * @param __key the element to insert
134 __insert_start(const _Tp& __key, int __source, bool __sup)
142 ::new(&(_M_losers[__i]._M_key)) _Tp(__key);
146 _M_losers[__pos]._M_key = __key;
219 // Do not pass a const reference since __key will be used as
222 __delete_min_insert(_Tp __key, bool __sup)
238 && ((_M_comp(_M_losers[__pos]._M_key, __key))
239 || (!_M_comp(__key, _M_losers[__pos]._M_key)
245 swap(_M_losers[__pos]._M_key, __key);
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_hash_map.h 195 iterator find(const _KT& __key) { return _M_ht.find(__key); }
197 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
200 _Tp& operator[](const _KT& __key) {
201 iterator __it = _M_ht.find(__key);
203 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
208 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
211 pair<iterator, iterator> equal_range(const _KT& __key)
    [all...]
_unordered_map.h 148 iterator find(const _KT& __key) { return _M_ht.find(__key); }
150 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
153 _Tp& operator[](const _KT& __key) {
154 iterator __it = _M_ht.find(__key);
156 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
161 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
164 pair<iterator, iterator> equal_range(const _KT& __key)
    [all...]
  /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/
_hash_map.h 195 iterator find(const _KT& __key) { return _M_ht.find(__key); }
197 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
200 _Tp& operator[](const _KT& __key) {
201 iterator __it = _M_ht.find(__key);
203 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
208 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
211 pair<iterator, iterator> equal_range(const _KT& __key)
    [all...]
_unordered_map.h 148 iterator find(const _KT& __key) { return _M_ht.find(__key); }
150 const_iterator find(const _KT& __key) const { return _M_ht.find(__key); }
153 _Tp& operator[](const _KT& __key) {
154 iterator __it = _M_ht.find(__key);
156 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
161 size_type count(const _KT& __key) const { return _M_ht.count(__key); }
164 pair<iterator, iterator> equal_range(const _KT& __key)
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/backward/
hash_map 212 find(const key_type& __key)
213 { return _M_ht.find(__key); }
216 find(const key_type& __key) const
217 { return _M_ht.find(__key); }
220 operator[](const key_type& __key)
221 { return _M_ht.find_or_insert(value_type(__key, _Tp())).second; }
224 count(const key_type& __key) const
225 { return _M_ht.count(__key); }
228 equal_range(const key_type& __key)
229 { return _M_ht.equal_range(__key); }
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/
hash_map 212 find(const key_type& __key)
213 { return _M_ht.find(__key); }
216 find(const key_type& __key) const
217 { return _M_ht.find(__key); }
220 operator[](const key_type& __key)
221 { return _M_ht.find_or_insert(value_type(__key, _Tp())).second; }
224 count(const key_type& __key) const
225 { return _M_ht.count(__key); }
228 equal_range(const key_type& __key)
229 { return _M_ht.equal_range(__key); }
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/backward/
hash_map 212 find(const key_type& __key)
213 { return _M_ht.find(__key); }
216 find(const key_type& __key) const
217 { return _M_ht.find(__key); }
220 operator[](const key_type& __key)
221 { return _M_ht.find_or_insert(value_type(__key, _Tp())).second; }
224 count(const key_type& __key) const
225 { return _M_ht.count(__key); }
228 equal_range(const key_type& __key)
229 { return _M_ht.equal_range(__key); }
    [all...]

Completed in 1857 milliseconds

1 23 4 5 6 7 8 910