json-as 1.3.2 → 1.3.4

package/assembly/util/dragonbox.ts

@@ -14,43 +14,51 @@ let _dbMulIsInteger: bool = false;
 let _dbParity: bool = false;
 let _dbRemovedExponent: i32 = 0;
 
+
 @inline
 function rotr32(n: u32, r: i32): u32 {
   const s = r & 31;
   return (n >>> s) | (n << ((32 - s) & 31));
 }
 
+
 @inline
 function rotr64(n: u64, r: i32): u64 {
   const s = r & 63;
   return (n >>> s) | (n << ((64 - s) & 63));
 }
 
+
 @inline
 function floor_log10_pow2(e: i32): i32 {
   return (e * 315653) >> 20;
 }
 
+
 @inline
 function floor_log2_pow10(e: i32): i32 {
   return (e * 1741647) >> 19;
 }
 
+
 @inline
 function floor_log10_pow2_minus_log10_4_over_3(e: i32): i32 {
   return (e * 631305 - 261663) >> 21;
 }
 
+
 @inline
 function floor_log5_pow2(e: i32): i32 {
   return (e * 225799) >> 19;
 }
 
+
 @inline
 function floor_log5_pow2_minus_log5_3(e: i32): i32 {
   return (e * 451597 - 715764) >> 20;
 }
 
+
 @inline
 function umul128_upper64(x: u64, y: u64): u64 {
   const a = <u32>(x >>> 32);
@@ -65,6 +73,7 @@ function umul128_upper64(x: u64, y: u64): u64 {
   return ac + (intermediate >>> 32) + (ad >>> 32) + (bc >>> 32);
 }
 
+
 @inline
 function umul96_upper64(x: u32, y: u64): u64 {
   const yh = <u32>(y >>> 32);
@@ -74,6 +83,7 @@ function umul96_upper64(x: u32, y: u64): u64 {
   return xyh + (xyl >>> 32);
 }
 
+
 @inline
 function computeMul32(u: u32, cache: u64): void {
   const r = umul96_upper64(u, cache);
@@ -81,28 +91,33 @@ function computeMul32(u: u32, cache: u64): void {
   _dbMulIsInteger = <u32>r == 0;
 }
 
+
 @inline
 function computeMulParity32(twoF: u32, cache: u64, beta: i32): void {
   const r = <u64>twoF * cache;
   _dbParity = ((r >>> (64 - beta)) & 1) != 0;
-  _dbMulIsInteger = (<u32>(r >>> (32 - beta))) == 0;
+  _dbMulIsInteger = <u32>(r >>> (32 - beta)) == 0;
 }
 
+
 @inline
 function computeLeftEndpointShorter32(cache: u64, beta: i32): u32 {
   return <u32>((cache - (cache >>> 25)) >>> (40 - beta));
 }
 
+
 @inline
 function computeRightEndpointShorter32(cache: u64, beta: i32): u32 {
   return <u32>((cache + (cache >>> 24)) >>> (40 - beta));
 }
 
+
 @inline
 function computeRoundUpShorter32(cache: u64, beta: i32): u32 {
   return (<u32>(cache >>> (39 - beta)) + 1) >>> 1;
 }
 
+
 @inline
 function removeTrailingZeros32(significand: u32): u32 {
   let exponent = 0;
@@ -126,22 +141,26 @@ function removeTrailingZeros32(significand: u32): u32 {
   return significand;
 }
 
+
 @inline
 function divideByPow10_32_1(n: u32): u32 {
   return <u32>((<u64>n * 429496730) >>> 32);
 }
 
+
 @inline
 function divideByPow10_32_2(n: u32): u32 {
   return <u32>((<u64>n * 1374389535) >>> 37);
 }
 
+
 @inline
 function checkDivisibilityAndDivideByPow10_32_1(n: u32): u64 {
   const prod = <u32>(n * 6554);
-  return (<u64>(prod >>> 16) << 32) | (((prod & 0xFFFF) < 6554) ? 1 : 0);
+  return ((<u64>(prod >>> 16)) << 32) | ((prod & 0xffff) < 6554 ? 1 : 0);
 }
 
+
 @inline
 function computeMul64(u: u64, cacheHigh: u64, cacheLow: u64): void {
   const high = umul128_upper64(u, cacheHigh);
@@ -167,6 +186,7 @@ function computeMul64(u: u64, cacheHigh: u64, cacheLow: u64): void {
   _dbMulIsInteger = rLow == 0;
 }
 
+
 @inline
 function computeMulParity64(twoF: u64, cacheHigh: u64, cacheLow: u64, beta: i32): void {
   const high = twoF * cacheHigh;
@@ -185,24 +205,28 @@ function computeMulParity64(twoF: u64, cacheHigh: u64, cacheLow: u64, beta: i32)
 
   const rHigh = high + lowHigh;
   _dbParity = ((rHigh >>> (64 - beta)) & 1) != 0;
-  _dbMulIsInteger = ((((rHigh << beta) & 0xFFFFFFFFFFFFFFFF) | (lowLow >>> (64 - beta))) == 0);
+  _dbMulIsInteger = (((rHigh << beta) & 0xffffffffffffffff) | (lowLow >>> (64 - beta))) == 0;
 }
 
+
 @inline
 function computeLeftEndpointShorter64(cacheHigh: u64, beta: i32): u64 {
   return (cacheHigh - (cacheHigh >>> 54)) >>> (11 - beta);
 }
 
+
 @inline
 function computeRightEndpointShorter64(cacheHigh: u64, beta: i32): u64 {
   return (cacheHigh + (cacheHigh >>> 53)) >>> (11 - beta);
 }
 
+
 @inline
 function computeRoundUpShorter64(cacheHigh: u64, beta: i32): u64 {
   return ((cacheHigh >>> (10 - beta)) + 1) >>> 1;
 }
 
+
 @inline
 function removeTrailingZeros64(significand: u64): u64 {
   let exponent = 0;
@@ -231,22 +255,26 @@ function removeTrailingZeros64(significand: u64): u64 {
   return significand;
 }
 
+
 @inline
 function divideByPow10_64_1(n: u64): u64 {
   return umul128_upper64(n, 1844674407370955162);
 }
 
+
 @inline
 function divideByPow10_64_3(n: u64): u64 {
   return umul128_upper64(n, 4722366482869645214) >>> 8;
 }
 
+
 @inline
 function checkDivisibilityAndDivideByPow10_64_2(n: u64): u64 {
   const prod = <u32>(n * 656);
-  return (<u64>(prod >>> 16) << 32) | (((prod & 0xFFFF) < 656) ? 1 : 0);
+  return ((<u64>(prod >>> 16)) << 32) | ((prod & 0xffff) < 656 ? 1 : 0);
 }
 
+
 @inline
 function genExponent(buffer: usize, k: i32): i32 {
   let negative = k < 0;
@@ -262,7 +290,7 @@ function prettify(buffer: usize, length: i32, k: i32): i32 {
   if (fast >= 0) return fast;
 
   if (!k) {
-    const tail = buffer + (<usize>length << 1);
+    const tail = buffer + ((<usize>length) << 1);
     store<u16>(tail, CHAR_DOT);
     store<u16>(tail, CHAR_0, 2);
     return length + 2;
@@ -270,29 +298,29 @@ function prettify(buffer: usize, length: i32, k: i32): i32 {
 
   const kk = length + k;
   if (length <= kk && kk <= 21) {
-    for (let i = length; i < kk; ++i) store<u16>(buffer + (<usize>i << 1), CHAR_0);
-    const tail = buffer + (<usize>kk << 1);
+    for (let i = length; i < kk; ++i) store<u16>(buffer + ((<usize>i) << 1), CHAR_0);
+    const tail = buffer + ((<usize>kk) << 1);
     store<u16>(tail, CHAR_DOT);
     store<u16>(tail, CHAR_0, 2);
     return kk + 2;
   } else if (kk > 0 && kk <= 21) {
-    const ptr = buffer + (<usize>kk << 1);
-    memory.copy(ptr + 2, ptr, <usize>(-k) << 1);
-    store<u16>(buffer + (<usize>kk << 1), CHAR_DOT);
+    const ptr = buffer + ((<usize>kk) << 1);
+    memory.copy(ptr + 2, ptr, (<usize>-k) << 1);
+    store<u16>(buffer + ((<usize>kk) << 1), CHAR_DOT);
     return length + 1;
   } else if (-6 < kk && kk <= 0) {
     const offset = 2 - kk;
-    memory.copy(buffer + (<usize>offset << 1), buffer, <usize>length << 1);
+    memory.copy(buffer + ((<usize>offset) << 1), buffer, (<usize>length) << 1);
     store<u16>(buffer, CHAR_0);
     store<u16>(buffer, CHAR_DOT, 2);
-    for (let i = 2; i < offset; ++i) store<u16>(buffer + (<usize>i << 1), CHAR_0);
+    for (let i = 2; i < offset; ++i) store<u16>(buffer + ((<usize>i) << 1), CHAR_0);
     return length + offset;
   } else if (length == 1) {
     store<u16>(buffer, CHAR_E, 2);
     length = genExponent(buffer + 4, kk - 1);
     return length + 2;
   } else {
-    const len = <usize>length << 1;
+    const len = (<usize>length) << 1;
     memory.copy(buffer + 4, buffer + 2, len - 2);
     store<u16>(buffer, CHAR_DOT, 2);
     store<u16>(buffer + len, CHAR_E, 2);
@@ -303,7 +331,7 @@ function prettify(buffer: usize, length: i32, k: i32): i32 {
 
 function prettifyFast(buffer: usize, length: i32, k: i32): i32 {
   if (k == 0) {
-    const tail = buffer + (<usize>length << 1);
+    const tail = buffer + ((<usize>length) << 1);
     store<u16>(tail, CHAR_DOT);
     store<u16>(tail, CHAR_0, 2);
     return length + 2;
@@ -312,24 +340,24 @@ function prettifyFast(buffer: usize, length: i32, k: i32): i32 {
   const kk = length + k;
   if (length <= kk && kk <= 21) {
     for (let i = length; i < kk; ++i) {
-      store<u16>(buffer + (<usize>i << 1), CHAR_0);
+      store<u16>(buffer + ((<usize>i) << 1), CHAR_0);
     }
-    const tail = buffer + (<usize>kk << 1);
+    const tail = buffer + ((<usize>kk) << 1);
     store<u16>(tail, CHAR_DOT);
     store<u16>(tail, CHAR_0, 2);
     return kk + 2;
   } else if (kk > 0 && kk <= 21) {
-    const ptr = buffer + (<usize>kk << 1);
-    memory.copy(ptr + 2, ptr, <usize>(length - kk) << 1);
-    store<u16>(buffer + (<usize>kk << 1), CHAR_DOT);
+    const ptr = buffer + ((<usize>kk) << 1);
+    memory.copy(ptr + 2, ptr, (<usize>(length - kk)) << 1);
+    store<u16>(buffer + ((<usize>kk) << 1), CHAR_DOT);
     return length + 1;
   } else if (-6 < kk && kk <= 0) {
     const offset = 2 - kk;
-    memory.copy(buffer + (<usize>offset << 1), buffer, <usize>length << 1);
+    memory.copy(buffer + ((<usize>offset) << 1), buffer, (<usize>length) << 1);
     store<u16>(buffer, CHAR_0);
     store<u16>(buffer, CHAR_DOT, 2);
     for (let i = 2; i < offset; ++i) {
-      store<u16>(buffer + (<usize>i << 1), CHAR_0);
+      store<u16>(buffer + ((<usize>i) << 1), CHAR_0);
     }
     return length + offset;
   }
@@ -346,7 +374,7 @@ function dragonboxToDecimalF32(binarySignificand: u32, binaryExponent: i32): u32
     if (twoFc == 0) {
       const minusK = floor_log10_pow2_minus_log10_4_over_3(binaryExponent);
       const beta = binaryExponent + floor_log2_pow10(-minusK);
-      const cache = load<u64>(DRAGONBOX_F32_CACHE + (<usize>(31 - minusK) << 3));
+      const cache = load<u64>(DRAGONBOX_F32_CACHE + ((<usize>(31 - minusK)) << 3));
       let xi = computeLeftEndpointShorter32(cache, beta);
       const zi = computeRightEndpointShorter32(cache, beta);
       if (!(binaryExponent >= 2 && binaryExponent <= 3)) ++xi;
@@ -370,7 +398,7 @@ function dragonboxToDecimalF32(binarySignificand: u32, binaryExponent: i32): u32
   }
 
   const minusK = floor_log10_pow2(binaryExponent) - 1;
-  const cache = load<u64>(DRAGONBOX_F32_CACHE + (<usize>(31 - minusK) << 3));
+  const cache = load<u64>(DRAGONBOX_F32_CACHE + ((<usize>(31 - minusK)) << 3));
   const beta = binaryExponent + floor_log2_pow10(-minusK);
   const deltai = <u32>(cache >>> (63 - beta));
 
@@ -432,7 +460,7 @@ function dragonboxToDecimalF64(binarySignificand: u64, binaryExponent: i32): u64
     if (twoFc == 0) {
       const minusK = floor_log10_pow2_minus_log10_4_over_3(binaryExponent);
       const beta = binaryExponent + floor_log2_pow10(-minusK);
-      const idx = <usize>(292 - minusK) << 4;
+      const idx = (<usize>(292 - minusK)) << 4;
       const cacheHigh = load<u64>(DRAGONBOX_F64_CACHE + idx);
       const cacheLow = load<u64>(DRAGONBOX_F64_CACHE + idx + 8);
       let xi = computeLeftEndpointShorter64(cacheHigh, beta);
@@ -458,7 +486,7 @@ function dragonboxToDecimalF64(binarySignificand: u64, binaryExponent: i32): u64
   }
 
   const minusK = floor_log10_pow2(binaryExponent) - 2;
-  const idx = <usize>(292 - minusK) << 4;
+  const idx = (<usize>(292 - minusK)) << 4;
   const cacheHigh = load<u64>(DRAGONBOX_F64_CACHE + idx);
   const cacheLow = load<u64>(DRAGONBOX_F64_CACHE + idx + 8);
   const beta = binaryExponent + floor_log2_pow10(-minusK);
@@ -520,9 +548,9 @@ function dragonboxCoreF32(buffer: usize, value: f32): u32 {
     value = -value;
     store<u16>(buffer, CHAR_MINUS);
   }
-  const digits = dragonboxToDecimalF32(reinterpret<u32>(value) & 0x7FFFFF, (reinterpret<u32>(value) >>> 23) & 0xFF);
-  let len = itoa_buffered<u32>(buffer + (<usize>sign << 1), digits);
-  return <u32>(prettify(buffer + (<usize>sign << 1), len, _dbK) + sign);
+  const digits = dragonboxToDecimalF32(reinterpret<u32>(value) & 0x7fffff, (reinterpret<u32>(value) >>> 23) & 0xff);
+  let len = itoa_buffered<u32>(buffer + ((<usize>sign) << 1), digits);
+  return <u32>(prettify(buffer + ((<usize>sign) << 1), len, _dbK) + sign);
 }
 
 function dragonboxCoreF64(buffer: usize, value: f64): u32 {
@@ -533,9 +561,9 @@ function dragonboxCoreF64(buffer: usize, value: f64): u32 {
     store<u16>(buffer, CHAR_MINUS);
   }
   const bits = reinterpret<u64>(value);
-  const digits = dragonboxToDecimalF64(bits & 0x000FFFFFFFFFFFFF, <i32>((bits >>> 52) & 0x7FF));
-  let len = itoa_buffered<u64>(buffer + (<usize>sign << 1), digits);
-  return <u32>(prettify(buffer + (<usize>sign << 1), len, _dbK) + sign);
+  const digits = dragonboxToDecimalF64(bits & 0x000fffffffffffff, <i32>((bits >>> 52) & 0x7ff));
+  let len = itoa_buffered<u64>(buffer + ((<usize>sign) << 1), digits);
+  return <u32>(prettify(buffer + ((<usize>sign) << 1), len, _dbK) + sign);
 }
 
 export function dragonbox_f32_buffered(buffer: usize, value: f32): u32 {
@@ -557,8 +585,8 @@ export function dragonbox_f32_buffered(buffer: usize, value: f32): u32 {
       store<u16>(buffer, CHAR_MINUS);
       buffer += 2;
     }
-    store<u64>(buffer, 0x690066006E0049);
-    store<u64>(buffer + 8, 0x7900740069006E);
+    store<u64>(buffer, 0x690066006e0049);
+    store<u64>(buffer + 8, 0x7900740069006e);
     return 8 + (sign ? 1 : 0);
   }
   return dragonboxCoreF32(buffer, value);
@@ -583,8 +611,8 @@ export function dragonbox_f64_buffered(buffer: usize, value: f64): u32 {
       store<u16>(buffer, CHAR_MINUS);
       buffer += 2;
     }
-    store<u64>(buffer, 0x690066006E0049);
-    store<u64>(buffer + 8, 0x7900740069006E);
+    store<u64>(buffer, 0x690066006e0049);
+    store<u64>(buffer + 8, 0x7900740069006e);
     return 8 + (sign ? 1 : 0);
   }
   return dragonboxCoreF64(buffer, value);

package/lib/as-bs.ts

@@ -190,7 +190,6 @@ export namespace bs {
     }
   }
 
-
   /**
    * Copies the slice starting at a caller-provided relative buffer offset and restores
    * `offset` back to that slice start.
@@ -287,18 +286,21 @@ export namespace bs {
  *
  * Enable caching by setting the `JSON_CACHE` environment variable:
  * ```bash
- * JSON_CACHE=1 npx asc your-file.ts --transform json-as/transform
+ * JSON_CACHE=true npx asc your-file.ts --transform json-as/transform
  * ```
  *
- * ## Memory Configuration
+ * You can also configure cache size directly:
+ * - `JSON_CACHE=<int>` => bytes
+ * - `JSON_CACHE=<int>kb|mb|gb` => kilobits/megabits/gigabits
+ * - `JSON_CACHE=<int>KB|MB|GB` => kilobytes/megabytes/gigabytes
  *
- * The cache uses the following fixed memory allocations:
+ * ## Memory Configuration
  *
- * - **CACHE_SIZE** (4096 entries): Number of cache slots. Uses direct-mapped
- *   caching with pointer-based indexing. Collisions will evict previous entries.
- *   Memory usage: ~49KB (4096 * 12 bytes per entry)
+ * The cache uses a size budget from `JSON_CACHE` (or defaults to 1MB when
+ * enabled with `true/on/yes`):
  *
- * - **ARENA_SIZE** (1MB): Circular buffer for storing cached serialized strings.
+ * - **CACHE_SIZE**: Number of direct-mapped cache slots. Derived from budget.
+ * - **ARENA_SIZE**: Circular buffer for storing cached serialized strings.
  *   When full, wraps around and overwrites oldest entries. Larger values retain
  *   more cached data but consume more memory.
  *
@@ -325,16 +327,20 @@ export namespace sc {
   // @ts-expect-error: @inline is a valid decorator
   @inline export const ENTRY_LEN = offsetof<sc.Entry>("len");
 
-  /** Number of cache slots (power of 2 for efficient masking). Set to 0 when caching disabled. */
-  // @ts-expect-error: JSON_CACHE may not be defined. If so, it will default to 0.
-  export const CACHE_SIZE = isDefined(JSON_CACHE) ? 1024 : 0;
-  /** Bitmask for fast modulo operation on cache index */
-  export const CACHE_MASK = CACHE_SIZE - 1;
-
-  /** Size of the circular arena buffer for cached strings (1MB) */
-  export const ARENA_SIZE = 1 << 20;
+  // @ts-expect-error: JSON_CACHE may not be defined. If so, it will default to false.
+  export const CACHE_ENABLED: bool = isDefined(JSON_CACHE) ? JSON_CACHE : false;
+  // @ts-expect-error: JSON_CACHE_SIZE may not be defined. If so, it will default to 1MB.
+  export const CACHE_BYTES: usize = isDefined(JSON_CACHE_SIZE) ? <usize>JSON_CACHE_SIZE : (1 << 20);
   /** Minimum serialized length to cache - smaller outputs aren't worth caching */
   export const MIN_CACHE_LEN: usize = 128;
+  /** Size of the circular arena buffer for cached strings */
+  export const ARENA_SIZE: usize = CACHE_BYTES >= MIN_CACHE_LEN ? CACHE_BYTES : MIN_CACHE_LEN;
+
+  /** Number of cache slots (power of 2 for efficient masking). Set to 0 when caching disabled. */
+  const CACHE_SIZE_BASE: i32 = CACHE_ENABLED ? i32((ARENA_SIZE >> 10) >= 1 ? (ARENA_SIZE >> 10) : 1) : 0;
+  export const CACHE_SIZE: usize = CACHE_ENABLED ? <usize>(1 << (32 - clz<i32>(CACHE_SIZE_BASE - 1))) : 0;
+  /** Bitmask for fast modulo operation on cache index */
+  export const CACHE_MASK: usize = CACHE_SIZE > 0 ? CACHE_SIZE - 1 : 0;
 
   /** Cache entry structure - stores pointer to string, cached output location, and length */
   @unmanaged
@@ -348,9 +354,9 @@ export namespace sc {
   }
 
   /** Static array of cache entries */
-  export const entries = new StaticArray<sc.Entry>(CACHE_SIZE);
+  export const entries = new StaticArray<sc.Entry>(i32(CACHE_SIZE));
   /** Circular buffer arena for storing cached serialized strings */
-  export const arena = new ArrayBuffer(ARENA_SIZE);
+  export const arena = new ArrayBuffer(i32(ARENA_SIZE));
   /** Current write position in the arena */
   export let arenaPtr: usize = changetype<usize>(arena);
   /** End boundary of the arena */
@@ -394,7 +400,9 @@ export namespace sc {
    * @param len - Length of serialized output
    */
   export function insertCached(str: usize, start: usize, len: usize): void {
+    if (!CACHE_ENABLED || ARENA_SIZE == 0) return;
     if (len < MIN_CACHE_LEN) return;
+    if (len > ARENA_SIZE) return;
     if (arenaPtr + len > arenaEnd) {
       // Wrap around to beginning of arena (circular buffer)
       arenaPtr = changetype<usize>(arena);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "json-as",
-  "version": "1.3.2",
+  "version": "1.3.4",
   "author": "Jairus Tanaka",
   "repository": {
     "type": "git",
@@ -10,19 +10,19 @@
   "main": "transform/lib/index.js",
   "devDependencies": {
     "@assemblyscript/wasi-shim": "^0.1.0",
-    "@eslint/js": "^9.0.0",
-    "@types/node": "^25.0.10",
-    "as-test": "^1.0.6",
-    "assemblyscript": "^0.28.9",
-    "assemblyscript-prettier": "^3.0.1",
+    "@eslint/js": "^10.0.1",
+    "@types/node": "^25.6.0",
+    "as-test": "^1.0.7",
+    "assemblyscript": "^0.28.14",
+    "assemblyscript-prettier": "^3.0.4",
     "chartjs-node-canvas": "^5.0.0",
     "chartjs-plugin-datalabels": "^2.2.0",
-    "eslint": "^10.0.0",
-    "prettier": "3.8.1",
+    "eslint": "^10.2.0",
+    "prettier": "3.8.3",
     "serve": "^14.2.6",
     "tinybench": "^6.0.0",
-    "typescript": "^5.9.3",
-    "typescript-eslint": "^8.0.0"
+    "typescript": "^6.0.2",
+    "typescript-eslint": "^8.58.2"
   },
   "bugs": {
     "url": "https://github.com/JairusSW/json-as/issues"
@@ -91,6 +91,7 @@
     "bench": "npm run bench:as && npm run bench:js && npm run charts:build",
     "bench:as": "bash ./scripts/run-bench.as.sh",
     "bench:js": "bash ./scripts/run-bench.js.sh",
+    "charts": "bun run charts:build && bun run charts:serve",
     "charts:build": "bash ./scripts/build-charts.sh",
     "charts:publish": "bash ./scripts/publish-benchmarks.sh",
     "charts:serve": "serve ./build/charts/",

package/transform/lib/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAA4G,eAAe,EAA8G,MAAM,EAAE,OAAO,EAAS,MAAM,EAA6C,MAAM,uCAAuC,CAAC;AAC3X,OAAO,EAAE,SAAS,EAAE,MAAM,kCAAkC,CAAC;AAK7D,OAAO,EAA2B,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAE7E,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAkFvC,qBAAa,aAAc,SAAQ,OAAO;IACxC,MAAM,CAAC,EAAE,EAAE,aAAa,CAAuB;IAExC,OAAO,EAAG,OAAO,CAAC;IAClB,OAAO,EAAG,MAAM,CAAC;IACjB,MAAM,EAAG,MAAM,CAAC;IAChB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAA+B;IAC7D,MAAM,EAAG,MAAM,CAAC;IAChB,OAAO,EAAE,SAAS,CAAmB;IACrC,OAAO,EAAE,eAAe,EAAE,CAAM;IAChC,cAAc,EAAE,MAAM,EAAE,CAAM;IAE9B,cAAc,EAAE,GAAG,CAAC,MAAM,CAAC,CAAqB;IAEvD,OAAO,CAAC,4BAA4B;IA6CpC,wBAAwB,CAAC,IAAI,EAAE,gBAAgB,GAAG,IAAI;IAYtD,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,cAAoB,GAAG,MAAM;IAsC3E,qBAAqB,CAAC,IAAI,EAAE,gBAAgB,GAAG,IAAI;IAy7CnD,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAItC,oBAAoB,CAAC,IAAI,EAAE,gBAAgB,GAAG,IAAI;IA4ClD,oBAAoB,CAAC,IAAI,EAAE,eAAe,GAAG,IAAI;IAIjD,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAI/B,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IA+J9B,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE,OAAe,GAAG,MAAM,EAAE;IA0BxD,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,gBAAgB,GAAG,OAAO;CAc3D;AA4BD,MAAM,CAAC,OAAO,OAAO,WAAY,SAAQ,SAAS;IAChD,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAwBvD,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;CAwDjC;AAoKD,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAO9C"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gBAAgB,EAA4G,eAAe,EAA8G,MAAM,EAAE,OAAO,EAAS,MAAM,EAA6C,MAAM,uCAAuC,CAAC;AAC3X,OAAO,EAAE,SAAS,EAAE,MAAM,kCAAkC,CAAC;AAK7D,OAAO,EAA2B,MAAM,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAE7E,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAuJvC,qBAAa,aAAc,SAAQ,OAAO;IACxC,MAAM,CAAC,EAAE,EAAE,aAAa,CAAuB;IAExC,OAAO,EAAG,OAAO,CAAC;IAClB,OAAO,EAAG,MAAM,CAAC;IACjB,MAAM,EAAG,MAAM,CAAC;IAChB,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAA+B;IAC7D,MAAM,EAAG,MAAM,CAAC;IAChB,OAAO,EAAE,SAAS,CAAmB;IACrC,OAAO,EAAE,eAAe,EAAE,CAAM;IAChC,cAAc,EAAE,MAAM,EAAE,CAAM;IAE9B,cAAc,EAAE,GAAG,CAAC,MAAM,CAAC,CAAqB;IAEvD,OAAO,CAAC,4BAA4B;IA6CpC,wBAAwB,CAAC,IAAI,EAAE,gBAAgB,GAAG,IAAI;IAYtD,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,OAAO,cAAoB,GAAG,MAAM;IAsC3E,qBAAqB,CAAC,IAAI,EAAE,gBAAgB,GAAG,IAAI;IAuiDnD,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI;IAItC,oBAAoB,CAAC,IAAI,EAAE,gBAAgB,GAAG,IAAI;IA4ClD,oBAAoB,CAAC,IAAI,EAAE,eAAe,GAAG,IAAI;IAIjD,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAI/B,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IA+J9B,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,GAAE,OAAe,GAAG,MAAM,EAAE;IA0BxD,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,gBAAgB,GAAG,OAAO;CAc3D;AA4BD,MAAM,CAAC,OAAO,OAAO,WAAY,SAAQ,SAAS;IAChD,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;IAyBvD,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;CAwDjC;AA+MD,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAO9C"}