@bjornpagen/bumbledb 0.15.0 → 0.17.0

package/COOKBOOK.md

@@ -2,11 +2,9 @@
 
 The bumbledb engine's 32 cookbook recipes (`bumbledb/docs/cookbook.md`),
 translated to this SDK's structural API. **This document is illustrative,
-never normative**: where a recipe and an engine architecture chapter disagree,
-the chapter wins (`docs/architecture/README.md` rule 5) — the SDK is the same
-theory in another skin, and the engine cookbook's deference chain
-(`10-data-model.md`, `30-dependencies.md`, `20-query-ir.md`, `70-api.md`)
-applies here unchanged.
+never normative**: the compiled tests are the authority — every block here
+is executed by the sync suites — and the SDK is the same theory in another
+skin.
 
 Every `ts` fence below compiles VERBATIM against the current SDK —
 `ts/test/cookbook-doc.test.ts` extracts each recipe's fences from this
@@ -36,22 +34,17 @@ import {
 	Db,
 	type Infer,
 	abandon,
-	allen,
 	bool,
 	bytes,
 	capacity,
 	closed,
 	contained,
 	duration,
-	eq,
 	i64,
 	interval,
 	key,
-	lt,
 	mirrors,
-	not,
 	on,
-	pointIn,
 	query,
 	ref,
 	relation,
@@ -128,7 +121,7 @@ const downAt = query(Uptime).rule((r) => {
 	const { service, window } = v(Outage)
 	return r
 		.match(Outage, { service, window })
-		.where(pointIn(r.param("t"), window))
+		.where(r.pointIn(r.param("t"), window))
 		.find({ service })
 })
 // overlapping an incident window (one Allen mask, no operator zoo):
@@ -136,14 +129,11 @@ const overlapping = query(Uptime).rule((r) => {
 	const { service, window } = v(Outage)
 	return r
 		.match(Outage, { service, window })
-		.where(allen(window, ALLEN.intersects, r.param("incident")))
+		.where(r.allen(window, ALLEN.intersects, r.param("incident")))
 		.find({ service, window })
 })
-// total downtime per service (the denotation's one arithmetic):
-const downtime = query(Uptime).rule((r) => {
-	const { service, window } = v(Outage)
-	return r.match(Outage, { service, window }).find({ service, downtime: r.sum(r.duration(window)) })
-})
+// total downtime per service is host arithmetic on the interval
+// endpoints every answer row already carries (`end − start`).
 ```
 
 ## 2. Discriminated unions
@@ -225,7 +215,7 @@ const unaddressed = query(Optionality).rule((r) => {
 	const { id: b } = v(Business)
 	return r
 		.match(Business, { id: b })
-		.where(not(MailingAddress, { business: b }))
+		.where(r.not(MailingAddress, { business: b }))
 		.find({ b })
 })
 ```
@@ -507,7 +497,7 @@ const playingAt = query(Playlists).rule((r) => {
 	const { slot, track } = v(Slot)
 	return r
 		.match(Slot, { playlist: r.param("list"), slot, track })
-		.where(pointIn(r.param("pos"), slot))
+		.where(r.pointIn(r.param("pos"), slot))
 		.find({ track })
 })
 
@@ -623,7 +613,7 @@ const mutual = query(Graph).rule((r) => {
 	return r
 		.match(Follows, { follower: a, followee: b })
 		.match(Follows, { follower: b, followee: a })
-		.where(lt(a, b))
+		.where(r.lt(a, b))
 		.find({ a, b })
 })
 ```
@@ -772,14 +762,14 @@ const roomConflicts = query(Calendar).rule((r) => {
 	const { room, span } = v(Booking)
 	return r
 		.match(Booking, { room, span })
-		.where(allen(span, ALLEN.intersects, r.param("want")))
+		.where(r.allen(span, ALLEN.intersects, r.param("want")))
 		.find({ room, span })
 })
 const personLoad = query(Calendar).rule((r) => {
 	const { person, span } = v(Claim)
 	return r
 		.match(Claim, { person, span })
-		.where(allen(span, ALLEN.intersects, r.param("window")))
+		.where(r.allen(span, ALLEN.intersects, r.param("window")))
 		.find({ person, span })
 })
 ```
@@ -815,7 +805,7 @@ const inForce = query(Pricing).rule((r) => {
 	const { rate_bps, valid } = v(Version)
 	return r
 		.match(Version, { policy: r.param("p"), rate_bps, valid })
-		.where(pointIn(r.param("t"), valid))
+		.where(r.pointIn(r.param("t"), valid))
 		.find({ rate_bps })
 })
 // clean successions (half-open makes MEETS exact, no ±1 fudge):
@@ -825,7 +815,7 @@ const successions = query(Pricing).rule((r) => {
 	return r
 		.match(Version, { policy: p, valid: a })
 		.match(Version, { policy: p, valid: b })
-		.where(allen(a, ALLEN.meets, b))
+		.where(r.allen(a, ALLEN.meets, b))
 		.find({ a, b })
 })
 ```
@@ -858,7 +848,7 @@ const holding = query(Payroll).rule((r) => {
 	const { seq, span } = v(PayPeriod)
 	return r
 		.match(PayPeriod, { year: r.param("y"), seq, span })
-		.where(pointIn(r.param("t"), span))
+		.where(r.pointIn(r.param("t"), span))
 		.find({ seq })
 })
 ```
@@ -908,7 +898,7 @@ const marginal = query(Tax).rule((r) => {
 	return r
 		.match(Regime, { id: reg, year: r.param("y"), status: r.param("s") })
 		.match(Bracket, { regime: reg, income: b, rate_bps })
-		.where(pointIn(r.param("taxable"), b))
+		.where(r.pointIn(r.param("taxable"), b))
 		.find({ rate_bps })
 })
 ```
@@ -939,11 +929,9 @@ const busy = query(FreeTime).rule((r) => {
 	const { person, span } = v(Claim)
 	return r.match(Claim, { person, span }).find({ person, packed: r.pack(span) })
 })
-// raw claimed time (overlaps double-count — often the wrong question):
-const claimed = query(FreeTime).rule((r) => {
-	const { person, span } = v(Claim)
-	return r.match(Claim, { person, span }).find({ person, claimed: r.sum(r.duration(span)) })
-})
+// raw claimed time is host arithmetic on the interval endpoints every
+// answer row already carries (`end − start`). Overlaps double-count,
+// often the wrong question.
 // Coalesced totals = the two-query composition (pack, then a host fold) —
 // aggregates never nest; free time (gaps) is the two-line host walk over
 // sorted packed answers (host sorts by person then span start/end) — both
@@ -1096,10 +1084,9 @@ const deriving = query(Rollup).rule((r) => {
 
 Guarantee: Lean theorem + represented planner/runtime premise — rule union is
 set-idempotent (`lean/Bumbledb/Query/Denotation.lean: union_idempotent`);
-key-backed DU arms justify a disjointness *witness*
-(`lean/Bumbledb/Exec/Dedup.lean: disjoint_witness_licence`) spent diagnostically
-only — execution always keeps one spanning seen-set
-(`docs/architecture/40-execution.md` § set semantics).
+key-backed DU arms satisfy the disjoint-arms licence
+(`lean/Bumbledb/Exec/Dedup.lean: disjoint_witness_licence`); execution
+always keeps one spanning seen-set.
 
 The whole-DU read is a set of rules: one head, one rule per arm — disjunction
 is data at the top, never an execution node.
@@ -1120,8 +1107,8 @@ const Payments = schema("Payments", { Kind, Payment, Card, Ach }, [
 
 // One query, two rules (set union). The exclusivity theorem (recipe 2) is
 // spent a third time here: rules selecting different `kind` handles are
-// provably disjoint. Plan introspection retains the witness; execution still
-// probes one spanning seen-set — the measured refutation deleted the elision.
+// provably disjoint. Execution still probes one spanning seen-set — the
+// measured refutation deleted the elision.
 const wholeDu = query(Payments)
 	.rule((r) => {
 		const { id } = v(Payment)
@@ -1226,7 +1213,7 @@ const root = 1n // the host's chosen root node id
 const seen = new Set<bigint>([root])
 let frontier: readonly bigint[] = [root]
 for (;;) {
-	const next = db.execute(stepPrepared, { frontier }) // one set-param query
+	const next = db.read((i) => i.execute(stepPrepared, { frontier })) // one set-param query
 	const fresh = next
 		.map((row) => row.c)
 		.filter((c) => {
@@ -1257,7 +1244,7 @@ const reach = query(Closure)
 				const { id: c } = v(Node)
 				return r
 					.match(Node, { id: c })
-					.where(eq(c, r.param("root")))
+					.where(r.eq(c, r.param("root")))
 					.find({ c })
 			}
 		],
@@ -1289,7 +1276,7 @@ const unreached = query(Closure)
 				const { id: c } = v(Node)
 				return r
 					.match(Node, { id: c })
-					.where(eq(c, r.param("root")))
+					.where(r.eq(c, r.param("root")))
 					.find({ c })
 			}
 		],
@@ -1360,7 +1347,7 @@ const nativeRollup = query(Accounts)
 				const { id: a } = v(Account)
 				return r
 					.match(Account, { id: a })
-					.where(eq(a, r.param("root")))
+					.where(r.eq(a, r.param("root")))
 					.find({ a })
 			}
 		],
@@ -1500,7 +1487,7 @@ const inForceAt = query(Payroll).rule((r) => {
 	return r
 		.match(Employee, { id: e, name })
 		.match(Salary, { employee: e, amount, applies: w })
-		.where(pointIn(r.param("at"), w))
+		.where(r.pointIn(r.param("at"), w))
 		.find({ name, amount })
 })
 ```
@@ -1620,7 +1607,7 @@ db.write((tx) => {
 const grp = minted.grp ?? 0n
 
 // db.get — the standalone keyed read through the declared law:
-const byGroup = db.get(Course, courseGrpKey, { grp })
+const byGroup = db.read((i) => i.get(Course, courseGrpKey, { grp }))
 
 // snap.get — the same spelling inside a read scope:
 const viaSnap = db.read((instance) => instance.get(Course, courseGrpKey, { grp }))
@@ -1636,7 +1623,7 @@ db.write((tx) => {
 })
 
 // The primary 2-arg form — the fresh field is the primary key:
-const byId = byGroup === undefined ? undefined : db.get(Course, { id: byGroup.id })
+const byId = byGroup === undefined ? undefined : db.read((i) => i.get(Course, { id: byGroup.id }))
 ```
 
 The anti-pattern this recipe retires: a scan-and-find where a key law
@@ -1729,11 +1716,8 @@ const Rooms = schema("Rooms", { Room, Booking }, [
 	)
 ])
 
-// the booked time per room, read back:
-const booked = query(Rooms).rule((r) => {
-	const { id, room, booked } = v(Booking)
-	return r.match(Booking, { id, room, booked }).find({ room, total: r.sum(r.duration(booked)) })
-})
+// the booked time per room is host arithmetic on the `booked`
+// endpoints every answer row already carries (`end − start`).
 ```
 
 Mind the weighted `{0}` and the weighted floor: on a weighted statement

package/README.md

@@ -33,7 +33,7 @@ and result rows are inferred, and a failed constraint check is returned as
 structured data rather than thrown as an exception.
 
 ```ts
-import { bool, closed, contained, Db, gt, type Infer, key, on, query, relation, schema, u64, v } from "@bjornpagen/bumbledb"
+import { bool, closed, contained, Db, type Infer, key, on, query, relation, schema, u64, v } from "@bjornpagen/bumbledb"
 
 // A fixed set can carry typed columns as well as names.
 // Its ID type is the union "DirectPass" | "JudgedPass" | "Failed".
@@ -92,12 +92,12 @@ const certifiedAbove = query(Review).rule((r) => {
 	return r
 		.match(Certificate, { attempt: a, kind: k })
 		.match(Kind, { id: k, mastered: true, rank }) // reusing k at Kind.id creates the join
-		.where(gt(rank, r.param("floor")))
+		.where(r.gt(rank, r.param("floor")))
 		.find({ a, rank })
 })
 
 const prepared = db.prepare(certifiedAbove)
-const rows = db.execute(prepared, { floor: 15n }) // rows: { a: bigint; rank: bigint }[]
+const rows = db.read((i) => i.execute(prepared, { floor: 15n })) // rows: { a: bigint; rank: bigint }[]
 console.log(rows)
 
 // A store read is one callback. The instance is invalid when the callback

package/dist/capacity.d.ts

@@ -1,31 +1,31 @@
 /**
  * Capacity-law mints — the window, weight, and dependent-bound vocabulary
- * the one `capacity()` statement constructor consumes
- * (`docs/architecture/70-api.md` § the canonical-utterance law, restated
- * around the aggregate form). `within()` is the ONE window spelling —
+ * the one `capacity` statement constructor consumes
+ * § the canonical-utterance law, restated
+ * around the aggregate form). `within` is the ONE window spelling —
  * `within(n)` exact (`within(0n)` IS the exclusion's one spelling),
  * `within(lo, hi)` range (`within(0n, hi)` the canonical ceiling),
- * `within(lo, "*")` floor — `weigh()` names the measure on the SOURCE row
+ * `within(lo, "*")` floor — `weigh` names the measure on the SOURCE row
  * (`weigh("watts")` a u64 field, `weigh(duration("booked"))` an interval's
- * measure), and `ref()`/`duration()` read a dependent bound from the
+ * measure), and `ref`/`duration` read a dependent bound from the
  * TARGET row (hi slot only — ruled 2026-07-24, C6). The ban table is
  * enforced REPRESENTATIONALLY in two tiers, split per-aggregate where
  * weight-sensitive (design § 6: a ban is canonical-utterance policing when
  * it is weight-independent, semantic deduplication when it is not):
  *
  * - **The type tier**: a banned spelling written as a LITERAL does not
- *   compile — every negative bound, `within(n, n)`, `within(0n, 0n)`, and
- *   `within(0n, "*")` are type errors naming the canonical form. The
- *   weight-SENSITIVE row rides the `capacity()` overloads themselves:
- *   `within(1n, "*")` is banned on the unit overload only (`{1..*}` on the
- *   count instance is the bare containment respelled —
- *   `window_floor_containment`), and LEGAL on the weighted one ("positive
- *   total" is not an existence claim over rows).
+ * compile — every negative bound, `within(n, n)`, `within(0n, 0n)`, and
+ * `within(0n, "*")` are type errors naming the canonical form. The
+ * weight-SENSITIVE row rides the `capacity` overloads themselves:
+ * `within(1n, "*")` is banned on the unit overload only (`{1..*}` on the
+ * count instance is the bare containment respelled —
+ * `window_floor_containment`), and LEGAL on the weighted one ("positive
+ * total" is not an existence claim over rows).
  * - **The construction tier**: a bound the type level cannot judge — a
- *   COMPUTED `bigint`, or an inverted `within(lo, hi)` order — is judged at
- *   construction with the same canonical-naming errors; and past both
- *   tiers the engine's own spec validation remains the law for a hostile
- *   FFI caller (the standing two-tier ban enforcement).
+ * COMPUTED `bigint`, or an inverted `within(lo, hi)` order — is judged at
+ * construction with the same canonical-naming errors; and past both
+ * tiers the engine's own spec validation remains the law for a hostile
+ * FFI caller (the standing two-tier ban enforcement).
  *
  * The weight vocabulary is closed at the row (ruled 2026-07-24, ruling 6):
  * a path weight (`weigh("model.watts")`) is a typed refusal at BOTH tiers
@@ -36,65 +36,25 @@
  */
 import type { AnyFace, FaceFields, FaceSource, ProjectedShape } from "./face.js";
 import type { CapacityWindowSpec, WeightSpec } from "./spec.js";
-/**
- * The admission brand — a module-private symbol, deliberately unexported
- * (the standing statement-mint pattern): `CapacityWindowSpec` and
- * `WeightSpec` are public wire types, so without this brand every banned
- * spelling in the ban table would be writable as a plain object literal.
- * The symbol makes `within()` and `weigh()` the ONLY producers of the
- * values `capacity()` accepts, which is what "the ban table is unwritable"
- * means.
- */
 declare const admitted: unique symbol;
-/**
- * An admitted capacity window — opaque and inert: a fact about the theory,
- * not a builder. Only `within()` produces one; the spec is carried at its
- * EXACT type so the weight-sensitive `{1..*}` ban and the dependent-bound
- * target wall are judged at the `capacity()` call.
- */
 interface CapacityWindow<S extends CapacityWindowSpec = CapacityWindowSpec> {
     readonly window: S;
     readonly [admitted]: true;
 }
-/**
- * An admitted measure — `weigh()`'s product, the `[w]` bracket of the
- * operator. The spec is carried at its exact type so the u64/interval
- * source wall ({@link WeightOnSource}) reads the weighed field's name off
- * the value.
- */
 interface CapacityWeight<S extends WeightSpec = WeightSpec> {
     readonly weight: S;
     readonly [admitted]: true;
 }
-/**
- * A dependent bound naming a u64 field of the TARGET row — `ref()`'s
- * product, legal in `within()`'s hi slot only (C6: a dependent floor has
- * no use case; inversion with idents is unrepresentable). Carries no
- * value: bounds resolve per target row at judge time.
- */
 interface FieldRef<F extends string = string> {
     readonly kind: "field";
     readonly field: F;
 }
-/**
- * A dependent interval-measure bound (`Duration(field)` of the TARGET
- * row), or — handed to `weigh()` — the interval-measure weight of the
- * SOURCE row. One mint, both slots: the interval enters through the
- * measure argument, never the group key.
- */
 interface DurationRef<F extends string = string> {
     readonly kind: "durationField";
     readonly field: F;
 }
-/** Narrows any value to an admitted capacity window through the module-private brand. */
 declare function isCapacityWindow(value: unknown): value is CapacityWindow;
-/** Narrows any value to an admitted capacity weight through the module-private brand. */
 declare function isCapacityWeight(value: unknown): value is CapacityWeight;
-/**
- * The legible banned-spelling verdict: intersected into a mint's parameter
- * when the LITERAL argument spells a banned window, naming the canonical
- * form — the compile-time face of the ban table.
- */
 interface BannedWindow<Canonical extends string> {
     readonly "banned window spelling — the canonical-utterance law names the one legal form": Canonical;
 }
@@ -106,7 +66,6 @@ interface BannedWindow<Canonical extends string> {
 interface RefusedPath<Idiom extends string> {
     readonly "path spelling refused — the vocabulary is closed at the row": Idiom;
 }
-/** `true` exactly when the literal bigint `N` is negative (out of the u64 bound domain). */
 type IsNegative<N extends bigint> = `${N}` extends `-${string}` ? true : false;
 /**
  * The dotted-name ban, both mints: a `a.b` spelling is a typed refusal
@@ -115,43 +74,23 @@ type IsNegative<N extends bigint> = `${N}` extends `-${string}` ? true : false;
  * name the local field.
  */
 type PathBan<F extends string> = string extends F ? unknown : F extends `${string}.${string}` ? RefusedPath<"pin the column — a two-column containment (Source(ref, f) <= Catalog(id, f)) proves the local copy, then name the local field"> : unknown;
-/** The ban verdict on a single bound: negatives are out of the u64 domain. */
 type NegativeBan<N extends bigint> = bigint extends N ? unknown : IsNegative<N> extends true ? BannedWindow<"capacity bounds are u64 — a negative bound is out of domain"> : unknown;
-/**
- * The ban verdict on `within(lo, "*")`: `{0..*}` is vacuous —
- * weight-independent (sums are ≥ 0). `{1..*}` is NOT judged here: the ban
- * is weight-sensitive (Count-instance only) and rides the `capacity()`
- * unit overload ({@link UnitWindowBan}).
- */
 type FloorBan<N extends bigint> = bigint extends N ? unknown : IsNegative<N> extends true ? BannedWindow<"capacity bounds are u64 — a negative bound is out of domain"> : N extends 0n ? BannedWindow<"`{0..*}` is vacuous — it provably says nothing; delete the statement"> : unknown;
-/**
- * The ban verdict on `within(lo, hi)` with both literals known: `{n..n}`
- * is the exact measure respelled (`within(n)`, or `within(0n)` at 0) —
- * weight-independent canonical policing. Bound ORDER (`{hi..lo}` inverted)
- * is not type-expressible — bigint literals have no type-level comparison
- * — so inversion stays a construction error.
- */
 type RangeBan<Lo extends bigint, Hi extends bigint> = bigint extends Lo ? unknown : bigint extends Hi ? unknown : IsNegative<Lo> extends true ? BannedWindow<"capacity bounds are u64 — a negative bound is out of domain"> : IsNegative<Hi> extends true ? BannedWindow<"capacity bounds are u64 — a negative bound is out of domain"> : Lo extends Hi ? Hi extends Lo ? Lo extends 0n ? BannedWindow<"`{0..0}` — the point window is written `{0}`: use within(0n)"> : BannedWindow<"`{n..n}` — an exact measure is written `{n}`: use within(n)"> : unknown : unknown;
-/**
- * The weight-SENSITIVE ban row, judged at the `capacity()` call where the
- * aggregate instance is known (design § 6): on the UNIT overload a
- * `{1..*}` floor says only what the bare containment says
- * (`window_floor_containment`) and is banned naming `contained`; on the
- * weighted overload the same window is LEGAL — "positive total" admits
- * zero-weight rows and is a different, weaker law.
- */
 type UnitWindowBan<W extends CapacityWindow> = W["window"] extends {
     readonly kind: "floor";
     readonly lo: {
         readonly kind: "lit";
         readonly value: 1n;
     };
-} ? BannedWindow<"`{1..*}` on the unit instance says only what the bare containment says — write contained(source, target)"> : unknown;
+} ? BannedWindow<"`{1..*}` on the unit instance says only what the bare containment says — write contained(source, target)"> : W["window"] extends {
+    readonly kind: "floor";
+} ? BannedWindow<"`{N..*}` on the unit instance — a bare count floor is refused; weigh the source (`<=[w]{N..*}` stays legal) or drop the bound"> : unknown;
 /**
  * The C18 dimension gate's ban row, unit instance (the engine's
  * `CapacityDimensionMixing` twin, ruled 2026-07-24): a unit (count)
- * window against a `duration()` bound counts facts against a span of
- * time — a dimension error. Judged on the `capacity()` UNIT overload
+ * window against a `duration` bound counts facts against a span of
+ * time — a dimension error. Judged on the `capacity` UNIT overload
  * only: Duration weights pair with Duration-capable bounds, so the
  * weighted overload takes the same window freely.
  */
@@ -160,57 +99,31 @@ type UnitDimensionBan<W extends CapacityWindow> = W["window"] extends {
         readonly kind: "durationField";
     };
 } ? BannedWindow<"a count of facts bounded by a span of time mixes dimensions (C18) — weigh the source with weigh(duration(field)), or bound by a u64 field or literal"> : unknown;
-/** The projected kind of one field of a face's source, read off the schema type. */
 type KindAt<S extends FaceSource, K extends string> = ProjectedShape<S, K> extends readonly [infer Kind, ...unknown[]] ? Kind : undefined;
-/**
- * The legible off-roster verdict for a dependent bound: bound names
- * resolve against the TARGET's full field roster (C1 — the written
- * projection tuple stays the pure grouping key), and the verdict names
- * that roster.
- */
 interface BoundOffTargetRoster<K, Roster> {
     readonly "dependent bound must name a field of the TARGET's own row — bound names resolve against the target's full roster": readonly [
         K,
         Roster
     ];
 }
-/** The legible kind-mismatch verdict for a dependent bound: `ref()` needs u64, `duration()` an interval. */
 interface BoundKindMismatch<K, Want> {
     readonly "dependent bound kind mismatch — ref() reads a u64 field, duration() an interval field, of the TARGET row": readonly [
         K,
         Want
     ];
 }
-/**
- * One dependent-bound slot judged against the target face's roster and
- * kinds. A WIDE field name (the untyped-caller path — literal identity
- * already lost) passes the type tier and is judged at construction.
- */
 type BoundOnTarget<K extends string, Want extends "u64" | "interval", B extends AnyFace> = string extends K ? unknown : K extends FaceFields<B["source"]> ? KindAt<B["source"], K> extends Want ? unknown : BoundKindMismatch<K, Want> : BoundOffTargetRoster<K, FaceFields<B["source"]>>;
-/**
- * The dependent-bound target wall (type tier): for a `ref(K)` bound in the
- * window's hi slot, `K` must name a u64 field of the TARGET face's own
- * row; for a `duration(K)` bound, an interval field. Literal-bound windows
- * pass untouched. The runtime twin for untyped callers lives at the
- * `capacity()` construction (`statements.ts`).
- */
 type BoundsOnTarget<W extends CapacityWindow, B extends AnyFace> = W["window"] extends {
     readonly hi: FieldRef<infer K>;
 } ? BoundOnTarget<K, "u64", B> : W["window"] extends {
     readonly hi: DurationRef<infer K>;
 } ? BoundOnTarget<K, "interval", B> : unknown;
-/** The legible off-roster verdict for a weight: the vocabulary is closed at the SOURCE row. */
 interface WeightOffSourceRoster<K, Roster> {
     readonly "weight must name a field of the SOURCE's own row — the weight vocabulary is closed at the row": readonly [
         K,
         Roster
     ];
 }
-/**
- * The legible kind-mismatch verdict for a weight: a signed weight would
- * break the polarity scheduler (an insert could lower a sum), so the
- * illegal weight is unrepresentable, not checked.
- */
 interface WeightKindMismatch<K, Want> {
     readonly "weight kind mismatch — weigh(field) reads a u64 field, weigh(duration(field)) an interval field, of the SOURCE row": readonly [
         K,
@@ -221,7 +134,7 @@ interface WeightKindMismatch<K, Want> {
  * The weight source wall (type tier): `weigh(K)`'s field must be a
  * u64-encoded position of the SOURCE face's own row (signed encodings are
  * the typed polarity refusal), `weigh(duration(K))`'s an interval
- * position. Checked at the `capacity()` call where the source face is
+ * position. Checked at the `capacity` call where the source face is
  * inferred — the proven constrain-after-inference pattern.
  */
 type WeightOnSource<M extends CapacityWeight, A extends AnyFace> = M["weight"] extends {
@@ -231,13 +144,7 @@ type WeightOnSource<M extends CapacityWeight, A extends AnyFace> = M["weight"] e
     readonly kind: "durationField";
     readonly field: infer K extends string;
 } ? string extends K ? unknown : K extends FaceFields<A["source"]> ? KindAt<A["source"], K> extends "interval" ? unknown : WeightKindMismatch<K, "interval"> : WeightOffSourceRoster<K, FaceFields<A["source"]>> : unknown;
-/** The unit weight — a case, not an absence (C4): the count instance's one wire spelling. */
 declare const unitWeight: WeightSpec;
-/**
- * `{n}` — THE exact-measure spelling; `within(0n)` IS the exclusion's one
- * spelling on the unit instance, and the weaker "total is zero" law on a
- * weighted one (zero-weight rows may exist — design § 6, stated loudly).
- */
 declare function within<const N extends bigint>(n: N & NegativeBan<N>): CapacityWindow<{
     readonly kind: "exact";
     readonly n: {
@@ -245,12 +152,6 @@ declare function within<const N extends bigint>(n: N & NegativeBan<N>): Capacity
         readonly value: N;
     };
 }>;
-/**
- * `{lo..*}` — a floor with no ceiling. `within(0n, "*")` is vacuous
- * (unwritable as a literal); `within(1n, "*")` constructs — the `{1..*}`
- * ban is weight-sensitive and judged at the `capacity()` call (unit
- * instance only).
- */
 declare function within<const Lo extends bigint>(lo: Lo & FloorBan<Lo>, hi: "*"): CapacityWindow<{
     readonly kind: "floor";
     readonly lo: {
@@ -272,13 +173,6 @@ declare function within<const Lo extends bigint, const R extends FieldRef | Dura
     };
     readonly hi: R;
 }>;
-/**
- * `{lo..hi}` — both bounds explicit, lo < hi; `within(0n, hi)` is the
- * canonical ceiling. `lo === hi` is the exact measure respelled
- * (unwritable as literals — {@link RangeBan} names `within(n)`), rejected
- * at construction when computed; an inverted window is unsatisfiable and
- * rejected at construction (bigint literals carry no type-level order).
- */
 declare function within<const Lo extends bigint, const Hi extends bigint>(lo: Lo, hi: Hi & RangeBan<Lo, Hi>): CapacityWindow<{
     readonly kind: "range";
     readonly lo: {
@@ -304,17 +198,11 @@ declare function weigh<const F extends string>(measure: DurationRef<F>): Capacit
     readonly kind: "durationField";
     readonly field: F;
 }>;
-/**
- * A dependent bound by name — `within(0n, ref("supply"))` reads each
- * group's ceiling from the TARGET row's u64 field (bound names resolve
- * against the target's FULL roster, C1 — the projection tuple stays the
- * pure grouping key). Carries no value.
- */
 declare function ref<const F extends string>(field: F & PathBan<F>): FieldRef<F>;
 /**
  * `Duration(field)` — the interval-measure spelling, one mint for both
- * slots: handed to `weigh()` it is the SOURCE row's interval measure;
- * in `within()`'s hi slot it is the TARGET row's interval-measure bound
+ * slots: handed to `weigh` it is the SOURCE row's interval measure;
+ * in `within`'s hi slot it is the TARGET row's interval-measure bound
  * (Duration weights pair with Duration-capable bounds — C18).
  */
 declare function duration<const F extends string>(field: F & PathBan<F>): DurationRef<F>;

package/dist/capacity.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"capacity.d.ts","sourceRoot":"","sources":["../src/capacity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,UAAU,CAAA;AAC/E,OAAO,KAAK,EAAqB,kBAAkB,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAEjF;;;;;;;;GAQG;AACH,QAAA,MAAM,QAAQ,EAAE,OAAO,MAA6C,CAAA;AAEpE;;;;;GAKG;AACH,UAAU,cAAc,CAAC,CAAC,SAAS,kBAAkB,GAAG,kBAAkB;IACzE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;IAClB,QAAQ,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;CACzB;AAED;;;;;GAKG;AACH,UAAU,cAAc,CAAC,CAAC,SAAS,UAAU,GAAG,UAAU;IACzD,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;IAClB,QAAQ,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;CACzB;AAED;;;;;GAKG;AACH,UAAU,QAAQ,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM;IAC3C,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CACjB;AAED;;;;;GAKG;AACH,UAAU,WAAW,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM;IAC9C,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CACjB;AAED,yFAAyF;AACzF,iBAAS,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CAEjE;AAED,yFAAyF;AACzF,iBAAS,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CAEjE;AAED;;;;GAIG;AACH,UAAU,YAAY,CAAC,SAAS,SAAS,MAAM;IAC9C,QAAQ,CAAC,+EAA+E,EAAE,SAAS,CAAA;CACnG;AAED;;;;GAIG;AACH,UAAU,WAAW,CAAC,KAAK,SAAS,MAAM;IACzC,QAAQ,CAAC,6DAA6D,EAAE,KAAK,CAAA;CAC7E;AAED,4FAA4F;AAC5F,KAAK,UAAU,CAAC,CAAC,SAAS,MAAM,IAAI,GAAG,CAAC,EAAE,SAAS,IAAI,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,CAAA;AAE9E;;;;;GAKG;AACH,KAAK,OAAO,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAC9C,OAAO,GACP,CAAC,SAAS,GAAG,MAAM,IAAI,MAAM,EAAE,GAC9B,WAAW,CAAC,+HAA+H,CAAC,GAC5I,OAAO,CAAA;AAEX,8EAA8E;AAC9E,KAAK,WAAW,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAClD,OAAO,GACP,UAAU,CAAC,CAAC,CAAC,SAAS,IAAI,GACzB,YAAY,CAAC,6DAA6D,CAAC,GAC3E,OAAO,CAAA;AAEX;;;;;GAKG;AACH,KAAK,QAAQ,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAC/C,OAAO,GACP,UAAU,CAAC,CAAC,CAAC,SAAS,IAAI,GACzB,YAAY,CAAC,6DAA6D,CAAC,GAC3E,CAAC,SAAS,EAAE,GACX,YAAY,CAAC,sEAAsE,CAAC,GACpF,OAAO,CAAA;AAEZ;;;;;;GAMG;AACH,KAAK,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,MAAM,IAAI,MAAM,SAAS,EAAE,GACpE,OAAO,GACP,MAAM,SAAS,EAAE,GAChB,OAAO,GACP,UAAU,CAAC,EAAE,CAAC,SAAS,IAAI,GAC1B,YAAY,CAAC,6DAA6D,CAAC,GAC3E,UAAU,CAAC,EAAE,CAAC,SAAS,IAAI,GAC1B,YAAY,CAAC,6DAA6D,CAAC,GAC3E,EAAE,SAAS,EAAE,GACZ,EAAE,SAAS,EAAE,GACZ,EAAE,SAAS,EAAE,GACZ,YAAY,CAAC,8DAA8D,CAAC,GAC5E,YAAY,CAAC,6DAA6D,CAAC,GAC5E,OAAO,GACR,OAAO,CAAA;AAEd;;;;;;;GAOG;AACH,KAAK,aAAa,CAAC,CAAC,SAAS,cAAc,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS;IAClE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;CACzD,GACE,YAAY,CAAC,0GAA0G,CAAC,GACxH,OAAO,CAAA;AAEV;;;;;;;GAOG;AACH,KAAK,gBAAgB,CAAC,CAAC,SAAS,cAAc,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS;IACrE,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;KAAE,CAAA;CAC/C,GACE,YAAY,CAAC,sJAAsJ,CAAC,GACpK,OAAO,CAAA;AAEV,oFAAoF;AACpF,KAAK,MAAM,CAAC,CAAC,SAAS,UAAU,EAAE,CAAC,SAAS,MAAM,IACjD,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,SAAS,CAAC,MAAM,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,CAAA;AAEpF;;;;;GAKG;AACH,UAAU,oBAAoB,CAAC,CAAC,EAAE,MAAM;IACvC,QAAQ,CAAC,kHAAkH,EAAE,SAAS;QACrI,CAAC;QACD,MAAM;KACN,CAAA;CACD;AAED,4GAA4G;AAC5G,UAAU,iBAAiB,CAAC,CAAC,EAAE,IAAI;IAClC,QAAQ,CAAC,0GAA0G,EAAE,SAAS;QAC7H,CAAC;QACD,IAAI;KACJ,CAAA;CACD;AAED;;;;GAIG;AACH,KAAK,aAAa,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,SAAS,KAAK,GAAG,UAAU,EAAE,CAAC,SAAS,OAAO,IAAI,MAAM,SAAS,CAAC,GACxG,OAAO,GACP,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAChC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,IAAI,GAClC,OAAO,GACP,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,GAC3B,oBAAoB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;AAEpD;;;;;;GAMG;AACH,KAAK,cAAc,CAAC,CAAC,SAAS,cAAc,EAAE,CAAC,SAAS,OAAO,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS;IACtF,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAA;CAC9B,GACE,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAC1B,CAAC,CAAC,QAAQ,CAAC,SAAS;IAAE,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAA;CAAE,GACxD,aAAa,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,GAC/B,OAAO,CAAA;AAEX,+FAA+F;AAC/F,UAAU,qBAAqB,CAAC,CAAC,EAAE,MAAM;IACxC,QAAQ,CAAC,+FAA+F,EAAE,SAAS;QAClH,CAAC;QACD,MAAM;KACN,CAAA;CACD;AAED;;;;GAIG;AACH,UAAU,kBAAkB,CAAC,CAAC,EAAE,IAAI;IACnC,QAAQ,CAAC,oHAAoH,EAAE,SAAS;QACvI,CAAC;QACD,IAAI;KACJ,CAAA;CACD;AAED;;;;;;GAMG;AACH,KAAK,cAAc,CAAC,CAAC,SAAS,cAAc,EAAE,CAAC,SAAS,OAAO,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS;IACtF,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,MAAM,CAAA;CACtC,GACE,MAAM,SAAS,CAAC,GACf,OAAO,GACP,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAChC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,KAAK,GACnC,OAAO,GACP,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,GAC7B,qBAAqB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GACnD,CAAC,CAAC,QAAQ,CAAC,SAAS;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,MAAM,CAAA;CAAE,GAC7F,MAAM,SAAS,CAAC,GACf,OAAO,GACP,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAChC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,UAAU,GACxC,OAAO,GACP,kBAAkB,CAAC,CAAC,EAAE,UAAU,CAAC,GAClC,qBAAqB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GACnD,OAAO,CAAA;AAEX,6FAA6F;AAC7F,QAAA,MAAM,UAAU,EAAE,UAA4C,CAAA;AAuB9D;;;;GAIG;AACH,iBAAS,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EACrC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,GACnB,cAAc,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAA;CAAE,CAAC,CAAA;AACtG;;;;;GAKG;AACH,iBAAS,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EACtC,EAAE,EAAE,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,EACrB,EAAE,EAAE,GAAG,GACL,cAAc,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;CAAE,CAAC,CAAA;AACxG;;;;;GAKG;AACH,iBAAS,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,QAAQ,GAAG,WAAW,EAC9E,EAAE,EAAE,EAAE,GAAG,WAAW,CAAC,EAAE,CAAC,EACxB,EAAE,EAAE,CAAC,GACH,cAAc,CAAC;IACjB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;IACzD,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAA;CACd,CAAC,CAAA;AACF;;;;;;GAMG;AACH,iBAAS,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,KAAK,CAAC,EAAE,SAAS,MAAM,EAC/D,EAAE,EAAE,EAAE,EACN,EAAE,EAAE,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,GACvB,cAAc,CAAC;IACjB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;IACzD,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;CACzD,CAAC,CAAA;AA4CF;;;;;GAKG;AACH,iBAAS,KAAK,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EACpC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GACnB,cAAc,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAAE,CAAC,CAAA;AAChE,iBAAS,KAAK,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EACpC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,GACrB,cAAc,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAAE,CAAC,CAAA;AAQxE;;;;;GAKG;AACH,iBAAS,GAAG,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAEvE;AAED;;;;;GAKG;AACH,iBAAS,QAAQ,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAE/E;AAED,YAAY,EACX,cAAc,EACd,cAAc,EACd,cAAc,EACd,WAAW,EACX,QAAQ,EACR,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,CAAA;AACD,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA"}
+{"version":3,"file":"capacity.d.ts","sourceRoot":"","sources":["../src/capacity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AAGH,OAAO,KAAK,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,cAAc,EAAE,MAAM,UAAU,CAAA;AAC/E,OAAO,KAAK,EAAqB,kBAAkB,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAEjF,QAAA,MAAM,QAAQ,EAAE,OAAO,MAA6C,CAAA;AAEpE,UAAU,cAAc,CAAC,CAAC,SAAS,kBAAkB,GAAG,kBAAkB;IACzE,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;IAClB,QAAQ,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;CACzB;AAED,UAAU,cAAc,CAAC,CAAC,SAAS,UAAU,GAAG,UAAU;IACzD,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;IAClB,QAAQ,CAAC,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;CACzB;AAED,UAAU,QAAQ,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM;IAC3C,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CACjB;AAED,UAAU,WAAW,CAAC,CAAC,SAAS,MAAM,GAAG,MAAM;IAC9C,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;IAC9B,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CACjB;AAED,iBAAS,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CAEjE;AAED,iBAAS,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,cAAc,CAEjE;AAED,UAAU,YAAY,CAAC,SAAS,SAAS,MAAM;IAC9C,QAAQ,CAAC,+EAA+E,EAAE,SAAS,CAAA;CACnG;AAED;;;;GAIG;AACH,UAAU,WAAW,CAAC,KAAK,SAAS,MAAM;IACzC,QAAQ,CAAC,6DAA6D,EAAE,KAAK,CAAA;CAC7E;AAED,KAAK,UAAU,CAAC,CAAC,SAAS,MAAM,IAAI,GAAG,CAAC,EAAE,SAAS,IAAI,MAAM,EAAE,GAAG,IAAI,GAAG,KAAK,CAAA;AAE9E;;;;;GAKG;AACH,KAAK,OAAO,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAC9C,OAAO,GACP,CAAC,SAAS,GAAG,MAAM,IAAI,MAAM,EAAE,GAC9B,WAAW,CAAC,+HAA+H,CAAC,GAC5I,OAAO,CAAA;AAEX,KAAK,WAAW,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAClD,OAAO,GACP,UAAU,CAAC,CAAC,CAAC,SAAS,IAAI,GACzB,YAAY,CAAC,6DAA6D,CAAC,GAC3E,OAAO,CAAA;AAEX,KAAK,QAAQ,CAAC,CAAC,SAAS,MAAM,IAAI,MAAM,SAAS,CAAC,GAC/C,OAAO,GACP,UAAU,CAAC,CAAC,CAAC,SAAS,IAAI,GACzB,YAAY,CAAC,6DAA6D,CAAC,GAC3E,CAAC,SAAS,EAAE,GACX,YAAY,CAAC,sEAAsE,CAAC,GACpF,OAAO,CAAA;AAEZ,KAAK,QAAQ,CAAC,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,MAAM,IAAI,MAAM,SAAS,EAAE,GACpE,OAAO,GACP,MAAM,SAAS,EAAE,GAChB,OAAO,GACP,UAAU,CAAC,EAAE,CAAC,SAAS,IAAI,GAC1B,YAAY,CAAC,6DAA6D,CAAC,GAC3E,UAAU,CAAC,EAAE,CAAC,SAAS,IAAI,GAC1B,YAAY,CAAC,6DAA6D,CAAC,GAC3E,EAAE,SAAS,EAAE,GACZ,EAAE,SAAS,EAAE,GACZ,EAAE,SAAS,EAAE,GACZ,YAAY,CAAC,8DAA8D,CAAC,GAC5E,YAAY,CAAC,6DAA6D,CAAC,GAC5E,OAAO,GACR,OAAO,CAAA;AAEd,KAAK,aAAa,CAAC,CAAC,SAAS,cAAc,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS;IAClE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;CACzD,GACE,YAAY,CAAC,0GAA0G,CAAC,GACxH,CAAC,CAAC,QAAQ,CAAC,SAAS;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAC7C,YAAY,CAAC,+HAA+H,CAAC,GAC7I,OAAO,CAAA;AAEX;;;;;;;GAOG;AACH,KAAK,gBAAgB,CAAC,CAAC,SAAS,cAAc,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS;IACrE,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;KAAE,CAAA;CAC/C,GACE,YAAY,CAAC,sJAAsJ,CAAC,GACpK,OAAO,CAAA;AAEV,KAAK,MAAM,CAAC,CAAC,SAAS,UAAU,EAAE,CAAC,SAAS,MAAM,IACjD,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,SAAS,CAAC,MAAM,IAAI,EAAE,GAAG,OAAO,EAAE,CAAC,GAAG,IAAI,GAAG,SAAS,CAAA;AAEpF,UAAU,oBAAoB,CAAC,CAAC,EAAE,MAAM;IACvC,QAAQ,CAAC,kHAAkH,EAAE,SAAS;QACrI,CAAC;QACD,MAAM;KACN,CAAA;CACD;AAED,UAAU,iBAAiB,CAAC,CAAC,EAAE,IAAI;IAClC,QAAQ,CAAC,0GAA0G,EAAE,SAAS;QAC7H,CAAC;QACD,IAAI;KACJ,CAAA;CACD;AAED,KAAK,aAAa,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,SAAS,KAAK,GAAG,UAAU,EAAE,CAAC,SAAS,OAAO,IAAI,MAAM,SAAS,CAAC,GACxG,OAAO,GACP,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAChC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,IAAI,GAClC,OAAO,GACP,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,GAC3B,oBAAoB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;AAEpD,KAAK,cAAc,CAAC,CAAC,SAAS,cAAc,EAAE,CAAC,SAAS,OAAO,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS;IACtF,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAA;CAC9B,GACE,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAC1B,CAAC,CAAC,QAAQ,CAAC,SAAS;IAAE,QAAQ,CAAC,EAAE,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAA;CAAE,GACxD,aAAa,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,GAC/B,OAAO,CAAA;AAEX,UAAU,qBAAqB,CAAC,CAAC,EAAE,MAAM;IACxC,QAAQ,CAAC,+FAA+F,EAAE,SAAS;QAClH,CAAC;QACD,MAAM;KACN,CAAA;CACD;AAED,UAAU,kBAAkB,CAAC,CAAC,EAAE,IAAI;IACnC,QAAQ,CAAC,oHAAoH,EAAE,SAAS;QACvI,CAAC;QACD,IAAI;KACJ,CAAA;CACD;AAED;;;;;;GAMG;AACH,KAAK,cAAc,CAAC,CAAC,SAAS,cAAc,EAAE,CAAC,SAAS,OAAO,IAAI,CAAC,CAAC,QAAQ,CAAC,SAAS;IACtF,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,MAAM,CAAA;CACtC,GACE,MAAM,SAAS,CAAC,GACf,OAAO,GACP,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAChC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,KAAK,GACnC,OAAO,GACP,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,GAC7B,qBAAqB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GACnD,CAAC,CAAC,QAAQ,CAAC,SAAS;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,SAAS,MAAM,CAAA;CAAE,GAC7F,MAAM,SAAS,CAAC,GACf,OAAO,GACP,CAAC,SAAS,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAChC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,UAAU,GACxC,OAAO,GACP,kBAAkB,CAAC,CAAC,EAAE,UAAU,CAAC,GAClC,qBAAqB,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GACnD,OAAO,CAAA;AAEX,QAAA,MAAM,UAAU,EAAE,UAA4C,CAAA;AAoB9D,iBAAS,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EACrC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,GACnB,cAAc,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,CAAC,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAA;CAAE,CAAC,CAAA;AAEtG,iBAAS,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EACtC,EAAE,EAAE,EAAE,GAAG,QAAQ,CAAC,EAAE,CAAC,EACrB,EAAE,EAAE,GAAG,GACL,cAAc,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;CAAE,CAAC,CAAA;AACxG;;;;;GAKG;AACH,iBAAS,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,KAAK,CAAC,CAAC,SAAS,QAAQ,GAAG,WAAW,EAC9E,EAAE,EAAE,EAAE,GAAG,WAAW,CAAC,EAAE,CAAC,EACxB,EAAE,EAAE,CAAC,GACH,cAAc,CAAC;IACjB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;IACzD,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAA;CACd,CAAC,CAAA;AAEF,iBAAS,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,KAAK,CAAC,EAAE,SAAS,MAAM,EAC/D,EAAE,EAAE,EAAE,EACN,EAAE,EAAE,EAAE,GAAG,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,GACvB,cAAc,CAAC;IACjB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;IACzD,QAAQ,CAAC,EAAE,EAAE;QAAE,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAA;KAAE,CAAA;CACzD,CAAC,CAAA;AA2CF;;;;;GAKG;AACH,iBAAS,KAAK,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EACpC,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GACnB,cAAc,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAAE,CAAC,CAAA;AAChE,iBAAS,KAAK,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EACpC,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,GACrB,cAAc,CAAC;IAAE,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAA;CAAE,CAAC,CAAA;AAQxE,iBAAS,GAAG,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAEvE;AAED;;;;;GAKG;AACH,iBAAS,QAAQ,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAE/E;AAED,YAAY,EACX,cAAc,EACd,cAAc,EACd,cAAc,EACd,WAAW,EACX,QAAQ,EACR,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,CAAA;AACD,OAAO,EAAE,QAAQ,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA"}