Home
last modified time | relevance | path

Searched refs:__h (Results 1 – 20 of 20) sorted by relevance

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_string_hash.h35 unsigned long __h = 0; in __stl_string_hash() local
39 __h = /* 5 *__h */(__h << 2) + __h + __data[__i]; in __stl_string_hash()
40 return size_t(__h); in __stl_string_hash()
D_hash_fun.h46 unsigned long __h = 0; in __stl_hash_string()
48 __h = 5*__h + *__s; in __stl_hash_string()
50 return size_t(__h); in __stl_hash_string()
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dforward_list794 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
798 __h.reset(__node_traits::allocate(__a, 1));
799 __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
800 __h->__next_ = nullptr;
801 __p->__next_ = __h.release();
815 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
819 __h.reset(__node_traits::allocate(__a, 1));
820 __node_traits::construct(__a, _VSTD::addressof(__h->__value_));
821 __h->__next_ = nullptr;
822 __p->__next_ = __h.release();
[all …]
D__hash_table75 __constrain_hash(size_t __h, size_t __bc)
77 return !(__bc & (__bc - 1)) ? __h & (__bc - 1) : __h % __bc;
1439 __node_holder __h =
1441 __node_insert_multi(__h.get());
1442 __h.release();
1780 __node_holder __h = __construct_node(__x, __hash);
1793 __h->__next_ = __pn->__next_;
1794 __pn->__next_ = __h.get();
1797 if (__h->__next_ != nullptr)
1798 __bucket_list_[__constrain_hash(__h->__next_->__hash_, __bc)] = __h.get();
[all …]
Dmap1297 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1298 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first));
1299 __h.get_deleter().__first_constructed = true;
1300 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.second));
1301 __h.get_deleter().__second_constructed = true;
1302 return __h;
1311 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1312 __node_traits::construct(__na, _VSTD::addressof(__h->__value_), _VSTD::forward<_A0>(__a0));
1313 __h.get_deleter().__first_constructed = true;
1314 __h.get_deleter().__second_constructed = true;
[all …]
Dunordered_map374 __unordered_map_hasher(const _Hash& __h)
376 : _Hash(__h) {}
398 __unordered_map_hasher(const _Hash& __h)
400 : __hash_(__h) {}
1264 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1265 __node_traits::construct(__na, _VSTD::addressof(__h->__value_));
1266 __h.get_deleter().__first_constructed = true;
1267 __h.get_deleter().__second_constructed = true;
1268 return __h;
1277 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
[all …]
D__tree98 unsigned __h = __tree_sub_invariant(__x->__left_);
99 if (__h == 0)
101 if (__h != __tree_sub_invariant(__x->__right_))
103 return __h + __x->__is_black_; // return black height of this node
1730 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1731 … __node_traits::construct(__na, _VSTD::addressof(__h->__value_), _VSTD::forward<_Args>(__args)...);
1732 __h.get_deleter().__value_constructed = true;
1733 return __h;
1741 __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
1743 __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
[all …]
D__locale247 size_t __h = 0;
252 __h = (__h << 4) + static_cast<size_t>(*__p);
253 size_t __g = __h & __mask;
254 __h ^= __g | (__g >> __sr);
256 return static_cast<long>(__h);
Dlocale2011 void __get_12_hour(int& __h,
2015 void __get_am_pm(int& __h,
2131 time_get<_CharT, _InputIterator>::__get_hour(int& __h,
2138 __h = __t;
2145 time_get<_CharT, _InputIterator>::__get_12_hour(int& __h,
2152 __h = __t;
2227 time_get<_CharT, _InputIterator>::__get_am_pm(int& __h,
2239 if (__i == 0 && __h == 12)
2240 __h = 0;
2241 else if (__i == 1 && __h < 12)
[all …]
Dchrono952 constexpr chrono::hours operator"" h(unsigned long long __h)
954 return chrono::hours(static_cast<chrono::hours::rep>(__h));
957 constexpr chrono::duration<long double, ratio<3600,1>> operator"" h(long double __h)
959 return chrono::duration<long double, ratio<3600,1>>(__h);
Dalgorithm3278 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
3305 // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
3368 unique_ptr<value_type, __return_temporary_buffer> __h;
3372 __h.reset(__p.first);
3408 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
3437 // __h destructs moved-from values out of the temp buffer, but doesn't deallocate buffer
3516 unique_ptr<value_type, __return_temporary_buffer> __h;
3520 __h.reset(__p.first);
3794 unique_ptr<value_type, __destruct_n&> __h(__first2, __d);
3816 __h.release();
[all …]
Dbitset421 size_t __h = 0;
423 __h ^= __first_[__i];
424 return __h;
Dmemory3096 _Size __h = __len;
3104 __h *= __m;
3105 __h ^= __k;
3110 __h ^= __data[2] << 16;
3112 __h ^= __data[1] << 8;
3114 __h ^= __data[0];
3115 __h *= __m;
3117 __h ^= __h >> 13;
3118 __h *= __m;
3119 __h ^= __h >> 15;
[all …]
Dfuture2289 __h(new __deferred_assoc_state<_Rp, _Fp>(_VSTD::forward<_Fp>(__f)));
2290 return future<_Rp>(__h.get());
2302 __h(new __async_assoc_state<_Rp, _Fp>(_VSTD::forward<_Fp>(__f)));
2303 _VSTD::thread(&__async_assoc_state<_Rp, _Fp>::__execute, __h.get()).detach();
2304 return future<_Rp>(__h.get());
Dostream848 unique_ptr<_CharT, void(*)(void*)> __h(0, free);
854 __h.reset(__wb);
Dfstream562 unique_ptr<FILE, int(*)(FILE*)> __h(__file_, fclose);
565 if (fclose(__h.release()) == 0)
Dvector3217 size_t __h = 0;
3222 __h ^= *__p;
3227 __h ^= *__p & __m;
3229 return __h;
Dregex2995 unique_ptr<__node> __h(new __end_state<_CharT>);
2996 __start_.reset(new __empty_state<_CharT>(__h.get()));
2997 __h.release();
/ndk/sources/host-tools/sed-4.2.1/lib/
Dobstack.h367 ({ struct obstack *__h = (OBSTACK); \
368 obstack_blank (__h, (length)); \
369 obstack_finish (__h); })
373 ({ struct obstack *__h = (OBSTACK); \
374 obstack_grow (__h, (where), (length)); \
375 obstack_finish (__h); })
379 ({ struct obstack *__h = (OBSTACK); \
380 obstack_grow0 (__h, (where), (length)); \
381 obstack_finish (__h); })
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ext/
Dhash_map232 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : _Hash(__h) {}
248 _LIBCPP_INLINE_VISIBILITY __hash_map_hasher(const _Hash& __h) : __hash_(__h) {}
686 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
687 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.first), __k);
688 __h.get_deleter().__first_constructed = true;
689 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.second));
690 __h.get_deleter().__second_constructed = true;
691 return _VSTD::move(__h); // explicitly moved for C++03
712 __node_holder __h = __construct_node(__k);
713 pair<iterator, bool> __r = __table_.__node_insert_unique(__h.get());
[all …]