effect 4.0.5 → 4.0.7

package/ai-docs/package.json

@@ -28,7 +28,7 @@
     "@effect/vitest": "workspace:*",
     "effect": "workspace:*",
     "hono": "^4.13.13",
-    "nodemailer": "^10.1.0"
+    "nodemailer": "^10.1.2"
   },
   "devDependencies": {
     "@types/nodemailer": "^8.0.2"

package/ai-docs/src/06_schedule/10_schedules.ts

@@ -5,14 +5,15 @@
  */
 import { Duration, Effect, Random, Schedule, Schema } from "effect"
 
-// Production pattern: capped exponential backoff with jitter and max attempts.
-// Delays start at 250ms, grow exponentially with jitter, and are capped at 10s.
+// Production pattern: capped exponential backoff with jitter and at most 5 retries (6 attempts).
+// Base delays start at 250ms and grow exponentially, capped at 10s before jitter.
 export const productionRetrySchedule = Schedule.min([
   Schedule.exponential("250 millis"),
   // Cap the delay at 10 seconds to avoid excessively long waits.
   Schedule.spaced("10 seconds")
 ]).pipe(
   Schedule.jittered,
+  Schedule.upTo({ times: 5 }),
   Schedule.setInputType<HttpError>(),
   Schedule.while(({ input }) => input.retryable)
 )
@@ -44,8 +45,8 @@ export const fetchUserProfile = Effect.fn("fetchUserProfile")(
 // Use the schedule with `Effect.retry` to retry failures.
 export const loadUserWithRetry = fetchUserProfile("user-123").pipe(
   Effect.retry(productionRetrySchedule),
-  // If the effect still fails after exhausting the schedule, turn the error
-  // into a fatal one.
+  // Turn the final error into a defect, either after exhausting the retries
+  // or immediately for a non-retryable error.
   Effect.orDie
 )
 

package/ai-docs/tsconfig.json

@@ -13,11 +13,13 @@
     "plugins": [
       {
         "name": "@effect/language-service",
+        "effectFn": ["untraced"],
         "namespaceImportPackages": [],
         "diagnosticSeverity": {
           "floatingEffect": "off",
           "preferSchemaOverJson": "off",
-          "unstableApiUsage": "off"
+          "unstableApiUsage": "off",
+          "effectFnOpportunity": "error"
         }
       }
     ]

package/dist/Arbitrary.d.ts

@@ -153,6 +153,12 @@ export type Replay = string;
  * Each unconstrained string, collection, or object property observes the current size independently. Recursive
  * branches instead consume one shared recursion allowance. Explicit Schema bounds and required members still apply.
  *
+ * `concurrency` is a positive safe integer, defaulting to `1`. It bounds the number of pending generated cases,
+ * including evaluations that have completed ahead of an earlier case. Results are processed in generation order.
+ * For deterministic generators and independent, repeatable properties, changing concurrency preserves the result,
+ * including the selected failure, run and discard counts, shrinks, and replay token. Later cases may execute
+ * speculatively. Their fibers are interrupted and awaited before shrinking or returning. Shrinking stays sequential.
+ *
  * `maxShrinks` bounds the number of shrink candidates inspected after the initial failure. Candidates rejected by a
  * Schema check, `filter`, `filterMap`, or dependent generation consume the same budget even though the property is not
  * evaluated. Candidates that produce a different failure class also consume the budget. When the budget is exhausted,
@@ -162,7 +168,7 @@ export type Replay = string;
  * **Gotchas**
  *
  * When `replay` is present, its recorded seed, attempt, size, and shrink path control the run. The `runs`, `size`,
- * `maxDiscards`, `maxShrinks`, and `seed` options are ignored.
+ * `maxDiscards`, `maxShrinks`, `seed`, and `concurrency` options are ignored. Replay stays sequential.
  *
  * @stability unstable
  * @category models
@@ -170,6 +176,7 @@ export type Replay = string;
  */
 export interface CheckOptions {
     readonly runs?: number | undefined;
+    readonly concurrency?: number | undefined;
     readonly size?: number | undefined;
     readonly maxDiscards?: number | undefined;
     readonly maxShrinks?: number | undefined;
@@ -748,7 +755,8 @@ export declare function sampleEffect<A>(self: Arbitrary<A>, options?: SampleOpti
  *
  * A property must also produce the same outcome for the same input and initial environment. The runner may evaluate
  * it repeatedly and does not restore mutable services between evaluations. Stateful properties should acquire and
- * release an independent fixture inside each evaluation.
+ * release an independent fixture inside each evaluation. Concurrent evaluations inherit the provided services;
+ * the runner does not rebuild layers. Their outcomes must not depend on scheduling or shared mutable state.
  *
  * @stability unstable
  * @category running

package/dist/Arbitrary.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Arbitrary.d.ts","sourceRoot":"","sources":["../src/Arbitrary.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,KAAK,MAAM,MAAM,aAAa,CAAA;AAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,aAAa,CAAA;AAI1C,OAAO,KAAK,QAAQ,MAAM,gCAAgC,CAAA;AAC1D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAC7C,OAAO,EAAe,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAC7E,OAAO,KAAK,KAAK,OAAO,MAAM,aAAa,CAAA;AAC3C,OAAO,KAAK,KAAK,KAAK,MAAM,YAAY,CAAA;AAExC;;;;;;GAMG;AACH,eAAO,MAAM,MAAM,EAAE,MAAwB,CAAA;AAE7C;;;;;;GAMG;AACH,MAAM,MAAM,MAAM,GAAG,6BAA6B,CAAA;AAElD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,SAAQ,QAAQ;IAChD,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;CAKlC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;CAC/D;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACvC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACxC;AAED;;;;;;;;;;GAUG;AACH,eAAO,MAAM,WAAW,MAAO,OAAO,KAAG,CAAC,IAAI,SAAS,CAAC,OAAO,CAA2B,CAAA;AAE1F;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAA;CAC5C;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;CAC/B;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,CAAA;AAE3B;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACzC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACxC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAA;IAC3C,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACrC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,GAAG,SAAS,CAAA;IACzD,QAAQ,CAAC,MAAM,CAAC,EAAE,aAAa,GAAG,SAAS,CAAA;CAC5C;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,eAAe,iCAA2B,CAAA;AAEvD;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;CAC/B;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa,CAAC,GAAG,CAAC,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAClB;AAED;;;;;;GAMG;AACH,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;AAEjE;;;;;;GAMG;AACH,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;CAC1B;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;IAC1B,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAA;IACxB,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAA;IACvB,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,CAAA;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;CAC/B;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAA;IAC/B,QAAQ,CAAC,MAAM,EAAE,kBAAkB,GAAG,gBAAgB,GAAG,uBAAuB,GAAG,cAAc,CAAA;CAClG;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,GAAG,cAAc,CAAA;AAErF;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,GAAG,SAAS,CAuBtF;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,OAAO,CAAC,UAAU,EACjD,MAAM,EAAE,CAAC,EACT,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GACjC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAEtB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAExD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AACH,eAAO,MAAM,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,KAAK,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAkB,CAAA;AAE3G;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;;;;;;;;;OAWG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAChE;;;;;;;;;;;OAWG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CACoC,CAAA;AAElG;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,MAAM,EAAE;IACnB;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IACpF;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC/E;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IAChF;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CAC+C,CAAA;AAE/G;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB;;;;;;;;;;;;;;;;;OAiBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC1E;;;;;;;;;;;;;;;;;OAiBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CAIvE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC3E;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CACwC,CAAA;AAEjH;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAC/F,KAAK,EAAE,KAAK,GACX,SAAS,CACV;IAAC,KAAK;CAAC,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;IAC9C,CAAC,UAAU,CAAC,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK;CAClF,GACC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GACzD,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;IACjD,CAAC,UAAU,CAAC,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK;CAClF,GACD,KAAK,CACV,CAEA;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAClB,OAAO,CAAC,EAAE,aAAa,GACtB,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAE9C;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EACjD,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAClB,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAC9D,OAAO,CAAC,EAAE,YAAY,GACrB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAE5C"}
+{"version":3,"file":"Arbitrary.d.ts","sourceRoot":"","sources":["../src/Arbitrary.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,KAAK,MAAM,MAAM,aAAa,CAAA;AAC1C,OAAO,KAAK,KAAK,MAAM,MAAM,aAAa,CAAA;AAI1C,OAAO,KAAK,QAAQ,MAAM,gCAAgC,CAAA;AAC1D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAC7C,OAAO,EAAe,KAAK,SAAS,EAAE,KAAK,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAC7E,OAAO,KAAK,KAAK,OAAO,MAAM,aAAa,CAAA;AAC3C,OAAO,KAAK,KAAK,KAAK,MAAM,YAAY,CAAA;AAExC;;;;;;GAMG;AACH,eAAO,MAAM,MAAM,EAAE,MAAwB,CAAA;AAE7C;;;;;;GAMG;AACH,MAAM,MAAM,MAAM,GAAG,6BAA6B,CAAA;AAElD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,WAAW,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,SAAQ,QAAQ;IAChD,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;CAKlC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC9B,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAA;CAC/D;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACvC,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACxC;AAED;;;;;;;;;;GAUG;AACH,eAAO,MAAM,WAAW,MAAO,OAAO,KAAG,CAAC,IAAI,SAAS,CAAC,OAAO,CAA2B,CAAA;AAE1F;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACnC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAA;CAC5C;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;IAC5B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;CAC/B;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,MAAM,MAAM,GAAG,MAAM,CAAA;AAE3B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACzC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IAClC,QAAQ,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACzC,QAAQ,CAAC,UAAU,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;IACxC,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAA;IAC3C,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CACrC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,GAAG,SAAS,CAAA;IACzD,QAAQ,CAAC,MAAM,CAAC,EAAE,aAAa,GAAG,SAAS,CAAA;CAC5C;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,eAAe,iCAA2B,CAAA;AAEvD;;;;;;GAMG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;CAC/B;AAED;;;;;;GAMG;AACH,MAAM,WAAW,aAAa,CAAC,GAAG,CAAC,CAAC;IAClC,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAClB;AAED;;;;;;GAMG;AACH,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;AAEjE;;;;;;GAMG;AACH,MAAM,WAAW,MAAM;IACrB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;CAC1B;AAED;;;;;;;;;;;;;;GAcG;AACH,MAAM,WAAW,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACrC,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;IAC1B,QAAQ,CAAC,YAAY,EAAE,CAAC,CAAA;IACxB,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAA;IACvB,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC,CAAC,CAAA;IACpC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAA;CAC/B;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAA;IAC/B,QAAQ,CAAC,MAAM,EAAE,kBAAkB,GAAG,gBAAgB,GAAG,uBAAuB,GAAG,cAAc,CAAA;CAClG;AAED;;;;;;;;;;GAUG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,EAAE,CAAC,IAAI,MAAM,GAAG,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,GAAG,cAAc,CAAA;AAErF;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,GAAG,SAAS,CAuBtF;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,MAAM,CAAC,CAAC,SAAS,OAAO,CAAC,UAAU,EACjD,MAAM,EAAE,CAAC,EACT,OAAO,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GACjC,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAEtB;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAExD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AACH,eAAO,MAAM,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,YAAY,KAAK,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAkB,CAAA;AAE3G;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,GAAG,EAAE;IAChB;;;;;;;;;;;OAWG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAChE;;;;;;;;;;;OAWG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CACoC,CAAA;AAElG;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,MAAM,EAAE;IACnB;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IACpF;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC/E;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;IAChF;;;;;;;;;;;;;;;;OAgBG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CAC+C,CAAA;AAE/G;;;;;;;;;;;;;;;;;GAiBG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB;;;;;;;;;;;;;;;;;OAiBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC1E;;;;;;;;;;;;;;;;;OAiBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CAIvE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,CAAA;IAC3E;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;CACwC,CAAA;AAEjH;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,GAAG,CAAC,KAAK,CAAC,KAAK,SAAS,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAC/F,KAAK,EAAE,KAAK,GACX,SAAS,CACV;IAAC,KAAK;CAAC,SAAS,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;IAC9C,CAAC,UAAU,CAAC,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK;CAClF,GACC,CAAC,KAAK,CAAC,SAAS,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GACzD,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG;IACjD,CAAC,UAAU,CAAC,IAAI,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK;CAClF,GACD,KAAK,CACV,CAEA;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC5B,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAClB,OAAO,CAAC,EAAE,aAAa,GACtB,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAE9C;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EACjD,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAClB,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,EAC9D,OAAO,CAAC,EAAE,YAAY,GACrB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAE5C"}

package/dist/Arbitrary.js

@@ -306,7 +306,8 @@ export function sampleEffect(self, options) {
  *
  * A property must also produce the same outcome for the same input and initial environment. The runner may evaluate
  * it repeatedly and does not restore mutable services between evaluations. Stateful properties should acquire and
- * release an independent fixture inside each evaluation.
+ * release an independent fixture inside each evaluation. Concurrent evaluations inherit the provided services;
+ * the runner does not rebuild layers. Their outcomes must not depend on scheduling or shared mutable state.
  *
  * @stability unstable
  * @category running

package/dist/Arbitrary.js.map

@@ -1 +1 @@
-{"version":3,"file":"Arbitrary.js","names":[],"sources":["../src/Arbitrary.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;AAMA,OAAO,KAAK,KAAK,MAAM,YAAY;AAGnC,OAAO,KAAK,SAAS,MAAM,gBAAgB;AAC3C,SAAS,IAAI,QAAQ,eAAe;AAEpC,OAAO,KAAK,QAAQ,MAAM,gCAAgC;AAE1D,SAAS,WAAW,QAAyC,gBAAgB;AAI7E;;;;;;;AAOA,OAAO,MAAM,MAAM,GAAW,QAAQ,CAAC,MAAM;AAqE7C;;;;;;;;;;;AAWA,OAAO,MAAM,WAAW,GAAI,CAAU,IAA8B,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC;AA8G1F;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAM,eAAe,GAAG,QAAQ,CAAC,eAAe;AA2HvD;;;;;;;;;;;AAWA,OAAM,SAAU,kBAAkB,CAAO,MAAyB;EAChE,QAAQ,MAAM,CAAC,IAAI;IACjB,KAAK,QAAQ;MACX,OAAO,SAAS;IAClB,KAAK,WAAW;MACd,OAAO,4BAA4B,MAAM,CAAC,IAAI,eAAe,MAAM,CAAC,OAAO,cAAc,GACvF,iBAAiB,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE;QAAE,KAAK,EAAE;MAAC,CAAE,CAAC,IAAI,GACvE,GACE,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,eAAe,GACnC,yBAAyB,GACzB,YACA,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAC/B,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAClC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE;QAAE,KAAK,EAAE;MAAC,CAAE,CACzD,EACJ,IAAI,GACJ,WAAW,MAAM,CAAC,MAAM,EAAE;IAC9B,KAAK,WAAW;MACd,OAAO,4BAA4B,MAAM,CAAC,IAAI,eAAe,MAAM,CAAC,QAAQ,eAAe,GACzF,SAAS,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE;QAAE,KAAK,EAAE;MAAC,CAAE,CAAC,EAAE;IAC1D,KAAK,gBAAgB;MACnB,OAAO,2BAA2B,MAAM,CAAC,MAAM,EAAE;EACrD;AACF;AAEA;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,OAAM,SAAU,MAAM,CACpB,MAAS,EACT,OAAkC;EAElC,OAAO,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;AACzC;AAEA;;;;;;;;;;;;;;;;AAgBA,OAAM,SAAU,QAAQ,CAAU,KAAQ;EACxC,OAAO,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC;AACjC;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+CA,OAAO,MAAM,KAAK,GAA2E,QAAQ,CAAC,KAAK;AAE3G;;;;;;;;;;;;AAYA,OAAO,MAAM,GAAG,gBA2BZ,IAAI,CAAC,CAAC,EAAE,CAAO,IAAkB,EAAE,CAAkB,KAAmB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAElG;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAM,MAAM,gBAyEf,IAAI,CAAC,CAAC,EAAE,CAAI,IAAkB,EAAE,SAAuB,KAAmB,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;AAE/G;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAM,SAAS,gBAuClB,IAAI,CACN,CAAC,EACD,CAAU,IAAkB,EAAE,CAAyB,KAAmB,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CACtG;AAED;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,OAAO,MAAM,OAAO,gBAmDhB,IAAI,CAAC,CAAC,EAAE,CAAO,IAAkB,EAAE,CAA6B,KAAmB,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAEjH;;;;;;;;;;;;;;;;;;;;;;;AAuBA,OAAM,SAAU,GAAG,CACjB,KAAY;EAWZ,OAAO,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;AAC5B;AAEA;;;;;;;;;;;AAWA,OAAM,SAAU,YAAY,CAC1B,IAAkB,EAClB,OAAuB;EAEvB,OAAO,QAAQ,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC;AAC7C;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,OAAM,SAAU,WAAW,CACzB,IAAkB,EAClB,QAA8D,EAC9D,OAAsB;EAEtB,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC;AACtD","ignoreList":[]}
+{"version":3,"file":"Arbitrary.js","names":[],"sources":["../src/Arbitrary.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;AAMA,OAAO,KAAK,KAAK,MAAM,YAAY;AAGnC,OAAO,KAAK,SAAS,MAAM,gBAAgB;AAC3C,SAAS,IAAI,QAAQ,eAAe;AAEpC,OAAO,KAAK,QAAQ,MAAM,gCAAgC;AAE1D,SAAS,WAAW,QAAyC,gBAAgB;AAI7E;;;;;;;AAOA,OAAO,MAAM,MAAM,GAAW,QAAQ,CAAC,MAAM;AAqE7C;;;;;;;;;;;AAWA,OAAO,MAAM,WAAW,GAAI,CAAU,IAA8B,WAAW,CAAC,CAAC,EAAE,MAAM,CAAC;AAqH1F;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAM,eAAe,GAAG,QAAQ,CAAC,eAAe;AA2HvD;;;;;;;;;;;AAWA,OAAM,SAAU,kBAAkB,CAAO,MAAyB;EAChE,QAAQ,MAAM,CAAC,IAAI;IACjB,KAAK,QAAQ;MACX,OAAO,SAAS;IAClB,KAAK,WAAW;MACd,OAAO,4BAA4B,MAAM,CAAC,IAAI,eAAe,MAAM,CAAC,OAAO,cAAc,GACvF,iBAAiB,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE;QAAE,KAAK,EAAE;MAAC,CAAE,CAAC,IAAI,GACvE,GACE,MAAM,CAAC,OAAO,CAAC,IAAI,KAAK,eAAe,GACnC,yBAAyB,GACzB,YACA,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAC/B,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAClC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE;QAAE,KAAK,EAAE;MAAC,CAAE,CACzD,EACJ,IAAI,GACJ,WAAW,MAAM,CAAC,MAAM,EAAE;IAC9B,KAAK,WAAW;MACd,OAAO,4BAA4B,MAAM,CAAC,IAAI,eAAe,MAAM,CAAC,QAAQ,eAAe,GACzF,SAAS,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE;QAAE,KAAK,EAAE;MAAC,CAAE,CAAC,EAAE;IAC1D,KAAK,gBAAgB;MACnB,OAAO,2BAA2B,MAAM,CAAC,MAAM,EAAE;EACrD;AACF;AAEA;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,OAAM,SAAU,MAAM,CACpB,MAAS,EACT,OAAkC;EAElC,OAAO,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;AACzC;AAEA;;;;;;;;;;;;;;;;AAgBA,OAAM,SAAU,QAAQ,CAAU,KAAQ;EACxC,OAAO,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC;AACjC;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+CA,OAAO,MAAM,KAAK,GAA2E,QAAQ,CAAC,KAAK;AAE3G;;;;;;;;;;;;AAYA,OAAO,MAAM,GAAG,gBA2BZ,IAAI,CAAC,CAAC,EAAE,CAAO,IAAkB,EAAE,CAAkB,KAAmB,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAElG;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAM,MAAM,gBAyEf,IAAI,CAAC,CAAC,EAAE,CAAI,IAAkB,EAAE,SAAuB,KAAmB,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;AAE/G;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAM,SAAS,gBAuClB,IAAI,CACN,CAAC,EACD,CAAU,IAAkB,EAAE,CAAyB,KAAmB,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CACtG;AAED;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,OAAO,MAAM,OAAO,gBAmDhB,IAAI,CAAC,CAAC,EAAE,CAAO,IAAkB,EAAE,CAA6B,KAAmB,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAEjH;;;;;;;;;;;;;;;;;;;;;;;AAuBA,OAAM,SAAU,GAAG,CACjB,KAAY;EAWZ,OAAO,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC;AAC5B;AAEA;;;;;;;;;;;AAWA,OAAM,SAAU,YAAY,CAC1B,IAAkB,EAClB,OAAuB;EAEvB,OAAO,QAAQ,CAAC,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC;AAC7C;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,OAAM,SAAU,WAAW,CACzB,IAAkB,EAClB,QAA8D,EAC9D,OAAsB;EAEtB,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC;AACtD","ignoreList":[]}

package/dist/Array.d.ts

@@ -5252,7 +5252,7 @@ export declare const rotate: {
  * **When to use**
  *
  * Use when checking membership with caller-provided equality instead of
- * `Equal.equivalence()`.
+ * `Equal.asEquivalence()`.
  *
  * **Example** (Checking with custom equality)
  *
@@ -5264,7 +5264,7 @@ export declare const rotate: {
  * pipe([1, 2, 3, 4], containsNumber(3)) // => true
  * ```
  *
- * @see {@link contains} for the `Equal.equivalence()` variant
+ * @see {@link contains} for the `Equal.asEquivalence()` variant
  *
  * @stability stable
  * @category predicates
@@ -5275,7 +5275,7 @@ export declare const containsWith: <A>(isEquivalent: (self: A, that: A) => boole
     (self: Iterable<A>, a: A): boolean;
 };
 /**
- * Checks whether an array contains a value, using `Equal.equivalence()` for
+ * Checks whether an array contains a value, using `Equal.asEquivalence()` for
  * comparison.
  *
  * **When to use**
@@ -5299,7 +5299,7 @@ export declare const containsWith: <A>(isEquivalent: (self: A, that: A) => boole
  */
 export declare const contains: {
     /**
-     * Checks whether an array contains a value, using `Equal.equivalence()` for
+     * Checks whether an array contains a value, using `Equal.asEquivalence()` for
      * comparison.
      *
      * **When to use**
@@ -5323,7 +5323,7 @@ export declare const contains: {
      */
     <A>(a: A): (self: Iterable<A>) => boolean;
     /**
-     * Checks whether an array contains a value, using `Equal.equivalence()` for
+     * Checks whether an array contains a value, using `Equal.asEquivalence()` for
      * comparison.
      *
      * **When to use**
@@ -6228,7 +6228,7 @@ export declare const window: {
  * ) // => [["a", "a"], ["b", "b", "b"], ["c"], ["a"]]
  * ```
  *
- * @see {@link group} for grouping adjacent elements with `Equal.equivalence()`
+ * @see {@link group} for grouping adjacent elements with `Equal.asEquivalence()`
  * @see {@link groupBy} for grouping all elements into a record by key, regardless of adjacency
  *
  * @stability stable
@@ -6260,7 +6260,7 @@ export declare const groupWith: {
      * ) // => [["a", "a"], ["b", "b", "b"], ["c"], ["a"]]
      * ```
      *
-     * @see {@link group} for grouping adjacent elements with `Equal.equivalence()`
+     * @see {@link group} for grouping adjacent elements with `Equal.asEquivalence()`
      * @see {@link groupBy} for grouping all elements into a record by key, regardless of adjacency
      *
      * @stability stable
@@ -6292,7 +6292,7 @@ export declare const groupWith: {
      * ) // => [["a", "a"], ["b", "b", "b"], ["c"], ["a"]]
      * ```
      *
-     * @see {@link group} for grouping adjacent elements with `Equal.equivalence()`
+     * @see {@link group} for grouping adjacent elements with `Equal.asEquivalence()`
      * @see {@link groupBy} for grouping all elements into a record by key, regardless of adjacency
      *
      * @stability stable
@@ -6302,7 +6302,7 @@ export declare const groupWith: {
     <A>(self: NonEmptyReadonlyArray<A>, isEquivalent: (self: A, that: A) => boolean): NonEmptyArray<NonEmptyArray<A>>;
 };
 /**
- * Groups consecutive equal elements using `Equal.equivalence()`.
+ * Groups consecutive equal elements using `Equal.asEquivalence()`.
  *
  * **When to use**
  *
@@ -6457,13 +6457,22 @@ export declare const groupBy: {
     <A, K extends string | symbol>(self: Iterable<A>, f: (a: A) => K): Record.ReadonlyRecord.GroupByResult<K, NonEmptyArray<A>>;
 };
 /**
- * Computes the union of two arrays using a custom equivalence, removing
- * duplicates.
+ * Computes the union of two iterables using a custom equivalence.
  *
  * **When to use**
  *
  * Use when you need the union of two arrays but duplicate detection must use a
- * custom equivalence instead of the default `Equal.equivalence()`.
+ * custom equivalence instead of the default `Equal.asEquivalence()`.
+ *
+ * **Details**
+ *
+ * Keeps the elements of `self`, then appends elements of `that` that have no
+ * equivalent in `self`. Calls `isEquivalent` with an element from `self` first
+ * and an element from `that` second.
+ *
+ * **Gotchas**
+ *
+ * Each input must already be deduplicated.
  *
  * **Example** (Computing unions with custom equality)
  *
@@ -6473,7 +6482,7 @@ export declare const groupBy: {
  * Array.unionWith([1, 2], [2, 3], (a, b) => a === b) // => [1, 2, 3]
  * ```
  *
- * @see {@link union} for the `Equal.equivalence()` variant
+ * @see {@link union} for the `Equal.asEquivalence()` variant
  * @see {@link intersectionWith} for keeping elements present in both arrays
  * @see {@link differenceWith} for keeping elements present only in the first array
  *
@@ -6483,13 +6492,22 @@ export declare const groupBy: {
  */
 export declare const unionWith: {
     /**
-     * Computes the union of two arrays using a custom equivalence, removing
-     * duplicates.
+     * Computes the union of two iterables using a custom equivalence.
      *
      * **When to use**
      *
      * Use when you need the union of two arrays but duplicate detection must use a
-     * custom equivalence instead of the default `Equal.equivalence()`.
+     * custom equivalence instead of the default `Equal.asEquivalence()`.
+     *
+     * **Details**
+     *
+     * Keeps the elements of `self`, then appends elements of `that` that have no
+     * equivalent in `self`. Calls `isEquivalent` with an element from `self` first
+     * and an element from `that` second.
+     *
+     * **Gotchas**
+     *
+     * Each input must already be deduplicated.
      *
      * **Example** (Computing unions with custom equality)
      *
@@ -6499,7 +6517,7 @@ export declare const unionWith: {
      * Array.unionWith([1, 2], [2, 3], (a, b) => a === b) // => [1, 2, 3]
      * ```
      *
-     * @see {@link union} for the `Equal.equivalence()` variant
+     * @see {@link union} for the `Equal.asEquivalence()` variant
      * @see {@link intersectionWith} for keeping elements present in both arrays
      * @see {@link differenceWith} for keeping elements present only in the first array
      *
@@ -6509,13 +6527,22 @@ export declare const unionWith: {
      */
     <S extends Iterable<any>, T extends Iterable<any>>(that: T, isEquivalent: (self: ReadonlyArray.Infer<S>, that: ReadonlyArray.Infer<T>) => boolean): (self: S) => ReadonlyArray.OrNonEmpty<S, T, ReadonlyArray.Infer<S> | ReadonlyArray.Infer<T>>;
     /**
-     * Computes the union of two arrays using a custom equivalence, removing
-     * duplicates.
+     * Computes the union of two iterables using a custom equivalence.
      *
      * **When to use**
      *
      * Use when you need the union of two arrays but duplicate detection must use a
-     * custom equivalence instead of the default `Equal.equivalence()`.
+     * custom equivalence instead of the default `Equal.asEquivalence()`.
+     *
+     * **Details**
+     *
+     * Keeps the elements of `self`, then appends elements of `that` that have no
+     * equivalent in `self`. Calls `isEquivalent` with an element from `self` first
+     * and an element from `that` second.
+     *
+     * **Gotchas**
+     *
+     * Each input must already be deduplicated.
      *
      * **Example** (Computing unions with custom equality)
      *
@@ -6525,7 +6552,7 @@ export declare const unionWith: {
      * Array.unionWith([1, 2], [2, 3], (a, b) => a === b) // => [1, 2, 3]
      * ```
      *
-     * @see {@link union} for the `Equal.equivalence()` variant
+     * @see {@link union} for the `Equal.asEquivalence()` variant
      * @see {@link intersectionWith} for keeping elements present in both arrays
      * @see {@link differenceWith} for keeping elements present only in the first array
      *
@@ -6535,13 +6562,22 @@ export declare const unionWith: {
      */
     <A, B>(self: NonEmptyReadonlyArray<A>, that: Iterable<B>, isEquivalent: (self: A, that: B) => boolean): NonEmptyArray<A | B>;
     /**
-     * Computes the union of two arrays using a custom equivalence, removing
-     * duplicates.
+     * Computes the union of two iterables using a custom equivalence.
      *
      * **When to use**
      *
      * Use when you need the union of two arrays but duplicate detection must use a
-     * custom equivalence instead of the default `Equal.equivalence()`.
+     * custom equivalence instead of the default `Equal.asEquivalence()`.
+     *
+     * **Details**
+     *
+     * Keeps the elements of `self`, then appends elements of `that` that have no
+     * equivalent in `self`. Calls `isEquivalent` with an element from `self` first
+     * and an element from `that` second.
+     *
+     * **Gotchas**
+     *
+     * Each input must already be deduplicated.
      *
      * **Example** (Computing unions with custom equality)
      *
@@ -6551,7 +6587,7 @@ export declare const unionWith: {
      * Array.unionWith([1, 2], [2, 3], (a, b) => a === b) // => [1, 2, 3]
      * ```
      *
-     * @see {@link union} for the `Equal.equivalence()` variant
+     * @see {@link union} for the `Equal.asEquivalence()` variant
      * @see {@link intersectionWith} for keeping elements present in both arrays
      * @see {@link differenceWith} for keeping elements present only in the first array
      *
@@ -6561,13 +6597,22 @@ export declare const unionWith: {
      */
     <A, B>(self: Iterable<A>, that: NonEmptyReadonlyArray<B>, isEquivalent: (self: A, that: B) => boolean): NonEmptyArray<A | B>;
     /**
-     * Computes the union of two arrays using a custom equivalence, removing
-     * duplicates.
+     * Computes the union of two iterables using a custom equivalence.
      *
      * **When to use**
      *
      * Use when you need the union of two arrays but duplicate detection must use a
-     * custom equivalence instead of the default `Equal.equivalence()`.
+     * custom equivalence instead of the default `Equal.asEquivalence()`.
+     *
+     * **Details**
+     *
+     * Keeps the elements of `self`, then appends elements of `that` that have no
+     * equivalent in `self`. Calls `isEquivalent` with an element from `self` first
+     * and an element from `that` second.
+     *
+     * **Gotchas**
+     *
+     * Each input must already be deduplicated.
      *
      * **Example** (Computing unions with custom equality)
      *
@@ -6577,7 +6622,7 @@ export declare const unionWith: {
      * Array.unionWith([1, 2], [2, 3], (a, b) => a === b) // => [1, 2, 3]
      * ```
      *
-     * @see {@link union} for the `Equal.equivalence()` variant
+     * @see {@link union} for the `Equal.asEquivalence()` variant
      * @see {@link intersectionWith} for keeping elements present in both arrays
      * @see {@link differenceWith} for keeping elements present only in the first array
      *
@@ -6588,8 +6633,12 @@ export declare const unionWith: {
     <A, B>(self: Iterable<A>, that: Iterable<B>, isEquivalent: (self: A, that: B) => boolean): Array<A | B>;
 };
 /**
- * Computes the union of two arrays, removing duplicates using
- * `Equal.equivalence()`.
+ * Computes the union of two iterables using `Equal.asEquivalence()`.
+ *
+ * **Gotchas**
+ *
+ * Each input must already be deduplicated. Use {@link dedupe} to remove
+ * duplicates from an input first.
  *
  * **Example** (Computing array unions)
  *
@@ -6609,8 +6658,12 @@ export declare const unionWith: {
  */
 export declare const union: {
     /**
-     * Computes the union of two arrays, removing duplicates using
-     * `Equal.equivalence()`.
+     * Computes the union of two iterables using `Equal.asEquivalence()`.
+     *
+     * **Gotchas**
+     *
+     * Each input must already be deduplicated. Use {@link dedupe} to remove
+     * duplicates from an input first.
      *
      * **Example** (Computing array unions)
      *
@@ -6630,8 +6683,12 @@ export declare const union: {
      */
     <T extends Iterable<any>>(that: T): <S extends Iterable<any>>(self: S) => ReadonlyArray.OrNonEmpty<S, T, ReadonlyArray.Infer<S> | ReadonlyArray.Infer<T>>;
     /**
-     * Computes the union of two arrays, removing duplicates using
-     * `Equal.equivalence()`.
+     * Computes the union of two iterables using `Equal.asEquivalence()`.
+     *
+     * **Gotchas**
+     *
+     * Each input must already be deduplicated. Use {@link dedupe} to remove
+     * duplicates from an input first.
      *
      * **Example** (Computing array unions)
      *
@@ -6651,8 +6708,12 @@ export declare const union: {
      */
     <A, B>(self: NonEmptyReadonlyArray<A>, that: ReadonlyArray<B>): NonEmptyArray<A | B>;
     /**
-     * Computes the union of two arrays, removing duplicates using
-     * `Equal.equivalence()`.
+     * Computes the union of two iterables using `Equal.asEquivalence()`.
+     *
+     * **Gotchas**
+     *
+     * Each input must already be deduplicated. Use {@link dedupe} to remove
+     * duplicates from an input first.
      *
      * **Example** (Computing array unions)
      *
@@ -6672,8 +6733,12 @@ export declare const union: {
      */
     <A, B>(self: ReadonlyArray<A>, that: NonEmptyReadonlyArray<B>): NonEmptyArray<A | B>;
     /**
-     * Computes the union of two arrays, removing duplicates using
-     * `Equal.equivalence()`.
+     * Computes the union of two iterables using `Equal.asEquivalence()`.
+     *
+     * **Gotchas**
+     *
+     * Each input must already be deduplicated. Use {@link dedupe} to remove
+     * duplicates from an input first.
      *
      * **Example** (Computing array unions)
      *
@@ -6714,7 +6779,7 @@ export declare const union: {
  * Array.intersectionWith(isEquivalent)(array2)(array1) // => [{ id: 1 }, { id: 3 }]
  * ```
  *
- * @see {@link intersection} for the `Equal.equivalence()` variant
+ * @see {@link intersection} for the `Equal.asEquivalence()` variant
  * @see {@link unionWith} for keeping values from either array with custom equality
  * @see {@link differenceWith} for keeping values only from the first array with custom equality
  *
@@ -6727,7 +6792,7 @@ export declare const intersectionWith: <A>(isEquivalent: (self: A, that: A) => b
     (self: Iterable<A>, that: Iterable<A>): Array<A>;
 };
 /**
- * Computes the intersection of two arrays using `Equal.equivalence()`. Order is
+ * Computes the intersection of two arrays using `Equal.asEquivalence()`. Order is
  * determined by the first array.
  *
  * **When to use**
@@ -6753,7 +6818,7 @@ export declare const intersectionWith: <A>(isEquivalent: (self: A, that: A) => b
  */
 export declare const intersection: {
     /**
-     * Computes the intersection of two arrays using `Equal.equivalence()`. Order is
+     * Computes the intersection of two arrays using `Equal.asEquivalence()`. Order is
      * determined by the first array.
      *
      * **When to use**
@@ -6779,7 +6844,7 @@ export declare const intersection: {
      */
     <B>(that: Iterable<B>): <A>(self: Iterable<A>) => Array<A & B>;
     /**
-     * Computes the intersection of two arrays using `Equal.equivalence()`. Order is
+     * Computes the intersection of two arrays using `Equal.asEquivalence()`. Order is
      * determined by the first array.
      *
      * **When to use**
@@ -6822,7 +6887,7 @@ export declare const intersection: {
  * Array.differenceWith<number>((a, b) => a === b)([1, 2, 3], [2, 3, 4]) // => [1]
  * ```
  *
- * @see {@link difference} for the `Equal.equivalence()` variant
+ * @see {@link difference} for the `Equal.asEquivalence()` variant
  * @see {@link unionWith} for keeping values from either array with custom equality
  * @see {@link intersectionWith} for keeping values present in both arrays with custom equality
  *
@@ -6836,12 +6901,12 @@ export declare const differenceWith: <A>(isEquivalent: (self: A, that: A) => boo
 };
 /**
  * Computes elements in the first array that are not in the second, using
- * `Equal.equivalence()`.
+ * `Equal.asEquivalence()`.
  *
  * **When to use**
  *
  * Use when you need to keep values from the first array that are absent from
- * the second and the default `Equal.equivalence()` comparison is appropriate.
+ * the second and the default `Equal.asEquivalence()` comparison is appropriate.
  *
  * **Example** (Computing array differences)
  *
@@ -6862,12 +6927,12 @@ export declare const differenceWith: <A>(isEquivalent: (self: A, that: A) => boo
 export declare const difference: {
     /**
      * Computes elements in the first array that are not in the second, using
-     * `Equal.equivalence()`.
+     * `Equal.asEquivalence()`.
      *
      * **When to use**
      *
      * Use when you need to keep values from the first array that are absent from
-     * the second and the default `Equal.equivalence()` comparison is appropriate.
+     * the second and the default `Equal.asEquivalence()` comparison is appropriate.
      *
      * **Example** (Computing array differences)
      *
@@ -6888,12 +6953,12 @@ export declare const difference: {
     <A>(that: Iterable<A>): (self: Iterable<A>) => Array<A>;
     /**
      * Computes elements in the first array that are not in the second, using
-     * `Equal.equivalence()`.
+     * `Equal.asEquivalence()`.
      *
      * **When to use**
      *
      * Use when you need to keep values from the first array that are absent from
-     * the second and the default `Equal.equivalence()` comparison is appropriate.
+     * the second and the default `Equal.asEquivalence()` comparison is appropriate.
      *
      * **Example** (Computing array differences)
      *
@@ -8751,7 +8816,7 @@ export declare const dedupeWith: {
     <A>(self: Iterable<A>, isEquivalent: (self: A, that: A) => boolean): Array<A>;
 };
 /**
- * Removes duplicates using `Equal.equivalence()`, preserving the order of the
+ * Removes duplicates using `Equal.asEquivalence()`, preserving the order of the
  * first occurrence.
  *
  * **When to use**
@@ -8864,7 +8929,7 @@ export declare const dedupeAdjacentWith: {
     <A>(self: Iterable<A>, isEquivalent: (self: A, that: A) => boolean): Array<A>;
 };
 /**
- * Removes consecutive duplicate elements using `Equal.equivalence()`.
+ * Removes consecutive duplicate elements using `Equal.asEquivalence()`.
  *
  * **When to use**
  *