| Technical Specification | ||||
| Filesystem library(filesystem TS) | ||||
| Library fundamentals(library fundamentals TS) | ||||
| Library fundamentals 2(library fundamentals TS v2) | ||||
| Library fundamentals 3(library fundamentals TS v3) | ||||
| Extensions for parallelism(parallelism TS) | ||||
| Extensions for parallelism 2(parallelism TS v2) | ||||
| Extensions for concurrency(concurrency TS) | ||||
| Extensions for concurrency 2(concurrency TS v2) | ||||
| Concepts(concepts TS) | ||||
| Ranges(ranges TS) | ||||
| Reflection(reflection TS) | ||||
| Mathematical special functions(special functions TR) | ||||
| Experimental Non-TS | ||||
| Pattern Matching | ||||
| Linear Algebra | ||||
| std::execution | ||||
| Contracts | ||||
| 2D Graphics |
![]() | Merged into ISO C++ The functionality described on this page was merged into the mainline ISO C++ standard as of 2/2016, seestd::conjunction(since C++17) |
Defined in header <experimental/type_traits> | ||
template<class...B> struct conjunction; | (library fundamentals TS v2) | |
Forms thelogical conjunction of the type traitsB..., effectively performing a logical AND on the sequence of traits.
The specializationstd::experimental::conjunction<B1, ..., BN> has a public and unambiguous base that is
Bi inB1, ..., BN for whichbool(Bi::value)==false, orBN if there is no such type.The member names of the base class, other thanconjunction andoperator=, are not hidden and are unambiguously available inconjunction.
Conjunction is short-circuiting: if there is a template type argumentBi withbool(Bi::value)==false, then instantiatingconjunction<B1, ..., BN>::value does not require the instantiation ofBj::value forj> i.
Contents |
| B... | - | every template argumentBi for whichBi::value is instantiated must be usable as a base class and define membervalue that is convertible tobool |
template<class...B> constexprbool conjunction_v= conjunction<B...>::value; | (library fundamentals TS v2) | |
template<class...>struct conjunction:std::true_type{};template<class B1>struct conjunction<B1>: B1{};template<class B1,class...Bn>struct conjunction<B1, Bn...>:std::conditional_t<bool(B1::value), conjunction<Bn...>, B1>{}; |
A specialization ofconjunction does not necessarily inherit from eitherstd::true_type orstd::false_type: it simply inherits from the first B whose ::value, converted to bool, is false, or from the very last B when all of them convert to true. For example,conjunction<std::integral_constant<int,2>,std::integral_constant<int,4>>::value is4.
#include <experimental/type_traits>#include <iostream> // func is enabled if all Ts... have the same typetemplate<typename T,typename...Ts>constexprstd::enable_if_t<std::experimental::conjunction_v<std::is_same<T, Ts>...>>func(T, Ts...){std::cout<<"All types are the same.\n";} template<typename T,typename...Ts>constexprstd::enable_if_t<!std::experimental::conjunction_v<std::is_same<T, Ts>...>>func(T, Ts...){std::cout<<"Types differ.\n";} int main(){ func(1,2'7, 3'1); func(1,2.7,'3');}
Output:
All types are the same.Types differ.
(C++17) | variadic logical AND metafunction (class template)[edit] |