Home
last modified time | relevance | path

Searched refs:_First (Results 1 – 7 of 7) sorted by relevance

/freebsd-12.1/contrib/libstdc++/include/debug/
H A Dmacros.h59 ._M_iterator(_First, #_First) \
93 __glibcxx_check_valid_range(_First,_Last); \
126 ._M_iterator(_First, #_First) \
146 _GLIBCXX_DEBUG_ASSERT(_First == _Last || !(*_First < *_First))
151 _GLIBCXX_DEBUG_ASSERT(_First == _Last || !_Pred(*_First, *_First))
160 ._M_iterator(_First, #_First) \
170 ._M_iterator(_First, #_First) \
181 ._M_iterator(_First, #_First) \
192 ._M_iterator(_First, #_First) \
202 ._M_iterator(_First, #_First) \
[all …]
H A Ddebug.h69 # define __glibcxx_requires_valid_range(_First,_Last) argument
70 # define __glibcxx_requires_sorted(_First,_Last) argument
74 # define __glibcxx_requires_heap(_First,_Last) argument
121 __glibcxx_check_valid_range(_First,_Last)
122 # define __glibcxx_requires_sorted(_First,_Last) \ argument
123 __glibcxx_check_sorted(_First,_Last)
125 __glibcxx_check_sorted_pred(_First,_Last,_Pred)
127 __glibcxx_check_partitioned(_First,_Last,_Value)
130 # define __glibcxx_requires_heap(_First,_Last) \ argument
131 __glibcxx_check_heap(_First,_Last)
[all …]
/freebsd-12.1/contrib/libstdc++/include/bits/
H A Dboost_concept_check.h276 template <class _First, class _Second> \
282 _First __a; \
287 template <class _Ret, class _First, class _Second> \
293 _First __a; \
362 _First __first;
367 template <class _Func, class _First, class _Second>
374 _First __first;
388 template <class _Func, class _First, class _Second>
395 _First __a;
400 template <class _Func, class _First, class _Second>
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Lex/
H A DPPCallbacks.h353 PPChainedCallbacks(std::unique_ptr<PPCallbacks> _First, in PPChainedCallbacks() argument
355 : First(std::move(_First)), Second(std::move(_Second)) {} in PPChainedCallbacks()
/freebsd-12.1/contrib/libc++/include/
H A D__hash_table1084 template <class _First, class _Second>
1087 __can_extract_map_key<_First, key_type, __container_value_type>::value,
1089 >::type __emplace_unique(_First&& __f, _Second&& __s) {
1090 return __emplace_unique_key_args(__f, _VSTD::forward<_First>(__f),
1359 template <class _First, class ..._Rest>
1360 __node_holder __construct_node_hash(size_t __hash, _First&& __f, _Rest&&... __rest);
2533 template <class _First, class ..._Rest>
2536 size_t __hash, _First&& __f, _Rest&& ...__rest)
2538 static_assert(!__is_hash_value_type<_First, _Rest...>::value,
2543 _VSTD::forward<_First>(__f),
H A D__tree1167 template <class _First, class _Second>
1170 __can_extract_map_key<_First, key_type, __container_value_type>::value,
1172 >::type __emplace_unique(_First&& __f, _Second&& __s) {
1173 return __emplace_unique_key_args(__f, _VSTD::forward<_First>(__f),
1211 template <class _First, class _Second>
1214 __can_extract_map_key<_First, key_type, __container_value_type>::value,
1216 >::type __emplace_hint_unique(const_iterator __p, _First&& __f, _Second&& __s) {
1218 _VSTD::forward<_First>(__f),
H A Dtype_traits4794 template <class _Pair, class _Key, class _First, class _Second>
4795 struct __can_extract_key<_Pair, _Key, pair<_First, _Second>>
4796 : conditional<is_same<typename remove_const<_First>::type, _Key>::value,