@voidhash/mimic 0.0.6 → 0.0.7

package/.turbo/turbo-build.log

@@ -1,5 +1,5 @@
 
-> @voidhash/mimic@0.0.6 build /home/runner/work/mimic/mimic/packages/mimic
+> @voidhash/mimic@0.0.7 build /home/runner/work/mimic/mimic/packages/mimic
 > tsdown
 
 ℹ tsdown v0.18.2 powered by rolldown v1.0.0-beta.55
@@ -30,9 +30,9 @@
 ℹ [CJS] dist/primitives/Boolean.cjs                                                            4.02 kB │ gzip: 1.06 kB
 ℹ [CJS] dist/primitives/Literal.cjs                                                            3.89 kB │ gzip: 1.06 kB
 ℹ [CJS] dist/client/StateMonitor.cjs                                                           3.71 kB │ gzip: 1.27 kB
+ℹ [CJS] dist/primitives/shared.cjs                                                             3.69 kB │ gzip: 1.25 kB
 ℹ [CJS] dist/server/errors.cjs                                                                 3.29 kB │ gzip: 0.70 kB
 ℹ [CJS] dist/server/ServerDocument.cjs                                                         3.16 kB │ gzip: 1.04 kB
-ℹ [CJS] dist/primitives/shared.cjs                                                             2.71 kB │ gzip: 1.02 kB
 ℹ [CJS] dist/primitives/TreeNode.cjs                                                           2.67 kB │ gzip: 0.92 kB
 ℹ [CJS] dist/Presence.cjs                                                                      2.36 kB │ gzip: 0.87 kB
 ℹ [CJS] dist/Primitive.cjs                                                                     2.34 kB │ gzip: 0.59 kB
@@ -52,7 +52,7 @@
 ℹ [CJS] dist/OperationDefinition.cjs                                                           0.22 kB │ gzip: 0.16 kB
 ℹ [CJS] dist/client/Transport.cjs                                                              0.21 kB │ gzip: 0.16 kB
 ℹ [CJS] dist/Transform.cjs                                                                     0.20 kB │ gzip: 0.16 kB
-ℹ [CJS] 44 files, total: 211.64 kB
+ℹ [CJS] 44 files, total: 212.62 kB
 ℹ [CJS] dist/primitives/Tree.d.cts.map             6.90 kB │ gzip: 2.60 kB
 ℹ [CJS] dist/primitives/Struct.d.cts.map           3.85 kB │ gzip: 1.62 kB
 ℹ [CJS] dist/utils/tree-helpers.d.cts.map          3.61 kB │ gzip: 1.31 kB
@@ -91,7 +91,7 @@
 ℹ [CJS] dist/primitives/Tree.d.cts                13.50 kB │ gzip: 3.50 kB
 ℹ [CJS] dist/utils/tree-helpers.d.cts             12.18 kB │ gzip: 2.52 kB
 ℹ [CJS] dist/client/Transport.d.cts                7.30 kB │ gzip: 1.84 kB
-ℹ [CJS] dist/primitives/shared.d.cts               6.87 kB │ gzip: 2.09 kB
+ℹ [CJS] dist/primitives/shared.d.cts               6.89 kB │ gzip: 2.09 kB
 ℹ [CJS] dist/client/ClientDocument.d.cts           6.07 kB │ gzip: 1.68 kB
 ℹ [CJS] dist/primitives/Struct.d.cts               5.96 kB │ gzip: 1.59 kB
 ℹ [CJS] dist/primitives/Either.d.cts               5.44 kB │ gzip: 1.54 kB
@@ -120,8 +120,8 @@
 ℹ [CJS] dist/client/WebSocketTransport.d.cts       1.22 kB │ gzip: 0.55 kB
 ℹ [CJS] dist/Transform.d.cts                       0.48 kB │ gzip: 0.26 kB
 ℹ [CJS] dist/OperationDefinition.d.cts             0.36 kB │ gzip: 0.21 kB
-ℹ [CJS] 67 files, total: 179.23 kB
-✔ Build complete in 6451ms
+ℹ [CJS] 67 files, total: 179.25 kB
+✔ Build complete in 6277ms
 ℹ [ESM] dist/index.mjs                                                                         1.01 kB │ gzip:  0.28 kB
 ℹ [ESM] dist/client/index.mjs                                                                  0.99 kB │ gzip:  0.28 kB
 ℹ [ESM] dist/server/index.mjs                                                                  0.41 kB │ gzip:  0.17 kB
@@ -140,10 +140,10 @@
 ℹ [ESM] dist/FractionalIndex.mjs                                                              16.49 kB │ gzip:  3.36 kB
 ℹ [ESM] dist/client/Rebase.mjs.map                                                            14.15 kB │ gzip:  3.21 kB
 ℹ [ESM] dist/utils/tree-helpers.mjs                                                           13.31 kB │ gzip:  3.15 kB
+ℹ [ESM] dist/primitives/shared.mjs.map                                                        13.14 kB │ gzip:  3.69 kB
 ℹ [ESM] dist/primitives/Array.mjs                                                             11.07 kB │ gzip:  2.64 kB
 ℹ [ESM] dist/Document.mjs.map                                                                 10.89 kB │ gzip:  3.31 kB
 ℹ [ESM] dist/client/WebSocketTransport.mjs                                                    10.81 kB │ gzip:  2.68 kB
-ℹ [ESM] dist/primitives/shared.mjs.map                                                        10.65 kB │ gzip:  3.09 kB
 ℹ [ESM] dist/server/ServerDocument.mjs.map                                                    10.44 kB │ gzip:  2.95 kB
 ℹ [ESM] dist/client/StateMonitor.mjs.map                                                      10.39 kB │ gzip:  3.04 kB
 ℹ [ESM] dist/primitives/String.mjs.map                                                         9.70 kB │ gzip:  2.70 kB
@@ -172,6 +172,7 @@
 ℹ [ESM] dist/types/index.mjs.map                                                               3.74 kB │ gzip:  0.79 kB
 ℹ [ESM] dist/utils/tree-helpers.d.mts.map                                                      3.61 kB │ gzip:  1.31 kB
 ℹ [ESM] dist/client/StateMonitor.mjs                                                           3.60 kB │ gzip:  1.23 kB
+ℹ [ESM] dist/primitives/shared.mjs                                                             3.55 kB │ gzip:  1.25 kB
 ℹ [ESM] dist/primitives/Boolean.mjs                                                            3.40 kB │ gzip:  1.04 kB
 ℹ [ESM] dist/primitives/Literal.mjs                                                            3.31 kB │ gzip:  1.04 kB
 ℹ [ESM] dist/primitives/Array.d.mts.map                                                        3.26 kB │ gzip:  1.35 kB
@@ -181,7 +182,6 @@
 ℹ [ESM] dist/server/errors.mjs                                                                 2.85 kB │ gzip:  0.70 kB
 ℹ [ESM] dist/Operation.mjs.map                                                                 2.75 kB │ gzip:  0.86 kB
 ℹ [ESM] dist/Transaction.mjs.map                                                               2.65 kB │ gzip:  0.99 kB
-ℹ [ESM] dist/primitives/shared.mjs                                                             2.57 kB │ gzip:  1.03 kB
 ℹ [ESM] dist/primitives/TreeNode.d.mts.map                                                     2.45 kB │ gzip:  1.07 kB
 ℹ [ESM] dist/ProxyEnvironment.mjs.map                                                          2.42 kB │ gzip:  0.93 kB
 ℹ [ESM] dist/primitives/TreeNode.mjs                                                           2.42 kB │ gzip:  0.93 kB
@@ -237,7 +237,7 @@
 ℹ [ESM] dist/primitives/Tree.d.mts                                                            13.50 kB │ gzip:  3.50 kB
 ℹ [ESM] dist/utils/tree-helpers.d.mts                                                         12.18 kB │ gzip:  2.52 kB
 ℹ [ESM] dist/client/Transport.d.mts                                                            7.30 kB │ gzip:  1.84 kB
-ℹ [ESM] dist/primitives/shared.d.mts                                                           6.87 kB │ gzip:  2.09 kB
+ℹ [ESM] dist/primitives/shared.d.mts                                                           6.89 kB │ gzip:  2.09 kB
 ℹ [ESM] dist/client/ClientDocument.d.mts                                                       6.09 kB │ gzip:  1.69 kB
 ℹ [ESM] dist/primitives/Struct.d.mts                                                           5.99 kB │ gzip:  1.60 kB
 ℹ [ESM] dist/primitives/Either.d.mts                                                           5.44 kB │ gzip:  1.54 kB
@@ -266,5 +266,5 @@
 ℹ [ESM] dist/client/WebSocketTransport.d.mts                                                   1.22 kB │ gzip:  0.55 kB
 ℹ [ESM] dist/Transform.d.mts                                                                   0.48 kB │ gzip:  0.26 kB
 ℹ [ESM] dist/OperationDefinition.d.mts                                                         0.36 kB │ gzip:  0.22 kB
-ℹ [ESM] 144 files, total: 836.40 kB
-✔ Build complete in 6485ms
+ℹ [ESM] 144 files, total: 839.90 kB
+✔ Build complete in 6315ms

package/dist/Presence.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"Presence.d.mts","names":[],"sources":["../src/Presence.ts"],"sourcesContent":[],"mappings":";;;;;;;;;;UAeiB;;;mBAGE,MAAA,CAAO,OAAO;;EAHhB,SAAA,KAAQ,EAKP,KALO;;;;;AAWR,UAAA,eAAe,CAAA,KAEC,CAAA,CAAA;EAMrB;EAKA,SAAA,MAAW,EAXJ,MAAA,CAAO,MAWA,CAXO,KAWC,CAAA;AASlC;AA8BA;;;AAAwE,KA5C5D,KA4C4D,CAAA,UA5C5C,QA4C4C,CAAA,GAAA,CAAA,CAAA,GA5C3B,CA4C2B,CAAA,OAAA,CAAA;;;AAmBxE;AACqB,KA3DT,WAAA,GAAc,QA2DL,CAAA,GAAA,CAAA;;;;AAcR,UAhEI,aAyEhB,CAAA,QAAA,OAAA,CAAA,CAAA;EARoB;EAAT,SAAA,IAAA,EA/DK,KA+DL;EAET;EAAK,SAAA,MAAA,CAAA,EAAA,MAAA;AAeR;;;;;;;;;;;;;;;;;;;;cApDa,uBAAyB,gBAAgB,WAAS,SAAS;;;;;;;;;;cAmB3D,4BACD,SAAS,0BAElB;;;;;;;;;cAYU,gCACD,SAAS,0BAElB;;;;;;;;cAeU,2BACD,SAAS,kCAEV"}
+{"version":3,"file":"Presence.d.mts","names":[],"sources":["../src/Presence.ts"],"sourcesContent":[],"mappings":";;;;;;;;;;UAeiB;;;mBAGE,MAAA,CAAO,OAAO;;EAHhB,SAAA,KAAQ,EAKP,KALO;;;;;AAWR,UAAA,eAAe,CAAA,KAAA,CAEC,CAAA;EAMrB;EAKA,SAAA,MAAW,EAXJ,MAAA,CAAO,MAWA,CAXO,KAWC,CAAA;AASlC;AA8BA;;;AAAwE,KA5C5D,KA4C4D,CAAA,UA5C5C,QA4C4C,CAAA,GAAA,CAAA,CAAA,GA5C3B,CA4C2B,CAAA,OAAA,CAAA;;;AAmBxE;AACqB,KA3DT,WAAA,GAAc,QA2DL,CAAA,GAAA,CAAA;;;;AAcR,UAhEI,aAyEhB,CAAA,QAAA,OAAA,CAAA,CAAA;EARoB;EAAT,SAAA,IAAA,EA/DK,KA+DL;EAET;EAAK,SAAA,MAAA,CAAA,EAAA,MAAA;AAeR;;;;;;;;;;;;;;;;;;;;cApDa,uBAAyB,gBAAgB,WAAS,SAAS;;;;;;;;;;cAmB3D,4BACD,SAAS,0BAElB;;;;;;;;;cAYU,gCACD,SAAS,0BAElB;;;;;;;;cAeU,2BACD,SAAS,kCAEV"}

package/dist/primitives/shared.cjs

@@ -25,12 +25,12 @@ function isCompatibleOperation(operation, operationDefinitions) {
 	return Object.values(operationDefinitions).some((value) => value.kind === operation.kind);
 }
 /**
-* Applies default values to a partial input, recursively handling nested structs.
+* Applies default values to a partial input, recursively handling nested structs and unions.
 * 
 * Uses a two-layer approach:
 * 1. First, get the struct's initial state (which includes struct-level defaults)
 * 2. Then, layer the provided values on top
-* 3. Finally, ensure nested structs are recursively processed
+* 3. Finally, ensure nested structs and unions are recursively processed
 * 
 * @param primitive - The primitive definition containing field information
 * @param value - The partial value provided by the user
@@ -46,10 +46,34 @@ function applyDefaults(primitive, value) {
 			if (result[key] === void 0) {
 				const fieldDefault = fieldPrimitive._internal.getInitialState();
 				if (fieldDefault !== void 0) result[key] = fieldDefault;
-			} else if (fieldPrimitive._tag === "StructPrimitive" && typeof result[key] === "object" && result[key] !== null) result[key] = applyDefaults(fieldPrimitive, result[key]);
+			} else if (typeof result[key] === "object" && result[key] !== null) {
+				if (fieldPrimitive._tag === "StructPrimitive" || fieldPrimitive._tag === "UnionPrimitive") result[key] = applyDefaults(fieldPrimitive, result[key]);
+			}
 		}
 		return result;
 	}
+	if (primitive._tag === "UnionPrimitive") {
+		const unionPrimitive = primitive;
+		if (typeof value !== "object" || value === null) return value;
+		const discriminator = unionPrimitive._schema.discriminator;
+		const discriminatorValue = value[discriminator];
+		let matchingVariantKey;
+		for (const variantKey in unionPrimitive._schema.variants) {
+			const variant = unionPrimitive._schema.variants[variantKey];
+			if (variant._tag === "StructPrimitive") {
+				const discriminatorField = variant.fields[discriminator];
+				if (discriminatorField && discriminatorField._tag === "LiteralPrimitive") {
+					if (discriminatorField.literal === discriminatorValue) {
+						matchingVariantKey = variantKey;
+						break;
+					}
+				}
+			}
+		}
+		if (!matchingVariantKey) return value;
+		const variantPrimitive = unionPrimitive._schema.variants[matchingVariantKey];
+		return applyDefaults(variantPrimitive, value);
+	}
 	return value;
 }
 

package/dist/primitives/shared.d.cts

@@ -139,12 +139,12 @@ declare function runValidators<T>(value: T, validators: readonly {
  */
 declare function isCompatibleOperation(operation: Operation<any, any, any>, operationDefinitions: Record<string, OperationDefinition<any, any, any>>): boolean;
 /**
- * Applies default values to a partial input, recursively handling nested structs.
+ * Applies default values to a partial input, recursively handling nested structs and unions.
  *
  * Uses a two-layer approach:
  * 1. First, get the struct's initial state (which includes struct-level defaults)
  * 2. Then, layer the provided values on top
- * 3. Finally, ensure nested structs are recursively processed
+ * 3. Finally, ensure nested structs and unions are recursively processed
  *
  * @param primitive - The primitive definition containing field information
  * @param value - The partial value provided by the user

package/dist/primitives/shared.d.mts

@@ -139,12 +139,12 @@ declare function runValidators<T>(value: T, validators: readonly {
  */
 declare function isCompatibleOperation(operation: Operation<any, any, any>, operationDefinitions: Record<string, OperationDefinition<any, any, any>>): boolean;
 /**
- * Applies default values to a partial input, recursively handling nested structs.
+ * Applies default values to a partial input, recursively handling nested structs and unions.
  *
  * Uses a two-layer approach:
  * 1. First, get the struct's initial state (which includes struct-level defaults)
  * 2. Then, layer the provided values on top
- * 3. Finally, ensure nested structs are recursively processed
+ * 3. Finally, ensure nested structs and unions are recursively processed
  *
  * @param primitive - The primitive definition containing field information
  * @param value - The partial value provided by the user

package/dist/primitives/shared.mjs

@@ -25,12 +25,12 @@ function isCompatibleOperation(operation, operationDefinitions) {
 	return Object.values(operationDefinitions).some((value) => value.kind === operation.kind);
 }
 /**
-* Applies default values to a partial input, recursively handling nested structs.
+* Applies default values to a partial input, recursively handling nested structs and unions.
 * 
 * Uses a two-layer approach:
 * 1. First, get the struct's initial state (which includes struct-level defaults)
 * 2. Then, layer the provided values on top
-* 3. Finally, ensure nested structs are recursively processed
+* 3. Finally, ensure nested structs and unions are recursively processed
 * 
 * @param primitive - The primitive definition containing field information
 * @param value - The partial value provided by the user
@@ -46,10 +46,34 @@ function applyDefaults(primitive, value) {
 			if (result[key] === void 0) {
 				const fieldDefault = fieldPrimitive._internal.getInitialState();
 				if (fieldDefault !== void 0) result[key] = fieldDefault;
-			} else if (fieldPrimitive._tag === "StructPrimitive" && typeof result[key] === "object" && result[key] !== null) result[key] = applyDefaults(fieldPrimitive, result[key]);
+			} else if (typeof result[key] === "object" && result[key] !== null) {
+				if (fieldPrimitive._tag === "StructPrimitive" || fieldPrimitive._tag === "UnionPrimitive") result[key] = applyDefaults(fieldPrimitive, result[key]);
+			}
 		}
 		return result;
 	}
+	if (primitive._tag === "UnionPrimitive") {
+		const unionPrimitive = primitive;
+		if (typeof value !== "object" || value === null) return value;
+		const discriminator = unionPrimitive._schema.discriminator;
+		const discriminatorValue = value[discriminator];
+		let matchingVariantKey;
+		for (const variantKey in unionPrimitive._schema.variants) {
+			const variant = unionPrimitive._schema.variants[variantKey];
+			if (variant._tag === "StructPrimitive") {
+				const discriminatorField = variant.fields[discriminator];
+				if (discriminatorField && discriminatorField._tag === "LiteralPrimitive") {
+					if (discriminatorField.literal === discriminatorValue) {
+						matchingVariantKey = variantKey;
+						break;
+					}
+				}
+			}
+		}
+		if (!matchingVariantKey) return value;
+		const variantPrimitive = unionPrimitive._schema.variants[matchingVariantKey];
+		return applyDefaults(variantPrimitive, value);
+	}
 	return value;
 }
 

package/dist/primitives/shared.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"shared.mjs","names":["result: Record<string, unknown>"],"sources":["../../src/primitives/shared.ts"],"sourcesContent":["import * as Operation from \"../Operation\";\nimport * as OperationDefinition from \"../OperationDefinition\";\nimport * as ProxyEnvironment from \"../ProxyEnvironment\";\nimport * as OperationPath from \"../OperationPath\";\nimport * as Transform from \"../Transform\";\n\n// =============================================================================\n// Primitive Interface & Type Utilities\n// =============================================================================\n\n/**\n * Base interface that all primitives must implement.\n * Provides type inference helpers and internal operations.\n * \n * @typeParam TState - The state type this primitive holds\n * @typeParam TProxy - The proxy type for interacting with this primitive\n * @typeParam TDefined - Whether the value is guaranteed to be defined (via required() or default())\n * @typeParam THasDefault - Whether this primitive has a default value\n */\nexport interface Primitive<TState, TProxy, TRequired extends boolean = false, THasDefault extends boolean = false, TSetInput = unknown, TUpdateInput = unknown> {\n    readonly _tag: string;\n    readonly _State: TState;\n    readonly _Proxy: TProxy;\n    readonly _TRequired: TRequired;\n    readonly _THasDefault: THasDefault;\n    readonly _internal: PrimitiveInternal<TState, TProxy>;\n    readonly TSetInput: TSetInput;\n    readonly TUpdateInput: TUpdateInput;\n  }\n  \n  /**\n   * Internal operations that each primitive must provide.\n   */\n  export interface PrimitiveInternal<TState, TProxy> {\n    /** Creates a proxy for generating operations */\n    readonly createProxy: (env: ProxyEnvironment.ProxyEnvironment, path: OperationPath.OperationPath) => TProxy;\n    /** Applies an operation to the current state, returning the new state */\n    readonly applyOperation: (state: TState | undefined, operation: Operation.Operation<any, any, any>) => TState;\n    /** Returns the initial/default state for this primitive */\n    readonly getInitialState: () => TState | undefined;\n    /**\n     * Converts a set input value to state format.\n     * For most primitives, this is a simple pass-through with defaults applied.\n     * For Tree primitives, this converts nested input to flat TreeState.\n     *\n     * @param input - The set input value\n     * @returns The corresponding state value\n     */\n    readonly convertSetInputToState?: (input: unknown) => TState;\n    /**\n     * Transforms a client operation against a server operation.\n     * Used for operational transformation (OT) conflict resolution.\n     *\n     * @param clientOp - The client's operation to transform\n     * @param serverOp - The server's operation that has already been applied\n     * @returns TransformResult indicating how the client operation should be handled\n     */\n    readonly transformOperation: (\n      clientOp: Operation.Operation<any, any, any>,\n      serverOp: Operation.Operation<any, any, any>\n    ) => Transform.TransformResult;\n  }\n  \n  /**\n   * Any primitive type - used for generic constraints.\n   */\n  export type AnyPrimitive = Primitive<any, any, any, any>;\n  \n  /**\n   * Infer the state type from a primitive.\n   */\n  export type InferState<T> = T extends Primitive<infer S, any, any, any> ? S : never;\n  \n  /**\n   * Infer the proxy type from a primitive.\n   */\n  export type InferProxy<T> = T extends Primitive<any, infer P, any, any> ? P : never;\n\n  /**\n   * Infer the SetInput type from a primitive.\n   * Works with both Primitive interface types and types with a TSetInput property (like TreeNodePrimitive).\n   */\n  export type InferSetInput<T> = \n    T extends Primitive<any, any, any, any, infer S, any> ? S : \n    T extends { TSetInput: infer S } ? S : \n    never;\n\n  /**\n   * Infer the UpdateInput type from a primitive.\n   * Works with both Primitive interface types and types with a TUpdateInput property (like TreeNodePrimitive).\n   */\n  export type InferUpdateInput<T> = \n    T extends Primitive<any, any, any, any, any, infer U> ? U : \n    T extends { TUpdateInput: infer U } ? U : \n    never;\n  \n  /**\n   * Helper type to conditionally add undefined based on TRequired and THasDefault.\n   * When TRequired is false and THasDefault is false, the value may be undefined.\n   * Otherwise, the value is guaranteed to be defined.\n   */\n  export type MaybeUndefined<T, TRequired extends boolean, THasDefault extends boolean> = TRequired extends false ? THasDefault extends false ? Optional<T> : T : T;\n\n  export type Optional<T> = T | undefined;\n\n  /**\n   * Helper type to conditionally add undefined based on TRequired and THasDefault.\n   * When TRequired is true and THasDefault is false, the value must be provided.\n   * Otherwise, the value may be undefined.\n   */\n  export type NeedsValue<T, TRequired extends boolean, THasDefault extends boolean> = TRequired extends true ? THasDefault extends false ? T : Optional<T> : Optional<T>;\n  \n  /**\n   * Infer the snapshot type from a primitive.\n   * The snapshot is a readonly, type-safe structure suitable for rendering.\n   */\n  export type InferSnapshot<T> = T extends Primitive<any, infer P, any, any>\n    ? P extends { toSnapshot(): infer S } ? S : never\n    : never;\n\n  /**\n   * Extract THasDefault from a primitive.\n   */\n  export type HasDefault<T> = T extends Primitive<any, any, any, infer H> ? H : false;\n\n  /**\n   * Extract TDefined from a primitive.\n   */\n  export type IsDefined<T> = T extends Primitive<any, any, infer D, any> ? D : false;\n\n  /**\n   * Infer whether a primitive is required.\n   * Alias for IsDefined for clarity.\n   */\n  export type IsRequired<T> = IsDefined<T>;\n\n\n  // =============================================================================\n  // Validation Errors\n  // =============================================================================\n  \n  export class ValidationError extends Error {\n    readonly _tag = \"ValidationError\";\n    constructor(message: string) {\n      super(message);\n      this.name = \"ValidationError\";\n    }\n  }\n  \n  // =============================================================================\n  // Validation Infrastructure\n  // =============================================================================\n  \n  /**\n   * A validator that checks a value and returns whether it's valid.\n   */\n  export interface Validator<T> {\n    readonly validate: (value: T) => boolean;\n    readonly message: string;\n  }\n  \n\n/**\n * Runs all validators against a value, throwing ValidationError if any fail.\n */\nexport function runValidators<T>(value: T, validators: readonly { validate: (value: T) => boolean; message: string }[]): void {\n  for (const validator of validators) {\n    if (!validator.validate(value)) {\n      throw new ValidationError(validator.message);\n    }\n  }\n}\n\n/**\n * Checks if an operation is compatible with the given operation definitions.\n * @param operation - The operation to check.\n * @param operationDefinitions - The operation definitions to check against.\n * @returns True if the operation is compatible, false otherwise.\n */\nexport function isCompatibleOperation(operation: Operation.Operation<any, any, any>, operationDefinitions: Record<string, OperationDefinition.OperationDefinition<any, any, any>>) {\n  const values = Object.values(operationDefinitions);\n  return values.some(value => value.kind === operation.kind);\n}\n\n// =============================================================================\n// Default Value Utilities\n// =============================================================================\n\n/**\n * Applies default values to a partial input, recursively handling nested structs.\n * \n * Uses a two-layer approach:\n * 1. First, get the struct's initial state (which includes struct-level defaults)\n * 2. Then, layer the provided values on top\n * 3. Finally, ensure nested structs are recursively processed\n * \n * @param primitive - The primitive definition containing field information\n * @param value - The partial value provided by the user\n * @returns The value with defaults applied for missing fields\n */\nexport function applyDefaults<T extends AnyPrimitive>(\n  primitive: T,\n  value: Partial<InferState<T>>\n): InferState<T> {\n  // Only structs need default merging\n  if (primitive._tag === \"StructPrimitive\") {\n    const structPrimitive = primitive as unknown as { \n      fields: Record<string, AnyPrimitive>;\n      _internal: { getInitialState: () => Record<string, unknown> | undefined };\n    };\n    \n    // Start with the struct's initial state (struct-level default or field defaults)\n    const structInitialState = structPrimitive._internal.getInitialState() ?? {};\n    \n    // Layer the provided values on top of initial state\n    const result: Record<string, unknown> = { ...structInitialState, ...value };\n    \n    for (const key in structPrimitive.fields) {\n      const fieldPrimitive = structPrimitive.fields[key]!;\n      \n      if (result[key] === undefined) {\n        // Field still not provided after merging - try individual field default\n        const fieldDefault = fieldPrimitive._internal.getInitialState();\n        if (fieldDefault !== undefined) {\n          result[key] = fieldDefault;\n        }\n      } else if (fieldPrimitive._tag === \"StructPrimitive\" && typeof result[key] === \"object\" && result[key] !== null) {\n        // Recursively apply defaults to nested structs\n        result[key] = applyDefaults(fieldPrimitive, result[key] as Partial<InferState<typeof fieldPrimitive>>);\n      }\n    }\n    \n    return result as InferState<T>;\n  }\n  \n  // For non-struct primitives, return the value as-is\n  return value as InferState<T>;\n}\n\n"],"mappings":";;;;AA6IE,IAAa,kBAAb,cAAqC,MAAM;CAEzC,YAAY,SAAiB;AAC3B,QAAM,QAAQ;wBAFP,QAAO;AAGd,OAAK,OAAO;;;;;;AAoBlB,SAAgB,cAAiB,OAAU,YAAmF;AAC5H,MAAK,MAAM,aAAa,WACtB,KAAI,CAAC,UAAU,SAAS,MAAM,CAC5B,OAAM,IAAI,gBAAgB,UAAU,QAAQ;;;;;;;;AAWlD,SAAgB,sBAAsB,WAA+C,sBAA8F;AAEjL,QADe,OAAO,OAAO,qBAAqB,CACpC,MAAK,UAAS,MAAM,SAAS,UAAU,KAAK;;;;;;;;;;;;;;AAmB5D,SAAgB,cACd,WACA,OACe;AAEf,KAAI,UAAU,SAAS,mBAAmB;;EACxC,MAAM,kBAAkB;EASxB,MAAMA,oEAHqB,gBAAgB,UAAU,iBAAiB,yEAAI,EAAE,GAGR;AAEpE,OAAK,MAAM,OAAO,gBAAgB,QAAQ;GACxC,MAAM,iBAAiB,gBAAgB,OAAO;AAE9C,OAAI,OAAO,SAAS,QAAW;IAE7B,MAAM,eAAe,eAAe,UAAU,iBAAiB;AAC/D,QAAI,iBAAiB,OACnB,QAAO,OAAO;cAEP,eAAe,SAAS,qBAAqB,OAAO,OAAO,SAAS,YAAY,OAAO,SAAS,KAEzG,QAAO,OAAO,cAAc,gBAAgB,OAAO,KAAmD;;AAI1G,SAAO;;AAIT,QAAO"}
+{"version":3,"file":"shared.mjs","names":["result: Record<string, unknown>","matchingVariantKey: string | undefined"],"sources":["../../src/primitives/shared.ts"],"sourcesContent":["import * as Operation from \"../Operation\";\nimport * as OperationDefinition from \"../OperationDefinition\";\nimport * as ProxyEnvironment from \"../ProxyEnvironment\";\nimport * as OperationPath from \"../OperationPath\";\nimport * as Transform from \"../Transform\";\n\n// =============================================================================\n// Primitive Interface & Type Utilities\n// =============================================================================\n\n/**\n * Base interface that all primitives must implement.\n * Provides type inference helpers and internal operations.\n * \n * @typeParam TState - The state type this primitive holds\n * @typeParam TProxy - The proxy type for interacting with this primitive\n * @typeParam TDefined - Whether the value is guaranteed to be defined (via required() or default())\n * @typeParam THasDefault - Whether this primitive has a default value\n */\nexport interface Primitive<TState, TProxy, TRequired extends boolean = false, THasDefault extends boolean = false, TSetInput = unknown, TUpdateInput = unknown> {\n    readonly _tag: string;\n    readonly _State: TState;\n    readonly _Proxy: TProxy;\n    readonly _TRequired: TRequired;\n    readonly _THasDefault: THasDefault;\n    readonly _internal: PrimitiveInternal<TState, TProxy>;\n    readonly TSetInput: TSetInput;\n    readonly TUpdateInput: TUpdateInput;\n  }\n  \n  /**\n   * Internal operations that each primitive must provide.\n   */\n  export interface PrimitiveInternal<TState, TProxy> {\n    /** Creates a proxy for generating operations */\n    readonly createProxy: (env: ProxyEnvironment.ProxyEnvironment, path: OperationPath.OperationPath) => TProxy;\n    /** Applies an operation to the current state, returning the new state */\n    readonly applyOperation: (state: TState | undefined, operation: Operation.Operation<any, any, any>) => TState;\n    /** Returns the initial/default state for this primitive */\n    readonly getInitialState: () => TState | undefined;\n    /**\n     * Converts a set input value to state format.\n     * For most primitives, this is a simple pass-through with defaults applied.\n     * For Tree primitives, this converts nested input to flat TreeState.\n     *\n     * @param input - The set input value\n     * @returns The corresponding state value\n     */\n    readonly convertSetInputToState?: (input: unknown) => TState;\n    /**\n     * Transforms a client operation against a server operation.\n     * Used for operational transformation (OT) conflict resolution.\n     *\n     * @param clientOp - The client's operation to transform\n     * @param serverOp - The server's operation that has already been applied\n     * @returns TransformResult indicating how the client operation should be handled\n     */\n    readonly transformOperation: (\n      clientOp: Operation.Operation<any, any, any>,\n      serverOp: Operation.Operation<any, any, any>\n    ) => Transform.TransformResult;\n  }\n  \n  /**\n   * Any primitive type - used for generic constraints.\n   */\n  export type AnyPrimitive = Primitive<any, any, any, any>;\n  \n  /**\n   * Infer the state type from a primitive.\n   */\n  export type InferState<T> = T extends Primitive<infer S, any, any, any> ? S : never;\n  \n  /**\n   * Infer the proxy type from a primitive.\n   */\n  export type InferProxy<T> = T extends Primitive<any, infer P, any, any> ? P : never;\n\n  /**\n   * Infer the SetInput type from a primitive.\n   * Works with both Primitive interface types and types with a TSetInput property (like TreeNodePrimitive).\n   */\n  export type InferSetInput<T> = \n    T extends Primitive<any, any, any, any, infer S, any> ? S : \n    T extends { TSetInput: infer S } ? S : \n    never;\n\n  /**\n   * Infer the UpdateInput type from a primitive.\n   * Works with both Primitive interface types and types with a TUpdateInput property (like TreeNodePrimitive).\n   */\n  export type InferUpdateInput<T> = \n    T extends Primitive<any, any, any, any, any, infer U> ? U : \n    T extends { TUpdateInput: infer U } ? U : \n    never;\n  \n  /**\n   * Helper type to conditionally add undefined based on TRequired and THasDefault.\n   * When TRequired is false and THasDefault is false, the value may be undefined.\n   * Otherwise, the value is guaranteed to be defined.\n   */\n  export type MaybeUndefined<T, TRequired extends boolean, THasDefault extends boolean> = TRequired extends false ? THasDefault extends false ? Optional<T> : T : T;\n\n  export type Optional<T> = T | undefined;\n\n  /**\n   * Helper type to conditionally add undefined based on TRequired and THasDefault.\n   * When TRequired is true and THasDefault is false, the value must be provided.\n   * Otherwise, the value may be undefined.\n   */\n  export type NeedsValue<T, TRequired extends boolean, THasDefault extends boolean> = TRequired extends true ? THasDefault extends false ? T : Optional<T> : Optional<T>;\n  \n  /**\n   * Infer the snapshot type from a primitive.\n   * The snapshot is a readonly, type-safe structure suitable for rendering.\n   */\n  export type InferSnapshot<T> = T extends Primitive<any, infer P, any, any>\n    ? P extends { toSnapshot(): infer S } ? S : never\n    : never;\n\n  /**\n   * Extract THasDefault from a primitive.\n   */\n  export type HasDefault<T> = T extends Primitive<any, any, any, infer H> ? H : false;\n\n  /**\n   * Extract TDefined from a primitive.\n   */\n  export type IsDefined<T> = T extends Primitive<any, any, infer D, any> ? D : false;\n\n  /**\n   * Infer whether a primitive is required.\n   * Alias for IsDefined for clarity.\n   */\n  export type IsRequired<T> = IsDefined<T>;\n\n\n  // =============================================================================\n  // Validation Errors\n  // =============================================================================\n  \n  export class ValidationError extends Error {\n    readonly _tag = \"ValidationError\";\n    constructor(message: string) {\n      super(message);\n      this.name = \"ValidationError\";\n    }\n  }\n  \n  // =============================================================================\n  // Validation Infrastructure\n  // =============================================================================\n  \n  /**\n   * A validator that checks a value and returns whether it's valid.\n   */\n  export interface Validator<T> {\n    readonly validate: (value: T) => boolean;\n    readonly message: string;\n  }\n  \n\n/**\n * Runs all validators against a value, throwing ValidationError if any fail.\n */\nexport function runValidators<T>(value: T, validators: readonly { validate: (value: T) => boolean; message: string }[]): void {\n  for (const validator of validators) {\n    if (!validator.validate(value)) {\n      throw new ValidationError(validator.message);\n    }\n  }\n}\n\n/**\n * Checks if an operation is compatible with the given operation definitions.\n * @param operation - The operation to check.\n * @param operationDefinitions - The operation definitions to check against.\n * @returns True if the operation is compatible, false otherwise.\n */\nexport function isCompatibleOperation(operation: Operation.Operation<any, any, any>, operationDefinitions: Record<string, OperationDefinition.OperationDefinition<any, any, any>>) {\n  const values = Object.values(operationDefinitions);\n  return values.some(value => value.kind === operation.kind);\n}\n\n// =============================================================================\n// Default Value Utilities\n// =============================================================================\n\n/**\n * Applies default values to a partial input, recursively handling nested structs and unions.\n * \n * Uses a two-layer approach:\n * 1. First, get the struct's initial state (which includes struct-level defaults)\n * 2. Then, layer the provided values on top\n * 3. Finally, ensure nested structs and unions are recursively processed\n * \n * @param primitive - The primitive definition containing field information\n * @param value - The partial value provided by the user\n * @returns The value with defaults applied for missing fields\n */\nexport function applyDefaults<T extends AnyPrimitive>(\n  primitive: T,\n  value: Partial<InferState<T>>\n): InferState<T> {\n  // Handle StructPrimitive\n  if (primitive._tag === \"StructPrimitive\") {\n    const structPrimitive = primitive as unknown as { \n      fields: Record<string, AnyPrimitive>;\n      _internal: { getInitialState: () => Record<string, unknown> | undefined };\n    };\n    \n    // Start with the struct's initial state (struct-level default or field defaults)\n    const structInitialState = structPrimitive._internal.getInitialState() ?? {};\n    \n    // Layer the provided values on top of initial state\n    const result: Record<string, unknown> = { ...structInitialState, ...value };\n    \n    for (const key in structPrimitive.fields) {\n      const fieldPrimitive = structPrimitive.fields[key]!;\n      \n      if (result[key] === undefined) {\n        // Field still not provided after merging - try individual field default\n        const fieldDefault = fieldPrimitive._internal.getInitialState();\n        if (fieldDefault !== undefined) {\n          result[key] = fieldDefault;\n        }\n      } else if (typeof result[key] === \"object\" && result[key] !== null) {\n        // Recursively apply defaults to nested structs and unions\n        if (fieldPrimitive._tag === \"StructPrimitive\" || fieldPrimitive._tag === \"UnionPrimitive\") {\n          result[key] = applyDefaults(fieldPrimitive, result[key] as Partial<InferState<typeof fieldPrimitive>>);\n        }\n      }\n    }\n    \n    return result as InferState<T>;\n  }\n  \n  // Handle UnionPrimitive\n  if (primitive._tag === \"UnionPrimitive\") {\n    const unionPrimitive = primitive as unknown as {\n      _schema: {\n        discriminator: string;\n        variants: Record<string, AnyPrimitive>;\n      };\n    };\n    \n    // Validate that value is an object\n    if (typeof value !== \"object\" || value === null) {\n      return value as InferState<T>;\n    }\n    \n    const discriminator = unionPrimitive._schema.discriminator;\n    const discriminatorValue = (value as Record<string, unknown>)[discriminator];\n    \n    // Find the matching variant based on discriminator value\n    let matchingVariantKey: string | undefined;\n    for (const variantKey in unionPrimitive._schema.variants) {\n      const variant = unionPrimitive._schema.variants[variantKey]!;\n      // Variants are structs - check if the discriminator field's literal matches\n      if (variant._tag === \"StructPrimitive\") {\n        const variantStruct = variant as unknown as {\n          fields: Record<string, AnyPrimitive>;\n        };\n        const discriminatorField = variantStruct.fields[discriminator];\n        if (discriminatorField && discriminatorField._tag === \"LiteralPrimitive\") {\n          const literalPrimitive = discriminatorField as unknown as { literal: unknown };\n          if (literalPrimitive.literal === discriminatorValue) {\n            matchingVariantKey = variantKey;\n            break;\n          }\n        }\n      }\n    }\n    \n    if (!matchingVariantKey) {\n      // No matching variant found - return value as-is\n      return value as InferState<T>;\n    }\n    \n    // Apply defaults using the matching variant's struct\n    const variantPrimitive = unionPrimitive._schema.variants[matchingVariantKey]!;\n    return applyDefaults(variantPrimitive, value as Partial<InferState<typeof variantPrimitive>>) as InferState<T>;\n  }\n  \n  // For other primitives, return the value as-is\n  return value as InferState<T>;\n}\n\n"],"mappings":";;;;AA6IE,IAAa,kBAAb,cAAqC,MAAM;CAEzC,YAAY,SAAiB;AAC3B,QAAM,QAAQ;wBAFP,QAAO;AAGd,OAAK,OAAO;;;;;;AAoBlB,SAAgB,cAAiB,OAAU,YAAmF;AAC5H,MAAK,MAAM,aAAa,WACtB,KAAI,CAAC,UAAU,SAAS,MAAM,CAC5B,OAAM,IAAI,gBAAgB,UAAU,QAAQ;;;;;;;;AAWlD,SAAgB,sBAAsB,WAA+C,sBAA8F;AAEjL,QADe,OAAO,OAAO,qBAAqB,CACpC,MAAK,UAAS,MAAM,SAAS,UAAU,KAAK;;;;;;;;;;;;;;AAmB5D,SAAgB,cACd,WACA,OACe;AAEf,KAAI,UAAU,SAAS,mBAAmB;;EACxC,MAAM,kBAAkB;EASxB,MAAMA,oEAHqB,gBAAgB,UAAU,iBAAiB,yEAAI,EAAE,GAGR;AAEpE,OAAK,MAAM,OAAO,gBAAgB,QAAQ;GACxC,MAAM,iBAAiB,gBAAgB,OAAO;AAE9C,OAAI,OAAO,SAAS,QAAW;IAE7B,MAAM,eAAe,eAAe,UAAU,iBAAiB;AAC/D,QAAI,iBAAiB,OACnB,QAAO,OAAO;cAEP,OAAO,OAAO,SAAS,YAAY,OAAO,SAAS,MAE5D;QAAI,eAAe,SAAS,qBAAqB,eAAe,SAAS,iBACvE,QAAO,OAAO,cAAc,gBAAgB,OAAO,KAAmD;;;AAK5G,SAAO;;AAIT,KAAI,UAAU,SAAS,kBAAkB;EACvC,MAAM,iBAAiB;AAQvB,MAAI,OAAO,UAAU,YAAY,UAAU,KACzC,QAAO;EAGT,MAAM,gBAAgB,eAAe,QAAQ;EAC7C,MAAM,qBAAsB,MAAkC;EAG9D,IAAIC;AACJ,OAAK,MAAM,cAAc,eAAe,QAAQ,UAAU;GACxD,MAAM,UAAU,eAAe,QAAQ,SAAS;AAEhD,OAAI,QAAQ,SAAS,mBAAmB;IAItC,MAAM,qBAHgB,QAGmB,OAAO;AAChD,QAAI,sBAAsB,mBAAmB,SAAS,oBAEpD;SADyB,mBACJ,YAAY,oBAAoB;AACnD,2BAAqB;AACrB;;;;;AAMR,MAAI,CAAC,mBAEH,QAAO;EAIT,MAAM,mBAAmB,eAAe,QAAQ,SAAS;AACzD,SAAO,cAAc,kBAAkB,MAAsD;;AAI/F,QAAO"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@voidhash/mimic",
-  "version": "0.0.6",
+  "version": "0.0.7",
   "type": "module",
   "repository": {
     "type": "git",
@@ -31,7 +31,7 @@
     "typescript": "5.8.3",
     "vite-tsconfig-paths": "^5.1.4",
     "vitest": "^3.2.4",
-    "@voidhash/tsconfig": "0.0.6"
+    "@voidhash/tsconfig": "0.0.7"
   },
   "peerDependencies": {
     "effect": "^3.19.12"

package/src/primitives/shared.ts

@@ -187,12 +187,12 @@ export function isCompatibleOperation(operation: Operation.Operation<any, any, a
 // =============================================================================
 
 /**
- * Applies default values to a partial input, recursively handling nested structs.
+ * Applies default values to a partial input, recursively handling nested structs and unions.
  * 
  * Uses a two-layer approach:
  * 1. First, get the struct's initial state (which includes struct-level defaults)
  * 2. Then, layer the provided values on top
- * 3. Finally, ensure nested structs are recursively processed
+ * 3. Finally, ensure nested structs and unions are recursively processed
  * 
  * @param primitive - The primitive definition containing field information
  * @param value - The partial value provided by the user
@@ -202,7 +202,7 @@ export function applyDefaults<T extends AnyPrimitive>(
   primitive: T,
   value: Partial<InferState<T>>
 ): InferState<T> {
-  // Only structs need default merging
+  // Handle StructPrimitive
   if (primitive._tag === "StructPrimitive") {
     const structPrimitive = primitive as unknown as { 
       fields: Record<string, AnyPrimitive>;
@@ -224,16 +224,65 @@ export function applyDefaults<T extends AnyPrimitive>(
         if (fieldDefault !== undefined) {
           result[key] = fieldDefault;
         }
-      } else if (fieldPrimitive._tag === "StructPrimitive" && typeof result[key] === "object" && result[key] !== null) {
-        // Recursively apply defaults to nested structs
-        result[key] = applyDefaults(fieldPrimitive, result[key] as Partial<InferState<typeof fieldPrimitive>>);
+      } else if (typeof result[key] === "object" && result[key] !== null) {
+        // Recursively apply defaults to nested structs and unions
+        if (fieldPrimitive._tag === "StructPrimitive" || fieldPrimitive._tag === "UnionPrimitive") {
+          result[key] = applyDefaults(fieldPrimitive, result[key] as Partial<InferState<typeof fieldPrimitive>>);
+        }
       }
     }
     
     return result as InferState<T>;
   }
   
-  // For non-struct primitives, return the value as-is
+  // Handle UnionPrimitive
+  if (primitive._tag === "UnionPrimitive") {
+    const unionPrimitive = primitive as unknown as {
+      _schema: {
+        discriminator: string;
+        variants: Record<string, AnyPrimitive>;
+      };
+    };
+    
+    // Validate that value is an object
+    if (typeof value !== "object" || value === null) {
+      return value as InferState<T>;
+    }
+    
+    const discriminator = unionPrimitive._schema.discriminator;
+    const discriminatorValue = (value as Record<string, unknown>)[discriminator];
+    
+    // Find the matching variant based on discriminator value
+    let matchingVariantKey: string | undefined;
+    for (const variantKey in unionPrimitive._schema.variants) {
+      const variant = unionPrimitive._schema.variants[variantKey]!;
+      // Variants are structs - check if the discriminator field's literal matches
+      if (variant._tag === "StructPrimitive") {
+        const variantStruct = variant as unknown as {
+          fields: Record<string, AnyPrimitive>;
+        };
+        const discriminatorField = variantStruct.fields[discriminator];
+        if (discriminatorField && discriminatorField._tag === "LiteralPrimitive") {
+          const literalPrimitive = discriminatorField as unknown as { literal: unknown };
+          if (literalPrimitive.literal === discriminatorValue) {
+            matchingVariantKey = variantKey;
+            break;
+          }
+        }
+      }
+    }
+    
+    if (!matchingVariantKey) {
+      // No matching variant found - return value as-is
+      return value as InferState<T>;
+    }
+    
+    // Apply defaults using the matching variant's struct
+    const variantPrimitive = unionPrimitive._schema.variants[matchingVariantKey]!;
+    return applyDefaults(variantPrimitive, value as Partial<InferState<typeof variantPrimitive>>) as InferState<T>;
+  }
+  
+  // For other primitives, return the value as-is
   return value as InferState<T>;
 }
 

package/tests/primitives/Union.test.ts

@@ -155,6 +155,95 @@ describe("UnionPrimitive", () => {
         content: "default",
       });
     });
+
+    it("return correct defaults for nested structs when global default is set", () => {
+      const stringVariableTypeSchema = Primitive.Struct({
+        key: Primitive.Literal("string"),
+        value: Primitive.String(),
+      });
+      
+      const numberVariableTypeSchema = Primitive.Struct({
+        key: Primitive.Literal("number"),
+        value: Primitive.Number(),
+      });
+
+
+      const variableTypeSchema = Primitive.Union({
+        discriminator: "key",
+        variants: {
+          string: stringVariableTypeSchema,
+          number: numberVariableTypeSchema,
+        },
+      }).default({
+        key: "string",
+        value: "",
+      });
+      
+      expect(variableTypeSchema._internal.getInitialState()).toEqual({
+        key: "string",
+        value: "",
+      });
+    });
+
+    it("return correct defaults for nested structs when variant default is set", () => {
+      const stringVariableTypeSchema = Primitive.Struct({
+        key: Primitive.Literal("string"),
+        value: Primitive.String().default(""),
+      });
+      
+      const numberVariableTypeSchema = Primitive.Struct({
+        key: Primitive.Literal("number"),
+        value: Primitive.Number().default(10),
+      });
+
+
+      const variableTypeSchema = Primitive.Union({
+        discriminator: "key",
+        variants: {
+          string: stringVariableTypeSchema,
+          number: numberVariableTypeSchema,
+        },
+      }).default({
+        key: "number",
+      });
+      
+      expect(variableTypeSchema._internal.getInitialState()).toEqual({
+        key: "number",
+        value: 10,
+      });
+    });
+
+    it("set() applies defaults to generated operation payload", () => {
+      const stringVariableTypeSchema = Primitive.Struct({
+        key: Primitive.Literal("string"),
+        value: Primitive.String().default(""),
+      });
+      
+      const numberVariableTypeSchema = Primitive.Struct({
+        key: Primitive.Literal("number"),
+        value: Primitive.Number().default(10),
+      });
+
+
+      const variableTypeSchema = Primitive.Union({
+        discriminator: "key",
+        variants: {
+          string: stringVariableTypeSchema,
+          number: numberVariableTypeSchema,
+        },
+      });
+
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const proxy = variableTypeSchema._internal.createProxy(ProxyEnvironment.make((op) => operations.push(op)), OperationPath.make(""));
+      proxy.set({ key: "number" });
+      
+      expect(operations).toHaveLength(1);
+      expect(operations[0]!.kind).toBe("union.set");
+      expect(operations[0]!.payload).toEqual({
+        key: "number",
+        value: 10,
+      });
+    });
   });
 
   describe("custom discriminator", () => {
@@ -208,3 +297,258 @@ describe("UnionPrimitive", () => {
 // =============================================================================
 // Integration Tests - Complex Nested Structures
 // =============================================================================
+
+describe("Union defaults in nested structures", () => {
+  // Schema matching the production use case
+  const stringVariableTypeSchema = Primitive.Struct({
+    key: Primitive.Literal("string"),
+    value: Primitive.String().default(""),
+  });
+
+  const numberVariableTypeSchema = Primitive.Struct({
+    key: Primitive.Literal("number"),
+    value: Primitive.Number().default(0),
+  });
+
+  const booleanVariableTypeSchema = Primitive.Struct({
+    key: Primitive.Literal("boolean"),
+    value: Primitive.Boolean().default(false),
+  });
+
+  const productVariableTypeSchema = Primitive.Struct({
+    key: Primitive.Literal("product"),
+    value: Primitive.Struct({
+      productId: Primitive.Either(
+        Primitive.String(),
+        Primitive.Literal(null),
+      ),
+    }).default({
+      productId: null,
+    }),
+  });
+
+  const variableTypeSchema = Primitive.Union({
+    discriminator: "key",
+    variants: {
+      string: stringVariableTypeSchema,
+      number: numberVariableTypeSchema,
+      boolean: booleanVariableTypeSchema,
+      product: productVariableTypeSchema,
+    },
+  });
+
+  const variableSchema = Primitive.Struct({
+    id: Primitive.String(),
+    name: Primitive.String(),
+    value: variableTypeSchema,
+  });
+
+  describe("Struct.set() with nested Union", () => {
+    it("applies Union variant defaults when setting partial Union value", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variableSchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.set({
+        id: "var-1",
+        name: "test",
+        value: { key: "number" },
+      });
+
+      expect(operations).toHaveLength(1);
+      expect(operations[0]!.kind).toBe("struct.set");
+      expect(operations[0]!.payload).toEqual({
+        id: "var-1",
+        name: "test",
+        value: {
+          key: "number",
+          value: 0,
+        },
+      });
+    });
+
+    it("applies Union variant defaults for string type", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variableSchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.set({
+        id: "var-1",
+        name: "test",
+        value: { key: "string" },
+      });
+
+      expect(operations[0]!.payload).toEqual({
+        id: "var-1",
+        name: "test",
+        value: {
+          key: "string",
+          value: "",
+        },
+      });
+    });
+
+    it("applies Union variant defaults for boolean type", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variableSchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.set({
+        id: "var-1",
+        name: "test",
+        value: { key: "boolean" },
+      });
+
+      expect(operations[0]!.payload).toEqual({
+        id: "var-1",
+        name: "test",
+        value: {
+          key: "boolean",
+          value: false,
+        },
+      });
+    });
+
+    it("applies Union variant defaults for nested struct (product type)", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variableSchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.set({
+        id: "var-1",
+        name: "test",
+        value: { key: "product" },
+      });
+
+      expect(operations[0]!.payload).toEqual({
+        id: "var-1",
+        name: "test",
+        value: {
+          key: "product",
+          value: {
+            productId: null,
+          },
+        },
+      });
+    });
+
+    it("preserves explicitly provided Union values", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variableSchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.set({
+        id: "var-1",
+        name: "test",
+        value: { key: "number", value: 42 },
+      });
+
+      expect(operations[0]!.payload).toEqual({
+        id: "var-1",
+        name: "test",
+        value: {
+          key: "number",
+          value: 42,
+        },
+      });
+    });
+  });
+
+  describe("Array.push() with Struct containing Union", () => {
+    const variablesArraySchema = Primitive.Array(variableSchema);
+
+    it("applies Union variant defaults when pushing with partial Union value", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variablesArraySchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.push({
+        id: "var-1",
+        name: "test",
+        value: { key: "number" },
+      });
+
+      expect(operations).toHaveLength(1);
+      expect(operations[0]!.kind).toBe("array.insert");
+      expect(operations[0]!.payload.value).toEqual({
+        id: "var-1",
+        name: "test",
+        value: {
+          key: "number",
+          value: 0,
+        },
+      });
+    });
+
+    it("applies Union variant defaults for all variant types", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variablesArraySchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.push({ id: "var-1", name: "str", value: { key: "string" } });
+      proxy.push({ id: "var-2", name: "num", value: { key: "number" } });
+      proxy.push({ id: "var-3", name: "bool", value: { key: "boolean" } });
+      proxy.push({ id: "var-4", name: "prod", value: { key: "product" } });
+
+      expect(operations[0]!.payload.value.value).toEqual({ key: "string", value: "" });
+      expect(operations[1]!.payload.value.value).toEqual({ key: "number", value: 0 });
+      expect(operations[2]!.payload.value.value).toEqual({ key: "boolean", value: false });
+      expect(operations[3]!.payload.value.value).toEqual({ key: "product", value: { productId: null } });
+    });
+  });
+
+  describe("Array.set() with Struct containing Union", () => {
+    const variablesArraySchema = Primitive.Array(variableSchema);
+
+    it("applies Union variant defaults when setting array with partial Union values", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variablesArraySchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.set([
+        { id: "var-1", name: "str", value: { key: "string" } },
+        { id: "var-2", name: "num", value: { key: "number" } },
+      ]);
+
+      expect(operations).toHaveLength(1);
+      expect(operations[0]!.kind).toBe("array.set");
+      expect(operations[0]!.payload[0].value).toEqual({
+        id: "var-1",
+        name: "str",
+        value: { key: "string", value: "" },
+      });
+      expect(operations[0]!.payload[1].value).toEqual({
+        id: "var-2",
+        name: "num",
+        value: { key: "number", value: 0 },
+      });
+    });
+  });
+
+  describe("Array.insertAt() with Struct containing Union", () => {
+    const variablesArraySchema = Primitive.Array(variableSchema);
+
+    it("applies Union variant defaults when inserting with partial Union value", () => {
+      const operations: Operation.Operation<any, any, any>[] = [];
+      const env = ProxyEnvironment.make((op) => operations.push(op));
+      const proxy = variablesArraySchema._internal.createProxy(env, OperationPath.make(""));
+
+      proxy.insertAt(0, {
+        id: "var-1",
+        name: "test",
+        value: { key: "boolean" },
+      });
+
+      expect(operations).toHaveLength(1);
+      expect(operations[0]!.kind).toBe("array.insert");
+      expect(operations[0]!.payload.value).toEqual({
+        id: "var-1",
+        name: "test",
+        value: {
+          key: "boolean",
+          value: false,
+        },
+      });
+    });
+  });
+});