Typescript, merge object types?
UPDATE for TS4.1+
The original answer still works (and you should read it if you need an explanation), but now that recursive conditional types are supported, we can write merge()
with to be variadic:
type OptionalPropertyNames<T> =
{ [K in keyof T]-?: ({} extends { [P in K]: T[K] } ? K : never) }[keyof T];
type SpreadProperties<L, R, K extends keyof L & keyof R> =
{ [P in K]: L[P] | Exclude<R[P], undefined> };
type Id<T> = T extends infer U ? { [K in keyof U]: U[K] } : never
type SpreadTwo<L, R> = Id<
& Pick<L, Exclude<keyof L, keyof R>>
& Pick<R, Exclude<keyof R, OptionalPropertyNames<R>>>
& Pick<R, Exclude<OptionalPropertyNames<R>, keyof L>>
& SpreadProperties<L, R, OptionalPropertyNames<R> & keyof L>
>;
type Spread<A extends readonly [...any]> = A extends [infer L, ...infer R] ?
SpreadTwo<L, Spread<R>> : unknown
type Foo = Spread<[{ a: string }, { a?: number }]>
function merge<A extends object[]>(...a: [...A]) {
return Object.assign({}, ...a) as Spread<A>;
}
And you can test it:
const merged = merge(
{ a: 42 },
{ b: "foo", a: "bar" },
{ c: true, b: 123 }
);
/* const merged: {
a: string;
b: number;
c: boolean;
} */
Playground link to code
ORIGINAL ANSWER
The intersection type produced by the TypeScript standard library definition of Object.assign()
is an approximation that doesn't properly represent what happens if a later argument has a property with the same name as an earlier argument. Until very recently, though, this was the best you could do in TypeScript's type system.
Starting with the introduction of conditional types in TypeScript 2.8, however, there are closer approximations available to you. One such improvement is to use the type function Spread<L,R>
defined here, like this:
// Names of properties in T with types that include undefined
type OptionalPropertyNames<T> =
{ [K in keyof T]: undefined extends T[K] ? K : never }[keyof T];
// Common properties from L and R with undefined in R[K] replaced by type in L[K]
type SpreadProperties<L, R, K extends keyof L & keyof R> =
{ [P in K]: L[P] | Exclude<R[P], undefined> };
type Id<T> = T extends infer U ? { [K in keyof U]: U[K] } : never // see note at bottom*
// Type of { ...L, ...R }
type Spread<L, R> = Id<
// Properties in L that don't exist in R
& Pick<L, Exclude<keyof L, keyof R>>
// Properties in R with types that exclude undefined
& Pick<R, Exclude<keyof R, OptionalPropertyNames<R>>>
// Properties in R, with types that include undefined, that don't exist in L
& Pick<R, Exclude<OptionalPropertyNames<R>, keyof L>>
// Properties in R, with types that include undefined, that exist in L
& SpreadProperties<L, R, OptionalPropertyNames<R> & keyof L>
>;
(I've changed the linked definitions slightly; using Exclude
from the standard library instead of Diff
, and wrapping the Spread
type with the no-op Id
type to make the inspected type more tractable than a bunch of intersections).
Let's try it out:
function merge<A extends object, B extends object>(a: A, b: B) {
return Object.assign({}, a, b) as Spread<A, B>;
}
const merged = merge({ a: 42 }, { b: "foo", a: "bar" });
// {a: string; b: string;} as desired
You can see that a
in the output is now correctly recognized as a string
instead of string & number
. Yay!
But note that this is still an approximation:
-
Object.assign()
only copies enumerable, own properties, and the type system doesn't give you any way to represent the enumerability and ownership of a property to filter on. Meaning thatmerge({},new Date())
will look like typeDate
to TypeScript, even though at runtime none of theDate
methods will be copied over and the output is essentially{}
. This is a hard limit for now. -
Additionally, the definition of
Spread
doesn't really distinguish between missing properties and a property that is present with an undefined value. Somerge({ a: 42}, {a: undefined})
is erroneously typed as{a: number}
when it should be{a: undefined}
. This can probably be fixed by redefiningSpread
, but I'm not 100% sure. And it might not be necessary for most users. (Edit: this can be fixed by redefiningtype OptionalPropertyNames<T> = { [K in keyof T]-?: ({} extends { [P in K]: T[K] } ? K : never) }[keyof T]
) -
The type system can't do anything with properties it doesn't know about.
declare const whoKnows: {}; const notGreat = merge({a: 42}, whoKnows);
will have an output type of{a: number}
at compile time, but ifwhoKnows
happens to be{a: "bar"}
(which is assignable to{}
), thennotGreat.a
is a string at runtime but a number at compile time. Oops.
So be warned; the typing of Object.assign()
as an intersection or a Spread<>
is kind of a "best-effort" thing, and can lead you astray in edge cases.
Playground link to code
*Note: Id<T>
is an identity type and in principle shouldn't do anything to the type. Someone at some point edited this answer to remove it and replace with just T
. Such a change isn't incorrect, exactly, but it defeats the purpose... which is to iterate through the keys to eliminate intersections. Compare:
type Id<T> = T extends infer U ? { [K in keyof U]: U[K] } : never
type Foo = { a: string } & { b: number };
type IdFoo = Id<Foo>; // {a: string, b: number }
If you inspect IdFoo
you will see that the intersection has been eliminated and the two constituents have been merged into a single type. Again, there's no real difference between Foo
and IdFoo
in terms of assignability; it's just that the latter is easier to read in some circumstances.
If you want to preserve property order, use the following solution.
See it in action here.
export type Spread<L extends object, R extends object> = Id<
// Merge the properties of L and R into a partial (preserving order).
Partial<{ [P in keyof (L & R)]: SpreadProp<L, R, P> }> &
// Restore any required L-exclusive properties.
Pick<L, Exclude<keyof L, keyof R>> &
// Restore any required R properties.
Pick<R, RequiredProps<R>>
>
/** Merge a property from `R` to `L` like the spread operator. */
type SpreadProp<
L extends object,
R extends object,
P extends keyof (L & R)
> = P extends keyof R
? (undefined extends R[P] ? L[Extract<P, keyof L>] | R[P] : R[P])
: L[Extract<P, keyof L>]
/** Property names that are always defined */
type RequiredProps<T extends object> = {
[P in keyof T]-?: undefined extends T[P] ? never : P
}[keyof T]
/** Eliminate intersections */
type Id<T> = { [P in keyof T]: T[P] }
I found a syntax to declare a type that merges all properties of any two objects.
type Merge<A, B> = { [K in keyof (A | B)]: K extends keyof B ? B[K] : A[K] };
I think you're looking for more of a union (|
) type instead of an intersection (&
) type. It's closer to what you want...
function merge<A, B>(a: A, b: B): A | B {
return Object.assign({}, a, b)
}
merge({ a: "string" }, { a: 1 }).a // string | number
merge({ a: "string" }, { a: "1" }).a // string
learning TS I spent a lot of time coming back to this page... it's a good read (if you're into that sort of thing) and gives a lot of useful information