@optimystic/db-p2p 1.0.0-beta.3 → 1.1.0

package/dist/src/storage/struct.d.ts

@@ -10,6 +10,64 @@ export type BlockMetadata = {
     ranges: RevisionRange[];
     /** Latest revision - present if the repo is not empty */
     latest?: ActionRev;
+    /**
+     * The lowest revision this node's content at `latest` is KNOWN to derive from: every revision
+     * record above it was produced HERE, by applying an update-only transform to the content of the
+     * revision before it. So a revision at or above the floor that the revision index names is part
+     * of what `latest` was built from, and one the index does not name is provably not.
+     *
+     * Anything that installs content this node did not derive moves the floor up to that revision,
+     * because it says nothing about what the content was built from: a replica or forward tombstone
+     * (`saveReplica`/`saveDeletion` — cohort reconcile, churn replication, invalidation), and a
+     * commit whose transform carries an `insert`, which replaces the block wholesale. The block's
+     * first commit starts the floor at its own revision.
+     *
+     * Absent on metadata written before the field existed; the next commit then starts it at the
+     * revision it built on, which claims nothing about the history below. Read through
+     * `IBlockStorage.lineageOf`, never compared by hand.
+     */
+    lineageFloor?: number;
+    /**
+     * The revision each pending record on this block was pended AT, keyed by the record's action id —
+     * the `rev` of the `PendRequest` it belongs to. This is what turns a pending record into a
+     * *reservation for a slot* rather than a bare "someone is writing": a record the incoming writer
+     * has built on — its requested revision is past the slot, or, where the promise vote reads it, its
+     * declared base for the block is at or past the slot — is no rival (see `isReservationAgainst` in
+     * `pending-claim.ts`),
+     * and one claiming a revision this block has already committed can never be promoted here at all.
+     *
+     * Kept here, beside `latest`, rather than inside the pending record itself, because the raw
+     * drivers move a pending record into the committed store byte-for-byte on promotion (a rename on
+     * the filesystem backend), so the record's value has to stay a plain transform. The pending
+     * NAMESPACE remains the record; this map only says what slot each record claims. An entry whose
+     * record is gone is inert — every reader joins it against the namespace
+     * (`IBlockStorage.listPendingClaims`) — and is dropped when the record is deleted or when
+     * `latest` advances to or past it. A record with no entry (written before the field existed, or
+     * pended without a revision) reads as an unknown claim, which is treated as the strongest kind.
+     */
+    pendingRevs?: Record<ActionId, number>;
+    /**
+     * The committed revision each pending record's update operations were computed against, keyed
+     * by the record's action id — the pend's `baseRevs[blockId]` (`PendRequest.baseRevs`). Absent for
+     * a record whose pend carried no base for this block (inserted, deleted, or unknown to the
+     * author) and for records written before the field existed; both read as base-unknown. Kept
+     * beside `pendingRevs`, and for the same reason: the raw drivers move a pending record into the
+     * committed store byte-for-byte on promotion, so the record's value has to stay a plain
+     * transform. Written, dropped and swept in the same metadata writes as `pendingRevs`
+     * (`BlockStorage.recordClaim`), so the two can never describe different records.
+     *
+     * A SIBLING map rather than a change to `pendingRevs`' shape, deliberately: metadata written by
+     * the release before this field must stay readable without a migration, and a record with no
+     * entry here simply reads as base-unknown. What each apply site does with an unknown base is
+     * its own rule — `StorageRepo.internalCommit` falls back to the commit's declaration and then
+     * abstains; the read-driven promotion in `StorageRepo.get` declines.
+     *
+     * NOTE: the two maps are not always co-keyed. A rev-less pend that names a base would leave an
+     * entry here and none in `pendingRevs`, which the slot-driven dead-claim sweep cannot see, so it
+     * would live until the record is deleted or promoted. Harmless, and no production caller sends a
+     * rev-less pend (see the NOTE in `StorageRepo.pend`); if one ever appears, sweep this map too.
+     */
+    pendingBases?: Record<ActionId, number>;
 };
 export type ArchiveRevisions = Record<number, {
     action: ActionTransform;

package/dist/src/storage/struct.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"struct.d.ts","sourceRoot":"","sources":["../../../src/storage/struct.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACnH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,MAAM,MAAM,aAAa,GAAG;IAC3B,sBAAsB;IACtB,QAAQ,EAAE,MAAM;IAChB,gDAAgD;IAChD,MAAM,CAAC,EAAE,MAAM;CACf,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAE3B,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,yDAAyD;IACzD,MAAM,CAAC,EAAE,SAAS,CAAC;CACnB,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE;IAC7C,MAAM,EAAE,eAAe,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,EAAE,gBAAgB,CAAC;CACzB,CAAC,CAAC;AAEH,MAAM,MAAM,YAAY,GAAG;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,gCAAgC;IAChC,SAAS,EAAE,gBAAgB,CAAC;IAC5B,2EAA2E;IAC3E,KAAK,EAAE,aAAa,CAAC;IACrB,4DAA4D;IAC5D,OAAO,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;CAC7C,CAAA;AAED;mFACmF;AACnF,MAAM,MAAM,eAAe,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,YAAY,GAAG,SAAS,CAAC,CAAC"}
+{"version":3,"file":"struct.d.ts","sourceRoot":"","sources":["../../../src/storage/struct.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACnH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,4BAA4B,CAAC;AAEnE,MAAM,MAAM,aAAa,GAAG;IAC3B,sBAAsB;IACtB,QAAQ,EAAE,MAAM;IAChB,gDAAgD;IAChD,MAAM,CAAC,EAAE,MAAM;CACf,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAE3B,MAAM,EAAE,aAAa,EAAE,CAAC;IACxB,yDAAyD;IACzD,MAAM,CAAC,EAAE,SAAS,CAAC;IACnB;;;;;;;;;;;;;;;OAeG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;;;;;;;;;;;;;;;;;OAiBG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACvC;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;CACxC,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE;IAC7C,MAAM,EAAE,eAAe,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,EAAE,gBAAgB,CAAC;CACzB,CAAC,CAAC;AAEH,MAAM,MAAM,YAAY,GAAG;IAC1B,OAAO,EAAE,OAAO,CAAC;IACjB,gCAAgC;IAChC,SAAS,EAAE,gBAAgB,CAAC;IAC5B,2EAA2E;IAC3E,KAAK,EAAE,aAAa,CAAC;IACrB,4DAA4D;IAC5D,OAAO,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;CAC7C,CAAA;AAED;mFACmF;AACnF,MAAM,MAAM,eAAe,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,GAAG,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,YAAY,GAAG,SAAS,CAAC,CAAC"}

package/dist/src/testing/mesh-harness.d.ts

@@ -1,13 +1,20 @@
 import type { PeerId, PrivateKey } from '@libp2p/interface';
-import type { IKeyNetwork, IRepo, BlockId, ITransactor, ITransactionValidator } from '@optimystic/db-core';
+import type { IKeyNetwork, ClusterRecord, IRepo, BlockId, ITransactor, ITransactionValidator } from '@optimystic/db-core';
 import { ClusterMember, type ExpectedClusterView } from '../cluster/cluster-repo.js';
 import { type ClusterPolicyOptions, type ResolvedClusterPolicy } from '../cluster/cluster-policy.js';
 import { StorageRepo } from '../storage/storage-repo.js';
 import type { IRawStorage } from '../storage/i-raw-storage.js';
+import type { CommittedHolders } from '../cluster/rebalance-monitor.js';
 import type { CoordinatorRepo } from '../repo/coordinator-repo.js';
 export interface MeshNode {
     peerId: PeerId;
     privateKey: PrivateKey;
+    /**
+     * This node's own view of the key network — the harness analogue of a real node's `keyNetwork`
+     * attachment, and the instance its coordinator and its member's admission derivation both read. It
+     * differs from `Mesh.keyNetwork` only under a simulated partition (`MeshFailureConfig.partitionSides`).
+     */
+    keyNetwork: IKeyNetwork;
     storageRepo: StorageRepo;
     clusterMember: ClusterMember;
     coordinatorRepo: CoordinatorRepo;
@@ -43,9 +50,9 @@ export interface MeshOptions {
     /**
      * Per-node member-side cluster derivation for the membership admission gate — the harness
      * analogue of `libp2p-node-base`'s `deriveExpectedCluster` (findCluster + FRET confidence).
-     * Omitted → each member gets the production-shaped derivation over its own self-including
-     * key-network view (partition-aware, see `MeshFailureConfig.partitionSides`) with confidence
-     * from `meshConfidence` (default 1).
+     * Omitted → each member gets the production-shaped derivation over its own key-network view
+     * (partition-aware, see `MeshFailureConfig.partitionSides`) with confidence from `meshConfidence`
+     * (default 1).
      */
     deriveExpectedCluster?: (node: MeshNode, blockId: BlockId) => Promise<ExpectedClusterView>;
     /**
@@ -64,7 +71,8 @@ export interface MeshOptions {
      *
      * A mesh that arms validators can also set `clusterPolicy.unvalidatablePendPolicy: 'reject'` to
      * refuse pends that carry no `validation` payload (the single-collection `Collection.sync`
-     * shape, which a validator cannot re-check); the default 'accept' admits them unchecked.
+     * shape, and the Quereus adapter's legacy multi-tree commit — neither can be re-checked); the
+     * default 'accept' admits them unchecked.
      */
     validatorFactory?: (index: number, peerId: PeerId) => ITransactionValidator;
     /**
@@ -89,6 +97,13 @@ export interface MeshOptions {
      * eventually crosses it. Omitted → random keys.
      */
     keySeed?: number;
+    /**
+     * Receives each node's committed-holders reports — from its member after a durable consensus apply
+     * and from its coordinator on acknowledging a cohort commit — the harness analogue of the sink
+     * `libp2p-node-base` routes to the node's rebalance monitor. The harness builds no monitor; a spec
+     * that wants one routes reports to its own. Omitted → nothing is reported.
+     */
+    onCommittedHolders?: (node: MeshNode, committed: CommittedHolders) => void;
 }
 export interface MeshFailureConfig {
     /** Peers that should fail on cluster update (simulate unreachable) */
@@ -115,11 +130,42 @@ export interface MeshFailureConfig {
      * it declared, which is already its own side.
      */
     partitionSides?: Set<string>[];
+    /**
+     * Observes every REMOTE cluster delivery — promise round, commit round, commit broadcast and
+     * scheduled commit retry alike — with the target's peer-id string and the record as sent, BEFORE
+     * `failingPeers` is consulted for that delivery. It exists so a spec can change reachability at an
+     * exact protocol step rather than between whole transactions: a member that promised and then
+     * dropped before voting to commit is set unreachable here, on the delivery that would have carried
+     * its commit vote, and that very delivery fails.
+     *
+     * A coordinator's OWN member is invoked in process, never through this path — as in production,
+     * where `ClusterCoordinator.updateMember` calls it directly — so the hook never sees it.
+     */
+    onClusterDelivery?: (targetPeerId: string, record: ClusterRecord) => void;
 }
 export interface Mesh {
     nodes: MeshNode[];
     failures: MeshFailureConfig;
     keyNetwork: IKeyNetwork;
+    /**
+     * Restart one node the way a stopped and relaunched process comes back: same identity, same raw
+     * storage, and nothing else. `node`'s storage repo, cluster member and coordinator are rebuilt IN
+     * PLACE on the same `MeshNode` object (so a spec's reference to it stays valid), over the
+     * `IRawStorage` instance it was built with — for the default `MemoryRawStorage` that is exactly
+     * "over its own storage"; a `rawStorageFactory` store is reused as-is, never re-requested.
+     *
+     * Everything held only in memory goes with the old instance: the member's reservations and
+     * executed-transaction memory, the coordinator's in-flight transactions and scheduled commit
+     * retries, every read-repair stamp. The harness wires no `ITransactionStateStore`, so nothing is
+     * recovered either — a production node built with `transactionStateStore` would resume its
+     * persisted commit retries on restart (`ClusterCoordinator.recoverTransactions`). The old instance is made inert rather than merely forgotten —
+     * its member is disposed, and every outbound call it would still make (a commit retry whose timer
+     * fires later, a cohort consult, an archive fetch) fails the way a stopped process's dial does — so
+     * a retry the old process owed cannot quietly deliver after the restart and pass for healing.
+     *
+     * Reachability (`failures`) is untouched: a node that was unreachable stays unreachable.
+     */
+    restart(node: MeshNode): void;
 }
 /**
  * Fold the mesh's operator-facing knobs into the numbers every node runs on, through the SAME
@@ -139,12 +185,28 @@ export declare function createMesh(nodeCount: number, options: MeshOptions): Pro
  * The nodes the key network keeps OUT of `blockId`'s cohort — peers that receive none of the
  * block's cluster traffic, and so hold none of its content until something repairs them.
  *
- * Peer ids are generated fresh per mesh, so which node is responsible for a given block is random
- * from run to run: in a 3-node `responsibilityK: 1` mesh, `nodes[1]` is the block's sole responsible
- * peer about a third of the time, and then it receives the writer's commit directly. A test that
- * needs a genuinely non-responsible node has to ask the routing layer rather than assume an index.
+ * Unless the mesh is seeded (`keySeed`), peer ids are generated fresh per mesh, so which node is
+ * responsible for a given block is random from run to run: in a 3-node `responsibilityK: 1` mesh,
+ * `nodes[1]` is the block's sole responsible peer about a third of the time, and then it receives the
+ * writer's commit directly. A test that needs a genuinely non-responsible node has to ask the routing
+ * layer rather than assume an index.
  */
 export declare function nonResponsibleNodes(mesh: Mesh, blockId: string): Promise<MeshNode[]>;
+/**
+ * The nodes the key network places in `blockId`'s cohort, nearest first — the complement of
+ * {@link nonResponsibleNodes}. A node outside this list refuses a write for the block through its own
+ * coordinator (`CoordinatorRepo` checks responsibility), so a spec that writes through one node's
+ * coordinator directly picks that node from here rather than by index.
+ */
+export declare function responsibleNodes(mesh: Mesh, blockId: string): Promise<MeshNode[]>;
+/**
+ * The first `count` ids of the form `${prefix}-${i}` whose cohort includes `node` — for a spec that needs
+ * several blocks one node is responsible for (a multi-block pend through that node's coordinator, or
+ * sequential writes it coordinates alone). In a `responsibilityK: 1` mesh these are blocks the node is
+ * the SOLE responsible peer for. Throws after `maxCandidates` ids rather than looping on a node whose ring
+ * arc no id lands in.
+ */
+export declare function blockIdsInCohortOf(mesh: Mesh, node: MeshNode, count: number, prefix: string, maxCandidates?: number): Promise<BlockId[]>;
 export interface BuildTransactorOptions {
     timeoutMs?: number;
     abortOrCancelTimeoutMs?: number;
@@ -158,14 +220,18 @@ export interface BuildTransactorOptions {
 /**
  * Builds a NetworkTransactor over a mesh. All nodes share the same mock
  * infrastructure so a single transactor routes to every peer via `getRepo`.
+ * It runs on no node (no `localPeerId`), so a coverage tie between cohort
+ * members goes to the nearest — a client-only writer's shape.
  * Suitable for solo-mesh tests; for multi-node tests prefer
  * `buildNetworkTransactors` to label "which node is driving".
  */
 export declare const buildNetworkTransactor: (mesh: Mesh, options?: BuildTransactorOptions) => ITransactor;
 /**
  * Builds one NetworkTransactor per mesh node, keyed by peer-id string. Each
- * transactor shares the mesh's key network and peer→repo map — the separate
- * instances exist so tests can semantically say "driven by node A".
+ * transactor shares the mesh's key network and peer→repo map, and runs on its
+ * node the way a production node's transactor does (`localPeerId`): when that
+ * node is in a block's cohort and ties another member on coverage, it
+ * coordinates the write itself. Reads and retries still route by proximity.
  */
 export declare const buildNetworkTransactors: (mesh: Mesh, options?: BuildTransactorOptions) => Map<string, ITransactor>;
 //# sourceMappingURL=mesh-harness.d.ts.map

package/dist/src/testing/mesh-harness.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mesh-harness.d.ts","sourceRoot":"","sources":["../../../src/testing/mesh-harness.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAAyC,KAAK,EAAE,OAAO,EAAa,WAAW,EAAE,qBAAqB,EAAsB,MAAM,qBAAqB,CAAC;AAMjL,OAAO,EAAE,aAAa,EAAkF,KAAK,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAErK,OAAO,EAAwB,KAAK,oBAAoB,EAAE,KAAK,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAC3H,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAGzD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAI/D,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAInE,MAAM,WAAW,QAAQ;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,UAAU,CAAC;IACvB,WAAW,EAAE,WAAW,CAAC;IACzB,aAAa,EAAE,aAAa,CAAC;IAC7B,eAAe,EAAE,eAAe,CAAC;CACjC;AAED,MAAM,WAAW,WAAW;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB;;;;;;OAMG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;OAKG;IACH,aAAa,CAAC,EAAE,oBAAoB,CAAC,eAAe,CAAC,CAAC;IACtD,mEAAmE;IACnE,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,0DAA0D;IAC1D,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,WAAW,CAAC;IACnD;;;;;;OAMG;IACH,qBAAqB,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,KAAK,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAC3F;;;;;;;;;;;;;;;;;OAiBG;IACH,gBAAgB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,qBAAqB,CAAC;IAC5E;;;;;OAKG;IACH,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,MAAM,CAAC;IAC5C;;;;;;OAMG;IACH,cAAc,CAAC,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,WAAW,CAAC;IACtD;;;;;OAKG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,iBAAiB;IACjC,sEAAsE;IACtE,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,2DAA2D;IAC3D,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B;;;;;OAKG;IACH,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1B;;;;;;;;;;;OAWG;IACH,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;CAC/B;AA2DD,MAAM,WAAW,IAAI;IACpB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,UAAU,EAAE,WAAW,CAAC;CACxB;AAgCD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,WAAW,GAAG,qBAAqB,CAiB7E;AAWD;;;GAGG;AACH,wBAAsB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAyOvF;AAED;;;;;;;;GAQG;AACH,wBAAsB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAG1F;AAED,MAAM,WAAW,sBAAsB;IACtC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC;;;;OAIG;IACH,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,KAAK,KAAK,CAAC;CAClD;AAED;;;;;GAKG;AACH,eAAO,MAAM,sBAAsB,GAAI,MAAM,IAAI,EAAE,UAAS,sBAA2B,KAAG,WAgBzF,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,uBAAuB,GAAI,MAAM,IAAI,EAAE,UAAS,sBAA2B,KAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAMjH,CAAC"}
+{"version":3,"file":"mesh-harness.d.ts","sourceRoot":"","sources":["../../../src/testing/mesh-harness.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAA0B,aAAa,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,qBAAqB,EAAkC,MAAM,qBAAqB,CAAC;AAOlL,OAAO,EAAE,aAAa,EAAkF,KAAK,mBAAmB,EAAE,MAAM,4BAA4B,CAAC;AAErK,OAAO,EAAwB,KAAK,oBAAoB,EAAE,KAAK,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AAC3H,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAC;AAGzD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAI/D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AACxE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAGnE,MAAM,WAAW,QAAQ;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,UAAU,CAAC;IACvB;;;;OAIG;IACH,UAAU,EAAE,WAAW,CAAC;IACxB,WAAW,EAAE,WAAW,CAAC;IACzB,aAAa,EAAE,aAAa,CAAC;IAC7B,eAAe,EAAE,eAAe,CAAC;CACjC;AAED,MAAM,WAAW,WAAW;IAC3B,eAAe,EAAE,MAAM,CAAC;IACxB;;;;;;OAMG;IACH,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB;;;;;OAKG;IACH,aAAa,CAAC,EAAE,oBAAoB,CAAC,eAAe,CAAC,CAAC;IACtD,mEAAmE;IACnE,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC,0DAA0D;IAC1D,oBAAoB,CAAC,EAAE,OAAO,CAAC;IAC/B;;;;;OAKG;IACH,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,WAAW,CAAC;IACnD;;;;;;OAMG;IACH,qBAAqB,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,KAAK,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAC3F;;;;;;;;;;;;;;;;;;OAkBG;IACH,gBAAgB,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,KAAK,qBAAqB,CAAC;IAC5E;;;;;OAKG;IACH,cAAc,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,MAAM,CAAC;IAC5C;;;;;;OAMG;IACH,cAAc,CAAC,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,WAAW,CAAC;IACtD;;;;;OAKG;IACH,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB;;;;;OAKG;IACH,kBAAkB,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,EAAE,gBAAgB,KAAK,IAAI,CAAC;CAC3E;AAED,MAAM,WAAW,iBAAiB;IACjC,sEAAsE;IACtE,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3B,2DAA2D;IAC3D,gBAAgB,CAAC,EAAE,OAAO,CAAC;IAC3B;;;;;OAKG;IACH,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1B;;;;;;;;;;;OAWG;IACH,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;IAC/B;;;;;;;;;;OAUG;IACH,iBAAiB,CAAC,EAAE,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,KAAK,IAAI,CAAC;CAC1E;AAoFD,MAAM,WAAW,IAAI;IACpB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,QAAQ,EAAE,iBAAiB,CAAC;IAC5B,UAAU,EAAE,WAAW,CAAC;IACxB;;;;;;;;;;;;;;;;;OAiBG;IACH,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;CAC9B;AAgCD;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,WAAW,GAAG,qBAAqB,CAiB7E;AAiBD;;;GAGG;AACH,wBAAsB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,CAuSvF;AAED;;;;;;;;;GASG;AACH,wBAAsB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAG1F;AAED;;;;;GAKG;AACH,wBAAsB,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAGvF;AAED;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,aAAa,SAAS,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,CAW9I;AAED,MAAM,WAAW,sBAAsB;IACtC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sBAAsB,CAAC,EAAE,MAAM,CAAC;IAChC;;;;OAIG;IACH,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,KAAK,KAAK,CAAC;CAClD;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,sBAAsB,GAAI,MAAM,IAAI,EAAE,UAAS,sBAA2B,KAAG,WACjD,CAAC;AAE1C;;;;;;GAMG;AACH,eAAO,MAAM,uBAAuB,GAAI,MAAM,IAAI,EAAE,UAAS,sBAA2B,KAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAMjH,CAAC"}