Home
last modified time | relevance | path

Searched refs:_Pp (Results 1 – 8 of 8) sorted by relevance

/llvm-project-15.0.7/libcxx/include/__random/
H A Ddiscard_block_engine.h99 template<class _Eng, size_t _Pp, size_t _Rp>
103 const discard_block_engine<_Eng, _Pp, _Rp>& __x,
106 template<class _Eng, size_t _Pp, size_t _Rp>
110 const discard_block_engine<_Eng, _Pp, _Rp>& __x,
114 class _Eng, size_t _Pp, size_t _Rp>
121 class _Eng, size_t _Pp, size_t _Rp>
147 template<class _Eng, size_t _Pp, size_t _Rp>
156 template<class _Eng, size_t _Pp, size_t _Rp>
166 class _Eng, size_t _Pp, size_t _Rp>
180 class _Eng, size_t _Pp, size_t _Rp>
[all …]
/llvm-project-15.0.7/libcxx/include/__memory/
H A Dunique_ptr.h361 template <class _Pp>
363 _CheckArrayPointerConversion<_Pp>::value
397 template <class _Pp, bool _Dummy = true,
399 class = _EnableIfPointerConvertible<_Pp> >
401 explicit unique_ptr(_Pp __p) _NOEXCEPT
404 template <class _Pp, bool _Dummy = true,
417 template <class _Pp, bool _Dummy = true,
436 template <class _Pp, bool _Dummy = true,
520 template <class _Pp>
523 _CheckArrayPointerConversion<_Pp>::value
[all …]
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dshuffle.h101 typedef typename _Dp::param_type _Pp; in random_shuffle() typedef
109 difference_type __i = __uid(__g, _Pp(0, __d)); in random_shuffle()
144 typedef typename _Dp::param_type _Pp; in __shuffle() typedef
154 difference_type __i = __uid(__g, _Pp(0, __d)); in __shuffle()
/llvm-project-15.0.7/libcxx/include/
H A D__tree1168 template <class _Pp>
1189 template <class _Pp>
1196 template <class _Pp>
1203 template <class _Pp>
1210 template <class _Pp>
1232 template <class _Pp>
1239 template <class _Pp>
1246 template <class _Pp>
2613 typedef pair<iterator, iterator> _Pp;
2626 return _Pp(iterator(__rt),
[all …]
H A D__hash_table1042 template <class _Pp>
1044 pair<iterator, bool> __emplace_unique(_Pp&& __x) {
1063 template <class _Pp>
1069 template <class _Pp>
1075 template <class _Pp>
1096 …template <class _Pp, class = __enable_if_t<!__is_same_uncvref<_Pp, __container_value_type>::value>…
1098 pair<iterator, bool> __insert_unique(_Pp&& __x) {
1102 template <class _Pp>
1104 iterator __insert_multi(_Pp&& __x) {
1105 return __emplace_multi(_VSTD::forward<_Pp>(__x));
[all …]
H A Dmap1230 template <class _Pp,
1233 pair<iterator, bool> insert(_Pp&& __p)
1234 {return __tree_.__insert_unique(_VSTD::forward<_Pp>(__p));}
1236 template <class _Pp,
1239 iterator insert(const_iterator __pos, _Pp&& __p)
2000 template <class _Pp,
2001 class = __enable_if_t<is_constructible<value_type, _Pp>::value>>
2003 iterator insert(_Pp&& __p)
2004 {return __tree_.__insert_multi(_VSTD::forward<_Pp>(__p));}
2006 template <class _Pp,
[all …]
H A Dunordered_map1237 template <class _Pp,
1240 pair<iterator, bool> insert(_Pp&& __x)
1241 {return __table_.__insert_unique(_VSTD::forward<_Pp>(__x));}
1243 template <class _Pp,
1246 iterator insert(const_iterator __p, _Pp&& __x)
1252 return insert(_VSTD::forward<_Pp>(__x)).first;
2114 template <class _Pp,
2117 iterator insert(_Pp&& __x)
2118 {return __table_.__insert_multi(_VSTD::forward<_Pp>(__x));}
2120 template <class _Pp,
[all …]
H A Ddeque349 template <class _Pp, class _Rp, class _MP>
351 __deque_iterator(const __deque_iterator<value_type, _Pp, _Rp, _MP, difference_type, _BS>& __it,
352 typename enable_if<is_convertible<_Pp, pointer>::value>::type* = 0) _NOEXCEPT
480 template <class _Vp, class _Pp, class _Rp, class _MP, class _Dp, _Dp>