Nullish coalescing operator but for conditional types

🔍 Search Terms

nullish coalescing operator
conditional types

✅ Viability Checklist

• This wouldn't be a breaking change in existing TypeScript/JavaScript code
• This wouldn't change the runtime behavior of existing JavaScript code
• This could be implemented without emitting different JS based on the types of the expressions
• This isn't a runtime feature (e.g. library functionality, non-ECMAScript syntax with JavaScript output, new syntax sugar for JS, etc.)
• This isn't a request to add a new utility type: https://github.com/microsoft/TypeScript/wiki/No-New-Utility-Types
• This feature would agree with the rest of our Design Goals: https://github.com/Microsoft/TypeScript/wiki/TypeScript-Design-Goals

⭐ Suggestion

Add syntactic sugar to allow this:

type T = A extends B ?? C

to be shorthand of:

type T = A extends B ? A : C

📃 Motivating Example

When working with large complicated types, it is often that you need to check that a type extends another type before passing it as a type argument to another type.

For example, ensuring it is an array before passing it to something that requires it to be an array:

type Foo<T> = Bar<
    Some<Really<Deep<Complex<Type<Utility<T>>>>>> extends readonly unknown[]
        ? Some<Really<Deep<Complex<Type<Utility<T>>>>>>
        : never
>;

type Bar<T extends readonly unknown[]> = ...;

The more complex the type you need to check, the more you need to repeat yourself to pass the same type in again.

This proposal aims to address that.

type Foo<T> = Bar<
    Some<Really<Deep<Complex<Type<Utility<T>>>>>> extends readonly unknown[] ?? never
>;

💻 Use Cases

1. What do you want to use this for?

Making my type code more readable and easier to maintain.

2. What shortcomings exist with current approaches?

The need to repeat yourself. Updates to the type need to be make in two places.

3. What workarounds are you using in the meantime?

The long-form syntax.

La issue non indica file di implementazione né test. Inizia tracciando come vengono analizzati e verificati i tipi condizionali, quindi determina le modifiche alla sintassi e al sistema dei tipi necessarie affinché A extends B ?? C si comporti come A extends B ? A : C; il lavoro è completo quando la forma abbreviata viene accettata e presenta il comportamento dei tipi equivalente indicato.