@voidhash/mimic-effect 1.0.0-beta.4 → 1.0.0-beta.6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (10) hide show
  1. package/.turbo/turbo-build.log +11 -11
  2. package/dist/testing/HotStorageTestSuite.cjs +7 -19
  3. package/dist/testing/HotStorageTestSuite.mjs +7 -19
  4. package/dist/testing/HotStorageTestSuite.mjs.map +1 -1
  5. package/dist/testing/assertions.cjs +5 -2
  6. package/dist/testing/assertions.mjs +5 -2
  7. package/dist/testing/assertions.mjs.map +1 -1
  8. package/package.json +3 -3
  9. package/src/testing/HotStorageTestSuite.ts +3 -3
  10. package/src/testing/assertions.ts +9 -2
package/.turbo/turbo-build.log CHANGED
@@ -1,5 +1,5 @@
1
1
 
2
- > @voidhash/mimic-effect@1.0.0-beta.4 build /home/runner/work/mimic/mimic/packages/mimic-effect
2
+ > @voidhash/mimic-effect@1.0.0-beta.6 build /home/runner/work/mimic/mimic/packages/mimic-effect
3
3
  > tsdown
4
4
 
5
5
  ℹ tsdown v0.18.2 powered by rolldown v1.0.0-beta.55
@@ -10,7 +10,7 @@
10
10
  ℹ Build start
11
11
  ℹ [CJS] dist/index.cjs  2.43 kB │ gzip: 0.50 kB
12
12
  ℹ [CJS] dist/testing/index.cjs  0.95 kB │ gzip: 0.22 kB
13
- ℹ [CJS] dist/testing/HotStorageTestSuite.cjs 37.91 kB │ gzip: 5.16 kB
13
+ ℹ [CJS] dist/testing/HotStorageTestSuite.cjs 38.03 kB │ gzip: 5.13 kB
14
14
  ℹ [CJS] dist/MimicClusterServerEngine.cjs 21.55 kB │ gzip: 4.91 kB
15
15
  ℹ [CJS] dist/testing/StorageIntegrationTestSuite.cjs 20.68 kB │ gzip: 3.67 kB
16
16
  ℹ [CJS] dist/testing/ColdStorageTestSuite.cjs 18.14 kB │ gzip: 3.22 kB
@@ -20,9 +20,9 @@
20
20
  ℹ [CJS] dist/Metrics.cjs  4.26 kB │ gzip: 1.04 kB
21
21
  ℹ [CJS] dist/MimicServerEngine.cjs  4.23 kB │ gzip: 1.34 kB
22
22
  ℹ [CJS] dist/Protocol.cjs  3.78 kB │ gzip: 1.14 kB
23
+ ℹ [CJS] dist/testing/assertions.cjs  3.74 kB │ gzip: 1.16 kB
23
24
  ℹ [CJS] dist/PresenceManager.cjs  3.72 kB │ gzip: 1.00 kB
24
25
  ℹ [CJS] dist/HotStorage.cjs  3.64 kB │ gzip: 1.21 kB
25
- ℹ [CJS] dist/testing/assertions.cjs  3.43 kB │ gzip: 1.04 kB
26
26
  ℹ [CJS] dist/MimicAuthService.cjs  2.27 kB │ gzip: 0.88 kB
27
27
  ℹ [CJS] dist/Errors.cjs  1.98 kB │ gzip: 0.61 kB
28
28
  ℹ [CJS] dist/ColdStorage.cjs  1.91 kB │ gzip: 0.77 kB
@@ -33,7 +33,7 @@
33
33
  ℹ [CJS] dist/_virtual/_@oxc-project_runtime@0.103.0/helpers/toPropertyKey.cjs  0.37 kB │ gzip: 0.23 kB
34
34
  ℹ [CJS] dist/_virtual/rolldown_runtime.cjs  0.36 kB │ gzip: 0.25 kB
35
35
  ℹ [CJS] dist/testing/types.cjs  0.34 kB │ gzip: 0.23 kB
36
- ℹ [CJS] 25 files, total: 163.63 kB
36
+ ℹ [CJS] 25 files, total: 164.06 kB
37
37
  ℹ [CJS] dist/Protocol.d.cts.map 1.57 kB │ gzip: 0.70 kB
38
38
  ℹ [CJS] dist/Types.d.cts.map 1.41 kB │ gzip: 0.65 kB
39
39
  ℹ [CJS] dist/MimicServerEngine.d.cts.map 1.09 kB │ gzip: 0.50 kB
@@ -71,13 +71,13 @@
71
71
  ℹ [CJS] dist/MimicClusterServerEngine.d.cts 0.82 kB │ gzip: 0.33 kB
72
72
  ℹ [CJS] dist/MimicServer.d.cts 0.74 kB │ gzip: 0.31 kB
73
73
  ℹ [CJS] 36 files, total: 56.62 kB
74
- ✔ Build complete in 6416ms
74
+ ✔ Build complete in 6611ms
75
75
  ℹ [ESM] dist/index.mjs  1.38 kB │ gzip: 0.35 kB
76
76
  ℹ [ESM] dist/testing/index.mjs  0.60 kB │ gzip: 0.19 kB
77
- ℹ [ESM] dist/testing/HotStorageTestSuite.mjs.map 63.35 kB │ gzip: 8.67 kB
77
+ ℹ [ESM] dist/testing/HotStorageTestSuite.mjs.map 63.42 kB │ gzip: 8.61 kB
78
78
  ℹ [ESM] dist/MimicClusterServerEngine.mjs.map 42.30 kB │ gzip: 9.99 kB
79
79
  ℹ [ESM] dist/testing/StorageIntegrationTestSuite.mjs.map 35.60 kB │ gzip: 6.44 kB
80
- ℹ [ESM] dist/testing/HotStorageTestSuite.mjs 34.18 kB │ gzip: 5.10 kB
80
+ ℹ [ESM] dist/testing/HotStorageTestSuite.mjs 34.21 kB │ gzip: 5.06 kB
81
81
  ℹ [ESM] dist/testing/ColdStorageTestSuite.mjs.map 31.92 kB │ gzip: 5.21 kB
82
82
  ℹ [ESM] dist/DocumentManager.mjs.map 28.52 kB │ gzip: 6.84 kB
83
83
  ℹ [ESM] dist/MimicServer.mjs.map 20.88 kB │ gzip: 5.46 kB
@@ -91,7 +91,7 @@
91
91
  ℹ [ESM] dist/MimicServer.mjs  9.63 kB │ gzip: 2.78 kB
92
92
  ℹ [ESM] dist/Protocol.mjs.map  9.18 kB │ gzip: 2.15 kB
93
93
  ℹ [ESM] dist/PresenceManager.mjs.map  9.11 kB │ gzip: 2.27 kB
94
- ℹ [ESM] dist/testing/assertions.mjs.map  6.69 kB │ gzip: 1.78 kB
94
+ ℹ [ESM] dist/testing/assertions.mjs.map  7.31 kB │ gzip: 2.01 kB
95
95
  ℹ [ESM] dist/testing/FailingStorage.mjs  6.49 kB │ gzip: 1.52 kB
96
96
  ℹ [ESM] dist/Metrics.mjs.map  6.13 kB │ gzip: 1.43 kB
97
97
  ℹ [ESM] dist/MimicAuthService.mjs.map  6.09 kB │ gzip: 1.85 kB
@@ -100,10 +100,10 @@
100
100
  ℹ [ESM] dist/Errors.mjs.map  4.00 kB │ gzip: 1.05 kB
101
101
  ℹ [ESM] dist/Metrics.mjs  3.63 kB │ gzip: 1.01 kB
102
102
  ℹ [ESM] dist/HotStorage.mjs  3.52 kB │ gzip: 1.22 kB
103
+ ℹ [ESM] dist/testing/assertions.mjs  3.46 kB │ gzip: 1.15 kB
103
104
  ℹ [ESM] dist/PresenceManager.mjs  3.39 kB │ gzip: 1.01 kB
104
105
  ℹ [ESM] dist/Protocol.mjs  3.35 kB │ gzip: 1.06 kB
105
106
  ℹ [ESM] dist/testing/types.mjs.map  3.22 kB │ gzip: 1.15 kB
106
- ℹ [ESM] dist/testing/assertions.mjs  3.14 kB │ gzip: 1.03 kB
107
107
  ℹ [ESM] dist/MimicAuthService.mjs  2.23 kB │ gzip: 0.88 kB
108
108
  ℹ [ESM] dist/ColdStorage.mjs  1.85 kB │ gzip: 0.79 kB
109
109
  ℹ [ESM] dist/Errors.mjs  1.73 kB │ gzip: 0.61 kB
@@ -150,5 +150,5 @@
150
150
  ℹ [ESM] dist/testing/StorageIntegrationTestSuite.d.mts  1.43 kB │ gzip: 0.57 kB
151
151
  ℹ [ESM] dist/MimicClusterServerEngine.d.mts  0.82 kB │ gzip: 0.33 kB
152
152
  ℹ [ESM] dist/MimicServer.d.mts  0.74 kB │ gzip: 0.31 kB
153
- ℹ [ESM] 78 files, total: 513.37 kB
154
- ✔ Build complete in 6441ms
153
+ ℹ [ESM] 78 files, total: 514.40 kB
154
+ ✔ Build complete in 6628ms
package/dist/testing/HotStorageTestSuite.cjs CHANGED
@@ -314,25 +314,13 @@ const tests = [
314
314
  const storage = yield* require_HotStorage.HotStorageTag;
315
315
  const entry = {
316
316
  transaction: _voidhash_mimic.Transaction.make([
317
- {
318
- type: "set",
319
- path: ["a"],
320
- value: 1
321
- },
322
- {
323
- type: "set",
324
- path: ["b", "c"],
325
- value: "nested"
326
- },
327
- {
328
- type: "set",
329
- path: ["arr"],
330
- value: [
331
- 1,
332
- 2,
333
- 3
334
- ]
335
- }
317
+ _voidhash_mimic.Operation.fromDefinition(_voidhash_mimic.OperationPath.make("a"), TestSetDefinition, 1),
318
+ _voidhash_mimic.Operation.fromDefinition(_voidhash_mimic.OperationPath.make("b/c"), TestSetDefinition, "nested"),
319
+ _voidhash_mimic.Operation.fromDefinition(_voidhash_mimic.OperationPath.make("arr"), TestSetDefinition, [
320
+ 1,
321
+ 2,
322
+ 3
323
+ ])
336
324
  ]),
337
325
  version: 1,
338
326
  timestamp: Date.now()
package/dist/testing/HotStorageTestSuite.mjs CHANGED
@@ -314,25 +314,13 @@ const tests = [
314
314
  const storage = yield* HotStorageTag;
315
315
  const entry = {
316
316
  transaction: Transaction.make([
317
- {
318
- type: "set",
319
- path: ["a"],
320
- value: 1
321
- },
322
- {
323
- type: "set",
324
- path: ["b", "c"],
325
- value: "nested"
326
- },
327
- {
328
- type: "set",
329
- path: ["arr"],
330
- value: [
331
- 1,
332
- 2,
333
- 3
334
- ]
335
- }
317
+ Operation.fromDefinition(OperationPath.make("a"), TestSetDefinition, 1),
318
+ Operation.fromDefinition(OperationPath.make("b/c"), TestSetDefinition, "nested"),
319
+ Operation.fromDefinition(OperationPath.make("arr"), TestSetDefinition, [
320
+ 1,
321
+ 2,
322
+ 3
323
+ ])
336
324
  ]),
337
325
  version: 1,
338
326
  timestamp: Date.now()
package/dist/testing/HotStorageTestSuite.mjs.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"HotStorageTestSuite.mjs","names":["tests: StorageTestCase<HotStorageTestError, HotStorageTag>[]","entry: WalEntry","passed: StorageTestCase<HotStorageTestError, HotStorageTag>[]","failed: Array<{\n test: StorageTestCase<HotStorageTestError, HotStorageTag>;\n error: HotStorageTestError;\n }>"],"sources":["../../src/testing/HotStorageTestSuite.ts"],"sourcesContent":["/**\n * @voidhash/mimic-effect/testing - HotStorage Test Suite\n *\n * Comprehensive test suite for HotStorage (WAL) adapter implementations.\n * These tests verify that an adapter correctly implements the HotStorage interface\n * and can reliably store/retrieve WAL entries for document recovery.\n */\nimport { Effect, Schema } from \"effect\";\nimport { Transaction, OperationPath, Operation, OperationDefinition } from \"@voidhash/mimic\";\nimport { HotStorageTag } from \"../HotStorage\";\nimport { type HotStorageError, WalVersionGapError } from \"../Errors\";\nimport type { WalEntry } from \"../Types\";\nimport type { StorageTestCase, TestResults } from \"./types\";\nimport { TestError } from \"./types\";\nimport {\n assertEqual,\n assertLength,\n assertEmpty,\n assertSortedBy,\n assertTrue,\n} from \"./assertions\";\n\n/**\n * Error type for HotStorage tests - can be either a TestError, HotStorageError, or WalVersionGapError\n */\nexport type HotStorageTestError = TestError | HotStorageError | WalVersionGapError;\n\n// =============================================================================\n// Test Operation Definitions\n// =============================================================================\n\n/**\n * Test operation definition for creating proper Operation objects in tests.\n * Using Schema.Unknown allows any payload type for flexibility in testing.\n */\nconst TestSetDefinition = OperationDefinition.make({\n kind: \"test.set\" as const,\n payload: Schema.Unknown,\n target: Schema.Unknown,\n apply: (payload: unknown) => payload,\n});\n\n/**\n * Custom operation definition for testing operation kind preservation.\n */\nconst CustomOpDefinition = OperationDefinition.make({\n kind: \"custom.operation\" as const,\n payload: Schema.Unknown,\n target: Schema.Unknown,\n apply: (payload: unknown) => payload,\n});\n\n// =============================================================================\n// Categories\n// =============================================================================\n\nexport const Categories = {\n BasicOperations: \"Basic Operations\",\n VersionFiltering: \"Version Filtering\",\n OrderingGuarantees: \"Ordering Guarantees\",\n TruncationEdgeCases: \"Truncation Edge Cases\",\n WalEntryIntegrity: \"WAL Entry Integrity\",\n DocumentIsolation: \"Document Isolation\",\n LargeScaleOperations: \"Large-Scale Operations\",\n DocumentIdEdgeCases: \"Document ID Edge Cases\",\n GapChecking: \"Gap Checking\",\n TransactionEncoding: \"Transaction Encoding\",\n} as const;\n\n// =============================================================================\n// Helper Functions\n// =============================================================================\n\nconst makeEntry = (version: number, timestamp?: number): WalEntry => ({\n transaction: Transaction.make([]),\n version,\n timestamp: timestamp ?? Date.now(),\n});\n\nconst makeEntryWithData = (\n version: number,\n data: unknown,\n timestamp?: number\n): WalEntry => ({\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(\"data\"), TestSetDefinition, data),\n ]),\n version,\n timestamp: timestamp ?? Date.now(),\n});\n\nconst makeEntryWithPath = (\n version: number,\n pathString: string,\n payload: unknown,\n timestamp?: number\n): WalEntry => ({\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(pathString), TestSetDefinition, payload),\n ]),\n version,\n timestamp: timestamp ?? Date.now(),\n});\n\n// =============================================================================\n// Test Definitions\n// =============================================================================\n\nconst tests: StorageTestCase<HotStorageTestError, HotStorageTag>[] = [\n // ---------------------------------------------------------------------------\n // Basic Operations\n // ---------------------------------------------------------------------------\n {\n name: \"getEntries returns empty array for non-existent document\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const result = yield* storage.getEntries(\"non-existent-hot-doc\", 0);\n yield* assertEmpty(result, \"Should return empty array for non-existent document\");\n }),\n },\n\n {\n name: \"append then getEntries returns the entry\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntry(1);\n yield* storage.append(\"basic-append\", entry);\n const entries = yield* storage.getEntries(\"basic-append\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(entries[0]!.version, 1, \"Entry version should match\");\n }),\n },\n\n {\n name: \"multiple append calls accumulate entries\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"multi-append\", makeEntry(1));\n yield* storage.append(\"multi-append\", makeEntry(2));\n yield* storage.append(\"multi-append\", makeEntry(3));\n const entries = yield* storage.getEntries(\"multi-append\", 0);\n yield* assertLength(entries, 3, \"Should have three entries\");\n }),\n },\n\n {\n name: \"truncate removes entries with version <= upToVersion\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"truncate-basic\", makeEntry(1));\n yield* storage.append(\"truncate-basic\", makeEntry(2));\n yield* storage.append(\"truncate-basic\", makeEntry(3));\n yield* storage.truncate(\"truncate-basic\", 2);\n const entries = yield* storage.getEntries(\"truncate-basic\", 0);\n yield* assertLength(entries, 1, \"Should have one entry after truncate\");\n yield* assertEqual(entries[0]!.version, 3, \"Only version 3 should remain\");\n }),\n },\n\n {\n name: \"truncate on non-existent document does not error\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.truncate(\"non-existent-truncate\", 100);\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Version Filtering (Critical for Recovery)\n // ---------------------------------------------------------------------------\n {\n name: \"getEntries(doc, 0) returns all entries\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-all\", makeEntry(1));\n yield* storage.append(\"filter-all\", makeEntry(2));\n yield* storage.append(\"filter-all\", makeEntry(3));\n const entries = yield* storage.getEntries(\"filter-all\", 0);\n yield* assertLength(entries, 3, \"sinceVersion=0 should return all entries\");\n }),\n },\n\n {\n name: \"getEntries(doc, n) returns only entries with version > n\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-n\", makeEntry(1));\n yield* storage.append(\"filter-n\", makeEntry(2));\n yield* storage.append(\"filter-n\", makeEntry(3));\n yield* storage.append(\"filter-n\", makeEntry(4));\n const entries = yield* storage.getEntries(\"filter-n\", 2);\n yield* assertLength(entries, 2, \"Should return entries with version > 2\");\n yield* assertEqual(entries[0]!.version, 3, \"First entry should be version 3\");\n yield* assertEqual(entries[1]!.version, 4, \"Second entry should be version 4\");\n }),\n },\n\n {\n name: \"getEntries(doc, exactVersion) excludes that exact version\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-exact\", makeEntry(5));\n yield* storage.append(\"filter-exact\", makeEntry(6));\n yield* storage.append(\"filter-exact\", makeEntry(7));\n const entries = yield* storage.getEntries(\"filter-exact\", 6);\n yield* assertLength(entries, 1, \"Should exclude version 6\");\n yield* assertEqual(entries[0]!.version, 7, \"Only version 7 should be returned\");\n }),\n },\n\n {\n name: \"getEntries(doc, maxVersion) returns empty array\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-max\", makeEntry(1));\n yield* storage.append(\"filter-max\", makeEntry(2));\n yield* storage.append(\"filter-max\", makeEntry(3));\n const entries = yield* storage.getEntries(\"filter-max\", 3);\n yield* assertEmpty(entries, \"sinceVersion >= maxVersion should return empty\");\n }),\n },\n\n {\n name: \"getEntries(doc, MAX_SAFE_INTEGER) returns empty array\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-huge\", makeEntry(1));\n yield* storage.append(\"filter-huge\", makeEntry(1000000));\n const entries = yield* storage.getEntries(\"filter-huge\", Number.MAX_SAFE_INTEGER);\n yield* assertEmpty(entries, \"sinceVersion=MAX_SAFE_INTEGER should return empty\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Ordering Guarantees\n // ---------------------------------------------------------------------------\n {\n name: \"entries returned sorted by version ascending\",\n category: Categories.OrderingGuarantees,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"order-test\", makeEntry(1));\n yield* storage.append(\"order-test\", makeEntry(2));\n yield* storage.append(\"order-test\", makeEntry(3));\n const entries = yield* storage.getEntries(\"order-test\", 0);\n yield* assertSortedBy(entries, \"version\", \"Entries should be sorted by version\");\n }),\n },\n\n {\n name: \"out-of-order appends are sorted correctly on retrieval\",\n category: Categories.OrderingGuarantees,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"ooo-test\", makeEntry(3));\n yield* storage.append(\"ooo-test\", makeEntry(1));\n yield* storage.append(\"ooo-test\", makeEntry(4));\n yield* storage.append(\"ooo-test\", makeEntry(2));\n const entries = yield* storage.getEntries(\"ooo-test\", 0);\n yield* assertLength(entries, 4, \"Should have all 4 entries\");\n yield* assertEqual(entries[0]!.version, 1, \"First should be version 1\");\n yield* assertEqual(entries[1]!.version, 2, \"Second should be version 2\");\n yield* assertEqual(entries[2]!.version, 3, \"Third should be version 3\");\n yield* assertEqual(entries[3]!.version, 4, \"Fourth should be version 4\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Truncation Edge Cases\n // ---------------------------------------------------------------------------\n {\n name: \"truncate(doc, 0) removes nothing (versions > 0 kept)\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-0\", makeEntry(1));\n yield* storage.append(\"trunc-0\", makeEntry(2));\n yield* storage.truncate(\"trunc-0\", 0);\n const entries = yield* storage.getEntries(\"trunc-0\", 0);\n yield* assertLength(entries, 2, \"truncate(0) should keep all entries with version > 0\");\n }),\n },\n\n {\n name: \"truncate(doc, maxVersion) removes all entries\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-all\", makeEntry(1));\n yield* storage.append(\"trunc-all\", makeEntry(2));\n yield* storage.append(\"trunc-all\", makeEntry(3));\n yield* storage.truncate(\"trunc-all\", 3);\n const entries = yield* storage.getEntries(\"trunc-all\", 0);\n yield* assertEmpty(entries, \"truncate(maxVersion) should remove all entries\");\n }),\n },\n\n {\n name: \"truncate(doc, middleVersion) removes correct entries\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-mid\", makeEntry(1));\n yield* storage.append(\"trunc-mid\", makeEntry(2));\n yield* storage.append(\"trunc-mid\", makeEntry(3));\n yield* storage.append(\"trunc-mid\", makeEntry(4));\n yield* storage.append(\"trunc-mid\", makeEntry(5));\n yield* storage.truncate(\"trunc-mid\", 3);\n const entries = yield* storage.getEntries(\"trunc-mid\", 0);\n yield* assertLength(entries, 2, \"Should keep versions 4 and 5\");\n yield* assertEqual(entries[0]!.version, 4, \"First remaining should be 4\");\n yield* assertEqual(entries[1]!.version, 5, \"Second remaining should be 5\");\n }),\n },\n\n {\n name: \"multiple truncates work correctly\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"multi-trunc\", makeEntry(1));\n yield* storage.append(\"multi-trunc\", makeEntry(2));\n yield* storage.append(\"multi-trunc\", makeEntry(3));\n yield* storage.append(\"multi-trunc\", makeEntry(4));\n yield* storage.append(\"multi-trunc\", makeEntry(5));\n yield* storage.truncate(\"multi-trunc\", 2);\n yield* storage.truncate(\"multi-trunc\", 4);\n const entries = yield* storage.getEntries(\"multi-trunc\", 0);\n yield* assertLength(entries, 1, \"Should only have version 5\");\n yield* assertEqual(entries[0]!.version, 5, \"Only version 5 should remain\");\n }),\n },\n\n {\n name: \"truncate followed by append works correctly\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-append\", makeEntry(1));\n yield* storage.append(\"trunc-append\", makeEntry(2));\n yield* storage.truncate(\"trunc-append\", 2);\n yield* storage.append(\"trunc-append\", makeEntry(3));\n yield* storage.append(\"trunc-append\", makeEntry(4));\n const entries = yield* storage.getEntries(\"trunc-append\", 0);\n yield* assertLength(entries, 2, \"Should have versions 3 and 4\");\n yield* assertEqual(entries[0]!.version, 3, \"First should be 3\");\n yield* assertEqual(entries[1]!.version, 4, \"Second should be 4\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // WAL Entry Data Integrity\n // ---------------------------------------------------------------------------\n {\n name: \"transaction data is preserved exactly\",\n category: Categories.WalEntryIntegrity,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithData(1, { key: \"value\", nested: { a: 1 } });\n yield* storage.append(\"tx-data\", entry);\n const entries = yield* storage.getEntries(\"tx-data\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction,\n entry.transaction,\n \"Transaction should be preserved exactly\"\n );\n }),\n },\n\n {\n name: \"version number is preserved exactly\",\n category: Categories.WalEntryIntegrity,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const version = 42;\n const entry = makeEntry(version);\n yield* storage.append(\"version-preserve\", entry);\n const entries = yield* storage.getEntries(\"version-preserve\", 0);\n yield* assertEqual(entries[0]!.version, version, \"Version should be preserved exactly\");\n }),\n },\n\n {\n name: \"timestamp is preserved exactly\",\n category: Categories.WalEntryIntegrity,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const timestamp = 1704067200000;\n const entry = makeEntry(1, timestamp);\n yield* storage.append(\"timestamp-preserve\", entry);\n const entries = yield* storage.getEntries(\"timestamp-preserve\", 0);\n yield* assertEqual(\n entries[0]!.timestamp,\n timestamp,\n \"Timestamp should be preserved exactly\"\n );\n }),\n },\n\n {\n name: \"complex transaction operations survive roundtrip\",\n category: Categories.WalEntryIntegrity,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry: WalEntry = {\n transaction: Transaction.make([\n { type: \"set\", path: [\"a\"], value: 1 },\n { type: \"set\", path: [\"b\", \"c\"], value: \"nested\" },\n { type: \"set\", path: [\"arr\"], value: [1, 2, 3] },\n ]),\n version: 1,\n timestamp: Date.now(),\n };\n yield* storage.append(\"complex-tx\", entry);\n const entries = yield* storage.getEntries(\"complex-tx\", 0);\n yield* assertEqual(\n entries[0]!.transaction,\n entry.transaction,\n \"Complex transaction should survive roundtrip\"\n );\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Document Isolation\n // ---------------------------------------------------------------------------\n {\n name: \"different documents have independent entry lists\",\n category: Categories.DocumentIsolation,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"iso-hot-1\", makeEntry(1));\n yield* storage.append(\"iso-hot-1\", makeEntry(2));\n yield* storage.append(\"iso-hot-2\", makeEntry(10));\n const entries1 = yield* storage.getEntries(\"iso-hot-1\", 0);\n const entries2 = yield* storage.getEntries(\"iso-hot-2\", 0);\n yield* assertLength(entries1, 2, \"Doc 1 should have 2 entries\");\n yield* assertLength(entries2, 1, \"Doc 2 should have 1 entry\");\n yield* assertEqual(entries1[0]!.version, 1, \"Doc 1 first entry version\");\n yield* assertEqual(entries2[0]!.version, 10, \"Doc 2 first entry version\");\n }),\n },\n\n {\n name: \"appending to one doc does not affect others\",\n category: Categories.DocumentIsolation,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"append-iso-1\", makeEntry(1));\n const beforeAppend = yield* storage.getEntries(\"append-iso-1\", 0);\n yield* storage.append(\"append-iso-2\", makeEntry(100));\n yield* storage.append(\"append-iso-2\", makeEntry(101));\n const afterAppend = yield* storage.getEntries(\"append-iso-1\", 0);\n yield* assertEqual(\n beforeAppend.length,\n afterAppend.length,\n \"Appending to doc 2 should not affect doc 1\"\n );\n }),\n },\n\n {\n name: \"truncating one doc does not affect others\",\n category: Categories.DocumentIsolation,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-iso-1\", makeEntry(1));\n yield* storage.append(\"trunc-iso-1\", makeEntry(2));\n yield* storage.append(\"trunc-iso-2\", makeEntry(1));\n yield* storage.append(\"trunc-iso-2\", makeEntry(2));\n yield* storage.truncate(\"trunc-iso-1\", 2);\n const entries1 = yield* storage.getEntries(\"trunc-iso-1\", 0);\n const entries2 = yield* storage.getEntries(\"trunc-iso-2\", 0);\n yield* assertEmpty(entries1, \"Doc 1 should be empty after truncate\");\n yield* assertLength(entries2, 2, \"Doc 2 should still have 2 entries\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Large-Scale Operations\n // ---------------------------------------------------------------------------\n {\n name: \"handle 1000+ entries per document\",\n category: Categories.LargeScaleOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const count = 1000;\n for (let i = 1; i <= count; i++) {\n yield* storage.append(\"large-entries\", makeEntry(i));\n }\n const entries = yield* storage.getEntries(\"large-entries\", 0);\n yield* assertLength(entries, count, `Should have ${count} entries`);\n yield* assertSortedBy(entries, \"version\", \"Should be sorted by version\");\n yield* assertEqual(entries[0]!.version, 1, \"First should be version 1\");\n yield* assertEqual(entries[count - 1]!.version, count, `Last should be version ${count}`);\n }),\n },\n\n {\n name: \"handle 100+ documents\",\n category: Categories.LargeScaleOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const docCount = 100;\n for (let i = 0; i < docCount; i++) {\n yield* storage.append(`multi-doc-${i}`, makeEntry(1));\n yield* storage.append(`multi-doc-${i}`, makeEntry(2));\n }\n let totalEntries = 0;\n for (let i = 0; i < docCount; i++) {\n const entries = yield* storage.getEntries(`multi-doc-${i}`, 0);\n totalEntries += entries.length;\n yield* assertLength(entries, 2, `Doc ${i} should have 2 entries`);\n }\n yield* assertEqual(totalEntries, docCount * 2, \"Total entries should match\");\n }),\n },\n\n {\n name: \"large transaction data (10KB+) survives roundtrip\",\n category: Categories.LargeScaleOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const largeData = \"x\".repeat(10 * 1024);\n const entry = makeEntryWithData(1, { content: largeData });\n yield* storage.append(\"large-tx\", entry);\n const entries = yield* storage.getEntries(\"large-tx\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction,\n entry.transaction,\n \"Large transaction data should survive roundtrip\"\n );\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Document ID Edge Cases\n // ---------------------------------------------------------------------------\n {\n name: \"long documentId (1000+ chars) works\",\n category: Categories.DocumentIdEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const longId = \"h\".repeat(1000);\n const entry = makeEntry(1);\n yield* storage.append(longId, entry);\n const entries = yield* storage.getEntries(longId, 0);\n yield* assertLength(entries, 1, \"Long documentId should work\");\n }),\n },\n\n {\n name: \"unicode documentId works\",\n category: Categories.DocumentIdEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const unicodeId = \"hot-doc-id\";\n const entry = makeEntry(1);\n yield* storage.append(unicodeId, entry);\n const entries = yield* storage.getEntries(unicodeId, 0);\n yield* assertLength(entries, 1, \"Unicode documentId should work\");\n }),\n },\n\n {\n name: \"documentId with special chars works\",\n category: Categories.DocumentIdEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const specialId = \"hot/path:to.wal\";\n const entry = makeEntry(1);\n yield* storage.append(specialId, entry);\n const entries = yield* storage.getEntries(specialId, 0);\n yield* assertLength(entries, 1, \"DocumentId with special chars should work\");\n }),\n },\n\n {\n name: \"documentId with spaces works\",\n category: Categories.DocumentIdEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const spacedId = \"hot doc with spaces\";\n const entry = makeEntry(1);\n yield* storage.append(spacedId, entry);\n const entries = yield* storage.getEntries(spacedId, 0);\n yield* assertLength(entries, 1, \"DocumentId with spaces should work\");\n }),\n },\n\n {\n name: \"version 0 entry is handled correctly\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"version-0-entry\", makeEntry(0));\n yield* storage.append(\"version-0-entry\", makeEntry(1));\n const entriesFromNeg = yield* storage.getEntries(\"version-0-entry\", -1);\n yield* assertTrue(\n entriesFromNeg.some((e) => e.version === 0),\n \"Version 0 entry should be retrievable with sinceVersion < 0\"\n );\n const entriesFrom0 = yield* storage.getEntries(\"version-0-entry\", 0);\n yield* assertTrue(\n !entriesFrom0.some((e) => e.version === 0),\n \"Version 0 entry should be excluded with sinceVersion = 0\"\n );\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Gap Checking (appendWithCheck)\n // ---------------------------------------------------------------------------\n {\n name: \"appendWithCheck succeeds for first entry (expectedVersion=1)\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntry(1);\n yield* storage.appendWithCheck(\"gap-check-first\", entry, 1);\n const entries = yield* storage.getEntries(\"gap-check-first\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(entries[0]!.version, 1, \"Entry version should be 1\");\n }),\n },\n\n {\n name: \"appendWithCheck succeeds for consecutive versions\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.appendWithCheck(\"gap-check-consecutive\", makeEntry(1), 1);\n yield* storage.appendWithCheck(\"gap-check-consecutive\", makeEntry(2), 2);\n yield* storage.appendWithCheck(\"gap-check-consecutive\", makeEntry(3), 3);\n const entries = yield* storage.getEntries(\"gap-check-consecutive\", 0);\n yield* assertLength(entries, 3, \"Should have three entries\");\n yield* assertEqual(entries[0]!.version, 1, \"First entry version should be 1\");\n yield* assertEqual(entries[1]!.version, 2, \"Second entry version should be 2\");\n yield* assertEqual(entries[2]!.version, 3, \"Third entry version should be 3\");\n }),\n },\n\n {\n name: \"appendWithCheck fails for version gap (skipping version 2)\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.appendWithCheck(\"gap-check-fail\", makeEntry(1), 1);\n // Attempt to append version 3, skipping version 2\n const result = yield* Effect.either(\n storage.appendWithCheck(\"gap-check-fail\", makeEntry(3), 3)\n );\n yield* assertTrue(\n result._tag === \"Left\",\n \"appendWithCheck should fail when there's a version gap\"\n );\n if (result._tag === \"Left\") {\n yield* assertTrue(\n result.left._tag === \"WalVersionGapError\",\n \"Error should be WalVersionGapError\"\n );\n }\n // Verify version 3 was not appended\n const entries = yield* storage.getEntries(\"gap-check-fail\", 0);\n yield* assertLength(entries, 1, \"Should only have version 1\");\n yield* assertEqual(entries[0]!.version, 1, \"Only version 1 should exist\");\n }),\n },\n\n {\n name: \"appendWithCheck fails if first entry is not version 1\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n // Attempt to append version 2 as first entry (expecting gap error)\n const result = yield* Effect.either(\n storage.appendWithCheck(\"gap-check-not-first\", makeEntry(2), 2)\n );\n yield* assertTrue(\n result._tag === \"Left\",\n \"appendWithCheck should fail when first entry is not version 1\"\n );\n if (result._tag === \"Left\") {\n yield* assertTrue(\n result.left._tag === \"WalVersionGapError\",\n \"Error should be WalVersionGapError\"\n );\n }\n // Verify nothing was appended\n const entries = yield* storage.getEntries(\"gap-check-not-first\", 0);\n yield* assertEmpty(entries, \"No entries should exist after failed append\");\n }),\n },\n\n {\n name: \"appendWithCheck fails when entry already exists at expectedVersion\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.appendWithCheck(\"gap-check-duplicate\", makeEntry(1), 1);\n // Attempt to append another version 1\n const result = yield* Effect.either(\n storage.appendWithCheck(\"gap-check-duplicate\", makeEntry(1), 1)\n );\n yield* assertTrue(\n result._tag === \"Left\",\n \"appendWithCheck should fail when version already exists\"\n );\n // Verify still only one entry\n const entries = yield* storage.getEntries(\"gap-check-duplicate\", 0);\n yield* assertLength(entries, 1, \"Should still only have one entry\");\n }),\n },\n\n {\n name: \"appendWithCheck after truncate works correctly\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n // Append versions 1, 2, 3\n yield* storage.appendWithCheck(\"gap-check-truncate\", makeEntry(1), 1);\n yield* storage.appendWithCheck(\"gap-check-truncate\", makeEntry(2), 2);\n yield* storage.appendWithCheck(\"gap-check-truncate\", makeEntry(3), 3);\n // Truncate up to version 2\n yield* storage.truncate(\"gap-check-truncate\", 2);\n // Now append version 4 (should succeed since last entry is version 3)\n yield* storage.appendWithCheck(\"gap-check-truncate\", makeEntry(4), 4);\n const entries = yield* storage.getEntries(\"gap-check-truncate\", 0);\n yield* assertLength(entries, 2, \"Should have versions 3 and 4\");\n yield* assertEqual(entries[0]!.version, 3, \"First should be version 3\");\n yield* assertEqual(entries[1]!.version, 4, \"Second should be version 4\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Transaction Encoding (Critical for OperationPath preservation)\n // ---------------------------------------------------------------------------\n {\n name: \"OperationPath has _tag after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0/name\", \"Alice\");\n yield* storage.append(\"op-path-tag\", entry);\n const entries = yield* storage.getEntries(\"op-path-tag\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n op.path._tag === \"OperationPath\",\n \"path should have _tag 'OperationPath'\"\n );\n }),\n },\n\n {\n name: \"OperationPath.toTokens() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0/name\", \"Alice\");\n yield* storage.append(\"op-path-tokens\", entry);\n const entries = yield* storage.getEntries(\"op-path-tokens\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.toTokens === \"function\",\n \"path.toTokens should be a function\"\n );\n const tokens = op.path.toTokens();\n yield* assertEqual(\n tokens,\n [\"users\", \"0\", \"name\"],\n \"toTokens() should return correct path tokens\"\n );\n }),\n },\n\n {\n name: \"OperationPath.concat() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0\", { name: \"Alice\" });\n yield* storage.append(\"op-path-concat\", entry);\n const entries = yield* storage.getEntries(\"op-path-concat\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.concat === \"function\",\n \"path.concat should be a function\"\n );\n const extended = op.path.concat(OperationPath.make(\"name\"));\n yield* assertEqual(\n extended.toTokens(),\n [\"users\", \"0\", \"name\"],\n \"concat() should work correctly\"\n );\n }),\n },\n\n {\n name: \"OperationPath.append() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users\", []);\n yield* storage.append(\"op-path-append\", entry);\n const entries = yield* storage.getEntries(\"op-path-append\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.append === \"function\",\n \"path.append should be a function\"\n );\n const extended = op.path.append(\"0\");\n yield* assertEqual(\n extended.toTokens(),\n [\"users\", \"0\"],\n \"append() should work correctly\"\n );\n }),\n },\n\n {\n name: \"OperationPath.pop() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0/name\", \"Alice\");\n yield* storage.append(\"op-path-pop\", entry);\n const entries = yield* storage.getEntries(\"op-path-pop\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.pop === \"function\",\n \"path.pop should be a function\"\n );\n const popped = op.path.pop();\n yield* assertEqual(\n popped.toTokens(),\n [\"users\", \"0\"],\n \"pop() should remove last token\"\n );\n }),\n },\n\n {\n name: \"OperationPath.shift() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0/name\", \"Alice\");\n yield* storage.append(\"op-path-shift\", entry);\n const entries = yield* storage.getEntries(\"op-path-shift\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.shift === \"function\",\n \"path.shift should be a function\"\n );\n const shifted = op.path.shift();\n yield* assertEqual(\n shifted.toTokens(),\n [\"0\", \"name\"],\n \"shift() should remove first token\"\n );\n }),\n },\n\n {\n name: \"transaction with multiple operations preserves all OperationPaths\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry: WalEntry = {\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(\"users/0/name\"), TestSetDefinition, \"Alice\"),\n Operation.fromDefinition(OperationPath.make(\"users/1/name\"), TestSetDefinition, \"Bob\"),\n Operation.fromDefinition(OperationPath.make(\"count\"), TestSetDefinition, 2),\n ]),\n version: 1,\n timestamp: Date.now(),\n };\n yield* storage.append(\"multi-op-paths\", entry);\n const entries = yield* storage.getEntries(\"multi-op-paths\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const ops = entries[0]!.transaction.ops;\n yield* assertLength([...ops], 3, \"Should have 3 operations\");\n // Verify all paths have working methods\n for (const op of ops) {\n yield* assertTrue(\n op.path._tag === \"OperationPath\",\n \"Each operation path should have _tag\"\n );\n yield* assertTrue(\n typeof op.path.toTokens === \"function\",\n \"Each operation path should have toTokens method\"\n );\n }\n yield* assertEqual(\n ops[0]!.path.toTokens(),\n [\"users\", \"0\", \"name\"],\n \"First path should be correct\"\n );\n yield* assertEqual(\n ops[1]!.path.toTokens(),\n [\"users\", \"1\", \"name\"],\n \"Second path should be correct\"\n );\n yield* assertEqual(\n ops[2]!.path.toTokens(),\n [\"count\"],\n \"Third path should be correct\"\n );\n }),\n },\n\n {\n name: \"nested path with many segments survives roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const deepPath = \"level1/level2/level3/level4/level5\";\n const entry = makeEntryWithPath(1, deepPath, \"deep value\");\n yield* storage.append(\"deep-path\", entry);\n const entries = yield* storage.getEntries(\"deep-path\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertEqual(\n op.path.toTokens(),\n [\"level1\", \"level2\", \"level3\", \"level4\", \"level5\"],\n \"Deep nested path should survive roundtrip\"\n );\n }),\n },\n\n {\n name: \"empty path survives roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"\", { root: true });\n yield* storage.append(\"empty-path\", entry);\n const entries = yield* storage.getEntries(\"empty-path\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n op.path._tag === \"OperationPath\",\n \"Empty path should still be OperationPath\"\n );\n yield* assertTrue(\n typeof op.path.toTokens === \"function\",\n \"Empty path should have toTokens method\"\n );\n }),\n },\n\n {\n name: \"transaction id is preserved after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"test\", \"value\");\n const originalId = entry.transaction.id;\n yield* storage.append(\"tx-id-preserve\", entry);\n const entries = yield* storage.getEntries(\"tx-id-preserve\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction.id,\n originalId,\n \"Transaction id should be preserved\"\n );\n }),\n },\n\n {\n name: \"transaction timestamp is preserved after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"test\", \"value\");\n const originalTimestamp = entry.transaction.timestamp;\n yield* storage.append(\"tx-timestamp-preserve\", entry);\n const entries = yield* storage.getEntries(\"tx-timestamp-preserve\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction.timestamp,\n originalTimestamp,\n \"Transaction timestamp should be preserved\"\n );\n }),\n },\n\n {\n name: \"operation kind is preserved after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry: WalEntry = {\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(\"data\"), CustomOpDefinition, \"test\"),\n ]),\n version: 1,\n timestamp: Date.now(),\n };\n yield* storage.append(\"op-kind-preserve\", entry);\n const entries = yield* storage.getEntries(\"op-kind-preserve\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction.ops[0]!.kind,\n \"custom.operation\",\n \"Operation kind should be preserved\"\n );\n }),\n },\n\n {\n name: \"operation payload with complex object survives roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const complexPayload = {\n nested: { value: 42, array: [1, 2, 3] },\n nullValue: null,\n string: \"test\",\n };\n const entry = makeEntryWithPath(1, \"data\", complexPayload);\n yield* storage.append(\"complex-payload\", entry);\n const entries = yield* storage.getEntries(\"complex-payload\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction.ops[0]!.payload,\n complexPayload,\n \"Complex payload should survive roundtrip\"\n );\n }),\n },\n];\n\n// =============================================================================\n// Exports\n// =============================================================================\n\n/**\n * Get all HotStorage test cases.\n *\n * @returns Array of test cases that require HotStorageTag\n */\nexport const makeTests = (): StorageTestCase<\n HotStorageTestError,\n HotStorageTag\n>[] => tests;\n\n/**\n * Run all tests and collect results.\n *\n * @returns Effect that produces TestResults\n */\nexport const runAll = (): Effect.Effect<\n TestResults<HotStorageTestError, HotStorageTag>,\n never,\n HotStorageTag\n> =>\n Effect.gen(function* () {\n const passed: StorageTestCase<HotStorageTestError, HotStorageTag>[] = [];\n const failed: Array<{\n test: StorageTestCase<HotStorageTestError, HotStorageTag>;\n error: HotStorageTestError;\n }> = [];\n\n for (const test of tests) {\n const result = yield* Effect.either(test.run);\n if (result._tag === \"Right\") {\n passed.push(test);\n } else {\n failed.push({ test, error: result.left });\n }\n }\n\n return {\n passed,\n failed,\n total: tests.length,\n passCount: passed.length,\n failCount: failed.length,\n };\n });\n\nexport const HotStorageTestSuite = {\n Categories,\n makeTests,\n runAll,\n};\n"],"mappings":";;;;;;;;;;;;;;;;;AAmCA,MAAM,oBAAoB,oBAAoB,KAAK;CACjD,MAAM;CACN,SAAS,OAAO;CAChB,QAAQ,OAAO;CACf,QAAQ,YAAqB;CAC9B,CAAC;;;;AAKF,MAAM,qBAAqB,oBAAoB,KAAK;CAClD,MAAM;CACN,SAAS,OAAO;CAChB,QAAQ,OAAO;CACf,QAAQ,YAAqB;CAC9B,CAAC;AAMF,MAAa,aAAa;CACxB,iBAAiB;CACjB,kBAAkB;CAClB,oBAAoB;CACpB,qBAAqB;CACrB,mBAAmB;CACnB,mBAAmB;CACnB,sBAAsB;CACtB,qBAAqB;CACrB,aAAa;CACb,qBAAqB;CACtB;AAMD,MAAM,aAAa,SAAiB,eAAkC;CACpE,aAAa,YAAY,KAAK,EAAE,CAAC;CACjC;CACA,WAAW,yDAAa,KAAK,KAAK;CACnC;AAED,MAAM,qBACJ,SACA,MACA,eACc;CACd,aAAa,YAAY,KAAK,CAC5B,UAAU,eAAe,cAAc,KAAK,OAAO,EAAE,mBAAmB,KAAK,CAC9E,CAAC;CACF;CACA,WAAW,yDAAa,KAAK,KAAK;CACnC;AAED,MAAM,qBACJ,SACA,YACA,SACA,eACc;CACd,aAAa,YAAY,KAAK,CAC5B,UAAU,eAAe,cAAc,KAAK,WAAW,EAAE,mBAAmB,QAAQ,CACrF,CAAC;CACF;CACA,WAAW,yDAAa,KAAK,KAAK;CACnC;AAMD,MAAMA,QAA+D;CAInE;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;AAG3B,UAAO,YADQ,QADC,OAAO,eACO,WAAW,wBAAwB,EAAE,EACxC,sDAAsD;IACjF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,gBAAgB,MAAM;GAC5C,MAAM,UAAU,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AAC5D,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,6BAA6B;IACxE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AAEnD,UAAO,aADS,OAAO,QAAQ,WAAW,gBAAgB,EAAE,EAC/B,GAAG,4BAA4B;IAC5D;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,kBAAkB,UAAU,EAAE,CAAC;AACrD,UAAO,QAAQ,OAAO,kBAAkB,UAAU,EAAE,CAAC;AACrD,UAAO,QAAQ,OAAO,kBAAkB,UAAU,EAAE,CAAC;AACrD,UAAO,QAAQ,SAAS,kBAAkB,EAAE;GAC5C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,uCAAuC;AACvE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,+BAA+B;IAC1E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;AAE3B,WADgB,OAAO,eACR,SAAS,yBAAyB,IAAI;IACrD;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AAEjD,UAAO,aADS,OAAO,QAAQ,WAAW,cAAc,EAAE,EAC7B,GAAG,2CAA2C;IAC3E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;GAC/C,MAAM,UAAU,OAAO,QAAQ,WAAW,YAAY,EAAE;AACxD,UAAO,aAAa,SAAS,GAAG,yCAAyC;AACzE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,kCAAkC;AAC7E,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,mCAAmC;IAC9E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;GACnD,MAAM,UAAU,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AAC5D,UAAO,aAAa,SAAS,GAAG,2BAA2B;AAC3D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,oCAAoC;IAC/E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AAEjD,UAAO,YADS,OAAO,QAAQ,WAAW,cAAc,EAAE,EAC9B,iDAAiD;IAC7E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,IAAQ,CAAC;AAExD,UAAO,YADS,OAAO,QAAQ,WAAW,eAAe,OAAO,iBAAiB,EACrD,oDAAoD;IAChF;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AAEjD,UAAO,eADS,OAAO,QAAQ,WAAW,cAAc,EAAE,EAC3B,WAAW,sCAAsC;IAChF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;GAC/C,MAAM,UAAU,OAAO,QAAQ,WAAW,YAAY,EAAE;AACxD,UAAO,aAAa,SAAS,GAAG,4BAA4B;AAC5D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;AACvE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,6BAA6B;AACxE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;AACvE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,6BAA6B;IACxE;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,WAAW,UAAU,EAAE,CAAC;AAC9C,UAAO,QAAQ,OAAO,WAAW,UAAU,EAAE,CAAC;AAC9C,UAAO,QAAQ,SAAS,WAAW,EAAE;AAErC,UAAO,aADS,OAAO,QAAQ,WAAW,WAAW,EAAE,EAC1B,GAAG,uDAAuD;IACvF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,SAAS,aAAa,EAAE;AAEvC,UAAO,YADS,OAAO,QAAQ,WAAW,aAAa,EAAE,EAC7B,iDAAiD;IAC7E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,SAAS,aAAa,EAAE;GACvC,MAAM,UAAU,OAAO,QAAQ,WAAW,aAAa,EAAE;AACzD,UAAO,aAAa,SAAS,GAAG,+BAA+B;AAC/D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,8BAA8B;AACzE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,+BAA+B;IAC1E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,SAAS,eAAe,EAAE;AACzC,UAAO,QAAQ,SAAS,eAAe,EAAE;GACzC,MAAM,UAAU,OAAO,QAAQ,WAAW,eAAe,EAAE;AAC3D,UAAO,aAAa,SAAS,GAAG,6BAA6B;AAC7D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,+BAA+B;IAC1E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,SAAS,gBAAgB,EAAE;AAC1C,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;GACnD,MAAM,UAAU,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AAC5D,UAAO,aAAa,SAAS,GAAG,+BAA+B;AAC/D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,oBAAoB;AAC/D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,qBAAqB;IAChE;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG;IAAE,KAAK;IAAS,QAAQ,EAAE,GAAG,GAAG;IAAE,CAAC;AACtE,UAAO,QAAQ,OAAO,WAAW,MAAM;GACvC,MAAM,UAAU,OAAO,QAAQ,WAAW,WAAW,EAAE;AACvD,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,aACZ,MAAM,aACN,0CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,UAAU;GAChB,MAAM,QAAQ,UAAU,QAAQ;AAChC,UAAO,QAAQ,OAAO,oBAAoB,MAAM;AAEhD,UAAO,aADS,OAAO,QAAQ,WAAW,oBAAoB,EAAE,EACrC,GAAI,SAAS,SAAS,sCAAsC;IACvF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,YAAY;GAClB,MAAM,QAAQ,UAAU,GAAG,UAAU;AACrC,UAAO,QAAQ,OAAO,sBAAsB,MAAM;AAElD,UAAO,aADS,OAAO,QAAQ,WAAW,sBAAsB,EAAE,EAExD,GAAI,WACZ,WACA,wCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAMC,QAAkB;IACtB,aAAa,YAAY,KAAK;KAC5B;MAAE,MAAM;MAAO,MAAM,CAAC,IAAI;MAAE,OAAO;MAAG;KACtC;MAAE,MAAM;MAAO,MAAM,CAAC,KAAK,IAAI;MAAE,OAAO;MAAU;KAClD;MAAE,MAAM;MAAO,MAAM,CAAC,MAAM;MAAE,OAAO;OAAC;OAAG;OAAG;OAAE;MAAE;KACjD,CAAC;IACF,SAAS;IACT,WAAW,KAAK,KAAK;IACtB;AACD,UAAO,QAAQ,OAAO,cAAc,MAAM;AAE1C,UAAO,aADS,OAAO,QAAQ,WAAW,cAAc,EAAE,EAEhD,GAAI,aACZ,MAAM,aACN,+CACD;IACD;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,GAAG,CAAC;GACjD,MAAM,WAAW,OAAO,QAAQ,WAAW,aAAa,EAAE;GAC1D,MAAM,WAAW,OAAO,QAAQ,WAAW,aAAa,EAAE;AAC1D,UAAO,aAAa,UAAU,GAAG,8BAA8B;AAC/D,UAAO,aAAa,UAAU,GAAG,4BAA4B;AAC7D,UAAO,YAAY,SAAS,GAAI,SAAS,GAAG,4BAA4B;AACxE,UAAO,YAAY,SAAS,GAAI,SAAS,IAAI,4BAA4B;IACzE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;GACnD,MAAM,eAAe,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AACjE,UAAO,QAAQ,OAAO,gBAAgB,UAAU,IAAI,CAAC;AACrD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,IAAI,CAAC;GACrD,MAAM,cAAc,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AAChE,UAAO,YACL,aAAa,QACb,YAAY,QACZ,6CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,SAAS,eAAe,EAAE;GACzC,MAAM,WAAW,OAAO,QAAQ,WAAW,eAAe,EAAE;GAC5D,MAAM,WAAW,OAAO,QAAQ,WAAW,eAAe,EAAE;AAC5D,UAAO,YAAY,UAAU,uCAAuC;AACpE,UAAO,aAAa,UAAU,GAAG,oCAAoC;IACrE;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ;AACd,QAAK,IAAI,IAAI,GAAG,KAAK,OAAO,IAC1B,QAAO,QAAQ,OAAO,iBAAiB,UAAU,EAAE,CAAC;GAEtD,MAAM,UAAU,OAAO,QAAQ,WAAW,iBAAiB,EAAE;AAC7D,UAAO,aAAa,SAAS,OAAO,eAAe,MAAM,UAAU;AACnE,UAAO,eAAe,SAAS,WAAW,8BAA8B;AACxE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;AACvE,UAAO,YAAY,QAAQ,QAAQ,GAAI,SAAS,OAAO,0BAA0B,QAAQ;IACzF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,WAAW;AACjB,QAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,WAAO,QAAQ,OAAO,aAAa,KAAK,UAAU,EAAE,CAAC;AACrD,WAAO,QAAQ,OAAO,aAAa,KAAK,UAAU,EAAE,CAAC;;GAEvD,IAAI,eAAe;AACnB,QAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK;IACjC,MAAM,UAAU,OAAO,QAAQ,WAAW,aAAa,KAAK,EAAE;AAC9D,oBAAgB,QAAQ;AACxB,WAAO,aAAa,SAAS,GAAG,OAAO,EAAE,wBAAwB;;AAEnE,UAAO,YAAY,cAAc,WAAW,GAAG,6BAA6B;IAC5E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GAEvB,MAAM,QAAQ,kBAAkB,GAAG,EAAE,SADnB,IAAI,OAAO,KAAK,KAAK,EACkB,CAAC;AAC1D,UAAO,QAAQ,OAAO,YAAY,MAAM;GACxC,MAAM,UAAU,OAAO,QAAQ,WAAW,YAAY,EAAE;AACxD,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,aACZ,MAAM,aACN,kDACD;IACD;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,SAAS,IAAI,OAAO,IAAK;GAC/B,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,QAAQ,MAAM;AAEpC,UAAO,aADS,OAAO,QAAQ,WAAW,QAAQ,EAAE,EACvB,GAAG,8BAA8B;IAC9D;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,YAAY;GAClB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,WAAW,MAAM;AAEvC,UAAO,aADS,OAAO,QAAQ,WAAW,WAAW,EAAE,EAC1B,GAAG,iCAAiC;IACjE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,YAAY;GAClB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,WAAW,MAAM;AAEvC,UAAO,aADS,OAAO,QAAQ,WAAW,WAAW,EAAE,EAC1B,GAAG,4CAA4C;IAC5E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,WAAW;GACjB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,UAAU,MAAM;AAEtC,UAAO,aADS,OAAO,QAAQ,WAAW,UAAU,EAAE,EACzB,GAAG,qCAAqC;IACrE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,mBAAmB,UAAU,EAAE,CAAC;AACtD,UAAO,QAAQ,OAAO,mBAAmB,UAAU,EAAE,CAAC;AAEtD,UAAO,YADgB,OAAO,QAAQ,WAAW,mBAAmB,GAAG,EAEtD,MAAM,MAAM,EAAE,YAAY,EAAE,EAC3C,8DACD;AAED,UAAO,WACL,EAFmB,OAAO,QAAQ,WAAW,mBAAmB,EAAE,EAEpD,MAAM,MAAM,EAAE,YAAY,EAAE,EAC1C,2DACD;IACD;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,gBAAgB,mBAAmB,OAAO,EAAE;GAC3D,MAAM,UAAU,OAAO,QAAQ,WAAW,mBAAmB,EAAE;AAC/D,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;IACvE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,gBAAgB,yBAAyB,UAAU,EAAE,EAAE,EAAE;AACxE,UAAO,QAAQ,gBAAgB,yBAAyB,UAAU,EAAE,EAAE,EAAE;AACxE,UAAO,QAAQ,gBAAgB,yBAAyB,UAAU,EAAE,EAAE,EAAE;GACxE,MAAM,UAAU,OAAO,QAAQ,WAAW,yBAAyB,EAAE;AACrE,UAAO,aAAa,SAAS,GAAG,4BAA4B;AAC5D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,kCAAkC;AAC7E,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,mCAAmC;AAC9E,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,kCAAkC;IAC7E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,gBAAgB,kBAAkB,UAAU,EAAE,EAAE,EAAE;GAEjE,MAAM,SAAS,OAAO,OAAO,OAC3B,QAAQ,gBAAgB,kBAAkB,UAAU,EAAE,EAAE,EAAE,CAC3D;AACD,UAAO,WACL,OAAO,SAAS,QAChB,yDACD;AACD,OAAI,OAAO,SAAS,OAClB,QAAO,WACL,OAAO,KAAK,SAAS,sBACrB,qCACD;GAGH,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,6BAA6B;AAC7D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,8BAA8B;IACzE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GAEvB,MAAM,SAAS,OAAO,OAAO,OAC3B,QAAQ,gBAAgB,uBAAuB,UAAU,EAAE,EAAE,EAAE,CAChE;AACD,UAAO,WACL,OAAO,SAAS,QAChB,gEACD;AACD,OAAI,OAAO,SAAS,OAClB,QAAO,WACL,OAAO,KAAK,SAAS,sBACrB,qCACD;AAIH,UAAO,YADS,OAAO,QAAQ,WAAW,uBAAuB,EAAE,EACvC,8CAA8C;IAC1E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,gBAAgB,uBAAuB,UAAU,EAAE,EAAE,EAAE;AAKtE,UAAO,YAHQ,OAAO,OAAO,OAC3B,QAAQ,gBAAgB,uBAAuB,UAAU,EAAE,EAAE,EAAE,CAChE,EAEQ,SAAS,QAChB,0DACD;AAGD,UAAO,aADS,OAAO,QAAQ,WAAW,uBAAuB,EAAE,EACtC,GAAG,mCAAmC;IACnE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AAEvB,UAAO,QAAQ,gBAAgB,sBAAsB,UAAU,EAAE,EAAE,EAAE;AACrE,UAAO,QAAQ,gBAAgB,sBAAsB,UAAU,EAAE,EAAE,EAAE;AACrE,UAAO,QAAQ,gBAAgB,sBAAsB,UAAU,EAAE,EAAE,EAAE;AAErE,UAAO,QAAQ,SAAS,sBAAsB,EAAE;AAEhD,UAAO,QAAQ,gBAAgB,sBAAsB,UAAU,EAAE,EAAE,EAAE;GACrE,MAAM,UAAU,OAAO,QAAQ,WAAW,sBAAsB,EAAE;AAClE,UAAO,aAAa,SAAS,GAAG,+BAA+B;AAC/D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;AACvE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,6BAA6B;IACxE;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,gBAAgB,QAAQ;AAC3D,UAAO,QAAQ,OAAO,eAAe,MAAM;GAC3C,MAAM,UAAU,OAAO,QAAQ,WAAW,eAAe,EAAE;AAC3D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,GAAG,KAAK,SAAS,iBACjB,wCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,gBAAgB,QAAQ;AAC3D,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,aAAa,YAC5B,qCACD;AAED,UAAO,YADQ,GAAG,KAAK,UAAU,EAG/B;IAAC;IAAS;IAAK;IAAO,EACtB,+CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,WAAW,YAC1B,mCACD;AAED,UAAO,YADU,GAAG,KAAK,OAAO,cAAc,KAAK,OAAO,CAAC,CAEhD,UAAU,EACnB;IAAC;IAAS;IAAK;IAAO,EACtB,iCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,SAAS,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,WAAW,YAC1B,mCACD;AAED,UAAO,YADU,GAAG,KAAK,OAAO,IAAI,CAEzB,UAAU,EACnB,CAAC,SAAS,IAAI,EACd,iCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,gBAAgB,QAAQ;AAC3D,UAAO,QAAQ,OAAO,eAAe,MAAM;GAC3C,MAAM,UAAU,OAAO,QAAQ,WAAW,eAAe,EAAE;AAC3D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,QAAQ,YACvB,gCACD;AAED,UAAO,YADQ,GAAG,KAAK,KAAK,CAEnB,UAAU,EACjB,CAAC,SAAS,IAAI,EACd,iCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,gBAAgB,QAAQ;AAC3D,UAAO,QAAQ,OAAO,iBAAiB,MAAM;GAC7C,MAAM,UAAU,OAAO,QAAQ,WAAW,iBAAiB,EAAE;AAC7D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,UAAU,YACzB,kCACD;AAED,UAAO,YADS,GAAG,KAAK,OAAO,CAErB,UAAU,EAClB,CAAC,KAAK,OAAO,EACb,oCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAMA,QAAkB;IACtB,aAAa,YAAY,KAAK;KAC5B,UAAU,eAAe,cAAc,KAAK,eAAe,EAAE,mBAAmB,QAAQ;KACxF,UAAU,eAAe,cAAc,KAAK,eAAe,EAAE,mBAAmB,MAAM;KACtF,UAAU,eAAe,cAAc,KAAK,QAAQ,EAAE,mBAAmB,EAAE;KAC5E,CAAC;IACF,SAAS;IACT,WAAW,KAAK,KAAK;IACtB;AACD,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,MAAM,QAAQ,GAAI,YAAY;AACpC,UAAO,aAAa,CAAC,GAAG,IAAI,EAAE,GAAG,2BAA2B;AAE5D,QAAK,MAAM,MAAM,KAAK;AACpB,WAAO,WACL,GAAG,KAAK,SAAS,iBACjB,uCACD;AACD,WAAO,WACL,OAAO,GAAG,KAAK,aAAa,YAC5B,kDACD;;AAEH,UAAO,YACL,IAAI,GAAI,KAAK,UAAU,EACvB;IAAC;IAAS;IAAK;IAAO,EACtB,+BACD;AACD,UAAO,YACL,IAAI,GAAI,KAAK,UAAU,EACvB;IAAC;IAAS;IAAK;IAAO,EACtB,gCACD;AACD,UAAO,YACL,IAAI,GAAI,KAAK,UAAU,EACvB,CAAC,QAAQ,EACT,+BACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GAEvB,MAAM,QAAQ,kBAAkB,GADf,sCAC4B,aAAa;AAC1D,UAAO,QAAQ,OAAO,aAAa,MAAM;GACzC,MAAM,UAAU,OAAO,QAAQ,WAAW,aAAa,EAAE;AACzD,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,YACL,GAAG,KAAK,UAAU,EAClB;IAAC;IAAU;IAAU;IAAU;IAAU;IAAS,EAClD,4CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,IAAI,EAAE,MAAM,MAAM,CAAC;AACtD,UAAO,QAAQ,OAAO,cAAc,MAAM;GAC1C,MAAM,UAAU,OAAO,QAAQ,WAAW,cAAc,EAAE;AAC1D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,GAAG,KAAK,SAAS,iBACjB,2CACD;AACD,UAAO,WACL,OAAO,GAAG,KAAK,aAAa,YAC5B,yCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,QAAQ,QAAQ;GACnD,MAAM,aAAa,MAAM,YAAY;AACrC,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,YAAY,IACxB,YACA,qCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,QAAQ,QAAQ;GACnD,MAAM,oBAAoB,MAAM,YAAY;AAC5C,UAAO,QAAQ,OAAO,yBAAyB,MAAM;GACrD,MAAM,UAAU,OAAO,QAAQ,WAAW,yBAAyB,EAAE;AACrE,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,YAAY,WACxB,mBACA,4CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAMA,QAAkB;IACtB,aAAa,YAAY,KAAK,CAC5B,UAAU,eAAe,cAAc,KAAK,OAAO,EAAE,oBAAoB,OAAO,CACjF,CAAC;IACF,SAAS;IACT,WAAW,KAAK,KAAK;IACtB;AACD,UAAO,QAAQ,OAAO,oBAAoB,MAAM;GAChD,MAAM,UAAU,OAAO,QAAQ,WAAW,oBAAoB,EAAE;AAChE,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,YAAY,IAAI,GAAI,MAChC,oBACA,qCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,iBAAiB;IACrB,QAAQ;KAAE,OAAO;KAAI,OAAO;MAAC;MAAG;MAAG;MAAE;KAAE;IACvC,WAAW;IACX,QAAQ;IACT;GACD,MAAM,QAAQ,kBAAkB,GAAG,QAAQ,eAAe;AAC1D,UAAO,QAAQ,OAAO,mBAAmB,MAAM;GAC/C,MAAM,UAAU,OAAO,QAAQ,WAAW,mBAAmB,EAAE;AAC/D,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,YAAY,IAAI,GAAI,SAChC,gBACA,2CACD;IACD;EACH;CACF;;;;;;AAWD,MAAa,kBAGN;;;;;;AAOP,MAAa,eAKX,OAAO,IAAI,aAAa;CACtB,MAAMC,SAAgE,EAAE;CACxE,MAAMC,SAGD,EAAE;AAEP,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,OAAO,OAAO,OAAO,KAAK,IAAI;AAC7C,MAAI,OAAO,SAAS,QAClB,QAAO,KAAK,KAAK;MAEjB,QAAO,KAAK;GAAE;GAAM,OAAO,OAAO;GAAM,CAAC;;AAI7C,QAAO;EACL;EACA;EACA,OAAO,MAAM;EACb,WAAW,OAAO;EAClB,WAAW,OAAO;EACnB;EACD;AAEJ,MAAa,sBAAsB;CACjC;CACA;CACA;CACD"}
1
+ {"version":3,"file":"HotStorageTestSuite.mjs","names":["tests: StorageTestCase<HotStorageTestError, HotStorageTag>[]","entry: WalEntry","passed: StorageTestCase<HotStorageTestError, HotStorageTag>[]","failed: Array<{\n test: StorageTestCase<HotStorageTestError, HotStorageTag>;\n error: HotStorageTestError;\n }>"],"sources":["../../src/testing/HotStorageTestSuite.ts"],"sourcesContent":["/**\n * @voidhash/mimic-effect/testing - HotStorage Test Suite\n *\n * Comprehensive test suite for HotStorage (WAL) adapter implementations.\n * These tests verify that an adapter correctly implements the HotStorage interface\n * and can reliably store/retrieve WAL entries for document recovery.\n */\nimport { Effect, Schema } from \"effect\";\nimport { Transaction, OperationPath, Operation, OperationDefinition } from \"@voidhash/mimic\";\nimport { HotStorageTag } from \"../HotStorage\";\nimport { type HotStorageError, WalVersionGapError } from \"../Errors\";\nimport type { WalEntry } from \"../Types\";\nimport type { StorageTestCase, TestResults } from \"./types\";\nimport { TestError } from \"./types\";\nimport {\n assertEqual,\n assertLength,\n assertEmpty,\n assertSortedBy,\n assertTrue,\n} from \"./assertions\";\n\n/**\n * Error type for HotStorage tests - can be either a TestError, HotStorageError, or WalVersionGapError\n */\nexport type HotStorageTestError = TestError | HotStorageError | WalVersionGapError;\n\n// =============================================================================\n// Test Operation Definitions\n// =============================================================================\n\n/**\n * Test operation definition for creating proper Operation objects in tests.\n * Using Schema.Unknown allows any payload type for flexibility in testing.\n */\nconst TestSetDefinition = OperationDefinition.make({\n kind: \"test.set\" as const,\n payload: Schema.Unknown,\n target: Schema.Unknown,\n apply: (payload: unknown) => payload,\n});\n\n/**\n * Custom operation definition for testing operation kind preservation.\n */\nconst CustomOpDefinition = OperationDefinition.make({\n kind: \"custom.operation\" as const,\n payload: Schema.Unknown,\n target: Schema.Unknown,\n apply: (payload: unknown) => payload,\n});\n\n// =============================================================================\n// Categories\n// =============================================================================\n\nexport const Categories = {\n BasicOperations: \"Basic Operations\",\n VersionFiltering: \"Version Filtering\",\n OrderingGuarantees: \"Ordering Guarantees\",\n TruncationEdgeCases: \"Truncation Edge Cases\",\n WalEntryIntegrity: \"WAL Entry Integrity\",\n DocumentIsolation: \"Document Isolation\",\n LargeScaleOperations: \"Large-Scale Operations\",\n DocumentIdEdgeCases: \"Document ID Edge Cases\",\n GapChecking: \"Gap Checking\",\n TransactionEncoding: \"Transaction Encoding\",\n} as const;\n\n// =============================================================================\n// Helper Functions\n// =============================================================================\n\nconst makeEntry = (version: number, timestamp?: number): WalEntry => ({\n transaction: Transaction.make([]),\n version,\n timestamp: timestamp ?? Date.now(),\n});\n\nconst makeEntryWithData = (\n version: number,\n data: unknown,\n timestamp?: number\n): WalEntry => ({\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(\"data\"), TestSetDefinition, data),\n ]),\n version,\n timestamp: timestamp ?? Date.now(),\n});\n\nconst makeEntryWithPath = (\n version: number,\n pathString: string,\n payload: unknown,\n timestamp?: number\n): WalEntry => ({\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(pathString), TestSetDefinition, payload),\n ]),\n version,\n timestamp: timestamp ?? Date.now(),\n});\n\n// =============================================================================\n// Test Definitions\n// =============================================================================\n\nconst tests: StorageTestCase<HotStorageTestError, HotStorageTag>[] = [\n // ---------------------------------------------------------------------------\n // Basic Operations\n // ---------------------------------------------------------------------------\n {\n name: \"getEntries returns empty array for non-existent document\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const result = yield* storage.getEntries(\"non-existent-hot-doc\", 0);\n yield* assertEmpty(result, \"Should return empty array for non-existent document\");\n }),\n },\n\n {\n name: \"append then getEntries returns the entry\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntry(1);\n yield* storage.append(\"basic-append\", entry);\n const entries = yield* storage.getEntries(\"basic-append\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(entries[0]!.version, 1, \"Entry version should match\");\n }),\n },\n\n {\n name: \"multiple append calls accumulate entries\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"multi-append\", makeEntry(1));\n yield* storage.append(\"multi-append\", makeEntry(2));\n yield* storage.append(\"multi-append\", makeEntry(3));\n const entries = yield* storage.getEntries(\"multi-append\", 0);\n yield* assertLength(entries, 3, \"Should have three entries\");\n }),\n },\n\n {\n name: \"truncate removes entries with version <= upToVersion\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"truncate-basic\", makeEntry(1));\n yield* storage.append(\"truncate-basic\", makeEntry(2));\n yield* storage.append(\"truncate-basic\", makeEntry(3));\n yield* storage.truncate(\"truncate-basic\", 2);\n const entries = yield* storage.getEntries(\"truncate-basic\", 0);\n yield* assertLength(entries, 1, \"Should have one entry after truncate\");\n yield* assertEqual(entries[0]!.version, 3, \"Only version 3 should remain\");\n }),\n },\n\n {\n name: \"truncate on non-existent document does not error\",\n category: Categories.BasicOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.truncate(\"non-existent-truncate\", 100);\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Version Filtering (Critical for Recovery)\n // ---------------------------------------------------------------------------\n {\n name: \"getEntries(doc, 0) returns all entries\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-all\", makeEntry(1));\n yield* storage.append(\"filter-all\", makeEntry(2));\n yield* storage.append(\"filter-all\", makeEntry(3));\n const entries = yield* storage.getEntries(\"filter-all\", 0);\n yield* assertLength(entries, 3, \"sinceVersion=0 should return all entries\");\n }),\n },\n\n {\n name: \"getEntries(doc, n) returns only entries with version > n\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-n\", makeEntry(1));\n yield* storage.append(\"filter-n\", makeEntry(2));\n yield* storage.append(\"filter-n\", makeEntry(3));\n yield* storage.append(\"filter-n\", makeEntry(4));\n const entries = yield* storage.getEntries(\"filter-n\", 2);\n yield* assertLength(entries, 2, \"Should return entries with version > 2\");\n yield* assertEqual(entries[0]!.version, 3, \"First entry should be version 3\");\n yield* assertEqual(entries[1]!.version, 4, \"Second entry should be version 4\");\n }),\n },\n\n {\n name: \"getEntries(doc, exactVersion) excludes that exact version\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-exact\", makeEntry(5));\n yield* storage.append(\"filter-exact\", makeEntry(6));\n yield* storage.append(\"filter-exact\", makeEntry(7));\n const entries = yield* storage.getEntries(\"filter-exact\", 6);\n yield* assertLength(entries, 1, \"Should exclude version 6\");\n yield* assertEqual(entries[0]!.version, 7, \"Only version 7 should be returned\");\n }),\n },\n\n {\n name: \"getEntries(doc, maxVersion) returns empty array\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-max\", makeEntry(1));\n yield* storage.append(\"filter-max\", makeEntry(2));\n yield* storage.append(\"filter-max\", makeEntry(3));\n const entries = yield* storage.getEntries(\"filter-max\", 3);\n yield* assertEmpty(entries, \"sinceVersion >= maxVersion should return empty\");\n }),\n },\n\n {\n name: \"getEntries(doc, MAX_SAFE_INTEGER) returns empty array\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"filter-huge\", makeEntry(1));\n yield* storage.append(\"filter-huge\", makeEntry(1000000));\n const entries = yield* storage.getEntries(\"filter-huge\", Number.MAX_SAFE_INTEGER);\n yield* assertEmpty(entries, \"sinceVersion=MAX_SAFE_INTEGER should return empty\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Ordering Guarantees\n // ---------------------------------------------------------------------------\n {\n name: \"entries returned sorted by version ascending\",\n category: Categories.OrderingGuarantees,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"order-test\", makeEntry(1));\n yield* storage.append(\"order-test\", makeEntry(2));\n yield* storage.append(\"order-test\", makeEntry(3));\n const entries = yield* storage.getEntries(\"order-test\", 0);\n yield* assertSortedBy(entries, \"version\", \"Entries should be sorted by version\");\n }),\n },\n\n {\n name: \"out-of-order appends are sorted correctly on retrieval\",\n category: Categories.OrderingGuarantees,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"ooo-test\", makeEntry(3));\n yield* storage.append(\"ooo-test\", makeEntry(1));\n yield* storage.append(\"ooo-test\", makeEntry(4));\n yield* storage.append(\"ooo-test\", makeEntry(2));\n const entries = yield* storage.getEntries(\"ooo-test\", 0);\n yield* assertLength(entries, 4, \"Should have all 4 entries\");\n yield* assertEqual(entries[0]!.version, 1, \"First should be version 1\");\n yield* assertEqual(entries[1]!.version, 2, \"Second should be version 2\");\n yield* assertEqual(entries[2]!.version, 3, \"Third should be version 3\");\n yield* assertEqual(entries[3]!.version, 4, \"Fourth should be version 4\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Truncation Edge Cases\n // ---------------------------------------------------------------------------\n {\n name: \"truncate(doc, 0) removes nothing (versions > 0 kept)\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-0\", makeEntry(1));\n yield* storage.append(\"trunc-0\", makeEntry(2));\n yield* storage.truncate(\"trunc-0\", 0);\n const entries = yield* storage.getEntries(\"trunc-0\", 0);\n yield* assertLength(entries, 2, \"truncate(0) should keep all entries with version > 0\");\n }),\n },\n\n {\n name: \"truncate(doc, maxVersion) removes all entries\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-all\", makeEntry(1));\n yield* storage.append(\"trunc-all\", makeEntry(2));\n yield* storage.append(\"trunc-all\", makeEntry(3));\n yield* storage.truncate(\"trunc-all\", 3);\n const entries = yield* storage.getEntries(\"trunc-all\", 0);\n yield* assertEmpty(entries, \"truncate(maxVersion) should remove all entries\");\n }),\n },\n\n {\n name: \"truncate(doc, middleVersion) removes correct entries\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-mid\", makeEntry(1));\n yield* storage.append(\"trunc-mid\", makeEntry(2));\n yield* storage.append(\"trunc-mid\", makeEntry(3));\n yield* storage.append(\"trunc-mid\", makeEntry(4));\n yield* storage.append(\"trunc-mid\", makeEntry(5));\n yield* storage.truncate(\"trunc-mid\", 3);\n const entries = yield* storage.getEntries(\"trunc-mid\", 0);\n yield* assertLength(entries, 2, \"Should keep versions 4 and 5\");\n yield* assertEqual(entries[0]!.version, 4, \"First remaining should be 4\");\n yield* assertEqual(entries[1]!.version, 5, \"Second remaining should be 5\");\n }),\n },\n\n {\n name: \"multiple truncates work correctly\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"multi-trunc\", makeEntry(1));\n yield* storage.append(\"multi-trunc\", makeEntry(2));\n yield* storage.append(\"multi-trunc\", makeEntry(3));\n yield* storage.append(\"multi-trunc\", makeEntry(4));\n yield* storage.append(\"multi-trunc\", makeEntry(5));\n yield* storage.truncate(\"multi-trunc\", 2);\n yield* storage.truncate(\"multi-trunc\", 4);\n const entries = yield* storage.getEntries(\"multi-trunc\", 0);\n yield* assertLength(entries, 1, \"Should only have version 5\");\n yield* assertEqual(entries[0]!.version, 5, \"Only version 5 should remain\");\n }),\n },\n\n {\n name: \"truncate followed by append works correctly\",\n category: Categories.TruncationEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-append\", makeEntry(1));\n yield* storage.append(\"trunc-append\", makeEntry(2));\n yield* storage.truncate(\"trunc-append\", 2);\n yield* storage.append(\"trunc-append\", makeEntry(3));\n yield* storage.append(\"trunc-append\", makeEntry(4));\n const entries = yield* storage.getEntries(\"trunc-append\", 0);\n yield* assertLength(entries, 2, \"Should have versions 3 and 4\");\n yield* assertEqual(entries[0]!.version, 3, \"First should be 3\");\n yield* assertEqual(entries[1]!.version, 4, \"Second should be 4\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // WAL Entry Data Integrity\n // ---------------------------------------------------------------------------\n {\n name: \"transaction data is preserved exactly\",\n category: Categories.WalEntryIntegrity,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithData(1, { key: \"value\", nested: { a: 1 } });\n yield* storage.append(\"tx-data\", entry);\n const entries = yield* storage.getEntries(\"tx-data\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction,\n entry.transaction,\n \"Transaction should be preserved exactly\"\n );\n }),\n },\n\n {\n name: \"version number is preserved exactly\",\n category: Categories.WalEntryIntegrity,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const version = 42;\n const entry = makeEntry(version);\n yield* storage.append(\"version-preserve\", entry);\n const entries = yield* storage.getEntries(\"version-preserve\", 0);\n yield* assertEqual(entries[0]!.version, version, \"Version should be preserved exactly\");\n }),\n },\n\n {\n name: \"timestamp is preserved exactly\",\n category: Categories.WalEntryIntegrity,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const timestamp = 1704067200000;\n const entry = makeEntry(1, timestamp);\n yield* storage.append(\"timestamp-preserve\", entry);\n const entries = yield* storage.getEntries(\"timestamp-preserve\", 0);\n yield* assertEqual(\n entries[0]!.timestamp,\n timestamp,\n \"Timestamp should be preserved exactly\"\n );\n }),\n },\n\n {\n name: \"complex transaction operations survive roundtrip\",\n category: Categories.WalEntryIntegrity,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry: WalEntry = {\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(\"a\"), TestSetDefinition, 1),\n Operation.fromDefinition(OperationPath.make(\"b/c\"), TestSetDefinition, \"nested\"),\n Operation.fromDefinition(OperationPath.make(\"arr\"), TestSetDefinition, [1, 2, 3]),\n ]),\n version: 1,\n timestamp: Date.now(),\n };\n yield* storage.append(\"complex-tx\", entry);\n const entries = yield* storage.getEntries(\"complex-tx\", 0);\n yield* assertEqual(\n entries[0]!.transaction,\n entry.transaction,\n \"Complex transaction should survive roundtrip\"\n );\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Document Isolation\n // ---------------------------------------------------------------------------\n {\n name: \"different documents have independent entry lists\",\n category: Categories.DocumentIsolation,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"iso-hot-1\", makeEntry(1));\n yield* storage.append(\"iso-hot-1\", makeEntry(2));\n yield* storage.append(\"iso-hot-2\", makeEntry(10));\n const entries1 = yield* storage.getEntries(\"iso-hot-1\", 0);\n const entries2 = yield* storage.getEntries(\"iso-hot-2\", 0);\n yield* assertLength(entries1, 2, \"Doc 1 should have 2 entries\");\n yield* assertLength(entries2, 1, \"Doc 2 should have 1 entry\");\n yield* assertEqual(entries1[0]!.version, 1, \"Doc 1 first entry version\");\n yield* assertEqual(entries2[0]!.version, 10, \"Doc 2 first entry version\");\n }),\n },\n\n {\n name: \"appending to one doc does not affect others\",\n category: Categories.DocumentIsolation,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"append-iso-1\", makeEntry(1));\n const beforeAppend = yield* storage.getEntries(\"append-iso-1\", 0);\n yield* storage.append(\"append-iso-2\", makeEntry(100));\n yield* storage.append(\"append-iso-2\", makeEntry(101));\n const afterAppend = yield* storage.getEntries(\"append-iso-1\", 0);\n yield* assertEqual(\n beforeAppend.length,\n afterAppend.length,\n \"Appending to doc 2 should not affect doc 1\"\n );\n }),\n },\n\n {\n name: \"truncating one doc does not affect others\",\n category: Categories.DocumentIsolation,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"trunc-iso-1\", makeEntry(1));\n yield* storage.append(\"trunc-iso-1\", makeEntry(2));\n yield* storage.append(\"trunc-iso-2\", makeEntry(1));\n yield* storage.append(\"trunc-iso-2\", makeEntry(2));\n yield* storage.truncate(\"trunc-iso-1\", 2);\n const entries1 = yield* storage.getEntries(\"trunc-iso-1\", 0);\n const entries2 = yield* storage.getEntries(\"trunc-iso-2\", 0);\n yield* assertEmpty(entries1, \"Doc 1 should be empty after truncate\");\n yield* assertLength(entries2, 2, \"Doc 2 should still have 2 entries\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Large-Scale Operations\n // ---------------------------------------------------------------------------\n {\n name: \"handle 1000+ entries per document\",\n category: Categories.LargeScaleOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const count = 1000;\n for (let i = 1; i <= count; i++) {\n yield* storage.append(\"large-entries\", makeEntry(i));\n }\n const entries = yield* storage.getEntries(\"large-entries\", 0);\n yield* assertLength(entries, count, `Should have ${count} entries`);\n yield* assertSortedBy(entries, \"version\", \"Should be sorted by version\");\n yield* assertEqual(entries[0]!.version, 1, \"First should be version 1\");\n yield* assertEqual(entries[count - 1]!.version, count, `Last should be version ${count}`);\n }),\n },\n\n {\n name: \"handle 100+ documents\",\n category: Categories.LargeScaleOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const docCount = 100;\n for (let i = 0; i < docCount; i++) {\n yield* storage.append(`multi-doc-${i}`, makeEntry(1));\n yield* storage.append(`multi-doc-${i}`, makeEntry(2));\n }\n let totalEntries = 0;\n for (let i = 0; i < docCount; i++) {\n const entries = yield* storage.getEntries(`multi-doc-${i}`, 0);\n totalEntries += entries.length;\n yield* assertLength(entries, 2, `Doc ${i} should have 2 entries`);\n }\n yield* assertEqual(totalEntries, docCount * 2, \"Total entries should match\");\n }),\n },\n\n {\n name: \"large transaction data (10KB+) survives roundtrip\",\n category: Categories.LargeScaleOperations,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const largeData = \"x\".repeat(10 * 1024);\n const entry = makeEntryWithData(1, { content: largeData });\n yield* storage.append(\"large-tx\", entry);\n const entries = yield* storage.getEntries(\"large-tx\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction,\n entry.transaction,\n \"Large transaction data should survive roundtrip\"\n );\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Document ID Edge Cases\n // ---------------------------------------------------------------------------\n {\n name: \"long documentId (1000+ chars) works\",\n category: Categories.DocumentIdEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const longId = \"h\".repeat(1000);\n const entry = makeEntry(1);\n yield* storage.append(longId, entry);\n const entries = yield* storage.getEntries(longId, 0);\n yield* assertLength(entries, 1, \"Long documentId should work\");\n }),\n },\n\n {\n name: \"unicode documentId works\",\n category: Categories.DocumentIdEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const unicodeId = \"hot-doc-id\";\n const entry = makeEntry(1);\n yield* storage.append(unicodeId, entry);\n const entries = yield* storage.getEntries(unicodeId, 0);\n yield* assertLength(entries, 1, \"Unicode documentId should work\");\n }),\n },\n\n {\n name: \"documentId with special chars works\",\n category: Categories.DocumentIdEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const specialId = \"hot/path:to.wal\";\n const entry = makeEntry(1);\n yield* storage.append(specialId, entry);\n const entries = yield* storage.getEntries(specialId, 0);\n yield* assertLength(entries, 1, \"DocumentId with special chars should work\");\n }),\n },\n\n {\n name: \"documentId with spaces works\",\n category: Categories.DocumentIdEdgeCases,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const spacedId = \"hot doc with spaces\";\n const entry = makeEntry(1);\n yield* storage.append(spacedId, entry);\n const entries = yield* storage.getEntries(spacedId, 0);\n yield* assertLength(entries, 1, \"DocumentId with spaces should work\");\n }),\n },\n\n {\n name: \"version 0 entry is handled correctly\",\n category: Categories.VersionFiltering,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.append(\"version-0-entry\", makeEntry(0));\n yield* storage.append(\"version-0-entry\", makeEntry(1));\n const entriesFromNeg = yield* storage.getEntries(\"version-0-entry\", -1);\n yield* assertTrue(\n entriesFromNeg.some((e) => e.version === 0),\n \"Version 0 entry should be retrievable with sinceVersion < 0\"\n );\n const entriesFrom0 = yield* storage.getEntries(\"version-0-entry\", 0);\n yield* assertTrue(\n !entriesFrom0.some((e) => e.version === 0),\n \"Version 0 entry should be excluded with sinceVersion = 0\"\n );\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Gap Checking (appendWithCheck)\n // ---------------------------------------------------------------------------\n {\n name: \"appendWithCheck succeeds for first entry (expectedVersion=1)\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntry(1);\n yield* storage.appendWithCheck(\"gap-check-first\", entry, 1);\n const entries = yield* storage.getEntries(\"gap-check-first\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(entries[0]!.version, 1, \"Entry version should be 1\");\n }),\n },\n\n {\n name: \"appendWithCheck succeeds for consecutive versions\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.appendWithCheck(\"gap-check-consecutive\", makeEntry(1), 1);\n yield* storage.appendWithCheck(\"gap-check-consecutive\", makeEntry(2), 2);\n yield* storage.appendWithCheck(\"gap-check-consecutive\", makeEntry(3), 3);\n const entries = yield* storage.getEntries(\"gap-check-consecutive\", 0);\n yield* assertLength(entries, 3, \"Should have three entries\");\n yield* assertEqual(entries[0]!.version, 1, \"First entry version should be 1\");\n yield* assertEqual(entries[1]!.version, 2, \"Second entry version should be 2\");\n yield* assertEqual(entries[2]!.version, 3, \"Third entry version should be 3\");\n }),\n },\n\n {\n name: \"appendWithCheck fails for version gap (skipping version 2)\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.appendWithCheck(\"gap-check-fail\", makeEntry(1), 1);\n // Attempt to append version 3, skipping version 2\n const result = yield* Effect.either(\n storage.appendWithCheck(\"gap-check-fail\", makeEntry(3), 3)\n );\n yield* assertTrue(\n result._tag === \"Left\",\n \"appendWithCheck should fail when there's a version gap\"\n );\n if (result._tag === \"Left\") {\n yield* assertTrue(\n result.left._tag === \"WalVersionGapError\",\n \"Error should be WalVersionGapError\"\n );\n }\n // Verify version 3 was not appended\n const entries = yield* storage.getEntries(\"gap-check-fail\", 0);\n yield* assertLength(entries, 1, \"Should only have version 1\");\n yield* assertEqual(entries[0]!.version, 1, \"Only version 1 should exist\");\n }),\n },\n\n {\n name: \"appendWithCheck fails if first entry is not version 1\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n // Attempt to append version 2 as first entry (expecting gap error)\n const result = yield* Effect.either(\n storage.appendWithCheck(\"gap-check-not-first\", makeEntry(2), 2)\n );\n yield* assertTrue(\n result._tag === \"Left\",\n \"appendWithCheck should fail when first entry is not version 1\"\n );\n if (result._tag === \"Left\") {\n yield* assertTrue(\n result.left._tag === \"WalVersionGapError\",\n \"Error should be WalVersionGapError\"\n );\n }\n // Verify nothing was appended\n const entries = yield* storage.getEntries(\"gap-check-not-first\", 0);\n yield* assertEmpty(entries, \"No entries should exist after failed append\");\n }),\n },\n\n {\n name: \"appendWithCheck fails when entry already exists at expectedVersion\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n yield* storage.appendWithCheck(\"gap-check-duplicate\", makeEntry(1), 1);\n // Attempt to append another version 1\n const result = yield* Effect.either(\n storage.appendWithCheck(\"gap-check-duplicate\", makeEntry(1), 1)\n );\n yield* assertTrue(\n result._tag === \"Left\",\n \"appendWithCheck should fail when version already exists\"\n );\n // Verify still only one entry\n const entries = yield* storage.getEntries(\"gap-check-duplicate\", 0);\n yield* assertLength(entries, 1, \"Should still only have one entry\");\n }),\n },\n\n {\n name: \"appendWithCheck after truncate works correctly\",\n category: Categories.GapChecking,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n // Append versions 1, 2, 3\n yield* storage.appendWithCheck(\"gap-check-truncate\", makeEntry(1), 1);\n yield* storage.appendWithCheck(\"gap-check-truncate\", makeEntry(2), 2);\n yield* storage.appendWithCheck(\"gap-check-truncate\", makeEntry(3), 3);\n // Truncate up to version 2\n yield* storage.truncate(\"gap-check-truncate\", 2);\n // Now append version 4 (should succeed since last entry is version 3)\n yield* storage.appendWithCheck(\"gap-check-truncate\", makeEntry(4), 4);\n const entries = yield* storage.getEntries(\"gap-check-truncate\", 0);\n yield* assertLength(entries, 2, \"Should have versions 3 and 4\");\n yield* assertEqual(entries[0]!.version, 3, \"First should be version 3\");\n yield* assertEqual(entries[1]!.version, 4, \"Second should be version 4\");\n }),\n },\n\n // ---------------------------------------------------------------------------\n // Transaction Encoding (Critical for OperationPath preservation)\n // ---------------------------------------------------------------------------\n {\n name: \"OperationPath has _tag after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0/name\", \"Alice\");\n yield* storage.append(\"op-path-tag\", entry);\n const entries = yield* storage.getEntries(\"op-path-tag\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n op.path._tag === \"OperationPath\",\n \"path should have _tag 'OperationPath'\"\n );\n }),\n },\n\n {\n name: \"OperationPath.toTokens() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0/name\", \"Alice\");\n yield* storage.append(\"op-path-tokens\", entry);\n const entries = yield* storage.getEntries(\"op-path-tokens\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.toTokens === \"function\",\n \"path.toTokens should be a function\"\n );\n const tokens = op.path.toTokens();\n yield* assertEqual(\n tokens,\n [\"users\", \"0\", \"name\"],\n \"toTokens() should return correct path tokens\"\n );\n }),\n },\n\n {\n name: \"OperationPath.concat() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0\", { name: \"Alice\" });\n yield* storage.append(\"op-path-concat\", entry);\n const entries = yield* storage.getEntries(\"op-path-concat\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.concat === \"function\",\n \"path.concat should be a function\"\n );\n const extended = op.path.concat(OperationPath.make(\"name\"));\n yield* assertEqual(\n extended.toTokens(),\n [\"users\", \"0\", \"name\"],\n \"concat() should work correctly\"\n );\n }),\n },\n\n {\n name: \"OperationPath.append() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users\", []);\n yield* storage.append(\"op-path-append\", entry);\n const entries = yield* storage.getEntries(\"op-path-append\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.append === \"function\",\n \"path.append should be a function\"\n );\n const extended = op.path.append(\"0\");\n yield* assertEqual(\n extended.toTokens(),\n [\"users\", \"0\"],\n \"append() should work correctly\"\n );\n }),\n },\n\n {\n name: \"OperationPath.pop() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0/name\", \"Alice\");\n yield* storage.append(\"op-path-pop\", entry);\n const entries = yield* storage.getEntries(\"op-path-pop\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.pop === \"function\",\n \"path.pop should be a function\"\n );\n const popped = op.path.pop();\n yield* assertEqual(\n popped.toTokens(),\n [\"users\", \"0\"],\n \"pop() should remove last token\"\n );\n }),\n },\n\n {\n name: \"OperationPath.shift() works after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"users/0/name\", \"Alice\");\n yield* storage.append(\"op-path-shift\", entry);\n const entries = yield* storage.getEntries(\"op-path-shift\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n typeof op.path.shift === \"function\",\n \"path.shift should be a function\"\n );\n const shifted = op.path.shift();\n yield* assertEqual(\n shifted.toTokens(),\n [\"0\", \"name\"],\n \"shift() should remove first token\"\n );\n }),\n },\n\n {\n name: \"transaction with multiple operations preserves all OperationPaths\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry: WalEntry = {\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(\"users/0/name\"), TestSetDefinition, \"Alice\"),\n Operation.fromDefinition(OperationPath.make(\"users/1/name\"), TestSetDefinition, \"Bob\"),\n Operation.fromDefinition(OperationPath.make(\"count\"), TestSetDefinition, 2),\n ]),\n version: 1,\n timestamp: Date.now(),\n };\n yield* storage.append(\"multi-op-paths\", entry);\n const entries = yield* storage.getEntries(\"multi-op-paths\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const ops = entries[0]!.transaction.ops;\n yield* assertLength([...ops], 3, \"Should have 3 operations\");\n // Verify all paths have working methods\n for (const op of ops) {\n yield* assertTrue(\n op.path._tag === \"OperationPath\",\n \"Each operation path should have _tag\"\n );\n yield* assertTrue(\n typeof op.path.toTokens === \"function\",\n \"Each operation path should have toTokens method\"\n );\n }\n yield* assertEqual(\n ops[0]!.path.toTokens(),\n [\"users\", \"0\", \"name\"],\n \"First path should be correct\"\n );\n yield* assertEqual(\n ops[1]!.path.toTokens(),\n [\"users\", \"1\", \"name\"],\n \"Second path should be correct\"\n );\n yield* assertEqual(\n ops[2]!.path.toTokens(),\n [\"count\"],\n \"Third path should be correct\"\n );\n }),\n },\n\n {\n name: \"nested path with many segments survives roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const deepPath = \"level1/level2/level3/level4/level5\";\n const entry = makeEntryWithPath(1, deepPath, \"deep value\");\n yield* storage.append(\"deep-path\", entry);\n const entries = yield* storage.getEntries(\"deep-path\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertEqual(\n op.path.toTokens(),\n [\"level1\", \"level2\", \"level3\", \"level4\", \"level5\"],\n \"Deep nested path should survive roundtrip\"\n );\n }),\n },\n\n {\n name: \"empty path survives roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"\", { root: true });\n yield* storage.append(\"empty-path\", entry);\n const entries = yield* storage.getEntries(\"empty-path\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n const op = entries[0]!.transaction.ops[0]!;\n yield* assertTrue(\n op.path._tag === \"OperationPath\",\n \"Empty path should still be OperationPath\"\n );\n yield* assertTrue(\n typeof op.path.toTokens === \"function\",\n \"Empty path should have toTokens method\"\n );\n }),\n },\n\n {\n name: \"transaction id is preserved after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"test\", \"value\");\n const originalId = entry.transaction.id;\n yield* storage.append(\"tx-id-preserve\", entry);\n const entries = yield* storage.getEntries(\"tx-id-preserve\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction.id,\n originalId,\n \"Transaction id should be preserved\"\n );\n }),\n },\n\n {\n name: \"transaction timestamp is preserved after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry = makeEntryWithPath(1, \"test\", \"value\");\n const originalTimestamp = entry.transaction.timestamp;\n yield* storage.append(\"tx-timestamp-preserve\", entry);\n const entries = yield* storage.getEntries(\"tx-timestamp-preserve\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction.timestamp,\n originalTimestamp,\n \"Transaction timestamp should be preserved\"\n );\n }),\n },\n\n {\n name: \"operation kind is preserved after roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const entry: WalEntry = {\n transaction: Transaction.make([\n Operation.fromDefinition(OperationPath.make(\"data\"), CustomOpDefinition, \"test\"),\n ]),\n version: 1,\n timestamp: Date.now(),\n };\n yield* storage.append(\"op-kind-preserve\", entry);\n const entries = yield* storage.getEntries(\"op-kind-preserve\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction.ops[0]!.kind,\n \"custom.operation\",\n \"Operation kind should be preserved\"\n );\n }),\n },\n\n {\n name: \"operation payload with complex object survives roundtrip\",\n category: Categories.TransactionEncoding,\n run: Effect.gen(function* () {\n const storage = yield* HotStorageTag;\n const complexPayload = {\n nested: { value: 42, array: [1, 2, 3] },\n nullValue: null,\n string: \"test\",\n };\n const entry = makeEntryWithPath(1, \"data\", complexPayload);\n yield* storage.append(\"complex-payload\", entry);\n const entries = yield* storage.getEntries(\"complex-payload\", 0);\n yield* assertLength(entries, 1, \"Should have one entry\");\n yield* assertEqual(\n entries[0]!.transaction.ops[0]!.payload,\n complexPayload,\n \"Complex payload should survive roundtrip\"\n );\n }),\n },\n];\n\n// =============================================================================\n// Exports\n// =============================================================================\n\n/**\n * Get all HotStorage test cases.\n *\n * @returns Array of test cases that require HotStorageTag\n */\nexport const makeTests = (): StorageTestCase<\n HotStorageTestError,\n HotStorageTag\n>[] => tests;\n\n/**\n * Run all tests and collect results.\n *\n * @returns Effect that produces TestResults\n */\nexport const runAll = (): Effect.Effect<\n TestResults<HotStorageTestError, HotStorageTag>,\n never,\n HotStorageTag\n> =>\n Effect.gen(function* () {\n const passed: StorageTestCase<HotStorageTestError, HotStorageTag>[] = [];\n const failed: Array<{\n test: StorageTestCase<HotStorageTestError, HotStorageTag>;\n error: HotStorageTestError;\n }> = [];\n\n for (const test of tests) {\n const result = yield* Effect.either(test.run);\n if (result._tag === \"Right\") {\n passed.push(test);\n } else {\n failed.push({ test, error: result.left });\n }\n }\n\n return {\n passed,\n failed,\n total: tests.length,\n passCount: passed.length,\n failCount: failed.length,\n };\n });\n\nexport const HotStorageTestSuite = {\n Categories,\n makeTests,\n runAll,\n};\n"],"mappings":";;;;;;;;;;;;;;;;;AAmCA,MAAM,oBAAoB,oBAAoB,KAAK;CACjD,MAAM;CACN,SAAS,OAAO;CAChB,QAAQ,OAAO;CACf,QAAQ,YAAqB;CAC9B,CAAC;;;;AAKF,MAAM,qBAAqB,oBAAoB,KAAK;CAClD,MAAM;CACN,SAAS,OAAO;CAChB,QAAQ,OAAO;CACf,QAAQ,YAAqB;CAC9B,CAAC;AAMF,MAAa,aAAa;CACxB,iBAAiB;CACjB,kBAAkB;CAClB,oBAAoB;CACpB,qBAAqB;CACrB,mBAAmB;CACnB,mBAAmB;CACnB,sBAAsB;CACtB,qBAAqB;CACrB,aAAa;CACb,qBAAqB;CACtB;AAMD,MAAM,aAAa,SAAiB,eAAkC;CACpE,aAAa,YAAY,KAAK,EAAE,CAAC;CACjC;CACA,WAAW,yDAAa,KAAK,KAAK;CACnC;AAED,MAAM,qBACJ,SACA,MACA,eACc;CACd,aAAa,YAAY,KAAK,CAC5B,UAAU,eAAe,cAAc,KAAK,OAAO,EAAE,mBAAmB,KAAK,CAC9E,CAAC;CACF;CACA,WAAW,yDAAa,KAAK,KAAK;CACnC;AAED,MAAM,qBACJ,SACA,YACA,SACA,eACc;CACd,aAAa,YAAY,KAAK,CAC5B,UAAU,eAAe,cAAc,KAAK,WAAW,EAAE,mBAAmB,QAAQ,CACrF,CAAC;CACF;CACA,WAAW,yDAAa,KAAK,KAAK;CACnC;AAMD,MAAMA,QAA+D;CAInE;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;AAG3B,UAAO,YADQ,QADC,OAAO,eACO,WAAW,wBAAwB,EAAE,EACxC,sDAAsD;IACjF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,gBAAgB,MAAM;GAC5C,MAAM,UAAU,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AAC5D,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,6BAA6B;IACxE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AAEnD,UAAO,aADS,OAAO,QAAQ,WAAW,gBAAgB,EAAE,EAC/B,GAAG,4BAA4B;IAC5D;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,kBAAkB,UAAU,EAAE,CAAC;AACrD,UAAO,QAAQ,OAAO,kBAAkB,UAAU,EAAE,CAAC;AACrD,UAAO,QAAQ,OAAO,kBAAkB,UAAU,EAAE,CAAC;AACrD,UAAO,QAAQ,SAAS,kBAAkB,EAAE;GAC5C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,uCAAuC;AACvE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,+BAA+B;IAC1E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;AAE3B,WADgB,OAAO,eACR,SAAS,yBAAyB,IAAI;IACrD;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AAEjD,UAAO,aADS,OAAO,QAAQ,WAAW,cAAc,EAAE,EAC7B,GAAG,2CAA2C;IAC3E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;GAC/C,MAAM,UAAU,OAAO,QAAQ,WAAW,YAAY,EAAE;AACxD,UAAO,aAAa,SAAS,GAAG,yCAAyC;AACzE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,kCAAkC;AAC7E,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,mCAAmC;IAC9E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;GACnD,MAAM,UAAU,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AAC5D,UAAO,aAAa,SAAS,GAAG,2BAA2B;AAC3D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,oCAAoC;IAC/E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AAEjD,UAAO,YADS,OAAO,QAAQ,WAAW,cAAc,EAAE,EAC9B,iDAAiD;IAC7E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,IAAQ,CAAC;AAExD,UAAO,YADS,OAAO,QAAQ,WAAW,eAAe,OAAO,iBAAiB,EACrD,oDAAoD;IAChF;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AACjD,UAAO,QAAQ,OAAO,cAAc,UAAU,EAAE,CAAC;AAEjD,UAAO,eADS,OAAO,QAAQ,WAAW,cAAc,EAAE,EAC3B,WAAW,sCAAsC;IAChF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,YAAY,UAAU,EAAE,CAAC;GAC/C,MAAM,UAAU,OAAO,QAAQ,WAAW,YAAY,EAAE;AACxD,UAAO,aAAa,SAAS,GAAG,4BAA4B;AAC5D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;AACvE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,6BAA6B;AACxE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;AACvE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,6BAA6B;IACxE;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,WAAW,UAAU,EAAE,CAAC;AAC9C,UAAO,QAAQ,OAAO,WAAW,UAAU,EAAE,CAAC;AAC9C,UAAO,QAAQ,SAAS,WAAW,EAAE;AAErC,UAAO,aADS,OAAO,QAAQ,WAAW,WAAW,EAAE,EAC1B,GAAG,uDAAuD;IACvF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,SAAS,aAAa,EAAE;AAEvC,UAAO,YADS,OAAO,QAAQ,WAAW,aAAa,EAAE,EAC7B,iDAAiD;IAC7E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,SAAS,aAAa,EAAE;GACvC,MAAM,UAAU,OAAO,QAAQ,WAAW,aAAa,EAAE;AACzD,UAAO,aAAa,SAAS,GAAG,+BAA+B;AAC/D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,8BAA8B;AACzE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,+BAA+B;IAC1E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,SAAS,eAAe,EAAE;AACzC,UAAO,QAAQ,SAAS,eAAe,EAAE;GACzC,MAAM,UAAU,OAAO,QAAQ,WAAW,eAAe,EAAE;AAC3D,UAAO,aAAa,SAAS,GAAG,6BAA6B;AAC7D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,+BAA+B;IAC1E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,SAAS,gBAAgB,EAAE;AAC1C,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;AACnD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;GACnD,MAAM,UAAU,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AAC5D,UAAO,aAAa,SAAS,GAAG,+BAA+B;AAC/D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,oBAAoB;AAC/D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,qBAAqB;IAChE;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG;IAAE,KAAK;IAAS,QAAQ,EAAE,GAAG,GAAG;IAAE,CAAC;AACtE,UAAO,QAAQ,OAAO,WAAW,MAAM;GACvC,MAAM,UAAU,OAAO,QAAQ,WAAW,WAAW,EAAE;AACvD,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,aACZ,MAAM,aACN,0CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,UAAU;GAChB,MAAM,QAAQ,UAAU,QAAQ;AAChC,UAAO,QAAQ,OAAO,oBAAoB,MAAM;AAEhD,UAAO,aADS,OAAO,QAAQ,WAAW,oBAAoB,EAAE,EACrC,GAAI,SAAS,SAAS,sCAAsC;IACvF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,YAAY;GAClB,MAAM,QAAQ,UAAU,GAAG,UAAU;AACrC,UAAO,QAAQ,OAAO,sBAAsB,MAAM;AAElD,UAAO,aADS,OAAO,QAAQ,WAAW,sBAAsB,EAAE,EAExD,GAAI,WACZ,WACA,wCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAMC,QAAkB;IACtB,aAAa,YAAY,KAAK;KAC5B,UAAU,eAAe,cAAc,KAAK,IAAI,EAAE,mBAAmB,EAAE;KACvE,UAAU,eAAe,cAAc,KAAK,MAAM,EAAE,mBAAmB,SAAS;KAChF,UAAU,eAAe,cAAc,KAAK,MAAM,EAAE,mBAAmB;MAAC;MAAG;MAAG;MAAE,CAAC;KAClF,CAAC;IACF,SAAS;IACT,WAAW,KAAK,KAAK;IACtB;AACD,UAAO,QAAQ,OAAO,cAAc,MAAM;AAE1C,UAAO,aADS,OAAO,QAAQ,WAAW,cAAc,EAAE,EAEhD,GAAI,aACZ,MAAM,aACN,+CACD;IACD;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,EAAE,CAAC;AAChD,UAAO,QAAQ,OAAO,aAAa,UAAU,GAAG,CAAC;GACjD,MAAM,WAAW,OAAO,QAAQ,WAAW,aAAa,EAAE;GAC1D,MAAM,WAAW,OAAO,QAAQ,WAAW,aAAa,EAAE;AAC1D,UAAO,aAAa,UAAU,GAAG,8BAA8B;AAC/D,UAAO,aAAa,UAAU,GAAG,4BAA4B;AAC7D,UAAO,YAAY,SAAS,GAAI,SAAS,GAAG,4BAA4B;AACxE,UAAO,YAAY,SAAS,GAAI,SAAS,IAAI,4BAA4B;IACzE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,gBAAgB,UAAU,EAAE,CAAC;GACnD,MAAM,eAAe,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AACjE,UAAO,QAAQ,OAAO,gBAAgB,UAAU,IAAI,CAAC;AACrD,UAAO,QAAQ,OAAO,gBAAgB,UAAU,IAAI,CAAC;GACrD,MAAM,cAAc,OAAO,QAAQ,WAAW,gBAAgB,EAAE;AAChE,UAAO,YACL,aAAa,QACb,YAAY,QACZ,6CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,OAAO,eAAe,UAAU,EAAE,CAAC;AAClD,UAAO,QAAQ,SAAS,eAAe,EAAE;GACzC,MAAM,WAAW,OAAO,QAAQ,WAAW,eAAe,EAAE;GAC5D,MAAM,WAAW,OAAO,QAAQ,WAAW,eAAe,EAAE;AAC5D,UAAO,YAAY,UAAU,uCAAuC;AACpE,UAAO,aAAa,UAAU,GAAG,oCAAoC;IACrE;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ;AACd,QAAK,IAAI,IAAI,GAAG,KAAK,OAAO,IAC1B,QAAO,QAAQ,OAAO,iBAAiB,UAAU,EAAE,CAAC;GAEtD,MAAM,UAAU,OAAO,QAAQ,WAAW,iBAAiB,EAAE;AAC7D,UAAO,aAAa,SAAS,OAAO,eAAe,MAAM,UAAU;AACnE,UAAO,eAAe,SAAS,WAAW,8BAA8B;AACxE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;AACvE,UAAO,YAAY,QAAQ,QAAQ,GAAI,SAAS,OAAO,0BAA0B,QAAQ;IACzF;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,WAAW;AACjB,QAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,WAAO,QAAQ,OAAO,aAAa,KAAK,UAAU,EAAE,CAAC;AACrD,WAAO,QAAQ,OAAO,aAAa,KAAK,UAAU,EAAE,CAAC;;GAEvD,IAAI,eAAe;AACnB,QAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK;IACjC,MAAM,UAAU,OAAO,QAAQ,WAAW,aAAa,KAAK,EAAE;AAC9D,oBAAgB,QAAQ;AACxB,WAAO,aAAa,SAAS,GAAG,OAAO,EAAE,wBAAwB;;AAEnE,UAAO,YAAY,cAAc,WAAW,GAAG,6BAA6B;IAC5E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GAEvB,MAAM,QAAQ,kBAAkB,GAAG,EAAE,SADnB,IAAI,OAAO,KAAK,KAAK,EACkB,CAAC;AAC1D,UAAO,QAAQ,OAAO,YAAY,MAAM;GACxC,MAAM,UAAU,OAAO,QAAQ,WAAW,YAAY,EAAE;AACxD,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,aACZ,MAAM,aACN,kDACD;IACD;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,SAAS,IAAI,OAAO,IAAK;GAC/B,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,QAAQ,MAAM;AAEpC,UAAO,aADS,OAAO,QAAQ,WAAW,QAAQ,EAAE,EACvB,GAAG,8BAA8B;IAC9D;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,YAAY;GAClB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,WAAW,MAAM;AAEvC,UAAO,aADS,OAAO,QAAQ,WAAW,WAAW,EAAE,EAC1B,GAAG,iCAAiC;IACjE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,YAAY;GAClB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,WAAW,MAAM;AAEvC,UAAO,aADS,OAAO,QAAQ,WAAW,WAAW,EAAE,EAC1B,GAAG,4CAA4C;IAC5E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,WAAW;GACjB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,OAAO,UAAU,MAAM;AAEtC,UAAO,aADS,OAAO,QAAQ,WAAW,UAAU,EAAE,EACzB,GAAG,qCAAqC;IACrE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,OAAO,mBAAmB,UAAU,EAAE,CAAC;AACtD,UAAO,QAAQ,OAAO,mBAAmB,UAAU,EAAE,CAAC;AAEtD,UAAO,YADgB,OAAO,QAAQ,WAAW,mBAAmB,GAAG,EAEtD,MAAM,MAAM,EAAE,YAAY,EAAE,EAC3C,8DACD;AAED,UAAO,WACL,EAFmB,OAAO,QAAQ,WAAW,mBAAmB,EAAE,EAEpD,MAAM,MAAM,EAAE,YAAY,EAAE,EAC1C,2DACD;IACD;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,UAAU,EAAE;AAC1B,UAAO,QAAQ,gBAAgB,mBAAmB,OAAO,EAAE;GAC3D,MAAM,UAAU,OAAO,QAAQ,WAAW,mBAAmB,EAAE;AAC/D,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;IACvE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,gBAAgB,yBAAyB,UAAU,EAAE,EAAE,EAAE;AACxE,UAAO,QAAQ,gBAAgB,yBAAyB,UAAU,EAAE,EAAE,EAAE;AACxE,UAAO,QAAQ,gBAAgB,yBAAyB,UAAU,EAAE,EAAE,EAAE;GACxE,MAAM,UAAU,OAAO,QAAQ,WAAW,yBAAyB,EAAE;AACrE,UAAO,aAAa,SAAS,GAAG,4BAA4B;AAC5D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,kCAAkC;AAC7E,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,mCAAmC;AAC9E,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,kCAAkC;IAC7E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,gBAAgB,kBAAkB,UAAU,EAAE,EAAE,EAAE;GAEjE,MAAM,SAAS,OAAO,OAAO,OAC3B,QAAQ,gBAAgB,kBAAkB,UAAU,EAAE,EAAE,EAAE,CAC3D;AACD,UAAO,WACL,OAAO,SAAS,QAChB,yDACD;AACD,OAAI,OAAO,SAAS,OAClB,QAAO,WACL,OAAO,KAAK,SAAS,sBACrB,qCACD;GAGH,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,6BAA6B;AAC7D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,8BAA8B;IACzE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GAEvB,MAAM,SAAS,OAAO,OAAO,OAC3B,QAAQ,gBAAgB,uBAAuB,UAAU,EAAE,EAAE,EAAE,CAChE;AACD,UAAO,WACL,OAAO,SAAS,QAChB,gEACD;AACD,OAAI,OAAO,SAAS,OAClB,QAAO,WACL,OAAO,KAAK,SAAS,sBACrB,qCACD;AAIH,UAAO,YADS,OAAO,QAAQ,WAAW,uBAAuB,EAAE,EACvC,8CAA8C;IAC1E;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AACvB,UAAO,QAAQ,gBAAgB,uBAAuB,UAAU,EAAE,EAAE,EAAE;AAKtE,UAAO,YAHQ,OAAO,OAAO,OAC3B,QAAQ,gBAAgB,uBAAuB,UAAU,EAAE,EAAE,EAAE,CAChE,EAEQ,SAAS,QAChB,0DACD;AAGD,UAAO,aADS,OAAO,QAAQ,WAAW,uBAAuB,EAAE,EACtC,GAAG,mCAAmC;IACnE;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;AAEvB,UAAO,QAAQ,gBAAgB,sBAAsB,UAAU,EAAE,EAAE,EAAE;AACrE,UAAO,QAAQ,gBAAgB,sBAAsB,UAAU,EAAE,EAAE,EAAE;AACrE,UAAO,QAAQ,gBAAgB,sBAAsB,UAAU,EAAE,EAAE,EAAE;AAErE,UAAO,QAAQ,SAAS,sBAAsB,EAAE;AAEhD,UAAO,QAAQ,gBAAgB,sBAAsB,UAAU,EAAE,EAAE,EAAE;GACrE,MAAM,UAAU,OAAO,QAAQ,WAAW,sBAAsB,EAAE;AAClE,UAAO,aAAa,SAAS,GAAG,+BAA+B;AAC/D,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,4BAA4B;AACvE,UAAO,YAAY,QAAQ,GAAI,SAAS,GAAG,6BAA6B;IACxE;EACH;CAKD;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,gBAAgB,QAAQ;AAC3D,UAAO,QAAQ,OAAO,eAAe,MAAM;GAC3C,MAAM,UAAU,OAAO,QAAQ,WAAW,eAAe,EAAE;AAC3D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,GAAG,KAAK,SAAS,iBACjB,wCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,gBAAgB,QAAQ;AAC3D,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,aAAa,YAC5B,qCACD;AAED,UAAO,YADQ,GAAG,KAAK,UAAU,EAG/B;IAAC;IAAS;IAAK;IAAO,EACtB,+CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,WAAW,YAC1B,mCACD;AAED,UAAO,YADU,GAAG,KAAK,OAAO,cAAc,KAAK,OAAO,CAAC,CAEhD,UAAU,EACnB;IAAC;IAAS;IAAK;IAAO,EACtB,iCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,SAAS,EAAE,CAAC;AAC/C,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,WAAW,YAC1B,mCACD;AAED,UAAO,YADU,GAAG,KAAK,OAAO,IAAI,CAEzB,UAAU,EACnB,CAAC,SAAS,IAAI,EACd,iCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,gBAAgB,QAAQ;AAC3D,UAAO,QAAQ,OAAO,eAAe,MAAM;GAC3C,MAAM,UAAU,OAAO,QAAQ,WAAW,eAAe,EAAE;AAC3D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,QAAQ,YACvB,gCACD;AAED,UAAO,YADQ,GAAG,KAAK,KAAK,CAEnB,UAAU,EACjB,CAAC,SAAS,IAAI,EACd,iCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,gBAAgB,QAAQ;AAC3D,UAAO,QAAQ,OAAO,iBAAiB,MAAM;GAC7C,MAAM,UAAU,OAAO,QAAQ,WAAW,iBAAiB,EAAE;AAC7D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,OAAO,GAAG,KAAK,UAAU,YACzB,kCACD;AAED,UAAO,YADS,GAAG,KAAK,OAAO,CAErB,UAAU,EAClB,CAAC,KAAK,OAAO,EACb,oCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAMA,QAAkB;IACtB,aAAa,YAAY,KAAK;KAC5B,UAAU,eAAe,cAAc,KAAK,eAAe,EAAE,mBAAmB,QAAQ;KACxF,UAAU,eAAe,cAAc,KAAK,eAAe,EAAE,mBAAmB,MAAM;KACtF,UAAU,eAAe,cAAc,KAAK,QAAQ,EAAE,mBAAmB,EAAE;KAC5E,CAAC;IACF,SAAS;IACT,WAAW,KAAK,KAAK;IACtB;AACD,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,MAAM,QAAQ,GAAI,YAAY;AACpC,UAAO,aAAa,CAAC,GAAG,IAAI,EAAE,GAAG,2BAA2B;AAE5D,QAAK,MAAM,MAAM,KAAK;AACpB,WAAO,WACL,GAAG,KAAK,SAAS,iBACjB,uCACD;AACD,WAAO,WACL,OAAO,GAAG,KAAK,aAAa,YAC5B,kDACD;;AAEH,UAAO,YACL,IAAI,GAAI,KAAK,UAAU,EACvB;IAAC;IAAS;IAAK;IAAO,EACtB,+BACD;AACD,UAAO,YACL,IAAI,GAAI,KAAK,UAAU,EACvB;IAAC;IAAS;IAAK;IAAO,EACtB,gCACD;AACD,UAAO,YACL,IAAI,GAAI,KAAK,UAAU,EACvB,CAAC,QAAQ,EACT,+BACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GAEvB,MAAM,QAAQ,kBAAkB,GADf,sCAC4B,aAAa;AAC1D,UAAO,QAAQ,OAAO,aAAa,MAAM;GACzC,MAAM,UAAU,OAAO,QAAQ,WAAW,aAAa,EAAE;AACzD,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,YACL,GAAG,KAAK,UAAU,EAClB;IAAC;IAAU;IAAU;IAAU;IAAU;IAAS,EAClD,4CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,IAAI,EAAE,MAAM,MAAM,CAAC;AACtD,UAAO,QAAQ,OAAO,cAAc,MAAM;GAC1C,MAAM,UAAU,OAAO,QAAQ,WAAW,cAAc,EAAE;AAC1D,UAAO,aAAa,SAAS,GAAG,wBAAwB;GACxD,MAAM,KAAK,QAAQ,GAAI,YAAY,IAAI;AACvC,UAAO,WACL,GAAG,KAAK,SAAS,iBACjB,2CACD;AACD,UAAO,WACL,OAAO,GAAG,KAAK,aAAa,YAC5B,yCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,QAAQ,QAAQ;GACnD,MAAM,aAAa,MAAM,YAAY;AACrC,UAAO,QAAQ,OAAO,kBAAkB,MAAM;GAC9C,MAAM,UAAU,OAAO,QAAQ,WAAW,kBAAkB,EAAE;AAC9D,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,YAAY,IACxB,YACA,qCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,QAAQ,kBAAkB,GAAG,QAAQ,QAAQ;GACnD,MAAM,oBAAoB,MAAM,YAAY;AAC5C,UAAO,QAAQ,OAAO,yBAAyB,MAAM;GACrD,MAAM,UAAU,OAAO,QAAQ,WAAW,yBAAyB,EAAE;AACrE,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,YAAY,WACxB,mBACA,4CACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAMA,QAAkB;IACtB,aAAa,YAAY,KAAK,CAC5B,UAAU,eAAe,cAAc,KAAK,OAAO,EAAE,oBAAoB,OAAO,CACjF,CAAC;IACF,SAAS;IACT,WAAW,KAAK,KAAK;IACtB;AACD,UAAO,QAAQ,OAAO,oBAAoB,MAAM;GAChD,MAAM,UAAU,OAAO,QAAQ,WAAW,oBAAoB,EAAE;AAChE,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,YAAY,IAAI,GAAI,MAChC,oBACA,qCACD;IACD;EACH;CAED;EACE,MAAM;EACN,UAAU,WAAW;EACrB,KAAK,OAAO,IAAI,aAAa;GAC3B,MAAM,UAAU,OAAO;GACvB,MAAM,iBAAiB;IACrB,QAAQ;KAAE,OAAO;KAAI,OAAO;MAAC;MAAG;MAAG;MAAE;KAAE;IACvC,WAAW;IACX,QAAQ;IACT;GACD,MAAM,QAAQ,kBAAkB,GAAG,QAAQ,eAAe;AAC1D,UAAO,QAAQ,OAAO,mBAAmB,MAAM;GAC/C,MAAM,UAAU,OAAO,QAAQ,WAAW,mBAAmB,EAAE;AAC/D,UAAO,aAAa,SAAS,GAAG,wBAAwB;AACxD,UAAO,YACL,QAAQ,GAAI,YAAY,IAAI,GAAI,SAChC,gBACA,2CACD;IACD;EACH;CACF;;;;;;AAWD,MAAa,kBAGN;;;;;;AAOP,MAAa,eAKX,OAAO,IAAI,aAAa;CACtB,MAAMC,SAAgE,EAAE;CACxE,MAAMC,SAGD,EAAE;AAEP,MAAK,MAAM,QAAQ,OAAO;EACxB,MAAM,SAAS,OAAO,OAAO,OAAO,KAAK,IAAI;AAC7C,MAAI,OAAO,SAAS,QAClB,QAAO,KAAK,KAAK;MAEjB,QAAO,KAAK;GAAE;GAAM,OAAO,OAAO;GAAM,CAAC;;AAI7C,QAAO;EACL;EACA;EACA,OAAO,MAAM;EACb,WAAW,OAAO;EAClB,WAAW,OAAO;EACnB;EACD;AAEJ,MAAa,sBAAsB;CACjC;CACA;CACA;CACD"}
package/dist/testing/assertions.cjs CHANGED
@@ -9,12 +9,15 @@ let effect = require("effect");
9
9
  */
10
10
  /**
11
11
  * Deep equality check that handles objects, arrays, and primitives.
12
+ * Skips function properties since reconstructed objects (like OperationPath)
13
+ * will have new function instances even when the underlying data is identical.
12
14
  */
13
15
  const isDeepEqual = (a, b) => {
14
16
  if (a === b) return true;
15
17
  if (a === null || b === null) return a === b;
16
18
  if (a === void 0 || b === void 0) return a === b;
17
19
  if (typeof a !== typeof b) return false;
20
+ if (typeof a === "function" && typeof b === "function") return true;
18
21
  if (typeof a === "number" && typeof b === "number") {
19
22
  if (Number.isNaN(a) && Number.isNaN(b)) return true;
20
23
  return a === b;
@@ -27,8 +30,8 @@ const isDeepEqual = (a, b) => {
27
30
  if (typeof a === "object" && typeof b === "object") {
28
31
  const aObj = a;
29
32
  const bObj = b;
30
- const aKeys = Object.keys(aObj);
31
- const bKeys = Object.keys(bObj);
33
+ const aKeys = Object.keys(aObj).filter((k) => typeof aObj[k] !== "function");
34
+ const bKeys = Object.keys(bObj).filter((k) => typeof bObj[k] !== "function");
32
35
  if (aKeys.length !== bKeys.length) return false;
33
36
  for (const key of aKeys) {
34
37
  if (!Object.prototype.hasOwnProperty.call(bObj, key)) return false;
package/dist/testing/assertions.mjs CHANGED
@@ -9,12 +9,15 @@ import { Effect } from "effect";
9
9
  */
10
10
  /**
11
11
  * Deep equality check that handles objects, arrays, and primitives.
12
+ * Skips function properties since reconstructed objects (like OperationPath)
13
+ * will have new function instances even when the underlying data is identical.
12
14
  */
13
15
  const isDeepEqual = (a, b) => {
14
16
  if (a === b) return true;
15
17
  if (a === null || b === null) return a === b;
16
18
  if (a === void 0 || b === void 0) return a === b;
17
19
  if (typeof a !== typeof b) return false;
20
+ if (typeof a === "function" && typeof b === "function") return true;
18
21
  if (typeof a === "number" && typeof b === "number") {
19
22
  if (Number.isNaN(a) && Number.isNaN(b)) return true;
20
23
  return a === b;
@@ -27,8 +30,8 @@ const isDeepEqual = (a, b) => {
27
30
  if (typeof a === "object" && typeof b === "object") {
28
31
  const aObj = a;
29
32
  const bObj = b;
30
- const aKeys = Object.keys(aObj);
31
- const bKeys = Object.keys(bObj);
33
+ const aKeys = Object.keys(aObj).filter((k) => typeof aObj[k] !== "function");
34
+ const bKeys = Object.keys(bObj).filter((k) => typeof bObj[k] !== "function");
32
35
  if (aKeys.length !== bKeys.length) return false;
33
36
  for (const key of aKeys) {
34
37
  if (!Object.prototype.hasOwnProperty.call(bObj, key)) return false;
package/dist/testing/assertions.mjs.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"assertions.mjs","names":[],"sources":["../../src/testing/assertions.ts"],"sourcesContent":["/**\n * @voidhash/mimic-effect/testing - Assertion Helpers\n *\n * Internal assertion helpers used by the test suites.\n */\nimport { Effect } from \"effect\";\nimport { TestError } from \"./types\";\n\n// =============================================================================\n// Deep Equality\n// =============================================================================\n\n/**\n * Deep equality check that handles objects, arrays, and primitives.\n */\nexport const isDeepEqual = (a: unknown, b: unknown): boolean => {\n if (a === b) return true;\n\n if (a === null || b === null) return a === b;\n if (a === undefined || b === undefined) return a === b;\n\n if (typeof a !== typeof b) return false;\n\n if (typeof a === \"number\" && typeof b === \"number\") {\n if (Number.isNaN(a) && Number.isNaN(b)) return true;\n return a === b;\n }\n\n if (Array.isArray(a) && Array.isArray(b)) {\n if (a.length !== b.length) return false;\n for (let i = 0; i < a.length; i++) {\n if (!isDeepEqual(a[i], b[i])) return false;\n }\n return true;\n }\n\n if (typeof a === \"object\" && typeof b === \"object\") {\n const aObj = a as Record<string, unknown>;\n const bObj = b as Record<string, unknown>;\n const aKeys = Object.keys(aObj);\n const bKeys = Object.keys(bObj);\n\n if (aKeys.length !== bKeys.length) return false;\n\n for (const key of aKeys) {\n if (!Object.prototype.hasOwnProperty.call(bObj, key)) return false;\n if (!isDeepEqual(aObj[key], bObj[key])) return false;\n }\n\n return true;\n }\n\n return false;\n};\n\n// =============================================================================\n// Assertion Helpers\n// =============================================================================\n\n/**\n * Assert that two values are deeply equal.\n */\nexport const assertEqual = <T>(\n actual: T,\n expected: T,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (!isDeepEqual(actual, expected)) {\n yield* Effect.fail(new TestError({ message, expected, actual }));\n }\n });\n\n/**\n * Assert that a condition is true.\n */\nexport const assertTrue = (\n condition: boolean,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (!condition) {\n yield* Effect.fail(new TestError({ message }));\n }\n });\n\n/**\n * Assert that a condition is false.\n */\nexport const assertFalse = (\n condition: boolean,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (condition) {\n yield* Effect.fail(new TestError({ message }));\n }\n });\n\n/**\n * Assert that a value is undefined.\n */\nexport const assertUndefined = (\n value: unknown,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (value !== undefined) {\n yield* Effect.fail(\n new TestError({ message, expected: undefined, actual: value })\n );\n }\n });\n\n/**\n * Assert that a value is defined (not undefined).\n */\nexport const assertDefined = <T>(\n value: T | undefined,\n message: string\n): Effect.Effect<T, TestError> =>\n Effect.gen(function* () {\n if (value === undefined) {\n yield* Effect.fail(\n new TestError({ message, expected: \"defined value\", actual: undefined })\n );\n }\n return value as T;\n });\n\n/**\n * Assert that an array has the expected length.\n */\nexport const assertLength = <T>(\n array: T[],\n expectedLength: number,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (array.length !== expectedLength) {\n yield* Effect.fail(\n new TestError({\n message,\n expected: expectedLength,\n actual: array.length,\n })\n );\n }\n });\n\n/**\n * Assert that an array is empty.\n */\nexport const assertEmpty = <T>(\n array: T[],\n message: string\n): Effect.Effect<void, TestError> => assertLength(array, 0, message);\n\n/**\n * Assert that an array is sorted by a key.\n */\nexport const assertSortedBy = <T>(\n array: T[],\n key: keyof T,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n for (let i = 1; i < array.length; i++) {\n const prev = array[i - 1]![key];\n const curr = array[i]![key];\n if (prev > curr) {\n yield* Effect.fail(\n new TestError({\n message,\n expected: `array sorted by ${String(key)}`,\n actual: `element at index ${i - 1} (${prev}) > element at index ${i} (${curr})`,\n })\n );\n }\n }\n });\n"],"mappings":";;;;;;;;;;;;AAeA,MAAa,eAAe,GAAY,MAAwB;AAC9D,KAAI,MAAM,EAAG,QAAO;AAEpB,KAAI,MAAM,QAAQ,MAAM,KAAM,QAAO,MAAM;AAC3C,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO,MAAM;AAErD,KAAI,OAAO,MAAM,OAAO,EAAG,QAAO;AAElC,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;AAClD,MAAI,OAAO,MAAM,EAAE,IAAI,OAAO,MAAM,EAAE,CAAE,QAAO;AAC/C,SAAO,MAAM;;AAGf,KAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,EAAE;AACxC,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,KAAI,CAAC,YAAY,EAAE,IAAI,EAAE,GAAG,CAAE,QAAO;AAEvC,SAAO;;AAGT,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;EAClD,MAAM,OAAO;EACb,MAAM,OAAO;EACb,MAAM,QAAQ,OAAO,KAAK,KAAK;EAC/B,MAAM,QAAQ,OAAO,KAAK,KAAK;AAE/B,MAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAE1C,OAAK,MAAM,OAAO,OAAO;AACvB,OAAI,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,IAAI,CAAE,QAAO;AAC7D,OAAI,CAAC,YAAY,KAAK,MAAM,KAAK,KAAK,CAAE,QAAO;;AAGjD,SAAO;;AAGT,QAAO;;;;;AAUT,MAAa,eACX,QACA,UACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,CAAC,YAAY,QAAQ,SAAS,CAChC,QAAO,OAAO,KAAK,IAAI,UAAU;EAAE;EAAS;EAAU;EAAQ,CAAC,CAAC;EAElE;;;;AAKJ,MAAa,cACX,WACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,CAAC,UACH,QAAO,OAAO,KAAK,IAAI,UAAU,EAAE,SAAS,CAAC,CAAC;EAEhD;;;;AAkBJ,MAAa,mBACX,OACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,UAAU,OACZ,QAAO,OAAO,KACZ,IAAI,UAAU;EAAE;EAAS,UAAU;EAAW,QAAQ;EAAO,CAAC,CAC/D;EAEH;;;;AAKJ,MAAa,iBACX,OACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,UAAU,OACZ,QAAO,OAAO,KACZ,IAAI,UAAU;EAAE;EAAS,UAAU;EAAiB,QAAQ;EAAW,CAAC,CACzE;AAEH,QAAO;EACP;;;;AAKJ,MAAa,gBACX,OACA,gBACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,MAAM,WAAW,eACnB,QAAO,OAAO,KACZ,IAAI,UAAU;EACZ;EACA,UAAU;EACV,QAAQ,MAAM;EACf,CAAC,CACH;EAEH;;;;AAKJ,MAAa,eACX,OACA,YACmC,aAAa,OAAO,GAAG,QAAQ;;;;AAKpE,MAAa,kBACX,OACA,KACA,YAEA,OAAO,IAAI,aAAa;AACtB,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,OAAO,MAAM,IAAI,GAAI;EAC3B,MAAM,OAAO,MAAM,GAAI;AACvB,MAAI,OAAO,KACT,QAAO,OAAO,KACZ,IAAI,UAAU;GACZ;GACA,UAAU,mBAAmB,OAAO,IAAI;GACxC,QAAQ,oBAAoB,IAAI,EAAE,IAAI,KAAK,uBAAuB,EAAE,IAAI,KAAK;GAC9E,CAAC,CACH;;EAGL"}
1
+ {"version":3,"file":"assertions.mjs","names":[],"sources":["../../src/testing/assertions.ts"],"sourcesContent":["/**\n * @voidhash/mimic-effect/testing - Assertion Helpers\n *\n * Internal assertion helpers used by the test suites.\n */\nimport { Effect } from \"effect\";\nimport { TestError } from \"./types\";\n\n// =============================================================================\n// Deep Equality\n// =============================================================================\n\n/**\n * Deep equality check that handles objects, arrays, and primitives.\n * Skips function properties since reconstructed objects (like OperationPath)\n * will have new function instances even when the underlying data is identical.\n */\nexport const isDeepEqual = (a: unknown, b: unknown): boolean => {\n if (a === b) return true;\n\n if (a === null || b === null) return a === b;\n if (a === undefined || b === undefined) return a === b;\n\n if (typeof a !== typeof b) return false;\n\n // Skip function comparison - functions with same behavior but different references should be considered equal\n if (typeof a === \"function\" && typeof b === \"function\") return true;\n\n if (typeof a === \"number\" && typeof b === \"number\") {\n if (Number.isNaN(a) && Number.isNaN(b)) return true;\n return a === b;\n }\n\n if (Array.isArray(a) && Array.isArray(b)) {\n if (a.length !== b.length) return false;\n for (let i = 0; i < a.length; i++) {\n if (!isDeepEqual(a[i], b[i])) return false;\n }\n return true;\n }\n\n if (typeof a === \"object\" && typeof b === \"object\") {\n const aObj = a as Record<string, unknown>;\n const bObj = b as Record<string, unknown>;\n\n // Filter out function properties for comparison\n const aKeys = Object.keys(aObj).filter(k => typeof aObj[k] !== \"function\");\n const bKeys = Object.keys(bObj).filter(k => typeof bObj[k] !== \"function\");\n\n if (aKeys.length !== bKeys.length) return false;\n\n for (const key of aKeys) {\n if (!Object.prototype.hasOwnProperty.call(bObj, key)) return false;\n if (!isDeepEqual(aObj[key], bObj[key])) return false;\n }\n\n return true;\n }\n\n return false;\n};\n\n// =============================================================================\n// Assertion Helpers\n// =============================================================================\n\n/**\n * Assert that two values are deeply equal.\n */\nexport const assertEqual = <T>(\n actual: T,\n expected: T,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (!isDeepEqual(actual, expected)) {\n yield* Effect.fail(new TestError({ message, expected, actual }));\n }\n });\n\n/**\n * Assert that a condition is true.\n */\nexport const assertTrue = (\n condition: boolean,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (!condition) {\n yield* Effect.fail(new TestError({ message }));\n }\n });\n\n/**\n * Assert that a condition is false.\n */\nexport const assertFalse = (\n condition: boolean,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (condition) {\n yield* Effect.fail(new TestError({ message }));\n }\n });\n\n/**\n * Assert that a value is undefined.\n */\nexport const assertUndefined = (\n value: unknown,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (value !== undefined) {\n yield* Effect.fail(\n new TestError({ message, expected: undefined, actual: value })\n );\n }\n });\n\n/**\n * Assert that a value is defined (not undefined).\n */\nexport const assertDefined = <T>(\n value: T | undefined,\n message: string\n): Effect.Effect<T, TestError> =>\n Effect.gen(function* () {\n if (value === undefined) {\n yield* Effect.fail(\n new TestError({ message, expected: \"defined value\", actual: undefined })\n );\n }\n return value as T;\n });\n\n/**\n * Assert that an array has the expected length.\n */\nexport const assertLength = <T>(\n array: T[],\n expectedLength: number,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n if (array.length !== expectedLength) {\n yield* Effect.fail(\n new TestError({\n message,\n expected: expectedLength,\n actual: array.length,\n })\n );\n }\n });\n\n/**\n * Assert that an array is empty.\n */\nexport const assertEmpty = <T>(\n array: T[],\n message: string\n): Effect.Effect<void, TestError> => assertLength(array, 0, message);\n\n/**\n * Assert that an array is sorted by a key.\n */\nexport const assertSortedBy = <T>(\n array: T[],\n key: keyof T,\n message: string\n): Effect.Effect<void, TestError> =>\n Effect.gen(function* () {\n for (let i = 1; i < array.length; i++) {\n const prev = array[i - 1]![key];\n const curr = array[i]![key];\n if (prev > curr) {\n yield* Effect.fail(\n new TestError({\n message,\n expected: `array sorted by ${String(key)}`,\n actual: `element at index ${i - 1} (${prev}) > element at index ${i} (${curr})`,\n })\n );\n }\n }\n });\n"],"mappings":";;;;;;;;;;;;;;AAiBA,MAAa,eAAe,GAAY,MAAwB;AAC9D,KAAI,MAAM,EAAG,QAAO;AAEpB,KAAI,MAAM,QAAQ,MAAM,KAAM,QAAO,MAAM;AAC3C,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO,MAAM;AAErD,KAAI,OAAO,MAAM,OAAO,EAAG,QAAO;AAGlC,KAAI,OAAO,MAAM,cAAc,OAAO,MAAM,WAAY,QAAO;AAE/D,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;AAClD,MAAI,OAAO,MAAM,EAAE,IAAI,OAAO,MAAM,EAAE,CAAE,QAAO;AAC/C,SAAO,MAAM;;AAGf,KAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,EAAE;AACxC,MAAI,EAAE,WAAW,EAAE,OAAQ,QAAO;AAClC,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,KAAI,CAAC,YAAY,EAAE,IAAI,EAAE,GAAG,CAAE,QAAO;AAEvC,SAAO;;AAGT,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;EAClD,MAAM,OAAO;EACb,MAAM,OAAO;EAGb,MAAM,QAAQ,OAAO,KAAK,KAAK,CAAC,QAAO,MAAK,OAAO,KAAK,OAAO,WAAW;EAC1E,MAAM,QAAQ,OAAO,KAAK,KAAK,CAAC,QAAO,MAAK,OAAO,KAAK,OAAO,WAAW;AAE1E,MAAI,MAAM,WAAW,MAAM,OAAQ,QAAO;AAE1C,OAAK,MAAM,OAAO,OAAO;AACvB,OAAI,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,IAAI,CAAE,QAAO;AAC7D,OAAI,CAAC,YAAY,KAAK,MAAM,KAAK,KAAK,CAAE,QAAO;;AAGjD,SAAO;;AAGT,QAAO;;;;;AAUT,MAAa,eACX,QACA,UACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,CAAC,YAAY,QAAQ,SAAS,CAChC,QAAO,OAAO,KAAK,IAAI,UAAU;EAAE;EAAS;EAAU;EAAQ,CAAC,CAAC;EAElE;;;;AAKJ,MAAa,cACX,WACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,CAAC,UACH,QAAO,OAAO,KAAK,IAAI,UAAU,EAAE,SAAS,CAAC,CAAC;EAEhD;;;;AAkBJ,MAAa,mBACX,OACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,UAAU,OACZ,QAAO,OAAO,KACZ,IAAI,UAAU;EAAE;EAAS,UAAU;EAAW,QAAQ;EAAO,CAAC,CAC/D;EAEH;;;;AAKJ,MAAa,iBACX,OACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,UAAU,OACZ,QAAO,OAAO,KACZ,IAAI,UAAU;EAAE;EAAS,UAAU;EAAiB,QAAQ;EAAW,CAAC,CACzE;AAEH,QAAO;EACP;;;;AAKJ,MAAa,gBACX,OACA,gBACA,YAEA,OAAO,IAAI,aAAa;AACtB,KAAI,MAAM,WAAW,eACnB,QAAO,OAAO,KACZ,IAAI,UAAU;EACZ;EACA,UAAU;EACV,QAAQ,MAAM;EACf,CAAC,CACH;EAEH;;;;AAKJ,MAAa,eACX,OACA,YACmC,aAAa,OAAO,GAAG,QAAQ;;;;AAKpE,MAAa,kBACX,OACA,KACA,YAEA,OAAO,IAAI,aAAa;AACtB,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACrC,MAAM,OAAO,MAAM,IAAI,GAAI;EAC3B,MAAM,OAAO,MAAM,GAAI;AACvB,MAAI,OAAO,KACT,QAAO,OAAO,KACZ,IAAI,UAAU;GACZ;GACA,UAAU,mBAAmB,OAAO,IAAI;GACxC,QAAQ,oBAAoB,IAAI,EAAE,IAAI,KAAK,uBAAuB,EAAE,IAAI,KAAK;GAC9E,CAAC,CACH;;EAGL"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@voidhash/mimic-effect",
3
- "version": "1.0.0-beta.4",
3
+ "version": "1.0.0-beta.6",
4
4
  "type": "module",
5
5
  "repository": {
6
6
  "type": "git",
@@ -26,14 +26,14 @@
26
26
  "typescript": "5.8.3",
27
27
  "vite-tsconfig-paths": "^5.1.4",
28
28
  "vitest": "^3.2.4",
29
- "@voidhash/tsconfig": "1.0.0-beta.4"
29
+ "@voidhash/tsconfig": "1.0.0-beta.6"
30
30
  },
31
31
  "peerDependencies": {
32
32
  "@effect/platform": "^0.93.8",
33
33
  "@effect/cluster": "^0.55.0",
34
34
  "@effect/rpc": "^0.72.2",
35
35
  "effect": "^3.19.12",
36
- "@voidhash/mimic": "1.0.0-beta.4"
36
+ "@voidhash/mimic": "1.0.0-beta.6"
37
37
  },
38
38
  "peerDependenciesMeta": {
39
39
  "@effect/cluster": {
package/src/testing/HotStorageTestSuite.ts CHANGED
@@ -415,9 +415,9 @@ const tests: StorageTestCase<HotStorageTestError, HotStorageTag>[] = [
415
415
  const storage = yield* HotStorageTag;
416
416
  const entry: WalEntry = {
417
417
  transaction: Transaction.make([
418
- { type: "set", path: ["a"], value: 1 },
419
- { type: "set", path: ["b", "c"], value: "nested" },
420
- { type: "set", path: ["arr"], value: [1, 2, 3] },
418
+ Operation.fromDefinition(OperationPath.make("a"), TestSetDefinition, 1),
419
+ Operation.fromDefinition(OperationPath.make("b/c"), TestSetDefinition, "nested"),
420
+ Operation.fromDefinition(OperationPath.make("arr"), TestSetDefinition, [1, 2, 3]),
421
421
  ]),
422
422
  version: 1,
423
423
  timestamp: Date.now(),
package/src/testing/assertions.ts CHANGED
@@ -12,6 +12,8 @@ import { TestError } from "./types";
12
12
 
13
13
  /**
14
14
  * Deep equality check that handles objects, arrays, and primitives.
15
+ * Skips function properties since reconstructed objects (like OperationPath)
16
+ * will have new function instances even when the underlying data is identical.
15
17
  */
16
18
  export const isDeepEqual = (a: unknown, b: unknown): boolean => {
17
19
  if (a === b) return true;
@@ -21,6 +23,9 @@ export const isDeepEqual = (a: unknown, b: unknown): boolean => {
21
23
 
22
24
  if (typeof a !== typeof b) return false;
23
25
 
26
+ // Skip function comparison - functions with same behavior but different references should be considered equal
27
+ if (typeof a === "function" && typeof b === "function") return true;
28
+
24
29
  if (typeof a === "number" && typeof b === "number") {
25
30
  if (Number.isNaN(a) && Number.isNaN(b)) return true;
26
31
  return a === b;
@@ -37,8 +42,10 @@ export const isDeepEqual = (a: unknown, b: unknown): boolean => {
37
42
  if (typeof a === "object" && typeof b === "object") {
38
43
  const aObj = a as Record<string, unknown>;
39
44
  const bObj = b as Record<string, unknown>;
40
- const aKeys = Object.keys(aObj);
41
- const bKeys = Object.keys(bObj);
45
+
46
+ // Filter out function properties for comparison
47
+ const aKeys = Object.keys(aObj).filter(k => typeof aObj[k] !== "function");
48
+ const bKeys = Object.keys(bObj).filter(k => typeof bObj[k] !== "function");
42
49
 
43
50
  if (aKeys.length !== bKeys.length) return false;
44
51