@inixiative/json-rules 2.19.2 → 2.19.3

package/dist/index.d.cts

@@ -369,16 +369,12 @@ type StrictIfThenElse<TRuleValue = RuleValue, TDateValue = DateRuleValue> = {
 };
 type StrictCondition<TRuleValue = RuleValue, TDateValue = DateRuleValue> = StrictRule<TRuleValue> | StrictAggregateRule<TRuleValue, TDateValue> | StrictArrayRule<TRuleValue, TDateValue> | StrictDateRule | StrictAll<TRuleValue, TDateValue> | StrictAny<TRuleValue, TDateValue> | StrictIfThenElse<TRuleValue, TDateValue> | boolean;
 
-/**
- * Names of every `{ bind }` token reachable in a condition tree. The flat-set
- * shorthand a caller validates a bindings map against (`keys(bindings) ⊇ requiredBindings`).
- */
+/** Names of every `{ bind }` token in the tree — the set a bindings map must cover. */
 declare const requiredBindings: (condition: Condition) => Set<string>;
 /**
- * Replace each `{ bind }` token the map covers with its `{ value }`, leaving uncovered
- * tokens in place (partial / progressive resolution — `requiredBindings` shrinks). A node
- * may carry both its own value-bind and a nested condition (aggregate/array), so both are
- * handled. Does not mutate the input.
+ * Substitute covered binds with their values; uncovered tokens stay in place (partial
+ * resolution). A supplied-but-undefined binding becomes null to stay serializable.
+ * Non-mutating.
  */
 declare const resolveBindings: (condition: Condition, bindings: Record<string, RuleValue>) => Condition;
 

package/dist/index.d.ts

@@ -369,16 +369,12 @@ type StrictIfThenElse<TRuleValue = RuleValue, TDateValue = DateRuleValue> = {
 };
 type StrictCondition<TRuleValue = RuleValue, TDateValue = DateRuleValue> = StrictRule<TRuleValue> | StrictAggregateRule<TRuleValue, TDateValue> | StrictArrayRule<TRuleValue, TDateValue> | StrictDateRule | StrictAll<TRuleValue, TDateValue> | StrictAny<TRuleValue, TDateValue> | StrictIfThenElse<TRuleValue, TDateValue> | boolean;
 
-/**
- * Names of every `{ bind }` token reachable in a condition tree. The flat-set
- * shorthand a caller validates a bindings map against (`keys(bindings) ⊇ requiredBindings`).
- */
+/** Names of every `{ bind }` token in the tree — the set a bindings map must cover. */
 declare const requiredBindings: (condition: Condition) => Set<string>;
 /**
- * Replace each `{ bind }` token the map covers with its `{ value }`, leaving uncovered
- * tokens in place (partial / progressive resolution — `requiredBindings` shrinks). A node
- * may carry both its own value-bind and a nested condition (aggregate/array), so both are
- * handled. Does not mutate the input.
+ * Substitute covered binds with their values; uncovered tokens stay in place (partial
+ * resolution). A supplied-but-undefined binding becomes null to stay serializable.
+ * Non-mutating.
  */
 declare const resolveBindings: (condition: Condition, bindings: Record<string, RuleValue>) => Condition;