@hexclave/shared 1.0.41 → 1.0.43

package/dist/esm/utils/paginated-lists.test.js.map

@@ -1 +1 @@
-{"version":3,"file":"paginated-lists.test.js","names":[],"sources":["../../../src/utils/paginated-lists.test.ts"],"sourcesContent":["import { describe, expect, it } from \"vitest\";\nimport { ArrayPaginatedList, PaginatedList } from \"./paginated-lists\";\nimport { stringCompare } from \"./strings\";\n\ntype NumberFilter = (item: number) => boolean;\ntype NumberOrderBy = (a: number, b: number) => number;\n\n// Helper to extract just the items from a paginated result\nconst items = <T>(result: { items: { item: T }[] }) => result.items.map(i => i.item);\n\ndescribe(\"ArrayPaginatedList\", () => {\n  describe(\"basic forward pagination (next)\", () => {\n    it(\"should return all items when limit is greater than array length\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([1, 2, 3]);\n      expect(result.isFirst).toBe(true);\n      expect(result.isLast).toBe(true);\n    });\n\n    it(\"should return exact limit when more items exist\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([1, 2, 3]);\n      expect(result.isFirst).toBe(true);\n      expect(result.isLast).toBe(false);\n    });\n\n    it(\"should continue from cursor correctly\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const first = await list.next({\n        after: list.getFirstCursor(),\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(first)).toEqual([1, 2]);\n      expect(first.cursor).toBe(\"before-2\");\n\n      const second = await list.next({\n        after: first.cursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(second)).toEqual([3, 4]);\n      expect(second.isFirst).toBe(false);\n      expect(second.isLast).toBe(false);\n    });\n\n    it(\"should handle empty array\", async () => {\n      const list = new ArrayPaginatedList<number>([]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([]);\n      expect(result.isFirst).toBe(true);\n      expect(result.isLast).toBe(true);\n    });\n\n    it(\"should handle limit of 0\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 0,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([]);\n    });\n  });\n\n  describe(\"backward pagination (prev)\", () => {\n    it(\"should return items before cursor\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.prev({\n        before: list.getLastCursor(),\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([4, 5]);\n      expect(result.isFirst).toBe(false);\n      expect(result.isLast).toBe(true);\n    });\n\n    it(\"should paginate backwards correctly\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n\n      const last = await list.prev({\n        before: list.getLastCursor(),\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n      expect(items(last)).toEqual([4, 5]);\n\n      const middle = await list.prev({\n        before: last.cursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n      expect(items(middle)).toEqual([2, 3]);\n\n      const first = await list.prev({\n        before: middle.cursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n      expect(items(first)).toEqual([1]);\n      expect(first.isFirst).toBe(true);\n    });\n  });\n\n  describe(\"cursor semantics (prevCursor and nextCursor)\", () => {\n    it(\"should have prevCursor before the item and nextCursor after\", async () => {\n      const list = new ArrayPaginatedList([10, 20, 30]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      // First item: prevCursor should be \"before-0\", nextCursor should be \"before-1\"\n      expect(result.items[0].prevCursor).toBe(\"before-0\");\n      expect(result.items[0].nextCursor).toBe(\"before-1\");\n\n      // Second item\n      expect(result.items[1].prevCursor).toBe(\"before-1\");\n      expect(result.items[1].nextCursor).toBe(\"before-2\");\n\n      // Third item\n      expect(result.items[2].prevCursor).toBe(\"before-2\");\n      expect(result.items[2].nextCursor).toBe(\"before-3\");\n    });\n\n    it(\"should allow using nextCursor to continue forward pagination\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n\n      const first = await list.next({\n        after: list.getFirstCursor(),\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      // Use the nextCursor of the last item to continue\n      const continueFrom = first.items[first.items.length - 1].nextCursor;\n      const second = await list.next({\n        after: continueFrom,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(second)).toEqual([3, 4]);\n    });\n\n    it(\"should allow using prevCursor to go back\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n\n      // Get items 3,4,5 first\n      const middle = await list.next({\n        after: \"before-2\",\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(middle)).toEqual([3, 4, 5]);\n      expect(middle.items[0].prevCursor).toBe(\"before-2\");\n\n      // Use prevCursor of first item to go back\n      const goBack = await list.prev({\n        before: middle.items[0].prevCursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(goBack)).toEqual([1, 2]);\n    });\n  });\n\n  describe(\"filtering\", () => {\n    it(\"should filter items correctly\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: (n) => n % 2 === 0, // only even numbers\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([2, 4, 6]);\n    });\n\n    it(\"should respect limit with filtering\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 2,\n        filter: (n) => n % 2 === 0,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([2, 4]);\n    });\n\n    it(\"should handle filter that matches nothing\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => false,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([]);\n    });\n  });\n\n  describe(\"ordering\", () => {\n    it(\"should sort items in ascending order\", async () => {\n      const list = new ArrayPaginatedList([5, 2, 8, 1, 9]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([1, 2, 5, 8, 9]);\n    });\n\n    it(\"should sort items in descending order\", async () => {\n      const list = new ArrayPaginatedList([5, 2, 8, 1, 9]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => b - a,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([9, 8, 5, 2, 1]);\n    });\n\n    it(\"should sort objects by property\", async () => {\n      const list = new ArrayPaginatedList([\n        { name: \"Charlie\", age: 30 },\n        { name: \"Alice\", age: 25 },\n        { name: \"Bob\", age: 35 },\n      ]);\n\n      const byName = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => stringCompare(a.name, b.name),\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(byName).map(p => p.name)).toEqual([\"Alice\", \"Bob\", \"Charlie\"]);\n\n      const byAge = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => a.age - b.age,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(byAge).map(p => p.name)).toEqual([\"Alice\", \"Charlie\", \"Bob\"]);\n    });\n  });\n\n  describe(\"limitPrecision\", () => {\n    it(\"exact should return exactly the limit\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(result.items.length).toBe(3);\n    });\n\n    // Note: ArrayPaginatedList always returns exact results since it has all data in memory\n    // These tests verify the contract is respected\n    it(\"at-least should return at least the limit (or all if less available)\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"at-least\",\n      });\n\n      expect(result.items.length).toBeGreaterThanOrEqual(3);\n    });\n\n    it(\"at-most should return at most the limit\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"at-most\",\n      });\n\n      expect(result.items.length).toBeLessThanOrEqual(3);\n    });\n\n    it(\"approximate should allow flexibility in either direction\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"approximate\",\n      });\n\n      // With 'approximate', the implementation can return more or fewer items\n      // than requested. We just verify it returns some items and makes progress.\n      expect(result.items.length).toBeGreaterThan(0);\n      // Should still return valid items\n      expect(items(result).every(n => typeof n === \"number\")).toBe(true);\n    });\n\n    it(\"approximate should still make progress when limit > 0\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n      const allItems: number[] = [];\n\n      let cursor = list.getFirstCursor();\n      let iterations = 0;\n      const maxIterations = 20; // Safety limit to prevent infinite loops\n\n      while (iterations < maxIterations) {\n        const result = await list.next({\n          after: cursor,\n          limit: 2,\n          filter: () => true,\n          orderBy: (a, b) => a - b,\n          limitPrecision: \"approximate\",\n        });\n\n        if (result.items.length === 0) break;\n\n        allItems.push(...items(result));\n        // Cursor must change to ensure progress\n        expect(result.cursor).not.toBe(cursor);\n        cursor = result.cursor;\n        iterations++;\n\n        if (result.isLast) break;\n      }\n\n      // Should eventually get all items\n      expect(allItems.length).toBeGreaterThan(0);\n    });\n  });\n\n  describe(\"getFirstCursor and getLastCursor\", () => {\n    it(\"should return correct cursor format\", () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      expect(list.getFirstCursor()).toBe(\"before-0\");\n      expect(list.getLastCursor()).toBe(\"before-3\");\n    });\n\n    it(\"should work for empty array\", () => {\n      const list = new ArrayPaginatedList([]);\n      expect(list.getFirstCursor()).toBe(\"before-0\");\n      expect(list.getLastCursor()).toBe(\"before-0\");\n    });\n  });\n\n  describe(\"compare\", () => {\n    it(\"should compare items using the orderBy function\", () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      const orderBy = (a: number, b: number) => a - b;\n\n      expect(list.compare(orderBy, 1, 2)).toBeLessThan(0);\n      expect(list.compare(orderBy, 2, 1)).toBeGreaterThan(0);\n      expect(list.compare(orderBy, 1, 1)).toBe(0);\n    });\n  });\n});\n\ndescribe(\"PaginatedList.empty\", () => {\n  it(\"should return empty results\", async () => {\n    const list = PaginatedList.empty();\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: {},\n      orderBy: {},\n      limitPrecision: \"exact\",\n    });\n\n    expect(result.items).toEqual([]);\n    expect(result.isFirst).toBe(true);\n    expect(result.isLast).toBe(true);\n  });\n\n  it(\"should have first cursor\", () => {\n    const list = PaginatedList.empty();\n    expect(list.getFirstCursor()).toBe(\"first\");\n    expect(list.getLastCursor()).toBe(\"last\");\n  });\n});\n\ndescribe(\"PaginatedList.map\", () => {\n  it(\"should transform items\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3]);\n    const doubled = list.map<number, NumberFilter, NumberOrderBy>({\n      itemMapper: (n) => n * 2,\n      oldItemFromNewItem: (n) => n / 2,\n      oldFilterFromNewFilter: (f) => f,\n      oldOrderByFromNewOrderBy: (o) => o,\n    });\n\n    const result = await doubled.next({\n      after: doubled.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([2, 4, 6]);\n  });\n\n  it(\"should preserve cursor semantics\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3]);\n    const doubled = list.map<number, NumberFilter, NumberOrderBy>({\n      itemMapper: (n) => n * 2,\n      oldItemFromNewItem: (n) => n / 2,\n      oldFilterFromNewFilter: (f) => f,\n      oldOrderByFromNewOrderBy: (o) => o,\n    });\n\n    const first = await doubled.next({\n      after: doubled.getFirstCursor(),\n      limit: 1,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(first)).toEqual([2]);\n\n    const second = await doubled.next({\n      after: first.cursor,\n      limit: 1,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(second)).toEqual([4]);\n  });\n});\n\ndescribe(\"PaginatedList.filter\", () => {\n  it(\"should filter items\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6]);\n    const evens = list.filter({\n      filter: (n) => n % 2 === 0,\n      oldFilterFromNewFilter: () => () => true,\n      estimateItemsToFetch: ({ limit }) => limit * 2,\n    });\n\n    const result = await evens.next({\n      after: evens.getFirstCursor(),\n      limit: 10,\n      filter: undefined,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([2, 4, 6]);\n  });\n});\n\ndescribe(\"PaginatedList.addFilter\", () => {\n  it(\"should add additional filter constraint\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n\n    // First filter: only even\n    const evens = list.filter({\n      filter: (n) => n % 2 === 0,\n      oldFilterFromNewFilter: () => () => true,\n      estimateItemsToFetch: ({ limit }) => limit * 2,\n    });\n\n    // Add filter: only > 5\n    const evenAndGreaterThan5 = evens.addFilter({\n      filter: (n) => n > 5,\n      estimateItemsToFetch: ({ limit }) => limit * 2,\n    });\n\n    const result = await evenAndGreaterThan5.next({\n      after: evenAndGreaterThan5.getFirstCursor(),\n      limit: 10,\n      filter: undefined,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([6, 8, 10]);\n  });\n});\n\ndescribe(\"PaginatedList.flatMap\", () => {\n  it(\"should expand items\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3]);\n    const expanded = list.flatMap<number, `before-${number}`, NumberFilter, NumberOrderBy>({\n      itemMapper: (entry) => [\n        { item: entry.item, prevCursor: entry.prevCursor, nextCursor: entry.nextCursor },\n        { item: entry.item + 0.5, prevCursor: entry.prevCursor, nextCursor: entry.nextCursor },\n      ],\n      compare: (_, a, b) => a - b,\n      newCursorFromOldCursor: (c) => c,\n      oldCursorFromNewCursor: (c) => c,\n      oldFilterFromNewFilter: (f) => f,\n      oldOrderByFromNewOrderBy: (o) => o,\n      estimateItemsToFetch: ({ limit }) => limit,\n    });\n\n    const result = await expanded.next({\n      after: expanded.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 1.5, 2, 2.5, 3, 3.5]);\n  });\n\n  it(\"should filter out items (return empty array)\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n    const evensOnly = list.flatMap<number, `before-${number}`, NumberFilter, NumberOrderBy>({\n      itemMapper: (entry) => entry.item % 2 === 0\n        ? [{ item: entry.item, prevCursor: entry.prevCursor, nextCursor: entry.nextCursor }]\n        : [],\n      compare: (_, a, b) => a - b,\n      newCursorFromOldCursor: (c) => c,\n      oldCursorFromNewCursor: (c) => c,\n      oldFilterFromNewFilter: (f) => f,\n      oldOrderByFromNewOrderBy: (o) => o,\n      estimateItemsToFetch: ({ limit }) => limit * 2,\n    });\n\n    const result = await evensOnly.next({\n      after: evensOnly.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([2, 4]);\n  });\n});\n\ndescribe(\"PaginatedList.merge\", () => {\n  it(\"should merge two lists\", async () => {\n    const list1 = new ArrayPaginatedList([1, 3, 5]);\n    const list2 = new ArrayPaginatedList([2, 4, 6]);\n\n    const merged = PaginatedList.merge(list1, list2);\n\n    const result = await merged.next({\n      after: merged.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 2, 3, 4, 5, 6]);\n  });\n\n  it(\"should merge three lists\", async () => {\n    const list1 = new ArrayPaginatedList([1, 4, 7]);\n    const list2 = new ArrayPaginatedList([2, 5, 8]);\n    const list3 = new ArrayPaginatedList([3, 6, 9]);\n\n    const merged = PaginatedList.merge(list1, list2, list3);\n\n    const result = await merged.next({\n      after: merged.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n  });\n\n  it(\"should handle empty lists in merge\", async () => {\n    const list1 = new ArrayPaginatedList([1, 2, 3]);\n    const list2 = new ArrayPaginatedList<number>([]);\n\n    const merged = PaginatedList.merge(list1, list2);\n\n    const result = await merged.next({\n      after: merged.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 2, 3]);\n  });\n\n  it(\"should paginate through merged list\", async () => {\n    const list1 = new ArrayPaginatedList([1, 3, 5, 7, 9]);\n    const list2 = new ArrayPaginatedList([2, 4, 6, 8, 10]);\n\n    const merged = PaginatedList.merge(list1, list2);\n\n    const first = await merged.next({\n      after: merged.getFirstCursor(),\n      limit: 4,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(first)).toEqual([1, 2, 3, 4]);\n\n    const second = await merged.next({\n      after: first.cursor,\n      limit: 4,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(second)).toEqual([5, 6, 7, 8]);\n  });\n\n  it(\"should have JSON-encoded cursor\", () => {\n    const list1 = new ArrayPaginatedList([1, 2]);\n    const list2 = new ArrayPaginatedList([3, 4]);\n\n    const merged = PaginatedList.merge(list1, list2);\n    const cursor = merged.getFirstCursor();\n\n    expect(() => JSON.parse(cursor)).not.toThrow();\n    expect(JSON.parse(cursor)).toEqual([\"before-0\", \"before-0\"]);\n  });\n\n  it(\"should paginate backward through merged list correctly\", async () => {\n    const list1 = new ArrayPaginatedList([1, 3, 5]);\n    const list2 = new ArrayPaginatedList([2, 4, 6]);\n\n    const merged = PaginatedList.merge(list1, list2);\n\n    // Get last 3 items going backward\n    const last = await merged.prev({\n      before: merged.getLastCursor(),\n      limit: 3,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(last)).toEqual([4, 5, 6]);\n    expect(last.isLast).toBe(true);\n    expect(last.isFirst).toBe(false);\n\n    // Continue backward to get previous 3 items\n    const middle = await merged.prev({\n      before: last.cursor,\n      limit: 3,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(middle)).toEqual([1, 2, 3]);\n    expect(middle.isFirst).toBe(true);\n  });\n\n  it(\"should paginate backward through entire merged list\", async () => {\n    const list1 = new ArrayPaginatedList([1, 3, 5, 7, 9]);\n    const list2 = new ArrayPaginatedList([2, 4, 6, 8, 10]);\n\n    const merged = PaginatedList.merge(list1, list2);\n    const allItems: number[] = [];\n\n    let cursor = merged.getLastCursor();\n    let isFirst = false;\n\n    while (!isFirst) {\n      const result = await merged.prev({\n        before: cursor,\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.unshift(...items(result));\n      cursor = result.cursor;\n      isFirst = result.isFirst;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n  });\n\n  it(\"should have consistent forward and backward pagination results\", async () => {\n    const list1 = new ArrayPaginatedList([1, 4, 7]);\n    const list2 = new ArrayPaginatedList([2, 5, 8]);\n    const list3 = new ArrayPaginatedList([3, 6, 9]);\n\n    const merged = PaginatedList.merge(list1, list2, list3);\n\n    // Collect all items going forward\n    const forwardItems: number[] = [];\n    let forwardCursor = merged.getFirstCursor();\n    let isLast = false;\n\n    while (!isLast) {\n      const result = await merged.next({\n        after: forwardCursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      forwardItems.push(...items(result));\n      forwardCursor = result.cursor;\n      isLast = result.isLast;\n    }\n\n    // Collect all items going backward\n    const backwardItems: number[] = [];\n    let backwardCursor = merged.getLastCursor();\n    let isFirst = false;\n\n    while (!isFirst) {\n      const result = await merged.prev({\n        before: backwardCursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      backwardItems.unshift(...items(result));\n      backwardCursor = result.cursor;\n      isFirst = result.isFirst;\n    }\n\n    // Both directions should yield the same final result\n    expect(forwardItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n    expect(backwardItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n  });\n});\n\ndescribe(\"edge cases\", () => {\n  it(\"should handle single item\", async () => {\n    const list = new ArrayPaginatedList([42]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([42]);\n    expect(result.isFirst).toBe(true);\n    expect(result.isLast).toBe(true);\n  });\n\n  it(\"should handle duplicate values\", async () => {\n    const list = new ArrayPaginatedList([1, 1, 2, 2, 3, 3]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 1, 2, 2, 3, 3]);\n  });\n\n  it(\"should handle negative numbers\", async () => {\n    const list = new ArrayPaginatedList([-3, -1, 0, 1, 3]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([-3, -1, 0, 1, 3]);\n  });\n\n  it(\"should handle string items\", async () => {\n    const list = new ArrayPaginatedList([\"banana\", \"apple\", \"cherry\"]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => stringCompare(a, b),\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([\"apple\", \"banana\", \"cherry\"]);\n  });\n\n  it(\"should handle object items\", async () => {\n    const list = new ArrayPaginatedList([\n      { id: 1, value: \"a\" },\n      { id: 2, value: \"b\" },\n    ]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a.id - b.id,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([\n      { id: 1, value: \"a\" },\n      { id: 2, value: \"b\" },\n    ]);\n  });\n});\n\ndescribe(\"complete pagination walkthrough\", () => {\n  it(\"should paginate forward through entire list\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n    const allItems: number[] = [];\n\n    let cursor = list.getFirstCursor();\n    let isLast = false;\n\n    while (!isLast) {\n      const result = await list.next({\n        after: cursor,\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.push(...items(result));\n      cursor = result.cursor;\n      isLast = result.isLast;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n  });\n\n  it(\"should paginate backward through entire list\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n    const allItems: number[] = [];\n\n    let cursor = list.getLastCursor();\n    let isFirst = false;\n\n    while (!isFirst) {\n      const result = await list.prev({\n        before: cursor,\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.unshift(...items(result));\n      cursor = result.cursor;\n      isFirst = result.isFirst;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n  });\n});\n\ndescribe(\"unsorted array pagination\", () => {\n  it(\"should correctly paginate through an unsorted array with sorting\", async () => {\n    const list = new ArrayPaginatedList([3, 1, 2]);\n\n    const first = await list.next({\n      after: list.getFirstCursor(),\n      limit: 2,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(first)).toEqual([1, 2]);\n\n    const second = await list.next({\n      after: first.cursor,\n      limit: 2,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(second)).toEqual([3]);\n  });\n\n  it(\"should maintain sorted order across pagination boundaries\", async () => {\n    const list = new ArrayPaginatedList([5, 4, 3, 2, 1]);\n    const allItems: number[] = [];\n\n    let cursor = list.getFirstCursor();\n    let isLast = false;\n\n    while (!isLast) {\n      const result = await list.next({\n        after: cursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.push(...items(result));\n      cursor = result.cursor;\n      isLast = result.isLast;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5]);\n  });\n\n  it(\"should handle random order array correctly\", async () => {\n    const list = new ArrayPaginatedList([7, 2, 9, 1, 5, 8, 3, 6, 4]);\n\n    const allItems: number[] = [];\n    let cursor = list.getFirstCursor();\n    let isLast = false;\n\n    while (!isLast) {\n      const result = await list.next({\n        after: cursor,\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.push(...items(result));\n      cursor = result.cursor;\n      isLast = result.isLast;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n  });\n\n  it(\"should have consistent cursor semantics with sorted data\", async () => {\n    const list = new ArrayPaginatedList([3, 1, 2]);\n\n    const first = await list.next({\n      after: list.getFirstCursor(),\n      limit: 1,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(first)).toEqual([1]);\n\n    const second = await list.next({\n      after: first.cursor,\n      limit: 1,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(second)).toEqual([2]);\n  });\n});\n\n"],"mappings":";;;;;AAQA,MAAM,SAAY,WAAqC,OAAO,MAAM,KAAI,MAAK,EAAE,KAAK;AAEpF,SAAS,4BAA4B;AACnC,UAAS,yCAAyC;AAChD,KAAG,mEAAmE,YAAY;GAChF,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAE,CAAC;GAC9C,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,UAAO,MAAM,OAAO,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;IAAE,CAAC;AACxC,UAAO,OAAO,QAAQ,CAAC,KAAK,KAAK;AACjC,UAAO,OAAO,OAAO,CAAC,KAAK,KAAK;IAChC;AAEF,KAAG,mDAAmD,YAAY;GAChE,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;GACpD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,UAAO,MAAM,OAAO,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;IAAE,CAAC;AACxC,UAAO,OAAO,QAAQ,CAAC,KAAK,KAAK;AACjC,UAAO,OAAO,OAAO,CAAC,KAAK,MAAM;IACjC;AAEF,KAAG,yCAAyC,YAAY;GACtD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;GACpD,MAAM,QAAQ,MAAM,KAAK,KAAK;IAC5B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,UAAO,MAAM,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;AACpC,UAAO,MAAM,OAAO,CAAC,KAAK,WAAW;GAErC,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,MAAM;IACb,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,UAAO,MAAM,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;AACrC,UAAO,OAAO,QAAQ,CAAC,KAAK,MAAM;AAClC,UAAO,OAAO,OAAO,CAAC,KAAK,MAAM;IACjC;AAEF,KAAG,6BAA6B,YAAY;GAC1C,MAAM,OAAO,IAAI,mBAA2B,EAAE,CAAC;GAC/C,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,UAAO,MAAM,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAC;AACjC,UAAO,OAAO,QAAQ,CAAC,KAAK,KAAK;AACjC,UAAO,OAAO,OAAO,CAAC,KAAK,KAAK;IAChC;AAEF,KAAG,4BAA4B,YAAY;GACzC,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAE,CAAC;AAS9C,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,EAAE,CAAC;IACjC;GACF;AAEF,UAAS,oCAAoC;AAC3C,KAAG,qCAAqC,YAAY;GAClD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;GACpD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,QAAQ,KAAK,eAAe;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,UAAO,MAAM,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;AACrC,UAAO,OAAO,QAAQ,CAAC,KAAK,MAAM;AAClC,UAAO,OAAO,OAAO,CAAC,KAAK,KAAK;IAChC;AAEF,KAAG,uCAAuC,YAAY;GACpD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;GAEpD,MAAM,OAAO,MAAM,KAAK,KAAK;IAC3B,QAAQ,KAAK,eAAe;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AACF,UAAO,MAAM,KAAK,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;GAEnC,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,QAAQ,KAAK;IACb,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AACF,UAAO,MAAM,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;GAErC,MAAM,QAAQ,MAAM,KAAK,KAAK;IAC5B,QAAQ,OAAO;IACf,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AACF,UAAO,MAAM,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;AACjC,UAAO,MAAM,QAAQ,CAAC,KAAK,KAAK;IAChC;GACF;AAEF,UAAS,sDAAsD;AAC7D,KAAG,+DAA+D,YAAY;GAC5E,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAI;IAAI;IAAG,CAAC;GACjD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAGF,UAAO,OAAO,MAAM,GAAG,WAAW,CAAC,KAAK,WAAW;AACnD,UAAO,OAAO,MAAM,GAAG,WAAW,CAAC,KAAK,WAAW;AAGnD,UAAO,OAAO,MAAM,GAAG,WAAW,CAAC,KAAK,WAAW;AACnD,UAAO,OAAO,MAAM,GAAG,WAAW,CAAC,KAAK,WAAW;AAGnD,UAAO,OAAO,MAAM,GAAG,WAAW,CAAC,KAAK,WAAW;AACnD,UAAO,OAAO,MAAM,GAAG,WAAW,CAAC,KAAK,WAAW;IACnD;AAEF,KAAG,gEAAgE,YAAY;GAC7E,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;GAEpD,MAAM,QAAQ,MAAM,KAAK,KAAK;IAC5B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;GAGF,MAAM,eAAe,MAAM,MAAM,MAAM,MAAM,SAAS,GAAG;AASzD,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;IACrC;AAEF,KAAG,4CAA4C,YAAY;GACzD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;GAGpD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,UAAO,MAAM,OAAO,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;IAAE,CAAC;AACxC,UAAO,OAAO,MAAM,GAAG,WAAW,CAAC,KAAK,WAAW;AAWnD,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,QAAQ,OAAO,MAAM,GAAG;IACxB,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;IACrC;GACF;AAEF,UAAS,mBAAmB;AAC1B,KAAG,iCAAiC,YAAY;GAC9C,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;AASvD,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,SAAS,MAAM,IAAI,MAAM;IACzB,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;IAAE,CAAC;IACxC;AAEF,KAAG,uCAAuC,YAAY;GACpD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG,CAAC;AASpE,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,SAAS,MAAM,IAAI,MAAM;IACzB,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;IACrC;AAEF,KAAG,6CAA6C,YAAY;GAC1D,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAE,CAAC;AAS9C,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,EAAE,CAAC;IACjC;GACF;AAEF,UAAS,kBAAkB;AACzB,KAAG,wCAAwC,YAAY;GACrD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;AASpD,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;IAC9C;AAEF,KAAG,yCAAyC,YAAY;GACtD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;AASpD,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;IAC9C;AAEF,KAAG,mCAAmC,YAAY;GAChD,MAAM,OAAO,IAAI,mBAAmB;IAClC;KAAE,MAAM;KAAW,KAAK;KAAI;IAC5B;KAAE,MAAM;KAAS,KAAK;KAAI;IAC1B;KAAE,MAAM;KAAO,KAAK;KAAI;IACzB,CAAC;AAUF,UAAO,MARQ,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,cAAc,EAAE,MAAM,EAAE,KAAK;IAChD,gBAAgB;IACjB,CAAC,CAEkB,CAAC,KAAI,MAAK,EAAE,KAAK,CAAC,CAAC,QAAQ;IAAC;IAAS;IAAO;IAAU,CAAC;AAU3E,UAAO,MARO,MAAM,KAAK,KAAK;IAC5B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,EAAE,MAAM,EAAE;IAC7B,gBAAgB;IACjB,CAAC,CAEiB,CAAC,KAAI,MAAK,EAAE,KAAK,CAAC,CAAC,QAAQ;IAAC;IAAS;IAAW;IAAM,CAAC;IAC1E;GACF;AAEF,UAAS,wBAAwB;AAC/B,KAAG,yCAAyC,YAAY;GACtD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;AASpD,WARe,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,EAEY,MAAM,OAAO,CAAC,KAAK,EAAE;IACnC;AAIF,KAAG,wEAAwE,YAAY;GACrF,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;AASpD,WARe,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,EAEY,MAAM,OAAO,CAAC,uBAAuB,EAAE;IACrD;AAEF,KAAG,2CAA2C,YAAY;GACxD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;AASpD,WARe,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC,EAEY,MAAM,OAAO,CAAC,oBAAoB,EAAE;IAClD;AAEF,KAAG,4DAA4D,YAAY;GACzE,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAE,CAAC;GACpD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,gBAAgB;IAC5B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAIF,UAAO,OAAO,MAAM,OAAO,CAAC,gBAAgB,EAAE;AAE9C,UAAO,MAAM,OAAO,CAAC,OAAM,MAAK,OAAO,MAAM,SAAS,CAAC,CAAC,KAAK,KAAK;IAClE;AAEF,KAAG,yDAAyD,YAAY;GACtE,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG,CAAC;GACpE,MAAM,WAAqB,EAAE;GAE7B,IAAI,SAAS,KAAK,gBAAgB;GAClC,IAAI,aAAa;GACjB,MAAM,gBAAgB;AAEtB,UAAO,aAAa,eAAe;IACjC,MAAM,SAAS,MAAM,KAAK,KAAK;KAC7B,OAAO;KACP,OAAO;KACP,cAAc;KACd,UAAU,GAAG,MAAM,IAAI;KACvB,gBAAgB;KACjB,CAAC;AAEF,QAAI,OAAO,MAAM,WAAW,EAAG;AAE/B,aAAS,KAAK,GAAG,MAAM,OAAO,CAAC;AAE/B,WAAO,OAAO,OAAO,CAAC,IAAI,KAAK,OAAO;AACtC,aAAS,OAAO;AAChB;AAEA,QAAI,OAAO,OAAQ;;AAIrB,UAAO,SAAS,OAAO,CAAC,gBAAgB,EAAE;IAC1C;GACF;AAEF,UAAS,0CAA0C;AACjD,KAAG,6CAA6C;GAC9C,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAE,CAAC;AAC9C,UAAO,KAAK,gBAAgB,CAAC,CAAC,KAAK,WAAW;AAC9C,UAAO,KAAK,eAAe,CAAC,CAAC,KAAK,WAAW;IAC7C;AAEF,KAAG,qCAAqC;GACtC,MAAM,OAAO,IAAI,mBAAmB,EAAE,CAAC;AACvC,UAAO,KAAK,gBAAgB,CAAC,CAAC,KAAK,WAAW;AAC9C,UAAO,KAAK,eAAe,CAAC,CAAC,KAAK,WAAW;IAC7C;GACF;AAEF,UAAS,iBAAiB;AACxB,KAAG,yDAAyD;GAC1D,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAE,CAAC;GAC9C,MAAM,WAAW,GAAW,MAAc,IAAI;AAE9C,UAAO,KAAK,QAAQ,SAAS,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE;AACnD,UAAO,KAAK,QAAQ,SAAS,GAAG,EAAE,CAAC,CAAC,gBAAgB,EAAE;AACtD,UAAO,KAAK,QAAQ,SAAS,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE;IAC3C;GACF;EACF;AAEF,SAAS,6BAA6B;AACpC,IAAG,+BAA+B,YAAY;EAC5C,MAAM,OAAO,cAAc,OAAO;EAClC,MAAM,SAAS,MAAM,KAAK,KAAK;GAC7B,OAAO,KAAK,gBAAgB;GAC5B,OAAO;GACP,QAAQ,EAAE;GACV,SAAS,EAAE;GACX,gBAAgB;GACjB,CAAC;AAEF,SAAO,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC;AAChC,SAAO,OAAO,QAAQ,CAAC,KAAK,KAAK;AACjC,SAAO,OAAO,OAAO,CAAC,KAAK,KAAK;GAChC;AAEF,IAAG,kCAAkC;EACnC,MAAM,OAAO,cAAc,OAAO;AAClC,SAAO,KAAK,gBAAgB,CAAC,CAAC,KAAK,QAAQ;AAC3C,SAAO,KAAK,eAAe,CAAC,CAAC,KAAK,OAAO;GACzC;EACF;AAEF,SAAS,2BAA2B;AAClC,IAAG,0BAA0B,YAAY;EAEvC,MAAM,UADO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC,CACzB,IAAyC;GAC5D,aAAa,MAAM,IAAI;GACvB,qBAAqB,MAAM,IAAI;GAC/B,yBAAyB,MAAM;GAC/B,2BAA2B,MAAM;GAClC,CAAC;AAUF,SAAO,MARQ,MAAM,QAAQ,KAAK;GAChC,OAAO,QAAQ,gBAAgB;GAC/B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAE,CAAC;GACxC;AAEF,IAAG,oCAAoC,YAAY;EAEjD,MAAM,UADO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC,CACzB,IAAyC;GAC5D,aAAa,MAAM,IAAI;GACvB,qBAAqB,MAAM,IAAI;GAC/B,yBAAyB,MAAM;GAC/B,2BAA2B,MAAM;GAClC,CAAC;EAEF,MAAM,QAAQ,MAAM,QAAQ,KAAK;GAC/B,OAAO,QAAQ,gBAAgB;GAC/B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC;AAEF,SAAO,MAAM,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;AAUjC,SAAO,MARQ,MAAM,QAAQ,KAAK;GAChC,OAAO,MAAM;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;GAClC;EACF;AAEF,SAAS,8BAA8B;AACrC,IAAG,uBAAuB,YAAY;EAEpC,MAAM,QADO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC,CACpC,OAAO;GACxB,SAAS,MAAM,IAAI,MAAM;GACzB,oCAAoC;GACpC,uBAAuB,EAAE,YAAY,QAAQ;GAC9C,CAAC;AAUF,SAAO,MARQ,MAAM,MAAM,KAAK;GAC9B,OAAO,MAAM,gBAAgB;GAC7B,OAAO;GACP,QAAQ;GACR,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAE,CAAC;GACxC;EACF;AAEF,SAAS,iCAAiC;AACxC,IAAG,2CAA2C,YAAY;EAWxD,MAAM,sBAVO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG,CAAC,CAGjD,OAAO;GACxB,SAAS,MAAM,IAAI,MAAM;GACzB,oCAAoC;GACpC,uBAAuB,EAAE,YAAY,QAAQ;GAC9C,CAAC,CAGgC,UAAU;GAC1C,SAAS,MAAM,IAAI;GACnB,uBAAuB,EAAE,YAAY,QAAQ;GAC9C,CAAC;AAUF,SAAO,MARQ,MAAM,oBAAoB,KAAK;GAC5C,OAAO,oBAAoB,gBAAgB;GAC3C,OAAO;GACP,QAAQ;GACR,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG,CAAC;GACzC;EACF;AAEF,SAAS,+BAA+B;AACtC,IAAG,uBAAuB,YAAY;EAEpC,MAAM,WADO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC,CACxB,QAAiE;GACrF,aAAa,UAAU,CACrB;IAAE,MAAM,MAAM;IAAM,YAAY,MAAM;IAAY,YAAY,MAAM;IAAY,EAChF;IAAE,MAAM,MAAM,OAAO;IAAK,YAAY,MAAM;IAAY,YAAY,MAAM;IAAY,CACvF;GACD,UAAU,GAAG,GAAG,MAAM,IAAI;GAC1B,yBAAyB,MAAM;GAC/B,yBAAyB,MAAM;GAC/B,yBAAyB,MAAM;GAC/B,2BAA2B,MAAM;GACjC,uBAAuB,EAAE,YAAY;GACtC,CAAC;AAUF,SAAO,MARQ,MAAM,SAAS,KAAK;GACjC,OAAO,SAAS,gBAAgB;GAChC,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAK;GAAG;GAAK;GAAG;GAAI,CAAC;GACvD;AAEF,IAAG,gDAAgD,YAAY;EAE7D,MAAM,YADO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC,CAC7B,QAAiE;GACtF,aAAa,UAAU,MAAM,OAAO,MAAM,IACtC,CAAC;IAAE,MAAM,MAAM;IAAM,YAAY,MAAM;IAAY,YAAY,MAAM;IAAY,CAAC,GAClF,EAAE;GACN,UAAU,GAAG,GAAG,MAAM,IAAI;GAC1B,yBAAyB,MAAM;GAC/B,yBAAyB,MAAM;GAC/B,yBAAyB,MAAM;GAC/B,2BAA2B,MAAM;GACjC,uBAAuB,EAAE,YAAY,QAAQ;GAC9C,CAAC;AAUF,SAAO,MARQ,MAAM,UAAU,KAAK;GAClC,OAAO,UAAU,gBAAgB;GACjC,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;GACrC;EACF;AAEF,SAAS,6BAA6B;AACpC,IAAG,0BAA0B,YAAY;EACvC,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAC/C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAE/C,MAAM,SAAS,cAAc,MAAM,OAAO,MAAM;AAUhD,SAAO,MARQ,MAAM,OAAO,KAAK;GAC/B,OAAO,OAAO,gBAAgB;GAC9B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;GACjD;AAEF,IAAG,4BAA4B,YAAY;EACzC,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAC/C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAC/C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAE/C,MAAM,SAAS,cAAc,MAAM,OAAO,OAAO,MAAM;AAUvD,SAAO,MARQ,MAAM,OAAO,KAAK;GAC/B,OAAO,OAAO,gBAAgB;GAC9B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;GAC1D;AAEF,IAAG,sCAAsC,YAAY;EACnD,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAC/C,MAAM,QAAQ,IAAI,mBAA2B,EAAE,CAAC;EAEhD,MAAM,SAAS,cAAc,MAAM,OAAO,MAAM;AAUhD,SAAO,MARQ,MAAM,OAAO,KAAK;GAC/B,OAAO,OAAO,gBAAgB;GAC9B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAE,CAAC;GACxC;AAEF,IAAG,uCAAuC,YAAY;EACpD,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;EACrD,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG,CAAC;EAEtD,MAAM,SAAS,cAAc,MAAM,OAAO,MAAM;EAEhD,MAAM,QAAQ,MAAM,OAAO,KAAK;GAC9B,OAAO,OAAO,gBAAgB;GAC9B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC;AAEF,SAAO,MAAM,MAAM,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAE,CAAC;AAU1C,SAAO,MARQ,MAAM,OAAO,KAAK;GAC/B,OAAO,MAAM;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAE,CAAC;GAC3C;AAEF,IAAG,yCAAyC;EAC1C,MAAM,QAAQ,IAAI,mBAAmB,CAAC,GAAG,EAAE,CAAC;EAC5C,MAAM,QAAQ,IAAI,mBAAmB,CAAC,GAAG,EAAE,CAAC;EAG5C,MAAM,SADS,cAAc,MAAM,OAAO,MAAM,CAC1B,gBAAgB;AAEtC,eAAa,KAAK,MAAM,OAAO,CAAC,CAAC,IAAI,SAAS;AAC9C,SAAO,KAAK,MAAM,OAAO,CAAC,CAAC,QAAQ,CAAC,YAAY,WAAW,CAAC;GAC5D;AAEF,IAAG,0DAA0D,YAAY;EACvE,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAC/C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAE/C,MAAM,SAAS,cAAc,MAAM,OAAO,MAAM;EAGhD,MAAM,OAAO,MAAM,OAAO,KAAK;GAC7B,QAAQ,OAAO,eAAe;GAC9B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC;AAEF,SAAO,MAAM,KAAK,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAE,CAAC;AACtC,SAAO,KAAK,OAAO,CAAC,KAAK,KAAK;AAC9B,SAAO,KAAK,QAAQ,CAAC,KAAK,MAAM;EAGhC,MAAM,SAAS,MAAM,OAAO,KAAK;GAC/B,QAAQ,KAAK;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC;AAEF,SAAO,MAAM,OAAO,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAE,CAAC;AACxC,SAAO,OAAO,QAAQ,CAAC,KAAK,KAAK;GACjC;AAEF,IAAG,uDAAuD,YAAY;EACpE,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;EACrD,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG,CAAC;EAEtD,MAAM,SAAS,cAAc,MAAM,OAAO,MAAM;EAChD,MAAM,WAAqB,EAAE;EAE7B,IAAI,SAAS,OAAO,eAAe;EACnC,IAAI,UAAU;AAEd,SAAO,CAAC,SAAS;GACf,MAAM,SAAS,MAAM,OAAO,KAAK;IAC/B,QAAQ;IACR,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,YAAS,QAAQ,GAAG,MAAM,OAAO,CAAC;AAClC,YAAS,OAAO;AAChB,aAAU,OAAO;;AAGnB,SAAO,SAAS,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG,CAAC;GACzD;AAEF,IAAG,kEAAkE,YAAY;EAC/E,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAC/C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAC/C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAE/C,MAAM,SAAS,cAAc,MAAM,OAAO,OAAO,MAAM;EAGvD,MAAM,eAAyB,EAAE;EACjC,IAAI,gBAAgB,OAAO,gBAAgB;EAC3C,IAAI,SAAS;AAEb,SAAO,CAAC,QAAQ;GACd,MAAM,SAAS,MAAM,OAAO,KAAK;IAC/B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,gBAAa,KAAK,GAAG,MAAM,OAAO,CAAC;AACnC,mBAAgB,OAAO;AACvB,YAAS,OAAO;;EAIlB,MAAM,gBAA0B,EAAE;EAClC,IAAI,iBAAiB,OAAO,eAAe;EAC3C,IAAI,UAAU;AAEd,SAAO,CAAC,SAAS;GACf,MAAM,SAAS,MAAM,OAAO,KAAK;IAC/B,QAAQ;IACR,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,iBAAc,QAAQ,GAAG,MAAM,OAAO,CAAC;AACvC,oBAAiB,OAAO;AACxB,aAAU,OAAO;;AAInB,SAAO,aAAa,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;AACzD,SAAO,cAAc,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;GAC1D;EACF;AAEF,SAAS,oBAAoB;AAC3B,IAAG,6BAA6B,YAAY;EAC1C,MAAM,OAAO,IAAI,mBAAmB,CAAC,GAAG,CAAC;EACzC,MAAM,SAAS,MAAM,KAAK,KAAK;GAC7B,OAAO,KAAK,gBAAgB;GAC5B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC;AAEF,SAAO,MAAM,OAAO,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;AACnC,SAAO,OAAO,QAAQ,CAAC,KAAK,KAAK;AACjC,SAAO,OAAO,OAAO,CAAC,KAAK,KAAK;GAChC;AAEF,IAAG,kCAAkC,YAAY;EAC/C,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;AASvD,SAAO,MARQ,MAAM,KAAK,KAAK;GAC7B,OAAO,KAAK,gBAAgB;GAC5B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;GACjD;AAEF,IAAG,kCAAkC,YAAY;EAC/C,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAI;GAAI;GAAG;GAAG;GAAE,CAAC;AAStD,SAAO,MARQ,MAAM,KAAK,KAAK;GAC7B,OAAO,KAAK,gBAAgB;GAC5B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAI;GAAI;GAAG;GAAG;GAAE,CAAC;GAChD;AAEF,IAAG,8BAA8B,YAAY;EAC3C,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAU;GAAS;GAAS,CAAC;AASlE,SAAO,MARQ,MAAM,KAAK,KAAK;GAC7B,OAAO,KAAK,gBAAgB;GAC5B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,cAAc,GAAG,EAAE;GACtC,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ;GAAC;GAAS;GAAU;GAAS,CAAC;GAC5D;AAEF,IAAG,8BAA8B,YAAY;EAC3C,MAAM,OAAO,IAAI,mBAAmB,CAClC;GAAE,IAAI;GAAG,OAAO;GAAK,EACrB;GAAE,IAAI;GAAG,OAAO;GAAK,CACtB,CAAC;AASF,SAAO,MARQ,MAAM,KAAK,KAAK;GAC7B,OAAO,KAAK,gBAAgB;GAC5B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,EAAE,KAAK,EAAE;GAC5B,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,CAC5B;GAAE,IAAI;GAAG,OAAO;GAAK,EACrB;GAAE,IAAI;GAAG,OAAO;GAAK,CACtB,CAAC;GACF;EACF;AAEF,SAAS,yCAAyC;AAChD,IAAG,+CAA+C,YAAY;EAC5D,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG,CAAC;EACpE,MAAM,WAAqB,EAAE;EAE7B,IAAI,SAAS,KAAK,gBAAgB;EAClC,IAAI,SAAS;AAEb,SAAO,CAAC,QAAQ;GACd,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,YAAS,KAAK,GAAG,MAAM,OAAO,CAAC;AAC/B,YAAS,OAAO;AAChB,YAAS,OAAO;;AAGlB,SAAO,SAAS,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG,CAAC;GACzD;AAEF,IAAG,gDAAgD,YAAY;EAC7D,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG,CAAC;EACpE,MAAM,WAAqB,EAAE;EAE7B,IAAI,SAAS,KAAK,eAAe;EACjC,IAAI,UAAU;AAEd,SAAO,CAAC,SAAS;GACf,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,QAAQ;IACR,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,YAAS,QAAQ,GAAG,MAAM,OAAO,CAAC;AAClC,YAAS,OAAO;AAChB,aAAU,OAAO;;AAGnB,SAAO,SAAS,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG,CAAC;GACzD;EACF;AAEF,SAAS,mCAAmC;AAC1C,IAAG,oEAAoE,YAAY;EACjF,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAE9C,MAAM,QAAQ,MAAM,KAAK,KAAK;GAC5B,OAAO,KAAK,gBAAgB;GAC5B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC;AAEF,SAAO,MAAM,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;AAUpC,SAAO,MARQ,MAAM,KAAK,KAAK;GAC7B,OAAO,MAAM;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;GAClC;AAEF,IAAG,6DAA6D,YAAY;EAC1E,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;EACpD,MAAM,WAAqB,EAAE;EAE7B,IAAI,SAAS,KAAK,gBAAgB;EAClC,IAAI,SAAS;AAEb,SAAO,CAAC,QAAQ;GACd,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,YAAS,KAAK,GAAG,MAAM,OAAO,CAAC;AAC/B,YAAS,OAAO;AAChB,YAAS,OAAO;;AAGlB,SAAO,SAAS,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;GACzC;AAEF,IAAG,8CAA8C,YAAY;EAC3D,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;EAEhE,MAAM,WAAqB,EAAE;EAC7B,IAAI,SAAS,KAAK,gBAAgB;EAClC,IAAI,SAAS;AAEb,SAAO,CAAC,QAAQ;GACd,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;IACjB,CAAC;AAEF,YAAS,KAAK,GAAG,MAAM,OAAO,CAAC;AAC/B,YAAS,OAAO;AAChB,YAAS,OAAO;;AAGlB,SAAO,SAAS,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAE,CAAC;GACrD;AAEF,IAAG,4DAA4D,YAAY;EACzE,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAE,CAAC;EAE9C,MAAM,QAAQ,MAAM,KAAK,KAAK;GAC5B,OAAO,KAAK,gBAAgB;GAC5B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC;AAEF,SAAO,MAAM,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;AAUjC,SAAO,MARQ,MAAM,KAAK,KAAK;GAC7B,OAAO,MAAM;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;GACjB,CAAC,CAEkB,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;GAClC;EACF"}
+{"version":3,"file":"paginated-lists.test.js","names":[],"sources":["../../../src/utils/paginated-lists.test.ts"],"sourcesContent":["import { describe, expect, it } from \"vitest\";\nimport { ArrayPaginatedList, PaginatedList } from \"./paginated-lists\";\nimport { stringCompare } from \"./strings\";\n\ntype NumberFilter = (item: number) => boolean;\ntype NumberOrderBy = (a: number, b: number) => number;\n\n// Helper to extract just the items from a paginated result\nconst items = <T>(result: { items: { item: T }[] }) => result.items.map(i => i.item);\n\ndescribe(\"ArrayPaginatedList\", () => {\n  describe(\"basic forward pagination (next)\", () => {\n    it(\"should return all items when limit is greater than array length\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([1, 2, 3]);\n      expect(result.isFirst).toBe(true);\n      expect(result.isLast).toBe(true);\n    });\n\n    it(\"should return exact limit when more items exist\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([1, 2, 3]);\n      expect(result.isFirst).toBe(true);\n      expect(result.isLast).toBe(false);\n    });\n\n    it(\"should continue from cursor correctly\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const first = await list.next({\n        after: list.getFirstCursor(),\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(first)).toEqual([1, 2]);\n      expect(first.cursor).toBe(\"before-2\");\n\n      const second = await list.next({\n        after: first.cursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(second)).toEqual([3, 4]);\n      expect(second.isFirst).toBe(false);\n      expect(second.isLast).toBe(false);\n    });\n\n    it(\"should handle empty array\", async () => {\n      const list = new ArrayPaginatedList<number>([]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([]);\n      expect(result.isFirst).toBe(true);\n      expect(result.isLast).toBe(true);\n    });\n\n    it(\"should handle limit of 0\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 0,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([]);\n    });\n  });\n\n  describe(\"backward pagination (prev)\", () => {\n    it(\"should return items before cursor\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.prev({\n        before: list.getLastCursor(),\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([4, 5]);\n      expect(result.isFirst).toBe(false);\n      expect(result.isLast).toBe(true);\n    });\n\n    it(\"should paginate backwards correctly\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n\n      const last = await list.prev({\n        before: list.getLastCursor(),\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n      expect(items(last)).toEqual([4, 5]);\n\n      const middle = await list.prev({\n        before: last.cursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n      expect(items(middle)).toEqual([2, 3]);\n\n      const first = await list.prev({\n        before: middle.cursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n      expect(items(first)).toEqual([1]);\n      expect(first.isFirst).toBe(true);\n    });\n  });\n\n  describe(\"cursor semantics (prevCursor and nextCursor)\", () => {\n    it(\"should have prevCursor before the item and nextCursor after\", async () => {\n      const list = new ArrayPaginatedList([10, 20, 30]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      // First item: prevCursor should be \"before-0\", nextCursor should be \"before-1\"\n      expect(result.items[0].prevCursor).toBe(\"before-0\");\n      expect(result.items[0].nextCursor).toBe(\"before-1\");\n\n      // Second item\n      expect(result.items[1].prevCursor).toBe(\"before-1\");\n      expect(result.items[1].nextCursor).toBe(\"before-2\");\n\n      // Third item\n      expect(result.items[2].prevCursor).toBe(\"before-2\");\n      expect(result.items[2].nextCursor).toBe(\"before-3\");\n    });\n\n    it(\"should allow using nextCursor to continue forward pagination\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n\n      const first = await list.next({\n        after: list.getFirstCursor(),\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      // Use the nextCursor of the last item to continue\n      const continueFrom = first.items[first.items.length - 1].nextCursor;\n      const second = await list.next({\n        after: continueFrom,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(second)).toEqual([3, 4]);\n    });\n\n    it(\"should allow using prevCursor to go back\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n\n      // Get items 3,4,5 first\n      const middle = await list.next({\n        after: \"before-2\",\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(middle)).toEqual([3, 4, 5]);\n      expect(middle.items[0].prevCursor).toBe(\"before-2\");\n\n      // Use prevCursor of first item to go back\n      const goBack = await list.prev({\n        before: middle.items[0].prevCursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(goBack)).toEqual([1, 2]);\n    });\n  });\n\n  describe(\"filtering\", () => {\n    it(\"should filter items correctly\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: (n) => n % 2 === 0, // only even numbers\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([2, 4, 6]);\n    });\n\n    it(\"should respect limit with filtering\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 2,\n        filter: (n) => n % 2 === 0,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([2, 4]);\n    });\n\n    it(\"should handle filter that matches nothing\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => false,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([]);\n    });\n  });\n\n  describe(\"ordering\", () => {\n    it(\"should sort items in ascending order\", async () => {\n      const list = new ArrayPaginatedList([5, 2, 8, 1, 9]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([1, 2, 5, 8, 9]);\n    });\n\n    it(\"should sort items in descending order\", async () => {\n      const list = new ArrayPaginatedList([5, 2, 8, 1, 9]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => b - a,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(result)).toEqual([9, 8, 5, 2, 1]);\n    });\n\n    it(\"should sort objects by property\", async () => {\n      const list = new ArrayPaginatedList([\n        { name: \"Charlie\", age: 30 },\n        { name: \"Alice\", age: 25 },\n        { name: \"Bob\", age: 35 },\n      ]);\n\n      const byName = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => stringCompare(a.name, b.name),\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(byName).map(p => p.name)).toEqual([\"Alice\", \"Bob\", \"Charlie\"]);\n\n      const byAge = await list.next({\n        after: list.getFirstCursor(),\n        limit: 10,\n        filter: () => true,\n        orderBy: (a, b) => a.age - b.age,\n        limitPrecision: \"exact\",\n      });\n\n      expect(items(byAge).map(p => p.name)).toEqual([\"Alice\", \"Charlie\", \"Bob\"]);\n    });\n  });\n\n  describe(\"limitPrecision\", () => {\n    it(\"exact should return exactly the limit\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      expect(result.items.length).toBe(3);\n    });\n\n    // Note: ArrayPaginatedList always returns exact results since it has all data in memory\n    // These tests verify the contract is respected\n    it(\"at-least should return at least the limit (or all if less available)\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"at-least\",\n      });\n\n      expect(result.items.length).toBeGreaterThanOrEqual(3);\n    });\n\n    it(\"at-most should return at most the limit\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"at-most\",\n      });\n\n      expect(result.items.length).toBeLessThanOrEqual(3);\n    });\n\n    it(\"approximate should allow flexibility in either direction\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n      const result = await list.next({\n        after: list.getFirstCursor(),\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"approximate\",\n      });\n\n      // With 'approximate', the implementation can return more or fewer items\n      // than requested. We just verify it returns some items and makes progress.\n      expect(result.items.length).toBeGreaterThan(0);\n      // Should still return valid items\n      expect(items(result).every(n => typeof n === \"number\")).toBe(true);\n    });\n\n    it(\"approximate should still make progress when limit > 0\", async () => {\n      const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n      const allItems: number[] = [];\n\n      let cursor = list.getFirstCursor();\n      let iterations = 0;\n      const maxIterations = 20; // Safety limit to prevent infinite loops\n\n      while (iterations < maxIterations) {\n        const result = await list.next({\n          after: cursor,\n          limit: 2,\n          filter: () => true,\n          orderBy: (a, b) => a - b,\n          limitPrecision: \"approximate\",\n        });\n\n        if (result.items.length === 0) break;\n\n        allItems.push(...items(result));\n        // Cursor must change to ensure progress\n        expect(result.cursor).not.toBe(cursor);\n        cursor = result.cursor;\n        iterations++;\n\n        if (result.isLast) break;\n      }\n\n      // Should eventually get all items\n      expect(allItems.length).toBeGreaterThan(0);\n    });\n  });\n\n  describe(\"getFirstCursor and getLastCursor\", () => {\n    it(\"should return correct cursor format\", () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      expect(list.getFirstCursor()).toBe(\"before-0\");\n      expect(list.getLastCursor()).toBe(\"before-3\");\n    });\n\n    it(\"should work for empty array\", () => {\n      const list = new ArrayPaginatedList([]);\n      expect(list.getFirstCursor()).toBe(\"before-0\");\n      expect(list.getLastCursor()).toBe(\"before-0\");\n    });\n  });\n\n  describe(\"compare\", () => {\n    it(\"should compare items using the orderBy function\", () => {\n      const list = new ArrayPaginatedList([1, 2, 3]);\n      const orderBy = (a: number, b: number) => a - b;\n\n      expect(list.compare(orderBy, 1, 2)).toBeLessThan(0);\n      expect(list.compare(orderBy, 2, 1)).toBeGreaterThan(0);\n      expect(list.compare(orderBy, 1, 1)).toBe(0);\n    });\n  });\n});\n\ndescribe(\"PaginatedList.empty\", () => {\n  it(\"should return empty results\", async () => {\n    const list = PaginatedList.empty();\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: {},\n      orderBy: {},\n      limitPrecision: \"exact\",\n    });\n\n    expect(result.items).toEqual([]);\n    expect(result.isFirst).toBe(true);\n    expect(result.isLast).toBe(true);\n  });\n\n  it(\"should have first cursor\", () => {\n    const list = PaginatedList.empty();\n    expect(list.getFirstCursor()).toBe(\"first\");\n    expect(list.getLastCursor()).toBe(\"last\");\n  });\n});\n\ndescribe(\"PaginatedList.map\", () => {\n  it(\"should transform items\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3]);\n    const doubled = list.map<number, NumberFilter, NumberOrderBy>({\n      itemMapper: (n) => n * 2,\n      oldItemFromNewItem: (n) => n / 2,\n      oldFilterFromNewFilter: (f) => f,\n      oldOrderByFromNewOrderBy: (o) => o,\n    });\n\n    const result = await doubled.next({\n      after: doubled.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([2, 4, 6]);\n  });\n\n  it(\"should preserve cursor semantics\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3]);\n    const doubled = list.map<number, NumberFilter, NumberOrderBy>({\n      itemMapper: (n) => n * 2,\n      oldItemFromNewItem: (n) => n / 2,\n      oldFilterFromNewFilter: (f) => f,\n      oldOrderByFromNewOrderBy: (o) => o,\n    });\n\n    const first = await doubled.next({\n      after: doubled.getFirstCursor(),\n      limit: 1,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(first)).toEqual([2]);\n\n    const second = await doubled.next({\n      after: first.cursor,\n      limit: 1,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(second)).toEqual([4]);\n  });\n});\n\ndescribe(\"PaginatedList.filter\", () => {\n  it(\"should filter items\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6]);\n    const evens = list.filter({\n      filter: (n) => n % 2 === 0,\n      oldFilterFromNewFilter: () => () => true,\n      estimateItemsToFetch: ({ limit }) => limit * 2,\n    });\n\n    const result = await evens.next({\n      after: evens.getFirstCursor(),\n      limit: 10,\n      filter: undefined,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([2, 4, 6]);\n  });\n});\n\ndescribe(\"PaginatedList.addFilter\", () => {\n  it(\"should add additional filter constraint\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n\n    // First filter: only even\n    const evens = list.filter({\n      filter: (n) => n % 2 === 0,\n      oldFilterFromNewFilter: () => () => true,\n      estimateItemsToFetch: ({ limit }) => limit * 2,\n    });\n\n    // Add filter: only > 5\n    const evenAndGreaterThan5 = evens.addFilter({\n      filter: (n) => n > 5,\n      estimateItemsToFetch: ({ limit }) => limit * 2,\n    });\n\n    const result = await evenAndGreaterThan5.next({\n      after: evenAndGreaterThan5.getFirstCursor(),\n      limit: 10,\n      filter: undefined,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([6, 8, 10]);\n  });\n});\n\ndescribe(\"PaginatedList.flatMap\", () => {\n  it(\"should expand items\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3]);\n    const expanded = list.flatMap<number, `before-${number}`, NumberFilter, NumberOrderBy>({\n      itemMapper: (entry) => [\n        { item: entry.item, prevCursor: entry.prevCursor, nextCursor: entry.nextCursor },\n        { item: entry.item + 0.5, prevCursor: entry.prevCursor, nextCursor: entry.nextCursor },\n      ],\n      compare: (_, a, b) => a - b,\n      newCursorFromOldCursor: (c) => c,\n      oldCursorFromNewCursor: (c) => c,\n      oldFilterFromNewFilter: (f) => f,\n      oldOrderByFromNewOrderBy: (o) => o,\n      estimateItemsToFetch: ({ limit }) => limit,\n    });\n\n    const result = await expanded.next({\n      after: expanded.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 1.5, 2, 2.5, 3, 3.5]);\n  });\n\n  it(\"should filter out items (return empty array)\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5]);\n    const evensOnly = list.flatMap<number, `before-${number}`, NumberFilter, NumberOrderBy>({\n      itemMapper: (entry) => entry.item % 2 === 0\n        ? [{ item: entry.item, prevCursor: entry.prevCursor, nextCursor: entry.nextCursor }]\n        : [],\n      compare: (_, a, b) => a - b,\n      newCursorFromOldCursor: (c) => c,\n      oldCursorFromNewCursor: (c) => c,\n      oldFilterFromNewFilter: (f) => f,\n      oldOrderByFromNewOrderBy: (o) => o,\n      estimateItemsToFetch: ({ limit }) => limit * 2,\n    });\n\n    const result = await evensOnly.next({\n      after: evensOnly.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([2, 4]);\n  });\n});\n\ndescribe(\"PaginatedList.merge\", () => {\n  it(\"should merge two lists\", async () => {\n    const list1 = new ArrayPaginatedList([1, 3, 5]);\n    const list2 = new ArrayPaginatedList([2, 4, 6]);\n\n    const merged = PaginatedList.merge(list1, list2);\n\n    const result = await merged.next({\n      after: merged.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 2, 3, 4, 5, 6]);\n  });\n\n  it(\"should merge three lists\", async () => {\n    const list1 = new ArrayPaginatedList([1, 4, 7]);\n    const list2 = new ArrayPaginatedList([2, 5, 8]);\n    const list3 = new ArrayPaginatedList([3, 6, 9]);\n\n    const merged = PaginatedList.merge(list1, list2, list3);\n\n    const result = await merged.next({\n      after: merged.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n  });\n\n  it(\"should handle empty lists in merge\", async () => {\n    const list1 = new ArrayPaginatedList([1, 2, 3]);\n    const list2 = new ArrayPaginatedList<number>([]);\n\n    const merged = PaginatedList.merge(list1, list2);\n\n    const result = await merged.next({\n      after: merged.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 2, 3]);\n  });\n\n  it(\"should paginate through merged list\", async () => {\n    const list1 = new ArrayPaginatedList([1, 3, 5, 7, 9]);\n    const list2 = new ArrayPaginatedList([2, 4, 6, 8, 10]);\n\n    const merged = PaginatedList.merge(list1, list2);\n\n    const first = await merged.next({\n      after: merged.getFirstCursor(),\n      limit: 4,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(first)).toEqual([1, 2, 3, 4]);\n\n    const second = await merged.next({\n      after: first.cursor,\n      limit: 4,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(second)).toEqual([5, 6, 7, 8]);\n  });\n\n  it(\"should have JSON-encoded cursor\", () => {\n    const list1 = new ArrayPaginatedList([1, 2]);\n    const list2 = new ArrayPaginatedList([3, 4]);\n\n    const merged = PaginatedList.merge(list1, list2);\n    const cursor = merged.getFirstCursor();\n\n    expect(() => JSON.parse(cursor)).not.toThrow();\n    expect(JSON.parse(cursor)).toEqual([\"before-0\", \"before-0\"]);\n  });\n\n  it(\"should paginate backward through merged list correctly\", async () => {\n    const list1 = new ArrayPaginatedList([1, 3, 5]);\n    const list2 = new ArrayPaginatedList([2, 4, 6]);\n\n    const merged = PaginatedList.merge(list1, list2);\n\n    // Get last 3 items going backward\n    const last = await merged.prev({\n      before: merged.getLastCursor(),\n      limit: 3,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(last)).toEqual([4, 5, 6]);\n    expect(last.isLast).toBe(true);\n    expect(last.isFirst).toBe(false);\n\n    // Continue backward to get previous 3 items\n    const middle = await merged.prev({\n      before: last.cursor,\n      limit: 3,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(middle)).toEqual([1, 2, 3]);\n    expect(middle.isFirst).toBe(true);\n  });\n\n  it(\"should paginate backward through entire merged list\", async () => {\n    const list1 = new ArrayPaginatedList([1, 3, 5, 7, 9]);\n    const list2 = new ArrayPaginatedList([2, 4, 6, 8, 10]);\n\n    const merged = PaginatedList.merge(list1, list2);\n    const allItems: number[] = [];\n\n    let cursor = merged.getLastCursor();\n    let isFirst = false;\n\n    while (!isFirst) {\n      const result = await merged.prev({\n        before: cursor,\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.unshift(...items(result));\n      cursor = result.cursor;\n      isFirst = result.isFirst;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n  });\n\n  it(\"should have consistent forward and backward pagination results\", async () => {\n    const list1 = new ArrayPaginatedList([1, 4, 7]);\n    const list2 = new ArrayPaginatedList([2, 5, 8]);\n    const list3 = new ArrayPaginatedList([3, 6, 9]);\n\n    const merged = PaginatedList.merge(list1, list2, list3);\n\n    // Collect all items going forward\n    const forwardItems: number[] = [];\n    let forwardCursor = merged.getFirstCursor();\n    let isLast = false;\n\n    while (!isLast) {\n      const result = await merged.next({\n        after: forwardCursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      forwardItems.push(...items(result));\n      forwardCursor = result.cursor;\n      isLast = result.isLast;\n    }\n\n    // Collect all items going backward\n    const backwardItems: number[] = [];\n    let backwardCursor = merged.getLastCursor();\n    let isFirst = false;\n\n    while (!isFirst) {\n      const result = await merged.prev({\n        before: backwardCursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      backwardItems.unshift(...items(result));\n      backwardCursor = result.cursor;\n      isFirst = result.isFirst;\n    }\n\n    // Both directions should yield the same final result\n    expect(forwardItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n    expect(backwardItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n  });\n});\n\ndescribe(\"edge cases\", () => {\n  it(\"should handle single item\", async () => {\n    const list = new ArrayPaginatedList([42]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([42]);\n    expect(result.isFirst).toBe(true);\n    expect(result.isLast).toBe(true);\n  });\n\n  it(\"should handle duplicate values\", async () => {\n    const list = new ArrayPaginatedList([1, 1, 2, 2, 3, 3]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([1, 1, 2, 2, 3, 3]);\n  });\n\n  it(\"should handle negative numbers\", async () => {\n    const list = new ArrayPaginatedList([-3, -1, 0, 1, 3]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([-3, -1, 0, 1, 3]);\n  });\n\n  it(\"should handle string items\", async () => {\n    const list = new ArrayPaginatedList([\"banana\", \"apple\", \"cherry\"]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => stringCompare(a, b),\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([\"apple\", \"banana\", \"cherry\"]);\n  });\n\n  it(\"should handle object items\", async () => {\n    const list = new ArrayPaginatedList([\n      { id: 1, value: \"a\" },\n      { id: 2, value: \"b\" },\n    ]);\n    const result = await list.next({\n      after: list.getFirstCursor(),\n      limit: 10,\n      filter: () => true,\n      orderBy: (a, b) => a.id - b.id,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(result)).toEqual([\n      { id: 1, value: \"a\" },\n      { id: 2, value: \"b\" },\n    ]);\n  });\n});\n\ndescribe(\"complete pagination walkthrough\", () => {\n  it(\"should paginate forward through entire list\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n    const allItems: number[] = [];\n\n    let cursor = list.getFirstCursor();\n    let isLast = false;\n\n    while (!isLast) {\n      const result = await list.next({\n        after: cursor,\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.push(...items(result));\n      cursor = result.cursor;\n      isLast = result.isLast;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n  });\n\n  it(\"should paginate backward through entire list\", async () => {\n    const list = new ArrayPaginatedList([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n    const allItems: number[] = [];\n\n    let cursor = list.getLastCursor();\n    let isFirst = false;\n\n    while (!isFirst) {\n      const result = await list.prev({\n        before: cursor,\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.unshift(...items(result));\n      cursor = result.cursor;\n      isFirst = result.isFirst;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);\n  });\n});\n\ndescribe(\"unsorted array pagination\", () => {\n  it(\"should correctly paginate through an unsorted array with sorting\", async () => {\n    const list = new ArrayPaginatedList([3, 1, 2]);\n\n    const first = await list.next({\n      after: list.getFirstCursor(),\n      limit: 2,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(first)).toEqual([1, 2]);\n\n    const second = await list.next({\n      after: first.cursor,\n      limit: 2,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(second)).toEqual([3]);\n  });\n\n  it(\"should maintain sorted order across pagination boundaries\", async () => {\n    const list = new ArrayPaginatedList([5, 4, 3, 2, 1]);\n    const allItems: number[] = [];\n\n    let cursor = list.getFirstCursor();\n    let isLast = false;\n\n    while (!isLast) {\n      const result = await list.next({\n        after: cursor,\n        limit: 2,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.push(...items(result));\n      cursor = result.cursor;\n      isLast = result.isLast;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5]);\n  });\n\n  it(\"should handle random order array correctly\", async () => {\n    const list = new ArrayPaginatedList([7, 2, 9, 1, 5, 8, 3, 6, 4]);\n\n    const allItems: number[] = [];\n    let cursor = list.getFirstCursor();\n    let isLast = false;\n\n    while (!isLast) {\n      const result = await list.next({\n        after: cursor,\n        limit: 3,\n        filter: () => true,\n        orderBy: (a, b) => a - b,\n        limitPrecision: \"exact\",\n      });\n\n      allItems.push(...items(result));\n      cursor = result.cursor;\n      isLast = result.isLast;\n    }\n\n    expect(allItems).toEqual([1, 2, 3, 4, 5, 6, 7, 8, 9]);\n  });\n\n  it(\"should have consistent cursor semantics with sorted data\", async () => {\n    const list = new ArrayPaginatedList([3, 1, 2]);\n\n    const first = await list.next({\n      after: list.getFirstCursor(),\n      limit: 1,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(first)).toEqual([1]);\n\n    const second = await list.next({\n      after: first.cursor,\n      limit: 1,\n      filter: () => true,\n      orderBy: (a, b) => a - b,\n      limitPrecision: \"exact\",\n    });\n\n    expect(items(second)).toEqual([2]);\n  });\n});\n\n"],"mappings":";;;;AAQA,MAAM,SAAY,WAAqC,OAAO,MAAM,KAAI,MAAK,EAAE,IAAI;AAEnF,SAAS,4BAA4B;CACnC,SAAS,yCAAyC;EAChD,GAAG,mEAAmE,YAAY;GAChF,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;GAAC,CAAC;GAC7C,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;GAAC,CAAC;GACvC,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,IAAI;GAChC,OAAO,OAAO,MAAM,CAAC,CAAC,KAAK,IAAI;EACjC,CAAC;EAED,GAAG,mDAAmD,YAAY;GAChE,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GACnD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;GAAC,CAAC;GACvC,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,IAAI;GAChC,OAAO,OAAO,MAAM,CAAC,CAAC,KAAK,KAAK;EAClC,CAAC;EAED,GAAG,yCAAyC,YAAY;GACtD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GACnD,MAAM,QAAQ,MAAM,KAAK,KAAK;IAC5B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;GACnC,OAAO,MAAM,MAAM,CAAC,CAAC,KAAK,UAAU;GAEpC,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,MAAM;IACb,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;GACpC,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK;GACjC,OAAO,OAAO,MAAM,CAAC,CAAC,KAAK,KAAK;EAClC,CAAC;EAED,GAAG,6BAA6B,YAAY;GAC1C,MAAM,OAAO,IAAI,mBAA2B,CAAC,CAAC;GAC9C,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;GAChC,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,IAAI;GAChC,OAAO,OAAO,MAAM,CAAC,CAAC,KAAK,IAAI;EACjC,CAAC;EAED,GAAG,4BAA4B,YAAY;GACzC,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;GAAC,CAAC;GAS7C,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;EAClC,CAAC;CACH,CAAC;CAED,SAAS,oCAAoC;EAC3C,GAAG,qCAAqC,YAAY;GAClD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GACnD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,QAAQ,KAAK,cAAc;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;GACpC,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,KAAK;GACjC,OAAO,OAAO,MAAM,CAAC,CAAC,KAAK,IAAI;EACjC,CAAC;EAED,GAAG,uCAAuC,YAAY;GACpD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GAEnD,MAAM,OAAO,MAAM,KAAK,KAAK;IAC3B,QAAQ,KAAK,cAAc;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GACD,OAAO,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;GAElC,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,QAAQ,KAAK;IACb,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GACD,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;GAEpC,MAAM,QAAQ,MAAM,KAAK,KAAK;IAC5B,QAAQ,OAAO;IACf,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GACD,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;GAChC,OAAO,MAAM,OAAO,CAAC,CAAC,KAAK,IAAI;EACjC,CAAC;CACH,CAAC;CAED,SAAS,sDAAsD;EAC7D,GAAG,+DAA+D,YAAY;GAC5E,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAI;IAAI;GAAE,CAAC;GAChD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAGD,OAAO,OAAO,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,KAAK,UAAU;GAClD,OAAO,OAAO,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,KAAK,UAAU;GAGlD,OAAO,OAAO,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,KAAK,UAAU;GAClD,OAAO,OAAO,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,KAAK,UAAU;GAGlD,OAAO,OAAO,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,KAAK,UAAU;GAClD,OAAO,OAAO,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,KAAK,UAAU;EACpD,CAAC;EAED,GAAG,gEAAgE,YAAY;GAC7E,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GAEnD,MAAM,QAAQ,MAAM,KAAK,KAAK;IAC5B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAGD,MAAM,eAAe,MAAM,MAAM,MAAM,MAAM,SAAS,EAAE,CAAC;GASzD,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;EACtC,CAAC;EAED,GAAG,4CAA4C,YAAY;GACzD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GAGnD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;GAAC,CAAC;GACvC,OAAO,OAAO,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,KAAK,UAAU;GAWlD,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,QAAQ,OAAO,MAAM,EAAE,CAAC;IACxB,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;EACtC,CAAC;CACH,CAAC;CAED,SAAS,mBAAmB;EAC1B,GAAG,iCAAiC,YAAY;GAC9C,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GAStD,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,SAAS,MAAM,IAAI,MAAM;IACzB,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;GAAC,CAAC;EACzC,CAAC;EAED,GAAG,uCAAuC,YAAY;GACpD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;GAAE,CAAC;GASnE,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,SAAS,MAAM,IAAI,MAAM;IACzB,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;EACtC,CAAC;EAED,GAAG,6CAA6C,YAAY;GAC1D,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;GAAC,CAAC;GAS7C,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;EAClC,CAAC;CACH,CAAC;CAED,SAAS,kBAAkB;EACzB,GAAG,wCAAwC,YAAY;GACrD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GASnD,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;EAC/C,CAAC;EAED,GAAG,yCAAyC,YAAY;GACtD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GASnD,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;EAC/C,CAAC;EAED,GAAG,mCAAmC,YAAY;GAChD,MAAM,OAAO,IAAI,mBAAmB;IAClC;KAAE,MAAM;KAAW,KAAK;IAAG;IAC3B;KAAE,MAAM;KAAS,KAAK;IAAG;IACzB;KAAE,MAAM;KAAO,KAAK;IAAG;GACzB,CAAC;GAUD,OAAO,MAAM,MARQ,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,cAAc,EAAE,MAAM,EAAE,IAAI;IAC/C,gBAAgB;GAClB,CAAC,CAEkB,CAAC,CAAC,KAAI,MAAK,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ;IAAC;IAAS;IAAO;GAAS,CAAC;GAU1E,OAAO,MAAM,MARO,KAAK,KAAK;IAC5B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,EAAE,MAAM,EAAE;IAC7B,gBAAgB;GAClB,CAAC,CAEiB,CAAC,CAAC,KAAI,MAAK,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ;IAAC;IAAS;IAAW;GAAK,CAAC;EAC3E,CAAC;CACH,CAAC;CAED,SAAS,wBAAwB;EAC/B,GAAG,yCAAyC,YAAY;GACtD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GASnD,QAAO,MARc,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,EAAA,CAEa,MAAM,MAAM,CAAC,CAAC,KAAK,CAAC;EACpC,CAAC;EAID,GAAG,wEAAwE,YAAY;GACrF,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GASnD,QAAO,MARc,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,EAAA,CAEa,MAAM,MAAM,CAAC,CAAC,uBAAuB,CAAC;EACtD,CAAC;EAED,GAAG,2CAA2C,YAAY;GACxD,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GASnD,QAAO,MARc,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC,EAAA,CAEa,MAAM,MAAM,CAAC,CAAC,oBAAoB,CAAC;EACnD,CAAC;EAED,GAAG,4DAA4D,YAAY;GACzE,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;GAAC,CAAC;GACnD,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO,KAAK,eAAe;IAC3B,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAID,OAAO,OAAO,MAAM,MAAM,CAAC,CAAC,gBAAgB,CAAC;GAE7C,OAAO,MAAM,MAAM,CAAC,CAAC,OAAM,MAAK,OAAO,MAAM,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI;EACnE,CAAC;EAED,GAAG,yDAAyD,YAAY;GACtE,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;IAAG;GAAE,CAAC;GACnE,MAAM,WAAqB,CAAC;GAE5B,IAAI,SAAS,KAAK,eAAe;GACjC,IAAI,aAAa;GACjB,MAAM,gBAAgB;GAEtB,OAAO,aAAa,eAAe;IACjC,MAAM,SAAS,MAAM,KAAK,KAAK;KAC7B,OAAO;KACP,OAAO;KACP,cAAc;KACd,UAAU,GAAG,MAAM,IAAI;KACvB,gBAAgB;IAClB,CAAC;IAED,IAAI,OAAO,MAAM,WAAW,GAAG;IAE/B,SAAS,KAAK,GAAG,MAAM,MAAM,CAAC;IAE9B,OAAO,OAAO,MAAM,CAAC,CAAC,IAAI,KAAK,MAAM;IACrC,SAAS,OAAO;IAChB;IAEA,IAAI,OAAO,QAAQ;GACrB;GAGA,OAAO,SAAS,MAAM,CAAC,CAAC,gBAAgB,CAAC;EAC3C,CAAC;CACH,CAAC;CAED,SAAS,0CAA0C;EACjD,GAAG,6CAA6C;GAC9C,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;GAAC,CAAC;GAC7C,OAAO,KAAK,eAAe,CAAC,CAAC,CAAC,KAAK,UAAU;GAC7C,OAAO,KAAK,cAAc,CAAC,CAAC,CAAC,KAAK,UAAU;EAC9C,CAAC;EAED,GAAG,qCAAqC;GACtC,MAAM,OAAO,IAAI,mBAAmB,CAAC,CAAC;GACtC,OAAO,KAAK,eAAe,CAAC,CAAC,CAAC,KAAK,UAAU;GAC7C,OAAO,KAAK,cAAc,CAAC,CAAC,CAAC,KAAK,UAAU;EAC9C,CAAC;CACH,CAAC;CAED,SAAS,iBAAiB;EACxB,GAAG,yDAAyD;GAC1D,MAAM,OAAO,IAAI,mBAAmB;IAAC;IAAG;IAAG;GAAC,CAAC;GAC7C,MAAM,WAAW,GAAW,MAAc,IAAI;GAE9C,OAAO,KAAK,QAAQ,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;GAClD,OAAO,KAAK,QAAQ,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC;GACrD,OAAO,KAAK,QAAQ,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;EAC5C,CAAC;CACH,CAAC;AACH,CAAC;AAED,SAAS,6BAA6B;CACpC,GAAG,+BAA+B,YAAY;EAC5C,MAAM,OAAO,cAAc,MAAM;EACjC,MAAM,SAAS,MAAM,KAAK,KAAK;GAC7B,OAAO,KAAK,eAAe;GAC3B,OAAO;GACP,QAAQ,CAAC;GACT,SAAS,CAAC;GACV,gBAAgB;EAClB,CAAC;EAED,OAAO,OAAO,KAAK,CAAC,CAAC,QAAQ,CAAC,CAAC;EAC/B,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,IAAI;EAChC,OAAO,OAAO,MAAM,CAAC,CAAC,KAAK,IAAI;CACjC,CAAC;CAED,GAAG,kCAAkC;EACnC,MAAM,OAAO,cAAc,MAAM;EACjC,OAAO,KAAK,eAAe,CAAC,CAAC,CAAC,KAAK,OAAO;EAC1C,OAAO,KAAK,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM;CAC1C,CAAC;AACH,CAAC;AAED,SAAS,2BAA2B;CAClC,GAAG,0BAA0B,YAAY;EAEvC,MAAM,UAAU,IADC,mBAAmB;GAAC;GAAG;GAAG;EAAC,CACzB,CAAC,CAAC,IAAyC;GAC5D,aAAa,MAAM,IAAI;GACvB,qBAAqB,MAAM,IAAI;GAC/B,yBAAyB,MAAM;GAC/B,2BAA2B,MAAM;EACnC,CAAC;EAUD,OAAO,MAAM,MARQ,QAAQ,KAAK;GAChC,OAAO,QAAQ,eAAe;GAC9B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;EAAC,CAAC;CACzC,CAAC;CAED,GAAG,oCAAoC,YAAY;EAEjD,MAAM,UAAU,IADC,mBAAmB;GAAC;GAAG;GAAG;EAAC,CACzB,CAAC,CAAC,IAAyC;GAC5D,aAAa,MAAM,IAAI;GACvB,qBAAqB,MAAM,IAAI;GAC/B,yBAAyB,MAAM;GAC/B,2BAA2B,MAAM;EACnC,CAAC;EAED,MAAM,QAAQ,MAAM,QAAQ,KAAK;GAC/B,OAAO,QAAQ,eAAe;GAC9B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC;EAED,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;EAUhC,OAAO,MAAM,MARQ,QAAQ,KAAK;GAChC,OAAO,MAAM;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;CACnC,CAAC;AACH,CAAC;AAED,SAAS,8BAA8B;CACrC,GAAG,uBAAuB,YAAY;EAEpC,MAAM,QAAQ,IADG,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CACpC,CAAC,CAAC,OAAO;GACxB,SAAS,MAAM,IAAI,MAAM;GACzB,oCAAoC;GACpC,uBAAuB,EAAE,YAAY,QAAQ;EAC/C,CAAC;EAUD,OAAO,MAAM,MARQ,MAAM,KAAK;GAC9B,OAAO,MAAM,eAAe;GAC5B,OAAO;GACP,QAAQ,KAAA;GACR,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;EAAC,CAAC;CACzC,CAAC;AACH,CAAC;AAED,SAAS,iCAAiC;CACxC,GAAG,2CAA2C,YAAY;EAWxD,MAAM,sBAPQ,IAHG,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAE,CAGjD,CAAC,CAAC,OAAO;GACxB,SAAS,MAAM,IAAI,MAAM;GACzB,oCAAoC;GACpC,uBAAuB,EAAE,YAAY,QAAQ;EAC/C,CAGgC,CAAC,CAAC,UAAU;GAC1C,SAAS,MAAM,IAAI;GACnB,uBAAuB,EAAE,YAAY,QAAQ;EAC/C,CAAC;EAUD,OAAO,MAAM,MARQ,oBAAoB,KAAK;GAC5C,OAAO,oBAAoB,eAAe;GAC1C,OAAO;GACP,QAAQ,KAAA;GACR,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;EAAE,CAAC;CAC1C,CAAC;AACH,CAAC;AAED,SAAS,+BAA+B;CACtC,GAAG,uBAAuB,YAAY;EAEpC,MAAM,WAAW,IADA,mBAAmB;GAAC;GAAG;GAAG;EAAC,CACxB,CAAC,CAAC,QAAiE;GACrF,aAAa,UAAU,CACrB;IAAE,MAAM,MAAM;IAAM,YAAY,MAAM;IAAY,YAAY,MAAM;GAAW,GAC/E;IAAE,MAAM,MAAM,OAAO;IAAK,YAAY,MAAM;IAAY,YAAY,MAAM;GAAW,CACvF;GACA,UAAU,GAAG,GAAG,MAAM,IAAI;GAC1B,yBAAyB,MAAM;GAC/B,yBAAyB,MAAM;GAC/B,yBAAyB,MAAM;GAC/B,2BAA2B,MAAM;GACjC,uBAAuB,EAAE,YAAY;EACvC,CAAC;EAUD,OAAO,MAAM,MARQ,SAAS,KAAK;GACjC,OAAO,SAAS,eAAe;GAC/B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAK;GAAG;GAAK;GAAG;EAAG,CAAC;CACxD,CAAC;CAED,GAAG,gDAAgD,YAAY;EAE7D,MAAM,YAAY,IADD,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;EAAC,CAC7B,CAAC,CAAC,QAAiE;GACtF,aAAa,UAAU,MAAM,OAAO,MAAM,IACtC,CAAC;IAAE,MAAM,MAAM;IAAM,YAAY,MAAM;IAAY,YAAY,MAAM;GAAW,CAAC,IACjF,CAAC;GACL,UAAU,GAAG,GAAG,MAAM,IAAI;GAC1B,yBAAyB,MAAM;GAC/B,yBAAyB,MAAM;GAC/B,yBAAyB,MAAM;GAC/B,2BAA2B,MAAM;GACjC,uBAAuB,EAAE,YAAY,QAAQ;EAC/C,CAAC;EAUD,OAAO,MAAM,MARQ,UAAU,KAAK;GAClC,OAAO,UAAU,eAAe;GAChC,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;CACtC,CAAC;AACH,CAAC;AAED,SAAS,6BAA6B;CACpC,GAAG,0BAA0B,YAAY;EACvC,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAC9C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAE9C,MAAM,SAAS,cAAc,MAAM,OAAO,KAAK;EAU/C,OAAO,MAAM,MARQ,OAAO,KAAK;GAC/B,OAAO,OAAO,eAAe;GAC7B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;CAClD,CAAC;CAED,GAAG,4BAA4B,YAAY;EACzC,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAC9C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAC9C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAE9C,MAAM,SAAS,cAAc,MAAM,OAAO,OAAO,KAAK;EAUtD,OAAO,MAAM,MARQ,OAAO,KAAK;GAC/B,OAAO,OAAO,eAAe;GAC7B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;CAC3D,CAAC;CAED,GAAG,sCAAsC,YAAY;EACnD,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAC9C,MAAM,QAAQ,IAAI,mBAA2B,CAAC,CAAC;EAE/C,MAAM,SAAS,cAAc,MAAM,OAAO,KAAK;EAU/C,OAAO,MAAM,MARQ,OAAO,KAAK;GAC/B,OAAO,OAAO,eAAe;GAC7B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;EAAC,CAAC;CACzC,CAAC;CAED,GAAG,uCAAuC,YAAY;EACpD,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;EACpD,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;EAAE,CAAC;EAErD,MAAM,SAAS,cAAc,MAAM,OAAO,KAAK;EAE/C,MAAM,QAAQ,MAAM,OAAO,KAAK;GAC9B,OAAO,OAAO,eAAe;GAC7B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC;EAED,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;EAAC,CAAC;EAUzC,OAAO,MAAM,MARQ,OAAO,KAAK;GAC/B,OAAO,MAAM;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;EAAC,CAAC;CAC5C,CAAC;CAED,GAAG,yCAAyC;EAC1C,MAAM,QAAQ,IAAI,mBAAmB,CAAC,GAAG,CAAC,CAAC;EAC3C,MAAM,QAAQ,IAAI,mBAAmB,CAAC,GAAG,CAAC,CAAC;EAG3C,MAAM,SADS,cAAc,MAAM,OAAO,KACtB,CAAC,CAAC,eAAe;EAErC,aAAa,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,IAAI,QAAQ;EAC7C,OAAO,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,YAAY,UAAU,CAAC;CAC7D,CAAC;CAED,GAAG,0DAA0D,YAAY;EACvE,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAC9C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAE9C,MAAM,SAAS,cAAc,MAAM,OAAO,KAAK;EAG/C,MAAM,OAAO,MAAM,OAAO,KAAK;GAC7B,QAAQ,OAAO,cAAc;GAC7B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC;EAED,OAAO,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;EAAC,CAAC;EACrC,OAAO,KAAK,MAAM,CAAC,CAAC,KAAK,IAAI;EAC7B,OAAO,KAAK,OAAO,CAAC,CAAC,KAAK,KAAK;EAG/B,MAAM,SAAS,MAAM,OAAO,KAAK;GAC/B,QAAQ,KAAK;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC;EAED,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;EAAC,CAAC;EACvC,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,IAAI;CAClC,CAAC;CAED,GAAG,uDAAuD,YAAY;EACpE,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;EACpD,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;EAAE,CAAC;EAErD,MAAM,SAAS,cAAc,MAAM,OAAO,KAAK;EAC/C,MAAM,WAAqB,CAAC;EAE5B,IAAI,SAAS,OAAO,cAAc;EAClC,IAAI,UAAU;EAEd,OAAO,CAAC,SAAS;GACf,MAAM,SAAS,MAAM,OAAO,KAAK;IAC/B,QAAQ;IACR,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,SAAS,QAAQ,GAAG,MAAM,MAAM,CAAC;GACjC,SAAS,OAAO;GAChB,UAAU,OAAO;EACnB;EAEA,OAAO,QAAQ,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAE,CAAC;CAC1D,CAAC;CAED,GAAG,kEAAkE,YAAY;EAC/E,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAC9C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAC9C,MAAM,QAAQ,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAE9C,MAAM,SAAS,cAAc,MAAM,OAAO,OAAO,KAAK;EAGtD,MAAM,eAAyB,CAAC;EAChC,IAAI,gBAAgB,OAAO,eAAe;EAC1C,IAAI,SAAS;EAEb,OAAO,CAAC,QAAQ;GACd,MAAM,SAAS,MAAM,OAAO,KAAK;IAC/B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,aAAa,KAAK,GAAG,MAAM,MAAM,CAAC;GAClC,gBAAgB,OAAO;GACvB,SAAS,OAAO;EAClB;EAGA,MAAM,gBAA0B,CAAC;EACjC,IAAI,iBAAiB,OAAO,cAAc;EAC1C,IAAI,UAAU;EAEd,OAAO,CAAC,SAAS;GACf,MAAM,SAAS,MAAM,OAAO,KAAK;IAC/B,QAAQ;IACR,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,cAAc,QAAQ,GAAG,MAAM,MAAM,CAAC;GACtC,iBAAiB,OAAO;GACxB,UAAU,OAAO;EACnB;EAGA,OAAO,YAAY,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;EACxD,OAAO,aAAa,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;CAC3D,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB;CAC3B,GAAG,6BAA6B,YAAY;EAC1C,MAAM,OAAO,IAAI,mBAAmB,CAAC,EAAE,CAAC;EACxC,MAAM,SAAS,MAAM,KAAK,KAAK;GAC7B,OAAO,KAAK,eAAe;GAC3B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC;EAED,OAAO,MAAM,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;EAClC,OAAO,OAAO,OAAO,CAAC,CAAC,KAAK,IAAI;EAChC,OAAO,OAAO,MAAM,CAAC,CAAC,KAAK,IAAI;CACjC,CAAC;CAED,GAAG,kCAAkC,YAAY;EAC/C,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;EAStD,OAAO,MAAM,MARQ,KAAK,KAAK;GAC7B,OAAO,KAAK,eAAe;GAC3B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;CAClD,CAAC;CAED,GAAG,kCAAkC,YAAY;EAC/C,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAI;GAAI;GAAG;GAAG;EAAC,CAAC;EASrD,OAAO,MAAM,MARQ,KAAK,KAAK;GAC7B,OAAO,KAAK,eAAe;GAC3B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAI;GAAI;GAAG;GAAG;EAAC,CAAC;CACjD,CAAC;CAED,GAAG,8BAA8B,YAAY;EAC3C,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAU;GAAS;EAAQ,CAAC;EASjE,OAAO,MAAM,MARQ,KAAK,KAAK;GAC7B,OAAO,KAAK,eAAe;GAC3B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,cAAc,GAAG,CAAC;GACrC,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ;GAAC;GAAS;GAAU;EAAQ,CAAC;CAC7D,CAAC;CAED,GAAG,8BAA8B,YAAY;EAC3C,MAAM,OAAO,IAAI,mBAAmB,CAClC;GAAE,IAAI;GAAG,OAAO;EAAI,GACpB;GAAE,IAAI;GAAG,OAAO;EAAI,CACtB,CAAC;EASD,OAAO,MAAM,MARQ,KAAK,KAAK;GAC7B,OAAO,KAAK,eAAe;GAC3B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,EAAE,KAAK,EAAE;GAC5B,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAC5B;GAAE,IAAI;GAAG,OAAO;EAAI,GACpB;GAAE,IAAI;GAAG,OAAO;EAAI,CACtB,CAAC;CACH,CAAC;AACH,CAAC;AAED,SAAS,yCAAyC;CAChD,GAAG,+CAA+C,YAAY;EAC5D,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAE,CAAC;EACnE,MAAM,WAAqB,CAAC;EAE5B,IAAI,SAAS,KAAK,eAAe;EACjC,IAAI,SAAS;EAEb,OAAO,CAAC,QAAQ;GACd,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,SAAS,KAAK,GAAG,MAAM,MAAM,CAAC;GAC9B,SAAS,OAAO;GAChB,SAAS,OAAO;EAClB;EAEA,OAAO,QAAQ,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAE,CAAC;CAC1D,CAAC;CAED,GAAG,gDAAgD,YAAY;EAC7D,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAE,CAAC;EACnE,MAAM,WAAqB,CAAC;EAE5B,IAAI,SAAS,KAAK,cAAc;EAChC,IAAI,UAAU;EAEd,OAAO,CAAC,SAAS;GACf,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,QAAQ;IACR,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,SAAS,QAAQ,GAAG,MAAM,MAAM,CAAC;GACjC,SAAS,OAAO;GAChB,UAAU,OAAO;EACnB;EAEA,OAAO,QAAQ,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAE,CAAC;CAC1D,CAAC;AACH,CAAC;AAED,SAAS,mCAAmC;CAC1C,GAAG,oEAAoE,YAAY;EACjF,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAE7C,MAAM,QAAQ,MAAM,KAAK,KAAK;GAC5B,OAAO,KAAK,eAAe;GAC3B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC;EAED,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;EAUnC,OAAO,MAAM,MARQ,KAAK,KAAK;GAC7B,OAAO,MAAM;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;CACnC,CAAC;CAED,GAAG,6DAA6D,YAAY;EAC1E,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;EACnD,MAAM,WAAqB,CAAC;EAE5B,IAAI,SAAS,KAAK,eAAe;EACjC,IAAI,SAAS;EAEb,OAAO,CAAC,QAAQ;GACd,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,SAAS,KAAK,GAAG,MAAM,MAAM,CAAC;GAC9B,SAAS,OAAO;GAChB,SAAS,OAAO;EAClB;EAEA,OAAO,QAAQ,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;CAC1C,CAAC;CAED,GAAG,8CAA8C,YAAY;EAC3D,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;EAE/D,MAAM,WAAqB,CAAC;EAC5B,IAAI,SAAS,KAAK,eAAe;EACjC,IAAI,SAAS;EAEb,OAAO,CAAC,QAAQ;GACd,MAAM,SAAS,MAAM,KAAK,KAAK;IAC7B,OAAO;IACP,OAAO;IACP,cAAc;IACd,UAAU,GAAG,MAAM,IAAI;IACvB,gBAAgB;GAClB,CAAC;GAED,SAAS,KAAK,GAAG,MAAM,MAAM,CAAC;GAC9B,SAAS,OAAO;GAChB,SAAS,OAAO;EAClB;EAEA,OAAO,QAAQ,CAAC,CAAC,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC,CAAC;CACtD,CAAC;CAED,GAAG,4DAA4D,YAAY;EACzE,MAAM,OAAO,IAAI,mBAAmB;GAAC;GAAG;GAAG;EAAC,CAAC;EAE7C,MAAM,QAAQ,MAAM,KAAK,KAAK;GAC5B,OAAO,KAAK,eAAe;GAC3B,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC;EAED,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;EAUhC,OAAO,MAAM,MARQ,KAAK,KAAK;GAC7B,OAAO,MAAM;GACb,OAAO;GACP,cAAc;GACd,UAAU,GAAG,MAAM,IAAI;GACvB,gBAAgB;EAClB,CAAC,CAEkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;CACnC,CAAC;AACH,CAAC"}

package/dist/esm/utils/passkey.d.ts

@@ -1,2 +1,2 @@
 import { AuthenticationResponseJSON, AuthenticatorAttestationResponseJSON, PublicKeyCredentialCreationOptionsJSON, PublicKeyCredentialRequestOptionsJSON, RegistrationResponseJSON } from "@simplewebauthn/browser";
-export { type AuthenticationResponseJSON, type AuthenticatorAttestationResponseJSON, type PublicKeyCredentialCreationOptionsJSON, type PublicKeyCredentialRequestOptionsJSON, type RegistrationResponseJSON };
+export type { AuthenticationResponseJSON, AuthenticatorAttestationResponseJSON, PublicKeyCredentialCreationOptionsJSON, PublicKeyCredentialRequestOptionsJSON, RegistrationResponseJSON };

package/dist/esm/utils/passkey.js

@@ -1 +1 @@
-export {  };
+export {};

package/dist/esm/utils/promises.d.ts

@@ -1,4 +1,4 @@
-import { Result } from "./results";
+import { Result } from "./results.js";
 
 //#region src/utils/promises.d.ts
 type ReactPromise<T> = Promise<T> & ({

package/dist/esm/utils/promises.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"promises.d.ts","names":[],"sources":["../../../src/utils/promises.tsx"],"mappings":";;;KAQY,YAAA,MAAkB,OAAA,CAAQ,CAAA;EAChC,MAAA;EAAoB,MAAA;AAAA;EACpB,MAAA;EAAqB,KAAA,EAAO,CAAA;AAAA;EAC5B,MAAA;AAAA;AAAA,KAGD,OAAA,OAAc,KAAA,EAAO,CAAA;AAAA,KACrB,MAAA,IAAU,MAAA;AAAA,iBACC,aAAA,GAAA,CAAiB,QAAA,GAAW,OAAA,EAAS,OAAA,CAAQ,CAAA,GAAI,MAAA,EAAQ,MAAA,YAAkB,YAAA,CAAa,CAAA;;;;;iBAwExF,QAAA,GAAA,CAAY,KAAA,EAAO,CAAA,GAAI,YAAA,CAAa,CAAA;;;;;iBA0CpC,QAAA,GAAA,CAAY,MAAA,YAAkB,YAAA,CAAa,CAAA;AAAA,iBA6C3C,YAAA,CAAA,GAAgB,YAAA;AAAA,iBAchB,OAAA,GAAA,CAAW,OAAA,EAAS,OAAA,CAAQ,CAAA,GAAI,OAAA;EAAW,oBAAA;AAAA,IAAwC,YAAA,CAAa,CAAA;;;;;AA/KrF;;iBAuNX,wBAAA,WAAmC,OAAA,MAAA,CAAc,OAAA,EAAS,CAAA;;;AArN1E;iBA0OgB,2BAAA,GAAA,CAA+B,OAAA,EAAS,OAAA,CAAQ,CAAA;AAAA,iBAW1C,IAAA,CAAK,EAAA,WAAU,OAAA;AAAA,iBAgCf,SAAA,CAAU,IAAA,EAAM,IAAA,GAAI,OAAA;AAAA,iBAsB1B,0BAAA,CAAA,GAA8B,IAAA,EAAM,UAAA,QAAkB,iBAAA;AAAA,iBAgCtD,iBAAA,CACd,aAAA,SAAsB,OAAA,0BAAiC,OAAA,wBACvD,OAAA;EACE,cAAA;EACA,OAAA,IAAW,KAAA,EAAO,KAAA;AAAA;AAAA,cAoChB,YAAA,SAAqB,KAAA;EAAA,SACG,EAAA;cAAA,EAAA;AAAA;AAAA,iBAMR,OAAA,GAAA,CAAW,aAAA,EAAe,OAAA,CAAQ,CAAA,WAAY,OAAA,CAAQ,CAAA,IAAK,EAAA,WAAa,OAAA,CAAQ,MAAA,CAAO,CAAA,EAAG,YAAA;AAAA,iBA0B1F,YAAA,GAAA,CAAgB,OAAA,EAAS,OAAA,CAAQ,CAAA,GAAI,EAAA,WAAa,OAAA,CAAQ,CAAA;;;;;;;AA5UhF;;;;iBAsWsB,kBAAA,MAAA,CACpB,KAAA,WAAgB,CAAA,IAChB,WAAA,UACA,EAAA,GAAK,IAAA,EAAM,CAAA,EAAG,KAAA,aAAkB,OAAA,CAAQ,CAAA,IACvC,OAAA,CAAQ,CAAA;AAAA,KAmDC,gBAAA;EA7ZuC;;;EAiajD,WAAA;EAja0B;;;EAsa1B,UAAA;EAtamD;AA0CrD;;EAiYE,UAAA;EAjYwD;;;EAsYxD,KAAA;EAtYyD;;;EA2YzD,UAAA;AAAA;AAAA,iBAGc,WAAA,GAAA,CACd,IAAA,QAAY,OAAA,CAAQ,CAAA,GACpB,OAAA,EAAS,gBAAA,SACF,OAAA,CAAQ,CAAA;AAAA,iBA0DD,SAAA,oBAAA,CAA8B,IAAA,MAAU,IAAA,EAAM,CAAA,KAAM,OAAA,CAAQ,CAAA,GAAI,OAAA,eAAsB,IAAA,EAAM,CAAA,KAAM,OAAA,CAAQ,CAAA"}
+{"version":3,"file":"promises.d.ts","names":[],"sources":["../../../src/utils/promises.tsx"],"mappings":";;;KAQY,YAAA,MAAkB,OAAA,CAAQ,CAAA;EAChC,MAAA;EAAoB,MAAA;AAAA;EACpB,MAAA;EAAqB,KAAA,EAAO,CAAA;AAAA;EAC5B,MAAA;AAAA;AAAA,KAGD,OAAA,OAAc,KAAA,EAAO,CAAC;AAAA,KACtB,MAAA,IAAU,MAAe;AAAA,iBACd,aAAA,IAAiB,QAAA,GAAW,OAAA,EAAS,OAAA,CAAQ,CAAA,GAAI,MAAA,EAAQ,MAAA,YAAkB,YAAA,CAAa,CAAA;;;;;iBAwExF,QAAA,IAAY,KAAA,EAAO,CAAA,GAAI,YAAA,CAAa,CAAA;;;;AA7ExC;iBAuHI,QAAA,IAAY,MAAA,YAAkB,YAAY,CAAC,CAAA;AAAA,iBA6C3C,YAAA,IAAgB,YAAY;AAAA,iBAc5B,OAAA,IAAW,OAAA,EAAS,OAAA,CAAQ,CAAA,GAAI,OAAA;EAAW,oBAAA;AAAA,IAAwC,YAAA,CAAa,CAAA;;;;AA/KrF;AAAA;;iBAuNX,wBAAA,WAAmC,OAAA,OAAc,OAAA,EAAS,CAAC;;AAtN7C;AAC9B;iBA0OgB,2BAAA,IAA+B,OAAA,EAAS,OAAO,CAAC,CAAA;AAAA,iBAW1C,IAAA,CAAK,EAAA,WAAU,OAAA;AAAA,iBAgCf,SAAA,CAAU,IAAA,EAAM,IAAA,GAAI,OAAA;AAAA,iBAsB1B,0BAAA,IAA8B,IAAA,EAAM,UAAU,QAAQ,iBAAA;AAAA,iBAgCtD,iBAAA,CACd,aAAA,SAAsB,OAAA,0BAAiC,OAAA,wBACvD,OAAA;EACE,cAAA;EACA,OAAA,IAAW,KAAA,EAAO,KAAA;AAAA;AAAA,cAoChB,YAAA,SAAqB,KAAK;EAAA,SACF,EAAA;cAAA,EAAA;AAAA;AAAA,iBAMR,OAAA,IAAW,aAAA,EAAe,OAAA,CAAQ,CAAA,WAAY,OAAA,CAAQ,CAAA,IAAK,EAAA,WAAa,OAAA,CAAQ,MAAA,CAAO,CAAA,EAAG,YAAA;AAAA,iBA0B1F,YAAA,IAAgB,OAAA,EAAS,OAAA,CAAQ,CAAA,GAAI,EAAA,WAAa,OAAA,CAAQ,CAAA;;;;;;AApZyB;AAwEzG;;;;iBAsWsB,kBAAA,OACpB,KAAA,WAAgB,CAAA,IAChB,WAAA,UACA,EAAA,GAAK,IAAA,EAAM,CAAA,EAAG,KAAA,aAAkB,OAAA,CAAQ,CAAA,IACvC,OAAA,CAAQ,CAAA;AAAA,KAmDC,gBAAA;EA7ZuC;;;EAiajD,WAAA;EAja0B;;;EAsa1B,UAAA;EAtamD;AA0CrD;;EAiYE,UAAA;EAjYwD;;;EAsYxD,KAAA;EAtYyD;;AAAC;EA2Y1D,UAAA;AAAA;AAAA,iBAGc,WAAA,IACd,IAAA,QAAY,OAAA,CAAQ,CAAA,GACpB,OAAA,EAAS,gBAAA,SACF,OAAA,CAAQ,CAAA;AAAA,iBA0DD,SAAA,qBAA8B,IAAA,MAAU,IAAA,EAAM,CAAA,KAAM,OAAA,CAAQ,CAAA,GAAI,OAAA,eAAsB,IAAA,EAAM,CAAA,KAAM,OAAA,CAAQ,CAAA"}

package/dist/esm/utils/promises.js

@@ -5,7 +5,6 @@ import { DependenciesMap } from "./maps.js";
 import { Result } from "./results.js";
 import { traceSpan } from "./telemetry.js";
 import { generateUuid } from "./uuids.js";
-
 //#region src/utils/promises.tsx
 function createPromise(callback) {
 	let status = "pending";
@@ -33,36 +32,6 @@ function createPromise(callback) {
 		...status === "rejected" ? { reason: valueOrReason } : {}
 	});
 }
-(void 0)?.test("createPromise", async ({ expect }) => {
-	const resolvedPromise = createPromise((resolve) => {
-		resolve(42);
-	});
-	expect(resolvedPromise.status).toBe("fulfilled");
-	expect(resolvedPromise.value).toBe(42);
-	expect(await resolvedPromise).toBe(42);
-	const error = /* @__PURE__ */ new Error("Test error");
-	const rejectedPromise = createPromise((_, reject) => {
-		reject(error);
-	});
-	expect(rejectedPromise.status).toBe("rejected");
-	expect(rejectedPromise.reason).toBe(error);
-	await expect(rejectedPromise).rejects.toBe(error);
-	const pendingPromise = createPromise(() => {});
-	expect(pendingPromise.status).toBe("pending");
-	expect(pendingPromise.value).toBeUndefined();
-	expect(pendingPromise.reason).toBeUndefined();
-	let resolveCount = 0;
-	const multiResolvePromise = createPromise((resolve) => {
-		resolve(1);
-		resolveCount++;
-		resolve(2);
-		resolveCount++;
-	});
-	expect(resolveCount).toBe(2);
-	expect(multiResolvePromise.status).toBe("fulfilled");
-	expect(multiResolvePromise.value).toBe(1);
-	expect(await multiResolvePromise).toBe(1);
-});
 let resolvedCache = null;
 /**
 * Like Promise.resolve(...), but also adds the status and value properties for use with React's `use` hook, and caches
@@ -78,19 +47,6 @@ function resolved(value) {
 	resolvedCache.set([value], res);
 	return res;
 }
-(void 0)?.test("resolved", async ({ expect }) => {
-	const promise1 = resolved(42);
-	expect(promise1.status).toBe("fulfilled");
-	expect(promise1.value).toBe(42);
-	expect(await promise1).toBe(42);
-	const obj = { test: true };
-	const promise2 = resolved(obj);
-	expect(promise2.status).toBe("fulfilled");
-	expect(promise2.value).toBe(obj);
-	expect(await promise2).toBe(obj);
-	expect(resolved(42)).toBe(promise1);
-	expect(resolved(43)).not.toBe(promise1);
-});
 let rejectedCache = null;
 /**
 * Like Promise.reject(...), but also adds the status and value properties for use with React's `use` hook, and caches
@@ -108,28 +64,10 @@ function rejected(reason) {
 	rejectedCache.set([reason], res);
 	return res;
 }
-(void 0)?.test("rejected", ({ expect }) => {
-	const error = /* @__PURE__ */ new Error("Test error");
-	const promise1 = rejected(error);
-	expect(promise1.status).toBe("rejected");
-	expect(promise1.reason).toBe(error);
-	const promise2 = rejected("error message");
-	expect(promise2.status).toBe("rejected");
-	expect(promise2.reason).toBe("error message");
-	expect(rejected(error)).toBe(promise1);
-	expect(rejected(/* @__PURE__ */ new Error("Different error"))).not.toBe(promise1);
-});
 const neverResolvePromise = pending(new Promise(() => {}));
 function neverResolve() {
 	return neverResolvePromise;
 }
-(void 0)?.test("neverResolve", ({ expect }) => {
-	const promise = neverResolve();
-	expect(promise.status).toBe("pending");
-	expect(promise.value).toBeUndefined();
-	expect(promise.reason).toBeUndefined();
-	expect(neverResolve()).toBe(promise);
-});
 function pending(promise, options = {}) {
 	const res = promise.then((value) => {
 		res.status = "fulfilled";
@@ -143,15 +81,6 @@ function pending(promise, options = {}) {
 	res.status = "pending";
 	return res;
 }
-(void 0)?.test("pending", async ({ expect }) => {
-	const resolvePromise = Promise.resolve(42);
-	const pendingPromise = pending(resolvePromise);
-	expect(pendingPromise.status).toBe("pending");
-	await resolvePromise;
-	await new Promise((resolve) => setTimeout(resolve, 0));
-	expect(pendingPromise.status).toBe("fulfilled");
-	expect(pendingPromise.value).toBe(42);
-});
 /**
 * Should be used to wrap Promises that are not immediately awaited, so they don't throw an unhandled promise rejection
 * error.
@@ -161,15 +90,6 @@ function pending(promise, options = {}) {
 function ignoreUnhandledRejection(promise) {
 	promise.catch(() => {});
 }
-(void 0)?.test("ignoreUnhandledRejection", async ({ expect }) => {
-	const resolvePromise = Promise.resolve(42);
-	ignoreUnhandledRejection(resolvePromise);
-	expect(await resolvePromise).toBe(42);
-	const error = /* @__PURE__ */ new Error("Test error");
-	const rejectPromise = Promise.reject(error);
-	ignoreUnhandledRejection(rejectPromise);
-	await expect(rejectPromise).rejects.toBe(error);
-});
 /**
 * See concatStacktraces for more information.
 */
@@ -189,32 +109,9 @@ async function wait(ms) {
 		return await new Promise((resolve) => setTimeout(resolve, ms));
 	});
 }
-(void 0)?.test("wait", async ({ expect }) => {
-	const start = Date.now();
-	await wait(10);
-	expect(Date.now() - start).toBeGreaterThanOrEqual(5);
-	await expect(wait(0)).resolves.toBeUndefined();
-	await expect(wait(-10)).rejects.toThrow("wait() requires a non-negative integer");
-	await expect(wait(NaN)).rejects.toThrow("wait() requires a non-negative integer");
-	await expect(wait(Infinity)).rejects.toThrow("wait() requires a non-negative integer");
-	await expect(wait(2 ** 31)).rejects.toThrow("The maximum timeout for wait()");
-});
 async function waitUntil(date) {
 	return await wait(date.getTime() - Date.now());
 }
-(void 0)?.test("waitUntil", async ({ expect }) => {
-	const futureDate = new Date(Date.now() + 10);
-	const start = Date.now();
-	await waitUntil(futureDate);
-	expect(Date.now() - start).toBeGreaterThanOrEqual(5);
-	try {
-		await waitUntil(/* @__PURE__ */ new Date(Date.now() - 1e3));
-		expect.fail("Should have thrown an error");
-	} catch (error) {
-		expect(error).toBeInstanceOf(HexclaveAssertionError);
-		expect(error.message).toContain("wait() requires a non-negative integer");
-	}
-});
 function runAsynchronouslyWithAlert(...args) {
 	return runAsynchronously(args[0], {
 		...args[1],
@@ -226,12 +123,6 @@ function runAsynchronouslyWithAlert(...args) {
 		}
 	}, ...args.slice(2));
 }
-(void 0)?.test("runAsynchronouslyWithAlert", ({ expect }) => {
-	const testFn = () => Promise.resolve("test");
-	const testOptions = { noErrorLogging: true };
-	expect(() => runAsynchronouslyWithAlert(testFn, testOptions)).not.toThrow();
-	expect(typeof runAsynchronouslyWithAlert).toBe("function");
-});
 function runAsynchronously(promiseOrFunc, options = {}) {
 	if (typeof promiseOrFunc === "function") promiseOrFunc = promiseOrFunc();
 	if (promiseOrFunc) {
@@ -243,14 +134,6 @@ function runAsynchronously(promiseOrFunc, options = {}) {
 		});
 	}
 }
-(void 0)?.test("runAsynchronously", ({ expect }) => {
-	const testFn = () => Promise.resolve("test");
-	expect(() => runAsynchronously(testFn)).not.toThrow();
-	expect(() => runAsynchronously(Promise.resolve("test"))).not.toThrow();
-	expect(() => runAsynchronously(void 0)).not.toThrow();
-	expect(() => runAsynchronously(testFn, { noErrorLogging: true })).not.toThrow();
-	expect(() => runAsynchronously(testFn, { onError: () => {} })).not.toThrow();
-});
 var TimeoutError = class extends Error {
 	constructor(ms) {
 		super(`Timeout after ${ms}ms`);
@@ -262,26 +145,9 @@ async function timeout(promiseOrFunc, ms) {
 	const promise = typeof promiseOrFunc === "function" ? promiseOrFunc() : promiseOrFunc;
 	return await Promise.race([promise.then((value) => Result.ok(value)), wait(ms).then(() => Result.error(new TimeoutError(ms)))]);
 }
-(void 0)?.test("timeout", async ({ expect }) => {
-	const fastResult = await timeout(Promise.resolve(42), 100);
-	expect(fastResult.status).toBe("ok");
-	if (fastResult.status === "ok") expect(fastResult.data).toBe(42);
-	const slowResult = await timeout(new Promise((resolve) => setTimeout(() => resolve("too late"), 50)), 10);
-	expect(slowResult.status).toBe("error");
-	if (slowResult.status === "error") {
-		expect(slowResult.error).toBeInstanceOf(TimeoutError);
-		expect(slowResult.error.ms).toBe(10);
-	}
-});
 async function timeoutThrow(promise, ms) {
 	return Result.orThrow(await timeout(promise, ms));
 }
-(void 0)?.test("timeoutThrow", async ({ expect }) => {
-	expect(await timeoutThrow(Promise.resolve(42), 100)).toBe(42);
-	const slowPromise = new Promise((resolve) => setTimeout(() => resolve("too late"), 50));
-	await expect(timeoutThrow(slowPromise, 10)).rejects.toThrow("Timeout after 10ms");
-	await expect(timeoutThrow(slowPromise, 10)).rejects.toBeInstanceOf(TimeoutError);
-});
 /**
 * Maps over `items` with `fn`, running at most `concurrency` invocations at a time.
 *
@@ -313,31 +179,6 @@ async function mapWithConcurrency(items, concurrency, fn) {
 	await Promise.all(Array.from({ length: workerCount }, () => worker()));
 	return results;
 }
-(void 0)?.test("mapWithConcurrency", async ({ expect }) => {
-	expect(await mapWithConcurrency([
-		30,
-		10,
-		20
-	], 3, async (ms, index) => {
-		await wait(ms);
-		return `${index}:${ms}`;
-	})).toEqual([
-		"0:30",
-		"1:10",
-		"2:20"
-	]);
-	let inFlight = 0;
-	let maxInFlight = 0;
-	await mapWithConcurrency(Array.from({ length: 10 }, (_, i) => i), 3, async () => {
-		inFlight++;
-		maxInFlight = Math.max(maxInFlight, inFlight);
-		await wait(5);
-		inFlight--;
-	});
-	expect(maxInFlight).toBe(3);
-	expect(await mapWithConcurrency([], 4, async () => 1)).toEqual([]);
-	await expect(mapWithConcurrency([1], 0, async (x) => x)).rejects.toThrow("positive integer concurrency");
-});
 function rateLimited(func, options) {
 	let waitUntil = performance.now();
 	let queue = [];
@@ -383,7 +224,7 @@ function throttled(func, delayMs) {
 		return await nextAvailable;
 	};
 }
-
 //#endregion
 export { concatStacktracesIfRejected, createPromise, ignoreUnhandledRejection, mapWithConcurrency, neverResolve, pending, rateLimited, rejected, resolved, runAsynchronously, runAsynchronouslyWithAlert, throttled, timeout, timeoutThrow, wait, waitUntil };
+
 //# sourceMappingURL=promises.js.map