Conditional Types
At the heart of most useful programs, we have to make decisions based on input.JavaScript programs are no different, but given the fact that values can be easily introspected, those decisions are also based on the types of the inputs.Conditional types help describe the relation between the types of inputs and outputs.
tsTryinterfaceAnimal {live ():void;}interfaceDog extendsAnimal {woof ():void;}typeExample1 =Dog extendsAnimal ?number :string;typeExample2 =RegExp extendsAnimal ?number :string;
Conditional types take a form that looks a little like conditional expressions (condition ? trueExpression : falseExpression) in #"unimplemented";
These overloads for createLabel describe a single JavaScript function that makes a choice based on the types of its inputs. Note a few things:
- If a library has to make the same sort of choice over and over throughout its API, this becomes cumbersome.
- We have to create three overloads: one for each case when we’resure of the type (one for
stringand one fornumber), and one for the most general case (taking astring | number). For every new typecreateLabelcan handle, the number of overloads grows exponentially.
Instead, we can encode that logic in a conditional type:
tsTrytypeNameOrId <T extendsnumber |string> =T extendsnumber?IdLabel :NameLabel ;
We can then use that conditional type to simplify our overloads down to a single function with no overloads.
tsTryfunctioncreateLabel <T extendsnumber |string>(idOrName :T ):NameOrId <T > {throw"unimplemented";}leta =createLabel ("typescript");letb =createLabel (2.8);letc =createLabel (Math .random () ?"hello" :42);
Conditional Type Constraints
Often, the checks in a conditional type will provide us with some new information.Just like narrowing with type guards can give us a more specific type, the true branch of a conditional type will further constrain generics by the type we check against.
For example, let’s take the following:
tsTrytypeType '"message"' cannot be used to index type 'T'.2536Type '"message"' cannot be used to index type 'T'.MessageOf <T > =T ["message"];
In this example, TypeScript errors becauseT isn’t known to have a property calledmessage.We could constrainT, and TypeScript would no longer complain:
tsTrytypeMessageOf <T extends {message :unknown }> =T ["message"];interfacemessage :string;}typeEmailMessageContents =MessageOf <
However, what if we wantedMessageOf to take any type, and default to something likenever if amessage property isn’t available?We can do this by moving the constraint out and introducing a conditional type:
tsTrytypeMessageOf <T > =T extends {message :unknown } ?T ["message"] :never;interfacemessage :string;}interfaceDog {bark ():void;}typeEmailMessageContents =MessageOf <typeDogMessageContents =MessageOf <Dog >;
Within the true branch, TypeScript knows thatTwill have amessage property.
As another example, we could also write a type calledFlatten that flattens array types to their element types, but leaves them alone otherwise:
tsTrytypeFlatten <T > =T extendsany[] ?T [number] :T ;// Extracts out the element type.typeStr =Flatten <string[]>;// Leaves the type alone.typeNum =Flatten <number>;
WhenFlatten is given an array type, it uses an indexed access withnumber to fetch outstring[]’s element type.Otherwise, it just returns the type it was given.
Inferring Within Conditional Types
We just found ourselves using conditional types to apply constraints and then extract out types.This ends up being such a common operation that conditional types make it easier.
Conditional types provide us with a way to infer from types we compare against in the true branch using theinfer keyword.For example, we could have inferred the element type inFlatten instead of fetching it out “manually” with an indexed access type:
tsTrytypeFlatten <Type > =Type extendsArray <inferItem > ?Item :Type ;
Here, we used theinfer keyword to declaratively introduce a new generic type variable namedItem instead of specifying how to retrieve the element type ofType within the true branch.This frees us from having to think about how to dig through and probing apart the structure of the types we’re interested in.
We can write some useful helper type aliases using theinfer keyword.For example, for simple cases, we can extract the return type out from function types:
tsTrytypeGetReturnType <Type > =Type extends (...args :never[])=>inferReturn ?Return :never;typeNum =GetReturnType <()=>number>;typeStr =GetReturnType <(x :string)=>string>;typeBools =GetReturnType <(a :boolean,b :boolean)=>boolean[]>;
When inferring from a type with multiple call signatures (such as the type of an overloaded function), inferences are made from thelast signature (which, presumably, is the most permissive catch-all case). It is not possible to perform overload resolution based on a list of argument types.
tsTrydeclarefunctionstringOrNum (x :string):number;declarefunctionstringOrNum (x :number):string;declarefunctionstringOrNum (x :string |number):string |number;typeT1 =ReturnType <typeofstringOrNum >;
Distributive Conditional Types
When conditional types act on a generic type, they becomedistributive when given a union type.For example, take the following:
tsTrytypeToArray <Type > =Type extendsany ?Type [] :never;
If we plug a union type intoToArray, then the conditional type will be applied to each member of that union.
tsTrytypeToArray <Type > =Type extendsany ?Type [] :never;typeStrArrOrNumArr =ToArray <string |number>;
What happens here is thatToArray distributes on:
tsTrystring |number;
and maps over each member type of the union, to what is effectively:
tsTryToArray <string> |ToArray <number>;
which leaves us with:
tsTrystring[] |number[];
Typically, distributivity is the desired behavior.To avoid that behavior, you can surround each side of theextends keyword with square brackets.
tsTrytypeToArrayNonDist <Type > = [Type ]extends [any] ?Type [] :never;// 'ArrOfStrOrNum' is no longer a union.typeArrOfStrOrNum =ToArrayNonDist <string |number>;