document-dataply 0.0.10-alpha.6 → 0.0.10-alpha.8

package/dist/cjs/index.js

@@ -125,8 +125,8 @@ var require_cjs = __commonJS({
        * @param b Value b.
        * @returns Negative if a < b, 0 if equal, positive if a > b (based on primary field only).
        */
-      primaryAsc(a, b) {
-        return this.asc(a, b);
+      primaryAsc(a, b2) {
+        return this.asc(a, b2);
       }
       isPrimarySame(value, than) {
         return this.primaryAsc(value, than) === 0;
@@ -139,16 +139,16 @@ var require_cjs = __commonJS({
       }
     };
     var NumericComparator = class extends ValueComparator2 {
-      asc(a, b) {
-        return a - b;
+      asc(a, b2) {
+        return a - b2;
       }
       match(value) {
         return value.toString();
       }
     };
     var StringComparator = class extends ValueComparator2 {
-      asc(a, b) {
-        return a.localeCompare(b);
+      asc(a, b2) {
+        return a.localeCompare(b2);
       }
       match(value) {
         return value;
@@ -965,11 +965,11 @@ var require_cjs = __commonJS({
       readQueue;
       writeQueue;
       static async CatchError(promise) {
-        return await promise.then((v) => [void 0, v]).catch((err) => [err]);
+        return await promise.then((v2) => [void 0, v2]).catch((err) => [err]);
       }
-      static IsRangeOverlap(a, b) {
+      static IsRangeOverlap(a, b2) {
         const [start1, end1] = a;
-        const [start2, end2] = b;
+        const [start2, end2] = b2;
         if (end1 <= start2 || end2 <= start1) {
           return false;
         }
@@ -1005,10 +1005,10 @@ var require_cjs = __commonJS({
       rangeOverlapping(tasks, range) {
         return Array.from(tasks.values()).some((t) => _Ryoiki.IsRangeOverlap(t.range, range));
       }
-      isSameRange(a, b) {
+      isSameRange(a, b2) {
         const [a1, a2] = a;
-        const [b1, b2] = b;
-        return a1 === b1 && a2 === b2;
+        const [b1, b22] = b2;
+        return a1 === b1 && a2 === b22;
       }
       fetchUnitAndRun(queue, workspaces) {
         for (const [id, unit] of queue) {
@@ -1071,9 +1071,9 @@ var require_cjs = __commonJS({
             if (timeoutId !== null) {
               clearTimeout(timeoutId);
             }
-            const [err, v] = await _Ryoiki.CatchError(task(id));
+            const [err, v2] = await _Ryoiki.CatchError(task(id));
             if (err) reject(err);
-            else resolve(v);
+            else resolve(v2);
           };
           const fetch = () => {
             this.fetchUnitAndRun(this.readQueue, this.readings);
@@ -1640,23 +1640,23 @@ var require_cjs = __commonJS({
       isInitialized = false;
       isDestroyed = false;
       verifierMap = {
-        gt: (nv, v) => this.comparator.isHigher(nv, v),
-        gte: (nv, v) => this.comparator.isHigher(nv, v) || this.comparator.isSame(nv, v),
-        lt: (nv, v) => this.comparator.isLower(nv, v),
-        lte: (nv, v) => this.comparator.isLower(nv, v) || this.comparator.isSame(nv, v),
-        equal: (nv, v) => this.comparator.isSame(nv, v),
-        notEqual: (nv, v) => this.comparator.isSame(nv, v) === false,
-        or: (nv, v) => this.ensureValues(v).some((v2) => this.comparator.isSame(nv, v2)),
-        primaryGt: (nv, v) => this.comparator.isPrimaryHigher(nv, v),
-        primaryGte: (nv, v) => this.comparator.isPrimaryHigher(nv, v) || this.comparator.isPrimarySame(nv, v),
-        primaryLt: (nv, v) => this.comparator.isPrimaryLower(nv, v),
-        primaryLte: (nv, v) => this.comparator.isPrimaryLower(nv, v) || this.comparator.isPrimarySame(nv, v),
-        primaryEqual: (nv, v) => this.comparator.isPrimarySame(nv, v),
-        primaryNotEqual: (nv, v) => this.comparator.isPrimarySame(nv, v) === false,
-        primaryOr: (nv, v) => this.ensureValues(v).some((v2) => this.comparator.isPrimarySame(nv, v2)),
-        like: (nv, v) => {
+        gt: (nv, v2) => this.comparator.isHigher(nv, v2),
+        gte: (nv, v2) => this.comparator.isHigher(nv, v2) || this.comparator.isSame(nv, v2),
+        lt: (nv, v2) => this.comparator.isLower(nv, v2),
+        lte: (nv, v2) => this.comparator.isLower(nv, v2) || this.comparator.isSame(nv, v2),
+        equal: (nv, v2) => this.comparator.isSame(nv, v2),
+        notEqual: (nv, v2) => this.comparator.isSame(nv, v2) === false,
+        or: (nv, v2) => this.ensureValues(v2).some((v22) => this.comparator.isSame(nv, v22)),
+        primaryGt: (nv, v2) => this.comparator.isPrimaryHigher(nv, v2),
+        primaryGte: (nv, v2) => this.comparator.isPrimaryHigher(nv, v2) || this.comparator.isPrimarySame(nv, v2),
+        primaryLt: (nv, v2) => this.comparator.isPrimaryLower(nv, v2),
+        primaryLte: (nv, v2) => this.comparator.isPrimaryLower(nv, v2) || this.comparator.isPrimarySame(nv, v2),
+        primaryEqual: (nv, v2) => this.comparator.isPrimarySame(nv, v2),
+        primaryNotEqual: (nv, v2) => this.comparator.isPrimarySame(nv, v2) === false,
+        primaryOr: (nv, v2) => this.ensureValues(v2).some((v22) => this.comparator.isPrimarySame(nv, v22)),
+        like: (nv, v2) => {
           const nodeValue = this.comparator.match(nv);
-          const value = v;
+          const value = v2;
           if (!this._cachedRegexp.has(value)) {
             const pattern = value.replace(/%/g, ".*").replace(/_/g, ".");
             const regexp2 = new RegExp(`^${pattern}$`, "i");
@@ -1669,28 +1669,28 @@ var require_cjs = __commonJS({
       searchConfigs = {
         gt: {
           asc: {
-            start: (tx, v) => tx.findUpperBoundLeaf(v[0]),
+            start: (tx, v2) => tx.findUpperBoundLeaf(v2[0]),
             end: () => null,
             direction: 1,
             earlyTerminate: false
           },
           desc: {
             start: (tx) => tx.rightestNode(),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], -1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], -1),
             direction: -1,
             earlyTerminate: true
           }
         },
         gte: {
           asc: {
-            start: (tx, v) => tx.findLowerBoundLeaf(v[0]),
+            start: (tx, v2) => tx.findLowerBoundLeaf(v2[0]),
             end: () => null,
             direction: 1,
             earlyTerminate: false
           },
           desc: {
             start: (tx) => tx.rightestNode(),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], -1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], -1),
             direction: -1,
             earlyTerminate: true
           }
@@ -1698,12 +1698,12 @@ var require_cjs = __commonJS({
         lt: {
           asc: {
             start: (tx) => tx.leftestNode(),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], 1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], 1),
             direction: 1,
             earlyTerminate: true
           },
           desc: {
-            start: (tx, v) => tx.findLowerBoundLeaf(v[0]),
+            start: (tx, v2) => tx.findLowerBoundLeaf(v2[0]),
             end: () => null,
             direction: -1,
             earlyTerminate: false
@@ -1712,12 +1712,12 @@ var require_cjs = __commonJS({
         lte: {
           asc: {
             start: (tx) => tx.leftestNode(),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], 1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], 1),
             direction: 1,
             earlyTerminate: true
           },
           desc: {
-            start: (tx, v) => tx.findUpperBoundLeaf(v[0]),
+            start: (tx, v2) => tx.findUpperBoundLeaf(v2[0]),
             end: () => null,
             direction: -1,
             earlyTerminate: false
@@ -1725,14 +1725,14 @@ var require_cjs = __commonJS({
         },
         equal: {
           asc: {
-            start: (tx, v) => tx.findLowerBoundLeaf(v[0]),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], 1),
+            start: (tx, v2) => tx.findLowerBoundLeaf(v2[0]),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], 1),
             direction: 1,
             earlyTerminate: true
           },
           desc: {
-            start: (tx, v) => tx.findOuterBoundaryLeaf(v[0], 1),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], -1),
+            start: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], 1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], -1),
             direction: -1,
             earlyTerminate: true
           }
@@ -1753,42 +1753,42 @@ var require_cjs = __commonJS({
         },
         or: {
           asc: {
-            start: (tx, v) => tx.findLowerBoundLeaf(tx.lowestValue(v)),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(tx.highestValue(v), 1),
+            start: (tx, v2) => tx.findLowerBoundLeaf(tx.lowestValue(v2)),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(tx.highestValue(v2), 1),
             direction: 1,
             earlyTerminate: false
           },
           desc: {
-            start: (tx, v) => tx.findOuterBoundaryLeaf(tx.highestValue(v), 1),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(tx.lowestValue(v), -1),
+            start: (tx, v2) => tx.findOuterBoundaryLeaf(tx.highestValue(v2), 1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(tx.lowestValue(v2), -1),
             direction: -1,
             earlyTerminate: false
           }
         },
         primaryGt: {
           asc: {
-            start: (tx, v) => tx.findUpperBoundLeaf(v[0]),
+            start: (tx, v2) => tx.findUpperBoundLeaf(v2[0]),
             end: () => null,
             direction: 1,
             earlyTerminate: false
           },
           desc: {
             start: (tx) => tx.rightestNode(),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], -1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], -1),
             direction: -1,
             earlyTerminate: true
           }
         },
         primaryGte: {
           asc: {
-            start: (tx, v) => tx.findLowerBoundLeaf(v[0]),
+            start: (tx, v2) => tx.findLowerBoundLeaf(v2[0]),
             end: () => null,
             direction: 1,
             earlyTerminate: false
           },
           desc: {
             start: (tx) => tx.rightestNode(),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], -1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], -1),
             direction: -1,
             earlyTerminate: true
           }
@@ -1796,12 +1796,12 @@ var require_cjs = __commonJS({
         primaryLt: {
           asc: {
             start: (tx) => tx.leftestNode(),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], 1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], 1),
             direction: 1,
             earlyTerminate: true
           },
           desc: {
-            start: (tx, v) => tx.findLowerBoundLeaf(v[0]),
+            start: (tx, v2) => tx.findLowerBoundLeaf(v2[0]),
             end: () => null,
             direction: -1,
             earlyTerminate: false
@@ -1810,12 +1810,12 @@ var require_cjs = __commonJS({
         primaryLte: {
           asc: {
             start: (tx) => tx.leftestNode(),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], 1),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], 1),
             direction: 1,
             earlyTerminate: true
           },
           desc: {
-            start: (tx, v) => tx.findUpperBoundLeaf(v[0]),
+            start: (tx, v2) => tx.findUpperBoundLeaf(v2[0]),
             end: () => null,
             direction: -1,
             earlyTerminate: false
@@ -1823,14 +1823,14 @@ var require_cjs = __commonJS({
         },
         primaryEqual: {
           asc: {
-            start: (tx, v) => tx.findLowerBoundLeaf(v[0]),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], 1),
+            start: (tx, v2) => tx.findLowerBoundLeaf(v2[0]),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], 1),
             direction: 1,
             earlyTerminate: true
           },
           desc: {
-            start: (tx, v) => tx.findUpperBoundLeaf(v[0]),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(v[0], -1),
+            start: (tx, v2) => tx.findUpperBoundLeaf(v2[0]),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(v2[0], -1),
             direction: -1,
             earlyTerminate: true
           }
@@ -1851,14 +1851,14 @@ var require_cjs = __commonJS({
         },
         primaryOr: {
           asc: {
-            start: (tx, v) => tx.findLowerBoundLeaf(tx.lowestPrimaryValue(v)),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(tx.highestPrimaryValue(v), 1),
+            start: (tx, v2) => tx.findLowerBoundLeaf(tx.lowestPrimaryValue(v2)),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(tx.highestPrimaryValue(v2), 1),
             direction: 1,
             earlyTerminate: false
           },
           desc: {
-            start: (tx, v) => tx.findUpperBoundLeaf(tx.highestPrimaryValue(v)),
-            end: (tx, v) => tx.findOuterBoundaryLeaf(tx.lowestPrimaryValue(v), -1),
+            start: (tx, v2) => tx.findUpperBoundLeaf(tx.highestPrimaryValue(v2)),
+            end: (tx, v2) => tx.findOuterBoundaryLeaf(tx.lowestPrimaryValue(v2), -1),
             direction: -1,
             earlyTerminate: false
           }
@@ -2085,27 +2085,27 @@ var require_cjs = __commonJS({
         this.comparator = comparator;
         this.option = option ?? {};
       }
-      ensureValues(v) {
-        if (!Array.isArray(v)) {
-          v = [v];
+      ensureValues(v2) {
+        if (!Array.isArray(v2)) {
+          v2 = [v2];
         }
-        return v;
+        return v2;
       }
-      lowestValue(v) {
+      lowestValue(v2) {
         const i = 0;
-        return [...v].sort((a, b) => this.comparator.asc(a, b))[i];
+        return [...v2].sort((a, b2) => this.comparator.asc(a, b2))[i];
       }
-      highestValue(v) {
-        const i = v.length - 1;
-        return [...v].sort((a, b) => this.comparator.asc(a, b))[i];
+      highestValue(v2) {
+        const i = v2.length - 1;
+        return [...v2].sort((a, b2) => this.comparator.asc(a, b2))[i];
       }
-      lowestPrimaryValue(v) {
+      lowestPrimaryValue(v2) {
         const i = 0;
-        return [...v].sort((a, b) => this.comparator.primaryAsc(a, b))[i];
+        return [...v2].sort((a, b2) => this.comparator.primaryAsc(a, b2))[i];
       }
-      highestPrimaryValue(v) {
-        const i = v.length - 1;
-        return [...v].sort((a, b) => this.comparator.primaryAsc(a, b))[i];
+      highestPrimaryValue(v2) {
+        const i = v2.length - 1;
+        return [...v2].sort((a, b2) => this.comparator.primaryAsc(a, b2))[i];
       }
       /**
        * Returns the result entries of the transaction.
@@ -2299,13 +2299,13 @@ var require_cjs = __commonJS({
           const midValue = parentNode.values[mid];
           parentNode.values = parentNode.values.slice(0, mid);
           parentNode.keys = parentNode.keys.slice(0, mid + 1);
-          for (const k of parentNode.keys) {
-            const n = this._cloneNode(this.getNode(k));
+          for (const k2 of parentNode.keys) {
+            const n = this._cloneNode(this.getNode(k2));
             n.parent = parentNode.id;
             this._updateNode(n);
           }
-          for (const k of newSiblingNodeRecursive.keys) {
-            const n = this._cloneNode(this.getNode(k));
+          for (const k2 of newSiblingNodeRecursive.keys) {
+            const n = this._cloneNode(this.getNode(k2));
             n.parent = newSiblingNodeRecursive.id;
             this._updateNode(n);
           }
@@ -2519,11 +2519,11 @@ var require_cjs = __commonJS({
         let count = 0;
         const intersection = filterValues && filterValues.size > 0 ? filterValues : null;
         for (const pair of generator) {
-          const [k, v] = pair;
-          if (intersection && !intersection.has(k)) {
+          const [k2, v2] = pair;
+          if (intersection && !intersection.has(k2)) {
             continue;
           }
-          if (this.verify(v, condition)) {
+          if (this.verify(v2, condition)) {
             yield pair;
             count++;
             if (limit !== void 0 && count >= limit) {
@@ -2571,7 +2571,7 @@ var require_cjs = __commonJS({
       }
       batchInsert(entries) {
         if (entries.length === 0) return;
-        const sorted = [...entries].sort((a, b) => this.comparator.asc(a[1], b[1]));
+        const sorted = [...entries].sort((a, b2) => this.comparator.asc(a[1], b2[1]));
         let currentLeaf = null;
         let modified = false;
         for (const [key, value] of sorted) {
@@ -2979,11 +2979,11 @@ var require_cjs = __commonJS({
       readQueue;
       writeQueue;
       static async CatchError(promise) {
-        return await promise.then((v) => [void 0, v]).catch((err) => [err]);
+        return await promise.then((v2) => [void 0, v2]).catch((err) => [err]);
       }
-      static IsRangeOverlap(a, b) {
+      static IsRangeOverlap(a, b2) {
         const [start1, end1] = a;
-        const [start2, end2] = b;
+        const [start2, end2] = b2;
         if (end1 <= start2 || end2 <= start1) {
           return false;
         }
@@ -3019,10 +3019,10 @@ var require_cjs = __commonJS({
       rangeOverlapping(tasks, range) {
         return Array.from(tasks.values()).some((t) => _Ryoiki2.IsRangeOverlap(t.range, range));
       }
-      isSameRange(a, b) {
+      isSameRange(a, b2) {
         const [a1, a2] = a;
-        const [b1, b2] = b;
-        return a1 === b1 && a2 === b2;
+        const [b1, b22] = b2;
+        return a1 === b1 && a2 === b22;
       }
       fetchUnitAndRun(queue, workspaces) {
         for (const [id, unit] of queue) {
@@ -3085,9 +3085,9 @@ var require_cjs = __commonJS({
             if (timeoutId !== null) {
               clearTimeout(timeoutId);
             }
-            const [err, v] = await _Ryoiki2.CatchError(task(id));
+            const [err, v2] = await _Ryoiki2.CatchError(task(id));
             if (err) reject(err);
-            else resolve(v);
+            else resolve(v2);
           };
           const fetch = () => {
             this.fetchUnitAndRun(this.readQueue, this.readings);
@@ -3385,13 +3385,13 @@ var require_cjs = __commonJS({
           const midValue = parentNode.values[mid];
           parentNode.values = parentNode.values.slice(0, mid);
           parentNode.keys = parentNode.keys.slice(0, mid + 1);
-          for (const k of parentNode.keys) {
-            const n = this._cloneNode(await this.getNode(k));
+          for (const k2 of parentNode.keys) {
+            const n = this._cloneNode(await this.getNode(k2));
             n.parent = parentNode.id;
             await this._updateNode(n);
           }
-          for (const k of newSiblingNodeRecursive.keys) {
-            const n = this._cloneNode(await this.getNode(k));
+          for (const k2 of newSiblingNodeRecursive.keys) {
+            const n = this._cloneNode(await this.getNode(k2));
             n.parent = newSiblingNodeRecursive.id;
             await this._updateNode(n);
           }
@@ -3614,11 +3614,11 @@ var require_cjs = __commonJS({
         let count = 0;
         const intersection = filterValues && filterValues.size > 0 ? filterValues : null;
         for await (const pair of generator) {
-          const [k, v] = pair;
-          if (intersection && !intersection.has(k)) {
+          const [k2, v2] = pair;
+          if (intersection && !intersection.has(k2)) {
             continue;
           }
-          if (this.verify(v, condition)) {
+          if (this.verify(v2, condition)) {
             yield pair;
             count++;
             if (limit !== void 0 && count >= limit) {
@@ -3669,7 +3669,7 @@ var require_cjs = __commonJS({
       async batchInsert(entries) {
         if (entries.length === 0) return;
         return this.writeLock(0, async () => {
-          const sorted = [...entries].sort((a, b) => this.comparator.asc(a[1], b[1]));
+          const sorted = [...entries].sort((a, b2) => this.comparator.asc(a[1], b2[1]));
           let currentLeaf = null;
           let modified = false;
           for (const [key, value] of sorted) {
@@ -4208,11 +4208,11 @@ var require_cjs = __commonJS({
       readQueue;
       writeQueue;
       static async CatchError(promise) {
-        return await promise.then((v) => [void 0, v]).catch((err) => [err]);
+        return await promise.then((v2) => [void 0, v2]).catch((err) => [err]);
       }
-      static IsRangeOverlap(a, b) {
+      static IsRangeOverlap(a, b2) {
         const [start1, end1] = a;
-        const [start2, end2] = b;
+        const [start2, end2] = b2;
         if (end1 <= start2 || end2 <= start1) {
           return false;
         }
@@ -4248,10 +4248,10 @@ var require_cjs = __commonJS({
       rangeOverlapping(tasks, range) {
         return Array.from(tasks.values()).some((t) => _Ryoiki3.IsRangeOverlap(t.range, range));
       }
-      isSameRange(a, b) {
+      isSameRange(a, b2) {
         const [a1, a2] = a;
-        const [b1, b2] = b;
-        return a1 === b1 && a2 === b2;
+        const [b1, b22] = b2;
+        return a1 === b1 && a2 === b22;
       }
       fetchUnitAndRun(queue, workspaces) {
         for (const [id, unit] of queue) {
@@ -4314,9 +4314,9 @@ var require_cjs = __commonJS({
             if (timeoutId !== null) {
               clearTimeout(timeoutId);
             }
-            const [err, v] = await _Ryoiki3.CatchError(task(id));
+            const [err, v2] = await _Ryoiki3.CatchError(task(id));
             if (err) reject(err);
-            else resolve(v);
+            else resolve(v2);
           };
           const fetch = () => {
             this.fetchUnitAndRun(this.readQueue, this.readings);
@@ -5721,11 +5721,11 @@ var require_cjs = __commonJS({
       readQueue;
       writeQueue;
       static async CatchError(promise) {
-        return await promise.then((v) => [void 0, v]).catch((err) => [err]);
+        return await promise.then((v2) => [void 0, v2]).catch((err) => [err]);
       }
-      static IsRangeOverlap(a, b) {
+      static IsRangeOverlap(a, b2) {
         const [start1, end1] = a;
-        const [start2, end2] = b;
+        const [start2, end2] = b2;
         if (end1 <= start2 || end2 <= start1) {
           return false;
         }
@@ -5761,10 +5761,10 @@ var require_cjs = __commonJS({
       rangeOverlapping(tasks, range) {
         return Array.from(tasks.values()).some((t) => _Ryoiki4.IsRangeOverlap(t.range, range));
       }
-      isSameRange(a, b) {
+      isSameRange(a, b2) {
         const [a1, a2] = a;
-        const [b1, b2] = b;
-        return a1 === b1 && a2 === b2;
+        const [b1, b22] = b2;
+        return a1 === b1 && a2 === b22;
       }
       fetchUnitAndRun(queue, workspaces) {
         for (const [id, unit] of queue) {
@@ -5827,9 +5827,9 @@ var require_cjs = __commonJS({
             if (timeoutId !== null) {
               clearTimeout(timeoutId);
             }
-            const [err, v] = await _Ryoiki4.CatchError(task(id));
+            const [err, v2] = await _Ryoiki4.CatchError(task(id));
             if (err) reject(err);
-            else resolve(v);
+            else resolve(v2);
           };
           const fetch = () => {
             this.fetchUnitAndRun(this.readQueue, this.readings);
@@ -6465,7 +6465,7 @@ var require_cjs = __commonJS({
     (function makeTable() {
       for (let i = 0; i < 256; i++) {
         let c = i;
-        for (let k = 0; k < 8; k++) {
+        for (let k2 = 0; k2 < 8; k2++) {
           c = c & 1 ? 3988292384 ^ c >>> 1 : c >>> 1;
         }
         CRC_TABLE[i] = c;
@@ -8149,7 +8149,7 @@ var require_cjs = __commonJS({
         if (this.fd === null) {
           this.open();
         }
-        const sortedPageIds = Array.from(pages.keys()).sort((a, b) => a - b);
+        const sortedPageIds = Array.from(pages.keys()).sort((a, b2) => a - b2);
         for (const pageId of sortedPageIds) {
           const data = pages.get(pageId);
           this.view.setUint32(0, pageId, true);
@@ -8330,7 +8330,7 @@ var require_cjs = __commonJS({
           return;
         }
         const snapshot = new Map(this.dirtyPages);
-        const sortedPageIds = Array.from(snapshot.keys()).sort((a, b) => a - b);
+        const sortedPageIds = Array.from(snapshot.keys()).sort((a, b2) => a - b2);
         for (const pageId of sortedPageIds) {
           const data = snapshot.get(pageId);
           const position = pageId * this.pageSize;
@@ -8347,7 +8347,7 @@ var require_cjs = __commonJS({
         if (pages.size === 0) {
           return;
         }
-        const sortedPageIds = Array.from(pages.keys()).sort((a, b) => a - b);
+        const sortedPageIds = Array.from(pages.keys()).sort((a, b2) => a - b2);
         for (const pageId of sortedPageIds) {
           const data = pages.get(pageId);
           const position = pageId * this.pageSize;
@@ -9494,7 +9494,7 @@ var require_cjs = __commonJS({
       async fetchRowsByRids(collections, itemsCount, tx) {
         const result = new Array(itemsCount).fill(null);
         if (itemsCount === 0) return result;
-        const sortedPageIds = Array.from(collections.keys()).sort((a, b) => a - b);
+        const sortedPageIds = Array.from(collections.keys()).sort((a, b2) => a - b2);
         await Promise.all(sortedPageIds.map(async (pageId) => {
           const items = collections.get(pageId);
           const page = await this.pfs.get(pageId, tx);
@@ -10394,12 +10394,12 @@ var import_dataply4 = __toESM(require_cjs());
 // src/core/bptree/documentComparator.ts
 var import_dataply = __toESM(require_cjs());
 var DocumentValueComparator = class extends import_dataply.ValueComparator {
-  primaryAsc(a, b) {
-    return this._compareValue(a.v, b.v);
+  primaryAsc(a, b2) {
+    return this._compareValue(a.v, b2.v);
   }
-  asc(a, b) {
-    const diff = this._compareValue(a.v, b.v);
-    return diff === 0 ? a.k - b.k : diff;
+  asc(a, b2) {
+    const diff = this._compareValue(a.v, b2.v);
+    return diff === 0 ? a.k - b2.k : diff;
   }
   match(value) {
     return value.v + "";
@@ -10407,24 +10407,24 @@ var DocumentValueComparator = class extends import_dataply.ValueComparator {
   /**
    * 두 Primitive 값을 비교합니다.
    */
-  _compareDiff(a, b) {
-    if (typeof a === "string" && typeof b === "string") {
-      return a.localeCompare(b);
+  _compareDiff(a, b2) {
+    if (typeof a === "string" && typeof b2 === "string") {
+      return a.localeCompare(b2);
     }
-    return +a - +b;
+    return +a - +b2;
   }
   /**
    * 두 v 값을 비교합니다. v는 Primitive 또는 Primitive[] (복합 인덱스)일 수 있습니다.
    * 배열인 경우 element-by-element로 비교합니다.
    */
-  _compareValue(a, b) {
+  _compareValue(a, b2) {
     const aArr = Array.isArray(a);
-    const bArr = Array.isArray(b);
+    const bArr = Array.isArray(b2);
     if (!aArr && !bArr) {
-      return this._compareDiff(a, b);
+      return this._compareDiff(a, b2);
     }
     const aList = aArr ? a : [a];
-    const bList = bArr ? b : [b];
+    const bList = bArr ? b2 : [b2];
     const len = Math.min(aList.length, bList.length);
     for (let i = 0; i < len; i++) {
       const diff = this._compareDiff(aList[i], bList[i]);
@@ -10482,7 +10482,7 @@ var SELECTIVITY = {
   /** FTS 통계 없을 때 보수적 추정 */
   FTS_DEFAULT: 0.5,
   /** 정렬 비용 가중치 (orderBy 미지원 시) */
-  SORT_PENALTY: 0.3,
+  SORT_PENALTY: 0.5,
   /** 인메모리 정렬이 유의미해지는 임계 문서 수 */
   SORT_THRESHOLD: 1e4
 };
@@ -10668,9 +10668,12 @@ var Optimizer = class {
    * 비용 계산: effectiveScanCost + sortPenalty
    * - effectiveScanCost: 인덱스 순서 지원 + limit 존재 시 조기 종료 이점 반영
    * - sortPenalty: 인메모리 정렬의 절대 문서 수 기반 비용
+   * - hasUncoveredFilters: 드라이버가 커버하지 못하는 비-FTS 필터 존재 여부
+   *   true일 경우 topK/N 조기 종료를 적용하지 않음
+   *   (uncovered 필터가 행을 탈락시킬 수 있어 topK개 이상 스캔 필요)
    */
-  calculateCost(selectivity, isIndexOrderSupported, orderByField, N, topK) {
-    const effectiveScanCost = isIndexOrderSupported && isFinite(topK) && N > 0 ? Math.min(topK / N, selectivity) : selectivity;
+  calculateCost(selectivity, isIndexOrderSupported, orderByField, N, topK, hasUncoveredFilters = false) {
+    const effectiveScanCost = isIndexOrderSupported && isFinite(topK) && N > 0 && !hasUncoveredFilters ? Math.min(topK / N, selectivity) : selectivity;
     const estimatedSortDocs = selectivity * N;
     const sortPenalty = orderByField && !isIndexOrderSupported ? Math.min(estimatedSortDocs / SELECTIVITY.SORT_THRESHOLD, 1) * SELECTIVITY.SORT_PENALTY : 0;
     return effectiveScanCost + sortPenalty;
@@ -10699,9 +10702,19 @@ var Optimizer = class {
           orderByField
         );
         if (candidate) {
+          const hasUncoveredFilters = ![...queryFields].every(
+            (f2) => candidate.coveredFields.includes(f2)
+          );
           candidates.push({
             ...candidate,
-            cost: this.calculateCost(candidate.selectivity, candidate.isIndexOrderSupported, orderByField, N, topK)
+            cost: this.calculateCost(
+              candidate.selectivity,
+              candidate.isIndexOrderSupported,
+              orderByField,
+              N,
+              topK,
+              hasUncoveredFilters
+            )
           });
         }
       } else if (config.type === "fts") {
@@ -10716,7 +10729,14 @@ var Optimizer = class {
         if (candidate) {
           candidates.push({
             ...candidate,
-            cost: this.calculateCost(candidate.selectivity, candidate.isIndexOrderSupported, orderByField, N, topK)
+            cost: this.calculateCost(
+              candidate.selectivity,
+              candidate.isIndexOrderSupported,
+              orderByField,
+              N,
+              topK,
+              true
+            )
           });
         }
       }
@@ -10730,10 +10750,10 @@ var Optimizer = class {
       rollback();
       return null;
     }
-    candidates.sort((a, b) => {
-      if (a.cost !== b.cost) return a.cost - b.cost;
+    candidates.sort((a, b2) => {
+      if (a.cost !== b2.cost) return a.cost - b2.cost;
       const aConfig = this.api.indexManager.registeredIndices.get(a.indexName);
-      const bConfig = this.api.indexManager.registeredIndices.get(b.indexName);
+      const bConfig = this.api.indexManager.registeredIndices.get(b2.indexName);
       const aFieldCount = aConfig ? Array.isArray(aConfig.fields) ? aConfig.fields.length : 1 : 0;
       const bFieldCount = bConfig ? Array.isArray(bConfig.fields) ? bConfig.fields.length : 1 : 0;
       return aFieldCount - bFieldCount;
@@ -10747,7 +10767,7 @@ var Optimizer = class {
       let isSubset = false;
       for (let j = 0, oLen = others.length; j < oLen; j++) {
         const better = others[j];
-        if (candidate.coveredFields.every((f) => better.coveredFields.includes(f))) {
+        if (candidate.coveredFields.every((f2) => better.coveredFields.includes(f2))) {
           isSubset = true;
           break;
         }
@@ -10869,19 +10889,19 @@ var QueryManager = class {
         for (const operator in conditions) {
           const before = operator;
           const after = this.operatorConverters[before];
-          const v = conditions[before];
+          const v2 = conditions[before];
           if (!after) {
             if (before === "match") {
-              newConditions[before] = v;
+              newConditions[before] = v2;
             }
             continue;
           }
-          if (before === "or" && Array.isArray(v)) {
-            newConditions[after] = v.map((val) => ({ v: val }));
+          if (before === "or" && Array.isArray(v2)) {
+            newConditions[after] = v2.map((val) => ({ v: val }));
           } else if (before === "like") {
-            newConditions[after] = v;
+            newConditions[after] = v2;
           } else {
-            newConditions[after] = { v };
+            newConditions[after] = { v: v2 };
           }
         }
       }
@@ -11035,12 +11055,24 @@ var QueryManager = class {
     }
     return true;
   }
-  adjustChunkSize(currentChunkSize, chunkTotalSize) {
-    if (chunkTotalSize <= 0) return currentChunkSize;
-    const { verySmallChunkSize, smallChunkSize } = this.getFreeMemoryChunkSize();
-    if (chunkTotalSize < verySmallChunkSize) return currentChunkSize * 2;
-    if (chunkTotalSize > smallChunkSize) return Math.max(Math.floor(currentChunkSize / 2), 20);
-    return currentChunkSize;
+  /**
+   * 최적화 공식: x = x * Math.sqrt(z / n)
+   * @param currentChunkSize 현재 청크 크기
+   * @param matchedCount 매칭된 문서 개수
+   * @param limit 최대 문서 개수
+   * @param chunkTotalSize 청크 내 문서 총 크기
+   * @returns 
+   */
+  adjustChunkSize(currentChunkSize, matchedCount, limit, chunkTotalSize) {
+    if (matchedCount <= 0 || chunkTotalSize <= 0) return currentChunkSize;
+    const n = Math.max(matchedCount, 1);
+    const z = isFinite(limit) ? limit : currentChunkSize * 10;
+    const nextChunkSize = Math.ceil(currentChunkSize * Math.sqrt(z / n));
+    const { smallChunkSize } = this.getFreeMemoryChunkSize();
+    const avgDocSize = chunkTotalSize / currentChunkSize;
+    const maxSafeChunkSize = Math.max(Math.floor(smallChunkSize / avgDocSize), 20);
+    const finalChunkSize = Math.max(Math.min(nextChunkSize, maxSafeChunkSize), 20);
+    return finalChunkSize;
   }
   async *processChunkedKeysWithVerify(keysStream, startIdx, initialChunkSize, limit, ftsConditions, compositeVerifyConditions, others, tx) {
     const verifyOthers = others.filter((o) => !o.isFtsMatch);
@@ -11056,34 +11088,35 @@ var QueryManager = class {
     let chunk = [];
     let chunkSize = 0;
     let dropped = 0;
+    let nAccumulated = 0;
     const processChunk = async (pks) => {
       const docs = [];
       const rawResults = await this.api.selectMany(new Float64Array(pks), false, tx);
       let chunkTotalSize = 0;
       for (let j = 0, len = rawResults.length; j < len; j++) {
-        const s = rawResults[j];
-        if (!s) continue;
-        const doc = JSON.parse(s);
-        chunkTotalSize += s.length * 2;
+        const s2 = rawResults[j];
+        if (!s2) continue;
+        const doc = JSON.parse(s2);
+        chunkTotalSize += s2.length * 2;
         if (isFts && !this.verifyFts(doc, ftsConditions)) continue;
         if (isCompositeVerify && this.verifyCompositeConditions(doc, compositeVerifyConditions) === false) continue;
         if (isVerifyOthers) {
           const flatDoc = this.api.flattenDocument(doc);
           let passed = true;
-          for (let k = 0, kLen = verifyOthers.length; k < kLen; k++) {
-            const other = verifyOthers[k];
+          for (let k2 = 0, kLen = verifyOthers.length; k2 < kLen; k2++) {
+            const other = verifyOthers[k2];
             const coveredFields = other.coveredFields;
             let fieldValue;
             if (coveredFields && coveredFields.length > 1) {
               const values = [];
               let hasMissing = false;
-              for (let f = 0, fLen = coveredFields.length; f < fLen; f++) {
-                const v = flatDoc[coveredFields[f]];
-                if (v === void 0) {
+              for (let f2 = 0, fLen = coveredFields.length; f2 < fLen; f2++) {
+                const v2 = flatDoc[coveredFields[f2]];
+                if (v2 === void 0) {
                   hasMissing = true;
                   break;
                 }
-                values.push(v);
+                values.push(v2);
               }
               if (hasMissing) {
                 passed = false;
@@ -11107,8 +11140,9 @@ var QueryManager = class {
         }
         docs.push(doc);
       }
+      nAccumulated += docs.length;
       if (!isReadQuotaLimited) {
-        currentChunkSize = this.adjustChunkSize(currentChunkSize, chunkTotalSize);
+        currentChunkSize = this.adjustChunkSize(currentChunkSize, nAccumulated, limit, chunkTotalSize);
       }
       return docs;
     };
@@ -11188,9 +11222,9 @@ var QueryManager = class {
           const topK = limit === Infinity ? Infinity : offset + limit;
           let heap = null;
           if (topK !== Infinity) {
-            heap = new BinaryHeap((a, b) => {
+            heap = new BinaryHeap((a, b2) => {
               const aVal = a[orderByField] ?? a._id;
-              const bVal = b[orderByField] ?? b._id;
+              const bVal = b2[orderByField] ?? b2._id;
               const cmp = aVal < bVal ? -1 : aVal > bVal ? 1 : 0;
               return sortOrder === "asc" ? -cmp : cmp;
             });
@@ -11222,9 +11256,9 @@ var QueryManager = class {
             }
           }
           const finalDocs = heap ? heap.toArray() : results;
-          finalDocs.sort((a, b) => {
+          finalDocs.sort((a, b2) => {
             const aVal = a[orderByField] ?? a._id;
-            const bVal = b[orderByField] ?? b._id;
+            const bVal = b2[orderByField] ?? b2._id;
             const cmp = aVal < bVal ? -1 : aVal > bVal ? 1 : 0;
             return sortOrder === "asc" ? cmp : -cmp;
           });
@@ -11562,8 +11596,8 @@ var IndexManager = class {
       const stream = idTree.whereStream({
         primaryGte: { v: 0 }
       });
-      for await (const [k, complexValue] of stream) {
-        const doc = await this.api.getDocument(k, tx2);
+      for await (const [k2, complexValue] of stream) {
+        const doc = await this.api.getDocument(k2, tx2);
         if (!doc) continue;
         const flatDoc = this.api.flattenDocument(doc);
         for (let i = 0, len = backfillTargets.length; i < len; i++) {
@@ -11574,23 +11608,23 @@ var IndexManager = class {
           const btx = indexTxMap[indexName];
           if (config.type === "fts") {
             const primaryField = this.getPrimaryField(config);
-            const v = flatDoc[primaryField];
-            if (v === void 0 || typeof v !== "string") continue;
+            const v2 = flatDoc[primaryField];
+            if (v2 === void 0 || typeof v2 !== "string") continue;
             const ftsConfig = this.getFtsConfig(config);
-            const tokens = ftsConfig ? tokenize(v, ftsConfig) : [v];
+            const tokens = ftsConfig ? tokenize(v2, ftsConfig) : [v2];
             const batchInsertData = [];
             for (let i2 = 0, len2 = tokens.length; i2 < len2; i2++) {
               const token = tokens[i2];
-              const keyToInsert = this.getTokenKey(k, token);
-              const entry = { k, v: token };
+              const keyToInsert = this.getTokenKey(k2, token);
+              const entry = { k: k2, v: token };
               batchInsertData.push([keyToInsert, entry]);
             }
             await btx.batchInsert(batchInsertData);
           } else {
             const indexVal = this.getIndexValue(config, flatDoc);
             if (indexVal === void 0) continue;
-            const entry = { k, v: indexVal };
-            const batchInsertData = [[k, entry]];
+            const entry = { k: k2, v: indexVal };
+            const batchInsertData = [[k2, entry]];
             await btx.batchInsert(batchInsertData);
           }
         }
@@ -11706,14 +11740,14 @@ var IndexManager = class {
   getIndexValue(config, flatDoc) {
     if (config.type !== "btree") return void 0;
     if (config.fields.length === 1) {
-      const v = flatDoc[config.fields[0]];
-      return v === void 0 ? void 0 : v;
+      const v2 = flatDoc[config.fields[0]];
+      return v2 === void 0 ? void 0 : v2;
     }
     const values = [];
     for (let i = 0, len = config.fields.length; i < len; i++) {
-      const v = flatDoc[config.fields[i]];
-      if (v === void 0) return void 0;
-      values.push(v);
+      const v2 = flatDoc[config.fields[i]];
+      if (v2 === void 0) return void 0;
+      values.push(v2);
     }
     return values;
   }
@@ -11737,6 +11771,64 @@ async function catchPromise(promise) {
   return promise.then((res) => [void 0, res]).catch((reason) => [reason]);
 }
 
+// src/utils/DeadlineChunker.ts
+var DeadlineChunker = class {
+  /**
+   * 이벤트 루프를 막을 최대 허용 시간
+   */
+  targetMs;
+  /**
+   * 현재 chunk size
+   */
+  chunkSize;
+  /**
+   * Exponential Weighted Moving Average
+   */
+  ewmaMs;
+  /**
+   * EWMA 평활화 계수
+   */
+  alpha;
+  constructor(targetMs = 14) {
+    this.targetMs = targetMs;
+    this.chunkSize = 50;
+    this.ewmaMs = null;
+    this.alpha = 0.3;
+  }
+  /**
+   * EWMA 평활화 계수를 사용하여 평균 처리 시간을 업데이트합니다.
+   */
+  _updateEstimate(elapsed, count) {
+    const msPerItem = elapsed / count;
+    this.ewmaMs = this.ewmaMs === null ? msPerItem : this.alpha * msPerItem + (1 - this.alpha) * this.ewmaMs;
+  }
+  /**
+   * 현재 chunk size를 업데이트합니다.
+   */
+  _nextChunkSize() {
+    if (!this.ewmaMs || this.ewmaMs === 0) return this.chunkSize;
+    const next = Math.floor(this.targetMs / this.ewmaMs);
+    return Math.max(1, Math.min(next, 5e3));
+  }
+  /**
+   * 주어진 items를 chunk로 분할하여 처리합니다.
+   */
+  async processInChunks(items, processFn) {
+    let i = 0;
+    let len = items.length;
+    while (i < len) {
+      const chunk = items.slice(i, i + this.chunkSize);
+      const start = performance.now();
+      await processFn(chunk);
+      const elapsed = performance.now() - start;
+      this._updateEstimate(elapsed, chunk.length);
+      this.chunkSize = this._nextChunkSize();
+      i += chunk.length;
+      await new Promise((resolve) => setImmediate(resolve));
+    }
+  }
+};
+
 // src/core/MutationManager.ts
 var MutationManager = class {
   constructor(api) {
@@ -11765,10 +11857,10 @@ var MutationManager = class {
         if (!tree) continue;
         if (config.type === "fts") {
           const primaryField = this.api.indexManager.getPrimaryField(config);
-          const v = flattenDocument[primaryField];
-          if (v === void 0 || typeof v !== "string") continue;
+          const v2 = flattenDocument[primaryField];
+          if (v2 === void 0 || typeof v2 !== "string") continue;
           const ftsConfig = this.api.indexManager.getFtsConfig(config);
-          const tokens = ftsConfig ? tokenize(v, ftsConfig) : [v];
+          const tokens = ftsConfig ? tokenize(v2, ftsConfig) : [v2];
           for (let i = 0, len = tokens.length; i < len; i++) {
             const token = tokens[i];
             const keyToInsert = this.api.indexManager.getTokenKey(dpk, token);
@@ -11820,9 +11912,9 @@ var MutationManager = class {
           const ftsConfig = this.api.indexManager.getFtsConfig(config);
           for (let i = 0, len = flattenedData.length; i < len; i++) {
             const item = flattenedData[i];
-            const v = item.data[primaryField];
-            if (v === void 0 || typeof v !== "string") continue;
-            const tokens = ftsConfig ? tokenize(v, ftsConfig) : [v];
+            const v2 = item.data[primaryField];
+            if (v2 === void 0 || typeof v2 !== "string") continue;
+            const tokens = ftsConfig ? tokenize(v2, ftsConfig) : [v2];
             for (let j = 0, tLen = tokens.length; j < tLen; j++) {
               const token = tokens[j];
               batchInsertData.push([this.api.indexManager.getTokenKey(item.pk, token), { k: item.pk, v: token }]);
@@ -11836,10 +11928,13 @@ var MutationManager = class {
             batchInsertData.push([item.pk, { k: item.pk, v: indexVal }]);
           }
         }
-        const [error] = await catchPromise(treeTx.batchInsert(batchInsertData));
-        if (error) {
-          throw error;
-        }
+        const chunker = new DeadlineChunker();
+        await chunker.processInChunks(batchInsertData, async (chunk) => {
+          const [error] = await catchPromise(treeTx.batchInsert(chunk));
+          if (error) {
+            throw error;
+          }
+        });
         const res = await treeTx.commit();
         if (!res.success) {
           throw res.error;
@@ -11953,10 +12048,10 @@ var MutationManager = class {
           if (!config) continue;
           if (config.type === "fts") {
             const primaryField = this.api.indexManager.getPrimaryField(config);
-            const v = flatDoc[primaryField];
-            if (v === void 0 || typeof v !== "string") continue;
+            const v2 = flatDoc[primaryField];
+            if (v2 === void 0 || typeof v2 !== "string") continue;
             const ftsConfig = this.api.indexManager.getFtsConfig(config);
-            const tokens = ftsConfig ? tokenize(v, ftsConfig) : [v];
+            const tokens = ftsConfig ? tokenize(v2, ftsConfig) : [v2];
             for (let j = 0, jLen = tokens.length; j < jLen; j++) {
               await tree.delete(this.api.indexManager.getTokenKey(pk, tokens[j]), { k: pk, v: tokens[j] });
             }
@@ -12042,6 +12137,657 @@ var DocumentFormatter = class {
   }
 };
 
+// node_modules/croner/dist/croner.js
+function T(s2) {
+  return Date.UTC(s2.y, s2.m - 1, s2.d, s2.h, s2.i, s2.s);
+}
+function D(s2, e) {
+  return s2.y === e.y && s2.m === e.m && s2.d === e.d && s2.h === e.h && s2.i === e.i && s2.s === e.s;
+}
+function A(s2, e) {
+  let t = new Date(Date.parse(s2));
+  if (isNaN(t)) throw new Error("Invalid ISO8601 passed to timezone parser.");
+  let r = s2.substring(9);
+  return r.includes("Z") || r.includes("+") || r.includes("-") ? b(t.getUTCFullYear(), t.getUTCMonth() + 1, t.getUTCDate(), t.getUTCHours(), t.getUTCMinutes(), t.getUTCSeconds(), "Etc/UTC") : b(t.getFullYear(), t.getMonth() + 1, t.getDate(), t.getHours(), t.getMinutes(), t.getSeconds(), e);
+}
+function v(s2, e, t) {
+  return k(A(s2, e), t);
+}
+function k(s2, e) {
+  let t = new Date(T(s2)), r = g(t, s2.tz), n = T(s2), i = T(r), a = n - i, o = new Date(t.getTime() + a), h = g(o, s2.tz);
+  if (D(h, s2)) {
+    let u = new Date(o.getTime() - 36e5), d = g(u, s2.tz);
+    return D(d, s2) ? u : o;
+  }
+  let l = new Date(o.getTime() + T(s2) - T(h)), y = g(l, s2.tz);
+  if (D(y, s2)) return l;
+  if (e) throw new Error("Invalid date passed to fromTZ()");
+  return o.getTime() > l.getTime() ? o : l;
+}
+function g(s2, e) {
+  let t, r;
+  try {
+    t = new Intl.DateTimeFormat("en-US", { timeZone: e, year: "numeric", month: "numeric", day: "numeric", hour: "numeric", minute: "numeric", second: "numeric", hour12: false }), r = t.formatToParts(s2);
+  } catch (i) {
+    let a = i instanceof Error ? i.message : String(i);
+    throw new RangeError(`toTZ: Invalid timezone '${e}' or date. Please provide a valid IANA timezone (e.g., 'America/New_York', 'Europe/Stockholm'). Original error: ${a}`);
+  }
+  let n = { year: 0, month: 0, day: 0, hour: 0, minute: 0, second: 0 };
+  for (let i of r) (i.type === "year" || i.type === "month" || i.type === "day" || i.type === "hour" || i.type === "minute" || i.type === "second") && (n[i.type] = parseInt(i.value, 10));
+  if (isNaN(n.year) || isNaN(n.month) || isNaN(n.day) || isNaN(n.hour) || isNaN(n.minute) || isNaN(n.second)) throw new Error(`toTZ: Failed to parse all date components from timezone '${e}'. This may indicate an invalid date or timezone configuration. Parsed components: ${JSON.stringify(n)}`);
+  return n.hour === 24 && (n.hour = 0), { y: n.year, m: n.month, d: n.day, h: n.hour, i: n.minute, s: n.second, tz: e };
+}
+function b(s2, e, t, r, n, i, a) {
+  return { y: s2, m: e, d: t, h: r, i: n, s: i, tz: a };
+}
+var O = [1, 2, 4, 8, 16];
+var C = class {
+  pattern;
+  timezone;
+  mode;
+  alternativeWeekdays;
+  sloppyRanges;
+  second;
+  minute;
+  hour;
+  day;
+  month;
+  dayOfWeek;
+  year;
+  lastDayOfMonth;
+  lastWeekday;
+  nearestWeekdays;
+  starDOM;
+  starDOW;
+  starYear;
+  useAndLogic;
+  constructor(e, t, r) {
+    this.pattern = e, this.timezone = t, this.mode = r?.mode ?? "auto", this.alternativeWeekdays = r?.alternativeWeekdays ?? false, this.sloppyRanges = r?.sloppyRanges ?? false, this.second = Array(60).fill(0), this.minute = Array(60).fill(0), this.hour = Array(24).fill(0), this.day = Array(31).fill(0), this.month = Array(12).fill(0), this.dayOfWeek = Array(7).fill(0), this.year = Array(1e4).fill(0), this.lastDayOfMonth = false, this.lastWeekday = false, this.nearestWeekdays = Array(31).fill(0), this.starDOM = false, this.starDOW = false, this.starYear = false, this.useAndLogic = false, this.parse();
+  }
+  parse() {
+    if (!(typeof this.pattern == "string" || this.pattern instanceof String)) throw new TypeError("CronPattern: Pattern has to be of type string.");
+    this.pattern.indexOf("@") >= 0 && (this.pattern = this.handleNicknames(this.pattern).trim());
+    let e = this.pattern.match(/\S+/g) || [""], t = e.length;
+    if (e.length < 5 || e.length > 7) throw new TypeError("CronPattern: invalid configuration format ('" + this.pattern + "'), exactly five, six, or seven space separated parts are required.");
+    if (this.mode !== "auto") {
+      let n;
+      switch (this.mode) {
+        case "5-part":
+          n = 5;
+          break;
+        case "6-part":
+          n = 6;
+          break;
+        case "7-part":
+          n = 7;
+          break;
+        case "5-or-6-parts":
+          n = [5, 6];
+          break;
+        case "6-or-7-parts":
+          n = [6, 7];
+          break;
+        default:
+          n = 0;
+      }
+      if (!(Array.isArray(n) ? n.includes(t) : t === n)) {
+        let a = Array.isArray(n) ? n.join(" or ") : n.toString();
+        throw new TypeError(`CronPattern: mode '${this.mode}' requires exactly ${a} parts, but pattern '${this.pattern}' has ${t} parts.`);
+      }
+    }
+    if (e.length === 5 && e.unshift("0"), e.length === 6 && e.push("*"), e[3].toUpperCase() === "LW" ? (this.lastWeekday = true, e[3] = "") : e[3].toUpperCase().indexOf("L") >= 0 && (e[3] = e[3].replace(/L/gi, ""), this.lastDayOfMonth = true), e[3] == "*" && (this.starDOM = true), e[6] == "*" && (this.starYear = true), e[4].length >= 3 && (e[4] = this.replaceAlphaMonths(e[4])), e[5].length >= 3 && (e[5] = this.alternativeWeekdays ? this.replaceAlphaDaysQuartz(e[5]) : this.replaceAlphaDays(e[5])), e[5].startsWith("+") && (this.useAndLogic = true, e[5] = e[5].substring(1), e[5] === "")) throw new TypeError("CronPattern: Day-of-week field cannot be empty after '+' modifier.");
+    switch (e[5] == "*" && (this.starDOW = true), this.pattern.indexOf("?") >= 0 && (e[0] = e[0].replace(/\?/g, "*"), e[1] = e[1].replace(/\?/g, "*"), e[2] = e[2].replace(/\?/g, "*"), e[3] = e[3].replace(/\?/g, "*"), e[4] = e[4].replace(/\?/g, "*"), e[5] = e[5].replace(/\?/g, "*"), e[6] && (e[6] = e[6].replace(/\?/g, "*"))), this.mode) {
+      case "5-part":
+        e[0] = "0", e[6] = "*";
+        break;
+      case "6-part":
+        e[6] = "*";
+        break;
+      case "5-or-6-parts":
+        e[6] = "*";
+        break;
+      case "6-or-7-parts":
+        break;
+      case "7-part":
+      case "auto":
+        break;
+    }
+    this.throwAtIllegalCharacters(e), this.partToArray("second", e[0], 0, 1), this.partToArray("minute", e[1], 0, 1), this.partToArray("hour", e[2], 0, 1), this.partToArray("day", e[3], -1, 1), this.partToArray("month", e[4], -1, 1);
+    let r = this.alternativeWeekdays ? -1 : 0;
+    this.partToArray("dayOfWeek", e[5], r, 63), this.partToArray("year", e[6], 0, 1), !this.alternativeWeekdays && this.dayOfWeek[7] && (this.dayOfWeek[0] = this.dayOfWeek[7]);
+  }
+  partToArray(e, t, r, n) {
+    let i = this[e], a = e === "day" && this.lastDayOfMonth, o = e === "day" && this.lastWeekday;
+    if (t === "" && !a && !o) throw new TypeError("CronPattern: configuration entry " + e + " (" + t + ") is empty, check for trailing spaces.");
+    if (t === "*") return i.fill(n);
+    let h = t.split(",");
+    if (h.length > 1) for (let l = 0; l < h.length; l++) this.partToArray(e, h[l], r, n);
+    else t.indexOf("-") !== -1 && t.indexOf("/") !== -1 ? this.handleRangeWithStepping(t, e, r, n) : t.indexOf("-") !== -1 ? this.handleRange(t, e, r, n) : t.indexOf("/") !== -1 ? this.handleStepping(t, e, r, n) : t !== "" && this.handleNumber(t, e, r, n);
+  }
+  throwAtIllegalCharacters(e) {
+    for (let t = 0; t < e.length; t++) if ((t === 3 ? /[^/*0-9,\-WwLl]+/ : t === 5 ? /[^/*0-9,\-#Ll]+/ : /[^/*0-9,\-]+/).test(e[t])) throw new TypeError("CronPattern: configuration entry " + t + " (" + e[t] + ") contains illegal characters.");
+  }
+  handleNumber(e, t, r, n) {
+    let i = this.extractNth(e, t), a = e.toUpperCase().includes("W");
+    if (t !== "day" && a) throw new TypeError("CronPattern: Nearest weekday modifier (W) only allowed in day-of-month.");
+    a && (t = "nearestWeekdays");
+    let o = parseInt(i[0], 10) + r;
+    if (isNaN(o)) throw new TypeError("CronPattern: " + t + " is not a number: '" + e + "'");
+    this.setPart(t, o, i[1] || n);
+  }
+  setPart(e, t, r) {
+    if (!Object.prototype.hasOwnProperty.call(this, e)) throw new TypeError("CronPattern: Invalid part specified: " + e);
+    if (e === "dayOfWeek") {
+      if (t === 7 && (t = 0), t < 0 || t > 6) throw new RangeError("CronPattern: Invalid value for dayOfWeek: " + t);
+      this.setNthWeekdayOfMonth(t, r);
+      return;
+    }
+    if (e === "second" || e === "minute") {
+      if (t < 0 || t >= 60) throw new RangeError("CronPattern: Invalid value for " + e + ": " + t);
+    } else if (e === "hour") {
+      if (t < 0 || t >= 24) throw new RangeError("CronPattern: Invalid value for " + e + ": " + t);
+    } else if (e === "day" || e === "nearestWeekdays") {
+      if (t < 0 || t >= 31) throw new RangeError("CronPattern: Invalid value for " + e + ": " + t);
+    } else if (e === "month") {
+      if (t < 0 || t >= 12) throw new RangeError("CronPattern: Invalid value for " + e + ": " + t);
+    } else if (e === "year" && (t < 1 || t >= 1e4)) throw new RangeError("CronPattern: Invalid value for " + e + ": " + t + " (supported range: 1-9999)");
+    this[e][t] = r;
+  }
+  validateNotNaN(e, t) {
+    if (isNaN(e)) throw new TypeError(t);
+  }
+  validateRange(e, t, r, n, i) {
+    if (e > t) throw new TypeError("CronPattern: From value is larger than to value: '" + i + "'");
+    if (r !== void 0) {
+      if (r === 0) throw new TypeError("CronPattern: Syntax error, illegal stepping: 0");
+      if (r > this[n].length) throw new TypeError("CronPattern: Syntax error, steps cannot be greater than maximum value of part (" + this[n].length + ")");
+    }
+  }
+  handleRangeWithStepping(e, t, r, n) {
+    if (e.toUpperCase().includes("W")) throw new TypeError("CronPattern: Syntax error, W is not allowed in ranges with stepping.");
+    let i = this.extractNth(e, t), a = i[0].match(/^(\d+)-(\d+)\/(\d+)$/);
+    if (a === null) throw new TypeError("CronPattern: Syntax error, illegal range with stepping: '" + e + "'");
+    let [, o, h, l] = a, y = parseInt(o, 10) + r, u = parseInt(h, 10) + r, d = parseInt(l, 10);
+    this.validateNotNaN(y, "CronPattern: Syntax error, illegal lower range (NaN)"), this.validateNotNaN(u, "CronPattern: Syntax error, illegal upper range (NaN)"), this.validateNotNaN(d, "CronPattern: Syntax error, illegal stepping: (NaN)"), this.validateRange(y, u, d, t, e);
+    for (let c = y; c <= u; c += d) this.setPart(t, c, i[1] || n);
+  }
+  extractNth(e, t) {
+    let r = e, n;
+    if (r.includes("#")) {
+      if (t !== "dayOfWeek") throw new Error("CronPattern: nth (#) only allowed in day-of-week field");
+      n = r.split("#")[1], r = r.split("#")[0];
+    } else if (r.toUpperCase().endsWith("L")) {
+      if (t !== "dayOfWeek") throw new Error("CronPattern: L modifier only allowed in day-of-week field (use L alone for day-of-month)");
+      n = "L", r = r.slice(0, -1);
+    }
+    return [r, n];
+  }
+  handleRange(e, t, r, n) {
+    if (e.toUpperCase().includes("W")) throw new TypeError("CronPattern: Syntax error, W is not allowed in a range.");
+    let i = this.extractNth(e, t), a = i[0].split("-");
+    if (a.length !== 2) throw new TypeError("CronPattern: Syntax error, illegal range: '" + e + "'");
+    let o = parseInt(a[0], 10) + r, h = parseInt(a[1], 10) + r;
+    this.validateNotNaN(o, "CronPattern: Syntax error, illegal lower range (NaN)"), this.validateNotNaN(h, "CronPattern: Syntax error, illegal upper range (NaN)"), this.validateRange(o, h, void 0, t, e);
+    for (let l = o; l <= h; l++) this.setPart(t, l, i[1] || n);
+  }
+  handleStepping(e, t, r, n) {
+    if (e.toUpperCase().includes("W")) throw new TypeError("CronPattern: Syntax error, W is not allowed in parts with stepping.");
+    let i = this.extractNth(e, t), a = i[0].split("/");
+    if (a.length !== 2) throw new TypeError("CronPattern: Syntax error, illegal stepping: '" + e + "'");
+    if (this.sloppyRanges) a[0] === "" && (a[0] = "*");
+    else {
+      if (a[0] === "") throw new TypeError("CronPattern: Syntax error, stepping with missing prefix ('" + e + "') is not allowed. Use wildcard (*/step) or range (min-max/step) instead.");
+      if (a[0] !== "*") throw new TypeError("CronPattern: Syntax error, stepping with numeric prefix ('" + e + "') is not allowed. Use wildcard (*/step) or range (min-max/step) instead.");
+    }
+    let o = 0;
+    a[0] !== "*" && (o = parseInt(a[0], 10) + r);
+    let h = parseInt(a[1], 10);
+    this.validateNotNaN(h, "CronPattern: Syntax error, illegal stepping: (NaN)"), this.validateRange(0, this[t].length - 1, h, t, e);
+    for (let l = o; l < this[t].length; l += h) this.setPart(t, l, i[1] || n);
+  }
+  replaceAlphaDays(e) {
+    return e.replace(/-sun/gi, "-7").replace(/sun/gi, "0").replace(/mon/gi, "1").replace(/tue/gi, "2").replace(/wed/gi, "3").replace(/thu/gi, "4").replace(/fri/gi, "5").replace(/sat/gi, "6");
+  }
+  replaceAlphaDaysQuartz(e) {
+    return e.replace(/sun/gi, "1").replace(/mon/gi, "2").replace(/tue/gi, "3").replace(/wed/gi, "4").replace(/thu/gi, "5").replace(/fri/gi, "6").replace(/sat/gi, "7");
+  }
+  replaceAlphaMonths(e) {
+    return e.replace(/jan/gi, "1").replace(/feb/gi, "2").replace(/mar/gi, "3").replace(/apr/gi, "4").replace(/may/gi, "5").replace(/jun/gi, "6").replace(/jul/gi, "7").replace(/aug/gi, "8").replace(/sep/gi, "9").replace(/oct/gi, "10").replace(/nov/gi, "11").replace(/dec/gi, "12");
+  }
+  handleNicknames(e) {
+    let t = e.trim().toLowerCase();
+    if (t === "@yearly" || t === "@annually") return "0 0 1 1 *";
+    if (t === "@monthly") return "0 0 1 * *";
+    if (t === "@weekly") return "0 0 * * 0";
+    if (t === "@daily" || t === "@midnight") return "0 0 * * *";
+    if (t === "@hourly") return "0 * * * *";
+    if (t === "@reboot") throw new TypeError("CronPattern: @reboot is not supported in this environment. This is an event-based trigger that requires system startup detection.");
+    return e;
+  }
+  setNthWeekdayOfMonth(e, t) {
+    if (typeof t != "number" && t.toUpperCase() === "L") this.dayOfWeek[e] = this.dayOfWeek[e] | 32;
+    else if (t === 63) this.dayOfWeek[e] = 63;
+    else if (t < 6 && t > 0) this.dayOfWeek[e] = this.dayOfWeek[e] | O[t - 1];
+    else throw new TypeError(`CronPattern: nth weekday out of range, should be 1-5 or L. Value: ${t}, Type: ${typeof t}`);
+  }
+};
+var P = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
+var f = [["month", "year", 0], ["day", "month", -1], ["hour", "day", 0], ["minute", "hour", 0], ["second", "minute", 0]];
+var m = class s {
+  tz;
+  ms;
+  second;
+  minute;
+  hour;
+  day;
+  month;
+  year;
+  constructor(e, t) {
+    if (this.tz = t, e && e instanceof Date) if (!isNaN(e)) this.fromDate(e);
+    else throw new TypeError("CronDate: Invalid date passed to CronDate constructor");
+    else if (e == null) this.fromDate(/* @__PURE__ */ new Date());
+    else if (e && typeof e == "string") this.fromString(e);
+    else if (e instanceof s) this.fromCronDate(e);
+    else throw new TypeError("CronDate: Invalid type (" + typeof e + ") passed to CronDate constructor");
+  }
+  getLastDayOfMonth(e, t) {
+    return t !== 1 ? P[t] : new Date(Date.UTC(e, t + 1, 0)).getUTCDate();
+  }
+  getLastWeekday(e, t) {
+    let r = this.getLastDayOfMonth(e, t), i = new Date(Date.UTC(e, t, r)).getUTCDay();
+    return i === 0 ? r - 2 : i === 6 ? r - 1 : r;
+  }
+  getNearestWeekday(e, t, r) {
+    let n = this.getLastDayOfMonth(e, t);
+    if (r > n) return -1;
+    let a = new Date(Date.UTC(e, t, r)).getUTCDay();
+    return a === 0 ? r === n ? r - 2 : r + 1 : a === 6 ? r === 1 ? r + 2 : r - 1 : r;
+  }
+  isNthWeekdayOfMonth(e, t, r, n) {
+    let a = new Date(Date.UTC(e, t, r)).getUTCDay(), o = 0;
+    for (let h = 1; h <= r; h++) new Date(Date.UTC(e, t, h)).getUTCDay() === a && o++;
+    if (n & 63 && O[o - 1] & n) return true;
+    if (n & 32) {
+      let h = this.getLastDayOfMonth(e, t);
+      for (let l = r + 1; l <= h; l++) if (new Date(Date.UTC(e, t, l)).getUTCDay() === a) return false;
+      return true;
+    }
+    return false;
+  }
+  fromDate(e) {
+    if (this.tz !== void 0) if (typeof this.tz == "number") this.ms = e.getUTCMilliseconds(), this.second = e.getUTCSeconds(), this.minute = e.getUTCMinutes() + this.tz, this.hour = e.getUTCHours(), this.day = e.getUTCDate(), this.month = e.getUTCMonth(), this.year = e.getUTCFullYear(), this.apply();
+    else try {
+      let t = g(e, this.tz);
+      this.ms = e.getMilliseconds(), this.second = t.s, this.minute = t.i, this.hour = t.h, this.day = t.d, this.month = t.m - 1, this.year = t.y;
+    } catch (t) {
+      let r = t instanceof Error ? t.message : String(t);
+      throw new TypeError(`CronDate: Failed to convert date to timezone '${this.tz}'. This may happen with invalid timezone names or dates. Original error: ${r}`);
+    }
+    else this.ms = e.getMilliseconds(), this.second = e.getSeconds(), this.minute = e.getMinutes(), this.hour = e.getHours(), this.day = e.getDate(), this.month = e.getMonth(), this.year = e.getFullYear();
+  }
+  fromCronDate(e) {
+    this.tz = e.tz, this.year = e.year, this.month = e.month, this.day = e.day, this.hour = e.hour, this.minute = e.minute, this.second = e.second, this.ms = e.ms;
+  }
+  apply() {
+    if (this.month > 11 || this.month < 0 || this.day > P[this.month] || this.day < 1 || this.hour > 59 || this.minute > 59 || this.second > 59 || this.hour < 0 || this.minute < 0 || this.second < 0) {
+      let e = new Date(Date.UTC(this.year, this.month, this.day, this.hour, this.minute, this.second, this.ms));
+      return this.ms = e.getUTCMilliseconds(), this.second = e.getUTCSeconds(), this.minute = e.getUTCMinutes(), this.hour = e.getUTCHours(), this.day = e.getUTCDate(), this.month = e.getUTCMonth(), this.year = e.getUTCFullYear(), true;
+    } else return false;
+  }
+  fromString(e) {
+    if (typeof this.tz == "number") {
+      let t = v(e);
+      this.ms = t.getUTCMilliseconds(), this.second = t.getUTCSeconds(), this.minute = t.getUTCMinutes(), this.hour = t.getUTCHours(), this.day = t.getUTCDate(), this.month = t.getUTCMonth(), this.year = t.getUTCFullYear(), this.apply();
+    } else return this.fromDate(v(e, this.tz));
+  }
+  findNext(e, t, r, n) {
+    return this._findMatch(e, t, r, n, 1);
+  }
+  _findMatch(e, t, r, n, i) {
+    let a = this[t], o;
+    r.lastDayOfMonth && (o = this.getLastDayOfMonth(this.year, this.month));
+    let h = !r.starDOW && t == "day" ? new Date(Date.UTC(this.year, this.month, 1, 0, 0, 0, 0)).getUTCDay() : void 0, l = this[t] + n, y = i === 1 ? (u) => u < r[t].length : (u) => u >= 0;
+    for (let u = l; y(u); u += i) {
+      let d = r[t][u];
+      if (t === "day" && !d) {
+        for (let c = 0; c < r.nearestWeekdays.length; c++) if (r.nearestWeekdays[c]) {
+          let M = this.getNearestWeekday(this.year, this.month, c - n);
+          if (M === -1) continue;
+          if (M === u - n) {
+            d = 1;
+            break;
+          }
+        }
+      }
+      if (t === "day" && r.lastWeekday) {
+        let c = this.getLastWeekday(this.year, this.month);
+        u - n === c && (d = 1);
+      }
+      if (t === "day" && r.lastDayOfMonth && u - n == o && (d = 1), t === "day" && !r.starDOW) {
+        let c = r.dayOfWeek[(h + (u - n - 1)) % 7];
+        if (c && c & 63) c = this.isNthWeekdayOfMonth(this.year, this.month, u - n, c) ? 1 : 0;
+        else if (c) throw new Error(`CronDate: Invalid value for dayOfWeek encountered. ${c}`);
+        r.useAndLogic ? d = d && c : !e.domAndDow && !r.starDOM ? d = d || c : d = d && c;
+      }
+      if (d) return this[t] = u - n, a !== this[t] ? 2 : 1;
+    }
+    return 3;
+  }
+  recurse(e, t, r) {
+    if (r === 0 && !e.starYear) {
+      if (this.year >= 0 && this.year < e.year.length && e.year[this.year] === 0) {
+        let i = -1;
+        for (let a = this.year + 1; a < e.year.length && a < 1e4; a++) if (e.year[a] === 1) {
+          i = a;
+          break;
+        }
+        if (i === -1) return null;
+        this.year = i, this.month = 0, this.day = 1, this.hour = 0, this.minute = 0, this.second = 0, this.ms = 0;
+      }
+      if (this.year >= 1e4) return null;
+    }
+    let n = this.findNext(t, f[r][0], e, f[r][2]);
+    if (n > 1) {
+      let i = r + 1;
+      for (; i < f.length; ) this[f[i][0]] = -f[i][2], i++;
+      if (n === 3) {
+        if (this[f[r][1]]++, this[f[r][0]] = -f[r][2], this.apply(), r === 0 && !e.starYear) {
+          for (; this.year >= 0 && this.year < e.year.length && e.year[this.year] === 0 && this.year < 1e4; ) this.year++;
+          if (this.year >= 1e4 || this.year >= e.year.length) return null;
+        }
+        return this.recurse(e, t, 0);
+      } else if (this.apply()) return this.recurse(e, t, r - 1);
+    }
+    return r += 1, r >= f.length ? this : (e.starYear ? this.year >= 3e3 : this.year >= 1e4) ? null : this.recurse(e, t, r);
+  }
+  increment(e, t, r) {
+    return this.second += t.interval !== void 0 && t.interval > 1 && r ? t.interval : 1, this.ms = 0, this.apply(), this.recurse(e, t, 0);
+  }
+  decrement(e, t) {
+    return this.second -= t.interval !== void 0 && t.interval > 1 ? t.interval : 1, this.ms = 0, this.apply(), this.recurseBackward(e, t, 0, 0);
+  }
+  recurseBackward(e, t, r, n = 0) {
+    if (n > 1e4) return null;
+    if (r === 0 && !e.starYear) {
+      if (this.year >= 0 && this.year < e.year.length && e.year[this.year] === 0) {
+        let a = -1;
+        for (let o = this.year - 1; o >= 0; o--) if (e.year[o] === 1) {
+          a = o;
+          break;
+        }
+        if (a === -1) return null;
+        this.year = a, this.month = 11, this.day = 31, this.hour = 23, this.minute = 59, this.second = 59, this.ms = 0;
+      }
+      if (this.year < 0) return null;
+    }
+    let i = this.findPrevious(t, f[r][0], e, f[r][2]);
+    if (i > 1) {
+      let a = r + 1;
+      for (; a < f.length; ) {
+        let o = f[a][0], h = f[a][2], l = this.getMaxPatternValue(o, e, h);
+        this[o] = l, a++;
+      }
+      if (i === 3) {
+        if (this[f[r][1]]--, r === 0) {
+          let y = this.getLastDayOfMonth(this.year, this.month);
+          this.day > y && (this.day = y);
+        }
+        if (r === 1) if (this.day <= 0) this.day = 1;
+        else {
+          let y = this.year, u = this.month;
+          for (; u < 0; ) u += 12, y--;
+          for (; u > 11; ) u -= 12, y++;
+          let d = u !== 1 ? P[u] : new Date(Date.UTC(y, u + 1, 0)).getUTCDate();
+          this.day > d && (this.day = d);
+        }
+        this.apply();
+        let o = f[r][0], h = f[r][2], l = this.getMaxPatternValue(o, e, h);
+        if (o === "day") {
+          let y = this.getLastDayOfMonth(this.year, this.month);
+          this[o] = Math.min(l, y);
+        } else this[o] = l;
+        if (this.apply(), r === 0) {
+          let y = f[1][2], u = this.getMaxPatternValue("day", e, y), d = this.getLastDayOfMonth(this.year, this.month), c = Math.min(u, d);
+          c !== this.day && (this.day = c, this.hour = this.getMaxPatternValue("hour", e, f[2][2]), this.minute = this.getMaxPatternValue("minute", e, f[3][2]), this.second = this.getMaxPatternValue("second", e, f[4][2]));
+        }
+        if (r === 0 && !e.starYear) {
+          for (; this.year >= 0 && this.year < e.year.length && e.year[this.year] === 0; ) this.year--;
+          if (this.year < 0) return null;
+        }
+        return this.recurseBackward(e, t, 0, n + 1);
+      } else if (this.apply()) return this.recurseBackward(e, t, r - 1, n + 1);
+    }
+    return r += 1, r >= f.length ? this : this.year < 0 ? null : this.recurseBackward(e, t, r, n + 1);
+  }
+  getMaxPatternValue(e, t, r) {
+    if (e === "day" && t.lastDayOfMonth) return this.getLastDayOfMonth(this.year, this.month);
+    if (e === "day" && !t.starDOW) return this.getLastDayOfMonth(this.year, this.month);
+    for (let n = t[e].length - 1; n >= 0; n--) if (t[e][n]) return n - r;
+    return t[e].length - 1 - r;
+  }
+  findPrevious(e, t, r, n) {
+    return this._findMatch(e, t, r, n, -1);
+  }
+  getDate(e) {
+    return e || this.tz === void 0 ? new Date(this.year, this.month, this.day, this.hour, this.minute, this.second, this.ms) : typeof this.tz == "number" ? new Date(Date.UTC(this.year, this.month, this.day, this.hour, this.minute - this.tz, this.second, this.ms)) : k(b(this.year, this.month + 1, this.day, this.hour, this.minute, this.second, this.tz), false);
+  }
+  getTime() {
+    return this.getDate(false).getTime();
+  }
+  match(e, t) {
+    if (!e.starYear && (this.year < 0 || this.year >= e.year.length || e.year[this.year] === 0)) return false;
+    for (let r = 0; r < f.length; r++) {
+      let n = f[r][0], i = f[r][2], a = this[n];
+      if (a + i < 0 || a + i >= e[n].length) return false;
+      let o = e[n][a + i];
+      if (n === "day") {
+        if (!o) {
+          for (let h = 0; h < e.nearestWeekdays.length; h++) if (e.nearestWeekdays[h]) {
+            let l = this.getNearestWeekday(this.year, this.month, h - i);
+            if (l !== -1 && l === a) {
+              o = 1;
+              break;
+            }
+          }
+        }
+        if (e.lastWeekday) {
+          let h = this.getLastWeekday(this.year, this.month);
+          a === h && (o = 1);
+        }
+        if (e.lastDayOfMonth) {
+          let h = this.getLastDayOfMonth(this.year, this.month);
+          a === h && (o = 1);
+        }
+        if (!e.starDOW) {
+          let h = new Date(Date.UTC(this.year, this.month, 1, 0, 0, 0, 0)).getUTCDay(), l = e.dayOfWeek[(h + (a - 1)) % 7];
+          l && l & 63 && (l = this.isNthWeekdayOfMonth(this.year, this.month, a, l) ? 1 : 0), e.useAndLogic ? o = o && l : !t.domAndDow && !e.starDOM ? o = o || l : o = o && l;
+        }
+      }
+      if (!o) return false;
+    }
+    return true;
+  }
+};
+function R(s2) {
+  if (s2 === void 0 && (s2 = {}), delete s2.name, s2.legacyMode !== void 0 && s2.domAndDow === void 0 ? s2.domAndDow = !s2.legacyMode : s2.domAndDow === void 0 && (s2.domAndDow = false), s2.legacyMode = !s2.domAndDow, s2.paused = s2.paused === void 0 ? false : s2.paused, s2.maxRuns = s2.maxRuns === void 0 ? 1 / 0 : s2.maxRuns, s2.catch = s2.catch === void 0 ? false : s2.catch, s2.interval = s2.interval === void 0 ? 0 : parseInt(s2.interval.toString(), 10), s2.utcOffset = s2.utcOffset === void 0 ? void 0 : parseInt(s2.utcOffset.toString(), 10), s2.dayOffset = s2.dayOffset === void 0 ? 0 : parseInt(s2.dayOffset.toString(), 10), s2.unref = s2.unref === void 0 ? false : s2.unref, s2.mode = s2.mode === void 0 ? "auto" : s2.mode, s2.alternativeWeekdays = s2.alternativeWeekdays === void 0 ? false : s2.alternativeWeekdays, s2.sloppyRanges = s2.sloppyRanges === void 0 ? false : s2.sloppyRanges, !["auto", "5-part", "6-part", "7-part", "5-or-6-parts", "6-or-7-parts"].includes(s2.mode)) throw new Error("CronOptions: mode must be one of 'auto', '5-part', '6-part', '7-part', '5-or-6-parts', or '6-or-7-parts'.");
+  if (s2.startAt && (s2.startAt = new m(s2.startAt, s2.timezone)), s2.stopAt && (s2.stopAt = new m(s2.stopAt, s2.timezone)), s2.interval !== null) {
+    if (isNaN(s2.interval)) throw new Error("CronOptions: Supplied value for interval is not a number");
+    if (s2.interval < 0) throw new Error("CronOptions: Supplied value for interval can not be negative");
+  }
+  if (s2.utcOffset !== void 0) {
+    if (isNaN(s2.utcOffset)) throw new Error("CronOptions: Invalid value passed for utcOffset, should be number representing minutes offset from UTC.");
+    if (s2.utcOffset < -870 || s2.utcOffset > 870) throw new Error("CronOptions: utcOffset out of bounds.");
+    if (s2.utcOffset !== void 0 && s2.timezone) throw new Error("CronOptions: Combining 'utcOffset' with 'timezone' is not allowed.");
+  }
+  if (s2.unref !== true && s2.unref !== false) throw new Error("CronOptions: Unref should be either true, false or undefined(false).");
+  if (s2.dayOffset !== void 0 && s2.dayOffset !== 0 && isNaN(s2.dayOffset)) throw new Error("CronOptions: Invalid value passed for dayOffset, should be a number representing days to offset.");
+  return s2;
+}
+function p(s2) {
+  return Object.prototype.toString.call(s2) === "[object Function]" || typeof s2 == "function" || s2 instanceof Function;
+}
+function _(s2) {
+  return p(s2);
+}
+function x(s2) {
+  typeof Deno < "u" && typeof Deno.unrefTimer < "u" ? Deno.unrefTimer(s2) : s2 && typeof s2.unref < "u" && s2.unref();
+}
+var W = 30 * 1e3;
+var w = [];
+var E = class {
+  name;
+  options;
+  _states;
+  fn;
+  getTz() {
+    return this.options.timezone || this.options.utcOffset;
+  }
+  applyDayOffset(e) {
+    if (this.options.dayOffset !== void 0 && this.options.dayOffset !== 0) {
+      let t = this.options.dayOffset * 24 * 60 * 60 * 1e3;
+      return new Date(e.getTime() + t);
+    }
+    return e;
+  }
+  constructor(e, t, r) {
+    let n, i;
+    if (p(t)) i = t;
+    else if (typeof t == "object") n = t;
+    else if (t !== void 0) throw new Error("Cron: Invalid argument passed for optionsIn. Should be one of function, or object (options).");
+    if (p(r)) i = r;
+    else if (typeof r == "object") n = r;
+    else if (r !== void 0) throw new Error("Cron: Invalid argument passed for funcIn. Should be one of function, or object (options).");
+    if (this.name = n?.name, this.options = R(n), this._states = { kill: false, blocking: false, previousRun: void 0, currentRun: void 0, once: void 0, currentTimeout: void 0, maxRuns: n ? n.maxRuns : void 0, paused: n ? n.paused : false, pattern: new C("* * * * *", void 0, { mode: "auto" }) }, e && (e instanceof Date || typeof e == "string" && e.indexOf(":") > 0) ? this._states.once = new m(e, this.getTz()) : this._states.pattern = new C(e, this.options.timezone, { mode: this.options.mode, alternativeWeekdays: this.options.alternativeWeekdays, sloppyRanges: this.options.sloppyRanges }), this.name) {
+      if (w.find((o) => o.name === this.name)) throw new Error("Cron: Tried to initialize new named job '" + this.name + "', but name already taken.");
+      w.push(this);
+    }
+    return i !== void 0 && _(i) && (this.fn = i, this.schedule()), this;
+  }
+  nextRun(e) {
+    let t = this._next(e);
+    return t ? this.applyDayOffset(t.getDate(false)) : null;
+  }
+  nextRuns(e, t) {
+    this._states.maxRuns !== void 0 && e > this._states.maxRuns && (e = this._states.maxRuns);
+    let r = t || this._states.currentRun || void 0;
+    return this._enumerateRuns(e, r, "next");
+  }
+  previousRuns(e, t) {
+    return this._enumerateRuns(e, t || void 0, "previous");
+  }
+  _enumerateRuns(e, t, r) {
+    let n = [], i = t ? new m(t, this.getTz()) : null, a = r === "next" ? this._next : this._previous;
+    for (; e--; ) {
+      let o = a.call(this, i);
+      if (!o) break;
+      let h = o.getDate(false);
+      n.push(this.applyDayOffset(h)), i = o;
+    }
+    return n;
+  }
+  match(e) {
+    if (this._states.once) {
+      let r = new m(e, this.getTz());
+      r.ms = 0;
+      let n = new m(this._states.once, this.getTz());
+      return n.ms = 0, r.getTime() === n.getTime();
+    }
+    let t = new m(e, this.getTz());
+    return t.ms = 0, t.match(this._states.pattern, this.options);
+  }
+  getPattern() {
+    if (!this._states.once) return this._states.pattern ? this._states.pattern.pattern : void 0;
+  }
+  getOnce() {
+    return this._states.once ? this._states.once.getDate() : null;
+  }
+  isRunning() {
+    let e = this.nextRun(this._states.currentRun), t = !this._states.paused, r = this.fn !== void 0, n = !this._states.kill;
+    return t && r && n && e !== null;
+  }
+  isStopped() {
+    return this._states.kill;
+  }
+  isBusy() {
+    return this._states.blocking;
+  }
+  currentRun() {
+    return this._states.currentRun ? this._states.currentRun.getDate() : null;
+  }
+  previousRun() {
+    return this._states.previousRun ? this._states.previousRun.getDate() : null;
+  }
+  msToNext(e) {
+    let t = this._next(e);
+    return t ? e instanceof m || e instanceof Date ? t.getTime() - e.getTime() : t.getTime() - new m(e).getTime() : null;
+  }
+  stop() {
+    this._states.kill = true, this._states.currentTimeout && clearTimeout(this._states.currentTimeout);
+    let e = w.indexOf(this);
+    e >= 0 && w.splice(e, 1);
+  }
+  pause() {
+    return this._states.paused = true, !this._states.kill;
+  }
+  resume() {
+    return this._states.paused = false, !this._states.kill;
+  }
+  schedule(e) {
+    if (e && this.fn) throw new Error("Cron: It is not allowed to schedule two functions using the same Croner instance.");
+    e && (this.fn = e);
+    let t = this.msToNext(), r = this.nextRun(this._states.currentRun);
+    return t == null || isNaN(t) || r === null ? this : (t > W && (t = W), this._states.currentTimeout = setTimeout(() => this._checkTrigger(r), t), this._states.currentTimeout && this.options.unref && x(this._states.currentTimeout), this);
+  }
+  async _trigger(e) {
+    this._states.blocking = true, this._states.currentRun = new m(void 0, this.getTz());
+    try {
+      if (this.options.catch) try {
+        this.fn !== void 0 && await this.fn(this, this.options.context);
+      } catch (t) {
+        if (p(this.options.catch)) try {
+          this.options.catch(t, this);
+        } catch {
+        }
+      }
+      else this.fn !== void 0 && await this.fn(this, this.options.context);
+    } finally {
+      this._states.previousRun = new m(e, this.getTz()), this._states.blocking = false;
+    }
+  }
+  async trigger() {
+    await this._trigger();
+  }
+  runsLeft() {
+    return this._states.maxRuns;
+  }
+  _checkTrigger(e) {
+    let t = /* @__PURE__ */ new Date(), r = !this._states.paused && t.getTime() >= e.getTime(), n = this._states.blocking && this.options.protect;
+    r && !n ? (this._states.maxRuns !== void 0 && this._states.maxRuns--, this._trigger()) : r && n && p(this.options.protect) && setTimeout(() => this.options.protect(this), 0), this.schedule();
+  }
+  _next(e) {
+    let t = !!(e || this._states.currentRun), r = false;
+    !e && this.options.startAt && this.options.interval && ([e, t] = this._calculatePreviousRun(e, t), r = !e), e = new m(e, this.getTz()), this.options.startAt && e && e.getTime() < this.options.startAt.getTime() && (e = this.options.startAt);
+    let n = this._states.once || new m(e, this.getTz());
+    return !r && n !== this._states.once && (n = n.increment(this._states.pattern, this.options, t)), this._states.once && this._states.once.getTime() <= e.getTime() || n === null || this._states.maxRuns !== void 0 && this._states.maxRuns <= 0 || this._states.kill || this.options.stopAt && n.getTime() >= this.options.stopAt.getTime() ? null : n;
+  }
+  _previous(e) {
+    let t = new m(e, this.getTz());
+    this.options.stopAt && t.getTime() > this.options.stopAt.getTime() && (t = this.options.stopAt);
+    let r = new m(t, this.getTz());
+    return this._states.once ? this._states.once.getTime() < t.getTime() ? this._states.once : null : (r = r.decrement(this._states.pattern, this.options), r === null || this.options.startAt && r.getTime() < this.options.startAt.getTime() ? null : r);
+  }
+  _calculatePreviousRun(e, t) {
+    let r = new m(void 0, this.getTz()), n = e;
+    if (this.options.startAt.getTime() <= r.getTime()) {
+      n = this.options.startAt;
+      let i = n.getTime() + this.options.interval * 1e3;
+      for (; i <= r.getTime(); ) n = new m(n, this.getTz()).increment(this._states.pattern, this.options, true), i = n.getTime() + this.options.interval * 1e3;
+      t = true;
+    }
+    return n === null && (n = void 0), [n, t];
+  }
+};
+
 // src/core/AnalysisProvider.ts
 var AnalysisProvider = class {
   constructor(api) {
@@ -12068,8 +12814,8 @@ var IntervalAnalysisProvider = class extends AnalysisProvider {
     const pks = await this.api.queryManager.getKeys({});
     const total = pks.length;
     if (total === 0) return [];
-    const k = "rate" in sampleOptions && sampleOptions.rate != null ? Math.ceil(total * Math.min(Math.max(sampleOptions.rate, 0), 1)) : sampleOptions.count;
-    const sampleCount = Math.min(Math.max(k, 0), total);
+    const k2 = "rate" in sampleOptions && sampleOptions.rate != null ? Math.ceil(total * Math.min(Math.max(sampleOptions.rate, 0), 1)) : sampleOptions.count;
+    const sampleCount = Math.min(Math.max(k2, 0), total);
     if (sampleCount === 0) return [];
     for (let i = 0; i < sampleCount; i++) {
       const j = i + Math.floor(Math.random() * (total - i));
@@ -12094,7 +12840,7 @@ var FTSTermCount = class extends IntervalAnalysisProvider {
   termCount = {};
   sampleSize = 0;
   async serialize(tx) {
-    const docs = await this.sample({ count: 1e3 }, tx);
+    const docs = await this.sample({ count: this.api.analysisManager.sampleSize }, tx);
     this.termCount = {};
     this.sampleSize = docs.length;
     if (docs.length === 0) return JSON.stringify({ _sampleSize: 0 });
@@ -12110,10 +12856,10 @@ var FTSTermCount = class extends IntervalAnalysisProvider {
       const flatDoc = this.api.flattenDocument(doc);
       for (const [indexName, config] of ftsIndices) {
         const primaryField = this.api.indexManager.getPrimaryField(config);
-        const v = flatDoc[primaryField];
-        if (typeof v === "string" && v.length > 0) {
+        const v2 = flatDoc[primaryField];
+        if (typeof v2 === "string" && v2.length > 0) {
           const ftsConfig = this.api.indexManager.getFtsConfig(config);
-          const tokens = ftsConfig ? tokenize(v, ftsConfig) : [v];
+          const tokens = ftsConfig ? tokenize(v2, ftsConfig) : [v2];
           const tokenizerStrategy = ftsConfig ? ftsConfig.tokenizer === "ngram" ? `${ftsConfig.gramSize}gram` : ftsConfig.tokenizer : "whitespace";
           if (!this.termCount[primaryField]) {
             this.termCount[primaryField] = {};
@@ -12134,7 +12880,7 @@ var FTSTermCount = class extends IntervalAnalysisProvider {
       optimizedTermCount[field] = {};
       for (const strategy in this.termCount[field]) {
         const tokenMap = this.termCount[field][strategy];
-        const sorted = Object.entries(tokenMap).sort((a, b) => b[1] - a[1]).slice(0, 1e3);
+        const sorted = Object.entries(tokenMap).sort((a, b2) => b2[1] - a[1]).slice(0, 1e3);
         optimizedTermCount[field][strategy] = {};
         for (let i = 0, len = sorted.length; i < len; i++) {
           optimizedTermCount[field][strategy][sorted[i][0]] = sorted[i][1];
@@ -12201,10 +12947,26 @@ var BuiltinAnalysisProviders = [
 
 // src/core/AnalysisManager.ts
 var AnalysisManager = class {
-  constructor(api) {
+  constructor(api, schedule, sampleSize) {
     this.api = api;
+    this.sampleSize = sampleSize;
+    this.cron = new E(schedule, async () => {
+      if (this.flushing) return;
+      await this.api.flushAnalysis();
+    });
   }
   providers = /* @__PURE__ */ new Map();
+  cron = null;
+  flushing = false;
+  /**
+   * Stop the background analysis cron job.
+   */
+  close() {
+    if (this.cron && this.cron.isRunning()) {
+      this.cron.stop();
+      this.cron = null;
+    }
+  }
   /**
    * Register all built-in analysis providers.
    * Each provider class is instantiated with the API reference and registered.
@@ -12255,6 +13017,14 @@ var AnalysisManager = class {
       }
     }
   }
+  /**
+   * Trigger the background analysis cron job.
+   */
+  triggerCron() {
+    if (this.cron && !this.cron.isRunning()) {
+      this.cron.trigger();
+    }
+  }
   /**
    * Notify all realtime providers that documents were inserted.
    * Data is persisted immediately after each provider processes the mutation.
@@ -12305,11 +13075,16 @@ var AnalysisManager = class {
    * @param tx The transaction to use (must be a write transaction)
    */
   async flush(tx) {
+    if (this.flushing) {
+      throw new Error("Cannot flush analysis while analysis is already flushing.");
+    }
+    this.flushing = true;
     for (const [name, provider] of this.providers) {
       if (provider instanceof IntervalAnalysisProvider) {
         await this.setAnalysisData(name, await provider.serialize(tx), tx);
       }
     }
+    this.flushing = false;
   }
   /**
    * Get the analysis header row.
@@ -12442,7 +13217,14 @@ var DocumentDataplyAPI = class extends import_dataply4.DataplyAPI {
     this.mutationManager = new MutationManager(this);
     this.metadataManager = new MetadataManager(this);
     this.documentFormatter = new DocumentFormatter();
-    this.analysisManager = new AnalysisManager(this);
+    this.analysisManager = new AnalysisManager(
+      this,
+      options.analysisSchedule ?? "* */1 * * *",
+      options.analysisSampleSize ?? 1e3
+    );
+    this.hook.onceAfter("close", async () => {
+      this.analysisManager.close();
+    });
     this.hook.onceAfter("init", async (tx, isNewlyCreated) => {
       if (isNewlyCreated) {
         await this.initializeDocumentFile(tx);
@@ -12454,6 +13236,7 @@ var DocumentDataplyAPI = class extends import_dataply4.DataplyAPI {
       await this.indexManager.initializeIndices(metadata, isNewlyCreated, tx);
       this.analysisManager.registerBuiltinProviders();
       await this.analysisManager.initializeProviders(tx);
+      this.analysisManager.triggerCron();
       this._initialized = true;
       return tx;
     });