@vinicunca/perkakas 1.7.0 → 1.8.0

package/dist/chunk-Z33G2D3N.js

@@ -1 +0,0 @@
-import{a}from"./chunk-J6WPJH72.js";function y(...n){return a(e,n)}function e(n,o){return o.some(r=>r(n))}export{y as a};

package/dist/chunk-Z3F6RC7S.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function o(...t){return _chunkXR72I63Wcjs.a.call(void 0, r,t)}function r(t,e){return t===e||Object.is(t,e)}exports.a = o;

package/dist/chunk-Z5EOW435.js

@@ -1 +0,0 @@
-import{a as n}from"./chunk-J6WPJH72.js";function i(...e){return n(a,e)}function a(e,r){for(let[t,o]of Object.entries(e))r(o,t,e);return e}export{i as a};

package/dist/chunk-Z5YZYBC2.js

@@ -1 +0,0 @@
-import{a as t}from"./chunk-NHTBBY2L.js";import{a as e}from"./chunk-J6WPJH72.js";function s(...n){return e(r,n,t(a))}function r([n]){return n}function a(){return o}function o(n){return{hasNext:!0,next:n,done:!0}}export{s as a};

package/dist/chunk-Z5Z4ADBO.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkN5JE6642cjs = require('./chunk-N5JE6642.cjs');var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function l(...r){return _chunkXR72I63Wcjs.a.call(void 0, o,r,u)}function o(r,e){return e<0?[]:r.slice(0,e)}function u(r){if(r<=0)return _chunkN5JE6642cjs.b;let e=r;return a=>(e-=1,{done:e<=0,hasNext:!0,next:a})}exports.a = l;

package/dist/chunk-Z6K5VISM.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function d(...e){return _chunkXR72I63Wcjs.a.call(void 0, p,e)}function p(e,n,o){let{[n]:K,[o]:s}=e;return{...e,[n]:s,[o]:K}}exports.a = d;

package/dist/chunk-Z6OOXW67.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function o(n,r,e){[n[r],n[e]]=[n[e],n[r]]}exports.a = o;

package/dist/chunk-Z7D7Q6U3.js

@@ -1 +0,0 @@
-import{a as t}from"./chunk-J6WPJH72.js";function i(...e){return t(s,e)}function s(e,o){let r={};for(let n of o)n in e&&(r[n]=e[n]);return r}export{i as a};

package/dist/chunk-Z7DYKN6W.js

@@ -1 +0,0 @@
-import{a as l}from"./chunk-KGPDVVVV.js";function T(e,n,r){return typeof e=="function"?(t,a)=>o(t,a,e):typeof n=="function"?l(o,[e,n],u):o(e,n,r)}function o(e,n,r){let t=[e,n];return e.length<n.length?e.map((a,i)=>r(a,n[i],i,t)):n.map((a,i)=>r(e[i],a,i,t))}function u(e,n){return(r,t,a)=>({next:n(r,e[t],t,[a,e]),hasNext:!0,done:t>=e.length-1})}export{T as a};

package/dist/chunk-ZAZDS3SB.js

@@ -1 +0,0 @@
-import{a as t,b as s,c as i}from"./chunk-MZEHWQF3.js";function c(n,r){let[o,f,m]=t(n,r),p=r?.mergeAmbiguousCharacters?s():i();return o+f.map((e,a)=>a===0?e.toLowerCase():p(e,a)).join(r?.delimiter??"")+m}export{c as a};

package/dist/chunk-ZCCHYKDG.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});function t(n){return typeof n=="function"}exports.a = t;

package/dist/chunk-ZH3SGWIA.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXR72I63Wcjs = require('./chunk-XR72I63W.cjs');function t(...a){return _chunkXR72I63Wcjs.a.call(void 0, e,a)}function e(a,o){return o.every(r=>r(a))}exports.a = t;

package/dist/chunk-ZIGQWNCG.js

@@ -1 +0,0 @@
-import{a,b as s,c as e}from"./chunk-MZEHWQF3.js";function c(t,r){let[i,n,o]=a(t,r),f=r?.mergeAmbiguousCharacters?s():e();return i+n.map(f).join(r?.delimiter??"")+o}export{c as a};

package/dist/chunk-ZIGQZNHP.js

@@ -1 +0,0 @@
-import{a as o}from"./chunk-LSODZ3GY.js";import{a as n}from"./chunk-EPU4K3DD.js";function T(...r){return o(i,r)}function i(r,t){return e=>r.every(a=>!t(e,a))?{done:!1,hasNext:!0,next:e}:n}export{T as a};

package/dist/chunk-ZITGCTSW.js

@@ -1 +0,0 @@
-import{a as r}from"./chunk-EPU4K3DD.js";import{a as t}from"./chunk-J6WPJH72.js";function m(...e){return t(o,e,i)}function o(e,n){return e.filter(n)}function i(e){return(n,a,d)=>e(n,a,d)?{done:!1,hasNext:!0,next:n}:r}export{m as a};

package/dist/chunk-ZLNSRDW7.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkEROXO3T4cjs = require('./chunk-EROXO3T4.cjs');function u(...r){return _chunkEROXO3T4cjs.b.call(void 0, y,r)}function y(r,t,o){let n=0;for(let a of r)t(o,a)>0&&(n+=1);return n}exports.a = u;

package/dist/chunk-ZMG3NQDL.js

@@ -1 +0,0 @@
-var d=/^(?:0|[1-9]\d*)$/u;function s(i){let t=[],a=/\.{0,4096}(?<propName>[^.[\]]+)|\['(?<quoted>.{0,4096}?)'\]|\["(?<doubleQuoted>.{0,4096}?)"\]|\[(?<unquoted>.{0,4096}?)\]/uy,n;for(;(n=a.exec(i))!==null;){let{propName:e,quoted:o,doubleQuoted:u,unquoted:r}=n.groups;if(r!==void 0){t.push(...s(r));continue}t.push(e===void 0?o??u:d.test(e)?Number(e):e)}return t}export{s as a};

package/dist/chunk-ZSKQIU2G.js

@@ -1 +0,0 @@
-import{a as o}from"./chunk-J6WPJH72.js";function i(...r){return o(l,r)}function l(r){let n=[...r];for(let e=0;e<r.length;e++){let t=e+Math.floor(Math.random()*(r.length-e)),a=n[t];n[t]=n[e],n[e]=a}return n}export{i as a};

package/dist/chunk-ZX5QTVEJ.js

@@ -1 +0,0 @@
-import{a}from"./chunk-J6WPJH72.js";function u(...e){return a(o,e,i)}function o(e,r){return e.forEach(r),e}function i(e){return(r,n,t)=>(e(r,n,t),{done:!1,hasNext:!0,next:r})}export{u as a};

package/dist/clamped-integer-subtract-DZ7rsJE4.d.cts

@@ -1,15 +0,0 @@
-/**
- * We built our own version of Subtract instead of using type-fest's one
- * because we needed a simpler implementation that isn't as prone to excessive
- * recursion issues and that is clamped at 0 so that we don't need to handle
- * negative values using even more utilities.
- */
-type ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag extends Array<unknown> = [], ResultBag extends Array<unknown> = []> = [...SubtrahendBag, ...ResultBag]['length'] extends Minuend ? ResultBag['length'] : SubtrahendBag['length'] extends Subtrahend ? ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag, [
-    ...ResultBag,
-    unknown
-]> : ClampedIntegerSubtract<Minuend, Subtrahend, [
-    ...SubtrahendBag,
-    unknown
-], ResultBag>;
-
-export type { ClampedIntegerSubtract as C };

package/dist/clamped-integer-subtract-DZ7rsJE4.d.ts

@@ -1,15 +0,0 @@
-/**
- * We built our own version of Subtract instead of using type-fest's one
- * because we needed a simpler implementation that isn't as prone to excessive
- * recursion issues and that is clamped at 0 so that we don't need to handle
- * negative values using even more utilities.
- */
-type ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag extends Array<unknown> = [], ResultBag extends Array<unknown> = []> = [...SubtrahendBag, ...ResultBag]['length'] extends Minuend ? ResultBag['length'] : SubtrahendBag['length'] extends Subtrahend ? ClampedIntegerSubtract<Minuend, Subtrahend, SubtrahendBag, [
-    ...ResultBag,
-    unknown
-]> : ClampedIntegerSubtract<Minuend, Subtrahend, [
-    ...SubtrahendBag,
-    unknown
-], ResultBag>;
-
-export type { ClampedIntegerSubtract as C };

package/dist/coerced-array-DRz3tqda.d.cts

@@ -1,14 +0,0 @@
-import { IfNever } from 'type-fest';
-
-/**
- * `never[]` and `[]` are not the same type, and in some cases they aren't
- * interchangeable.
- *
- * This type makes it easier to use the result of TupleParts when the input is a
- * fixed-length tuple but we still want to spread the rest of the array. e.g.
- * `[...CoercedArray<TupleParts<T>["item"]>, ...TupleParts<T>["suffix"]]`.
- *
- */
-type CoercedArray<T> = IfNever<T, [], Array<T>>;
-
-export type { CoercedArray as C };

package/dist/coerced-array-DRz3tqda.d.ts

@@ -1,14 +0,0 @@
-import { IfNever } from 'type-fest';
-
-/**
- * `never[]` and `[]` are not the same type, and in some cases they aren't
- * interchangeable.
- *
- * This type makes it easier to use the result of TupleParts when the input is a
- * fixed-length tuple but we still want to spread the rest of the array. e.g.
- * `[...CoercedArray<TupleParts<T>["item"]>, ...TupleParts<T>["suffix"]]`.
- *
- */
-type CoercedArray<T> = IfNever<T, [], Array<T>>;
-
-export type { CoercedArray as C };

package/dist/curry-order-rules-BKXCPBNx.d.cts

@@ -1,37 +0,0 @@
-declare const COMPARATORS: {
-    readonly asc: <T>(x: T, y: T) => boolean;
-    readonly desc: <T>(x: T, y: T) => boolean;
-};
-/**
- * An order rule defines a projection/extractor that returns a comparable from
- * the data being compared. It would be run on each item being compared, and a
- * comparator would then be used on the results to determine the order.
- *
- * There are 2 forms of the order rule, a simple one which only provides the
- * projection function and assumes ordering is ascending, and a 2-tuple where
- * the first element is the projection function and the second is the direction;
- * this allows changing the direction without defining a more complex projection
- * to simply negate the value (e.g. `(x) => -x`).
- *
- * We rely on the javascript implementation of `<` and `>` for comparison, which
- * will attempt to transform both operands into a primitive comparable value via
- * the built in `valueOf` function (and then `toString`). It's up to the caller
- * to make sure that the projection is returning a value that makes sense for
- * this logic.
- *
- * It's important to note that there is no built-in caching/memoization of
- * projection function and therefore no guarantee that it would only be called
- * once.
- */
-type OrderRule<T> = Projection<T> | readonly [projection: Projection<T>, direction: keyof typeof COMPARATORS];
-type Projection<T> = (x: T) => Comparable;
-type Comparable = ComparablePrimitive | {
-    [Symbol.toPrimitive]: (hint: string) => ComparablePrimitive;
-} | {
-    toString: () => string;
-} | {
-    valueOf: () => ComparablePrimitive;
-};
-type ComparablePrimitive = bigint | boolean | number | string;
-
-export type { OrderRule as O };

package/dist/curry-order-rules-BKXCPBNx.d.ts

@@ -1,37 +0,0 @@
-declare const COMPARATORS: {
-    readonly asc: <T>(x: T, y: T) => boolean;
-    readonly desc: <T>(x: T, y: T) => boolean;
-};
-/**
- * An order rule defines a projection/extractor that returns a comparable from
- * the data being compared. It would be run on each item being compared, and a
- * comparator would then be used on the results to determine the order.
- *
- * There are 2 forms of the order rule, a simple one which only provides the
- * projection function and assumes ordering is ascending, and a 2-tuple where
- * the first element is the projection function and the second is the direction;
- * this allows changing the direction without defining a more complex projection
- * to simply negate the value (e.g. `(x) => -x`).
- *
- * We rely on the javascript implementation of `<` and `>` for comparison, which
- * will attempt to transform both operands into a primitive comparable value via
- * the built in `valueOf` function (and then `toString`). It's up to the caller
- * to make sure that the projection is returning a value that makes sense for
- * this logic.
- *
- * It's important to note that there is no built-in caching/memoization of
- * projection function and therefore no guarantee that it would only be called
- * once.
- */
-type OrderRule<T> = Projection<T> | readonly [projection: Projection<T>, direction: keyof typeof COMPARATORS];
-type Projection<T> = (x: T) => Comparable;
-type Comparable = ComparablePrimitive | {
-    [Symbol.toPrimitive]: (hint: string) => ComparablePrimitive;
-} | {
-    toString: () => string;
-} | {
-    valueOf: () => ComparablePrimitive;
-};
-type ComparablePrimitive = bigint | boolean | number | string;
-
-export type { OrderRule as O };

package/dist/deduped-CagGlWg1.d.cts

@@ -1,23 +0,0 @@
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
-
-/**
- * The result of running a function that would dedupe an array (`unique`,
- * `uniqueBy`, and `uniqueWith`).
- *
- * There are certain traits of the output which are unique to a deduped array
- * that allow us to create a better type; see comments inline.
- *
- * !Note: We can build better types for each of the unique functions
- * _separately_ by taking advantage of _other_ characteristics that are unique
- * to each one (e.g. in `unique` we know that each item that has a disjoint type
- * to all previous items would be part of the output, even when it isn't the
- * first), but to make this utility the most useful we kept it simple and
- * generic for now.
- */
-type Deduped<T extends IterableContainer> = T extends readonly [] ? [] : T extends readonly [infer Head, ...infer Rest] ? [
-    Head,
-    ...Array<Rest[number]>
-] : T extends readonly [...Array<unknown>, unknown] ? NonEmptyArray<T[number]> : Array<T[number]>;
-
-export type { Deduped as D };

package/dist/deduped-DWYYywHn.d.ts

@@ -1,23 +0,0 @@
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
-
-/**
- * The result of running a function that would dedupe an array (`unique`,
- * `uniqueBy`, and `uniqueWith`).
- *
- * There are certain traits of the output which are unique to a deduped array
- * that allow us to create a better type; see comments inline.
- *
- * !Note: We can build better types for each of the unique functions
- * _separately_ by taking advantage of _other_ characteristics that are unique
- * to each one (e.g. in `unique` we know that each item that has a disjoint type
- * to all previous items would be part of the output, even when it isn't the
- * first), but to make this utility the most useful we kept it simple and
- * generic for now.
- */
-type Deduped<T extends IterableContainer> = T extends readonly [] ? [] : T extends readonly [infer Head, ...infer Rest] ? [
-    Head,
-    ...Array<Rest[number]>
-] : T extends readonly [...Array<unknown>, unknown] ? NonEmptyArray<T[number]> : Array<T[number]>;
-
-export type { Deduped as D };

package/dist/enumerable-string-key-of-C4gsorXe.d.ts

@@ -1,14 +0,0 @@
-import { T as ToString } from './to-string-DO8zw6jS.js';
-
-/**
- * A union of all keys of T which are not symbols, and where number keys are
- * converted to strings, following the definition of `Object.keys` and
- * `Object.entries`.
- *
- * Inspired and largely copied from [`sindresorhus/ts-extras`](https://github.com/sindresorhus/ts-extras/blob/44f57392c5f027268330771996c4fdf9260b22d6/source/object-keys.ts).
- *
- * @see EnumerableStringKeyedValueOf
- */
-type EnumerableStringKeyOf<T> = Required<T> extends Record<infer K, unknown> ? ToString<K> : never;
-
-export type { EnumerableStringKeyOf as E };

package/dist/enumerable-string-key-of-D8w_3Yg8.d.cts

@@ -1,14 +0,0 @@
-import { T as ToString } from './to-string-DO8zw6jS.cjs';
-
-/**
- * A union of all keys of T which are not symbols, and where number keys are
- * converted to strings, following the definition of `Object.keys` and
- * `Object.entries`.
- *
- * Inspired and largely copied from [`sindresorhus/ts-extras`](https://github.com/sindresorhus/ts-extras/blob/44f57392c5f027268330771996c4fdf9260b22d6/source/object-keys.ts).
- *
- * @see EnumerableStringKeyedValueOf
- */
-type EnumerableStringKeyOf<T> = Required<T> extends Record<infer K, unknown> ? ToString<K> : never;
-
-export type { EnumerableStringKeyOf as E };

package/dist/enumerable-string-keyed-value-of-BU9R_cEk.d.cts

@@ -1,9 +0,0 @@
-import { IfNever } from 'type-fest';
-
-/**
- * A union of all values of properties in T which are not keyed by a symbol,
- * following the definition of `Object.values` and `Object.entries`.
- */
-type EnumerableStringKeyedValueOf<T> = T extends unknown ? IfNever<Exclude<keyof T, symbol>, never, Required<T>[Exclude<keyof T, symbol>]> : never;
-
-export type { EnumerableStringKeyedValueOf as E };

package/dist/enumerable-string-keyed-value-of-BU9R_cEk.d.ts

@@ -1,9 +0,0 @@
-import { IfNever } from 'type-fest';
-
-/**
- * A union of all values of properties in T which are not keyed by a symbol,
- * following the definition of `Object.values` and `Object.entries`.
- */
-type EnumerableStringKeyedValueOf<T> = T extends unknown ? IfNever<Exclude<keyof T, symbol>, never, Required<T>[Exclude<keyof T, symbol>]> : never;
-
-export type { EnumerableStringKeyedValueOf as E };

package/dist/filtered-array-BCjySbC6.d.cts

@@ -1,18 +0,0 @@
-import { C as CoercedArray } from './coerced-array-DRz3tqda.cjs';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
-import { T as TupleParts } from './tuple-parts-v6av7LMU.cjs';
-
-type FilteredArray<T extends IterableContainer, Condition> = T extends unknown ? [
-    ...FilteredFixedTuple<TupleParts<T>['required'], Condition>,
-    ...FilteredFixedTuple<TupleParts<T>['optional'], Condition>,
-    ...CoercedArray<SymmetricRefine<TupleParts<T>['item'], Condition>>,
-    ...FilteredFixedTuple<TupleParts<T>['suffix'], Condition>
-] : never;
-type FilteredFixedTuple<T, Condition, Output extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Rest] ? FilteredFixedTuple<Rest, Condition, Head extends Condition ? [
-    ...Output,
-    Head
-] : Head | Condition extends object ? Output : Condition extends Head ? // But for any other type (mostly primitives), if the condition
-Output | [...Output, Condition] : Output> : Output;
-type SymmetricRefine<Item, Condition> = Item extends Condition ? Item : Condition extends Item ? Condition : never;
-
-export type { FilteredArray as F };

package/dist/filtered-array-JKATL39M.d.ts

@@ -1,18 +0,0 @@
-import { C as CoercedArray } from './coerced-array-DRz3tqda.js';
-import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
-import { T as TupleParts } from './tuple-parts-BTivqbtT.js';
-
-type FilteredArray<T extends IterableContainer, Condition> = T extends unknown ? [
-    ...FilteredFixedTuple<TupleParts<T>['required'], Condition>,
-    ...FilteredFixedTuple<TupleParts<T>['optional'], Condition>,
-    ...CoercedArray<SymmetricRefine<TupleParts<T>['item'], Condition>>,
-    ...FilteredFixedTuple<TupleParts<T>['suffix'], Condition>
-] : never;
-type FilteredFixedTuple<T, Condition, Output extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Rest] ? FilteredFixedTuple<Rest, Condition, Head extends Condition ? [
-    ...Output,
-    Head
-] : Head | Condition extends object ? Output : Condition extends Head ? // But for any other type (mostly primitives), if the condition
-Output | [...Output, Condition] : Output> : Output;
-type SymmetricRefine<Item, Condition> = Item extends Condition ? Item : Condition extends Item ? Condition : never;
-
-export type { FilteredArray as F };

package/dist/if-D4QIikQ1.d.cts

@@ -1,5 +0,0 @@
-import { IsNever } from 'type-fest';
-
-type If<Type extends boolean, IfBranch, ElseBranch> = IsNever<Type> extends true ? ElseBranch : Type extends true ? IfBranch : ElseBranch;
-
-export type { If as I };

package/dist/if-D4QIikQ1.d.ts

@@ -1,5 +0,0 @@
-import { IsNever } from 'type-fest';
-
-type If<Type extends boolean, IfBranch, ElseBranch> = IsNever<Type> extends true ? ElseBranch : Type extends true ? IfBranch : ElseBranch;
-
-export type { If as I };

package/dist/int-range-inclusive-Cn-qsrAN.d.cts

@@ -1,12 +0,0 @@
-import { IntRange } from 'type-fest';
-
-/**
- * Type fest offers IntClosedRange which is a similar offering, but is
- * implemented in a way which makes it inefficient when the Step size is '1'
- * (as in our case). Their implementation can cause ts(2589) errors ('Type
- * instantiation is excessively deep and possibly infinite') errors when the
- * integers are large (even when the range itself is not).
- */
-type IntRangeInclusive<From extends number, To extends number> = IntRange<From, To> | To;
-
-export type { IntRangeInclusive as I };

package/dist/int-range-inclusive-Cn-qsrAN.d.ts

@@ -1,12 +0,0 @@
-import { IntRange } from 'type-fest';
-
-/**
- * Type fest offers IntClosedRange which is a similar offering, but is
- * implemented in a way which makes it inefficient when the Step size is '1'
- * (as in our case). Their implementation can cause ts(2589) errors ('Type
- * instantiation is excessively deep and possibly infinite') errors when the
- * integers are large (even when the range itself is not).
- */
-type IntRangeInclusive<From extends number, To extends number> = IntRange<From, To> | To;
-
-export type { IntRangeInclusive as I };

package/dist/is-bounded-record-C9WAwfA8.d.cts

@@ -1,30 +0,0 @@
-import { Or, IsStringLiteral, Split, IsNumericLiteral, IsSymbolLiteral, KeysOfUnion } from 'type-fest';
-
-/**
- * Checks if a type is a bounded key: a union of bounded strings, numeric
- * literals, or symbol literals.
- *
- * [For an interactive deeper dive and explanation see the following playground](https://www.typescriptlang.org/play/?noUncheckedIndexedAccess=true#code/PTAEBUAsEsGdQE4FMDGB7BATUdQCIAjNAVwDtMlM8AaHAF1EgEN4nQAzaU6OpUWJAzTtQAayQBPWADpQASQZMANrDSIkAR2LRk8HgHJYAKBCg0BAFaoGdNcwBufZUrMi6kJAFtpRuhIAOfABCJOSUoAC8oABKqBiYADwABv7InAAeAPoAJADeeB5KSmh4oAA++ADuGEpUAL5JtHiqnoIwpADmeAB8ANxGJmBQuMjoWDjweGREZBRUtDyMLKBMpDiknNy8-IKuoP5osLDQBEp84lKyCoaDZpbWoOjEtY9opHRMXKCkb3zCoO4vAC0GgfH5AqAAKqkGZhbBRWJjRIpNLQLJ5WB0BBcDoNJotNo4nr9W4AMQwK1IEggAC4IKAkOleOR4AAFJgIOjQZQJcDdUAEakUTZct60AjEGwedaOBACCbfNCKJSVJhSW5Y4hIWQAdQ8a0WuE1fEqfBQq34aoBzAY4AV0E8-iU0BQPCU1P8HK5ylAAApDcZTJptPZlEh3sDQOzOdylLzugBKXwBPhyWByR3O110d3R71xvmRKNe2PxhlM8OYeB2gD8+AkpTpeFIeBJpj14ZWKBQSCOOJW+wQaH8e0BAtCczuVhQtpTAGUUNj-AxzWtw7BiMhrUwGKlh7dGXA6Ho1mPzNPFOQGaQN1uePBwdqjBQUEoOWa3pjQEEAPKQgByAAiACigF0iEsyUP06A3gwsKTlEv4ASBgEANp4KkSAZJkhTFHgAC6-SmKAJEAHo1gM7b6l2PZ9p0A57iO-xjtME7hOe1i0JU1H6D80IoB4KDiJgchhOklAAILdr2sBJLcuDhkwpzhOA86LtAy6PBabzutet4mjaAIpvQoAAFSeNAHSQHQpkCkg4qSisKhoLcMHHBQCDWmaLAGUgd4MJgaC9qQ+gMIeX5fGe9wzrQqgmU8LzKHFBBILcSSQZslBJD4L5vlubkMABSFAaBdLQvBUFGAVoCsZB8JQv+xUoehmHYbhJSEbcJGgORlFDDAegPggWocBSpmmasEjjYOw57EVf4lYBvSgNxLqQKArSrA+hnODN-jwMItzzchoErFueDDqKpDKDQK0wAJCqMkwM66dxO6gEkealo+-zHYt3RyaYm03jsnirFy5pFBIy1xaa+jYIygQztaRpqMgdCbms+gSPoDkMIs6OY-AvH6AAhMmEJpuVbEiZmLpuhIX0+lEaYZk69M5ozJY8tTdV9F1PUUbcervbt7i4MDg3bvjaxg1SWkCLAtC9kjsa6e4hx8O4726MwEKrLcHHI6aG2WdZ3xIOEthLOQZzjnVlLYLVcLqEi8ACJ6CA7u6tCrJgrmrKF6i6W8OB09mrx+a6n7K44azcZ2gLUmD4g7De2rSD4QA).
- */
-type IsBounded<T> = (T extends unknown ? Or<IsBoundedString<T>, Or<IsNumericLiteral<T>, IsSymbolLiteral<T>>> : never) extends true ? true : false;
-/**
- * Literal strings can be unbounded when they are a template literal which
- * contains non-literal components (e.g. `prefix_${string}`), this is because
- * there are an infinite number of possible values that satisfy it.
- */
-type IsBoundedString<T> = T extends string ? IsStringLiteral<T> extends true ? Split<T, ''>[number] extends infer U ? [`${number}`] extends [U] ? false : [string] extends [U] ? false : true : false : false : false;
-
-/**
- * Check if a type is guaranteed to be a bounded record: a record with a finite
- * set of keys.
- *
- * See the docs for `IsBounded` to understand more.
- *
- * @example
- *   IsBoundedRecord<{ a: 1, 1: "a" }>; //=> true
- *   IsBoundedRecord<Record<string | number, unknown>>; //=> false
- *   IsBoundedRecord<Record<`prefix_${number}`, unknown>>; //=> false
- */
-type IsBoundedRecord<T> = IsBounded<KeysOfUnion<T>>;
-
-export type { IsBoundedRecord as I, IsBounded as a };

package/dist/is-bounded-record-C9WAwfA8.d.ts

@@ -1,30 +0,0 @@
-import { Or, IsStringLiteral, Split, IsNumericLiteral, IsSymbolLiteral, KeysOfUnion } from 'type-fest';
-
-/**
- * Checks if a type is a bounded key: a union of bounded strings, numeric
- * literals, or symbol literals.
- *
- * [For an interactive deeper dive and explanation see the following playground](https://www.typescriptlang.org/play/?noUncheckedIndexedAccess=true#code/PTAEBUAsEsGdQE4FMDGB7BATUdQCIAjNAVwDtMlM8AaHAF1EgEN4nQAzaU6OpUWJAzTtQAayQBPWADpQASQZMANrDSIkAR2LRk8HgHJYAKBCg0BAFaoGdNcwBufZUrMi6kJAFtpRuhIAOfABCJOSUoAC8oABKqBiYADwABv7InAAeAPoAJADeeB5KSmh4oAA++ADuGEpUAL5JtHiqnoIwpADmeAB8ANxGJmBQuMjoWDjweGREZBRUtDyMLKBMpDiknNy8-IKuoP5osLDQBEp84lKyCoaDZpbWoOjEtY9opHRMXKCkb3zCoO4vAC0GgfH5AqAAKqkGZhbBRWJjRIpNLQLJ5WB0BBcDoNJotNo4nr9W4AMQwK1IEggAC4IKAkOleOR4AAFJgIOjQZQJcDdUAEakUTZct60AjEGwedaOBACCbfNCKJSVJhSW5Y4hIWQAdQ8a0WuE1fEqfBQq34aoBzAY4AV0E8-iU0BQPCU1P8HK5ylAAApDcZTJptPZlEh3sDQOzOdylLzugBKXwBPhyWByR3O110d3R71xvmRKNe2PxhlM8OYeB2gD8+AkpTpeFIeBJpj14ZWKBQSCOOJW+wQaH8e0BAtCczuVhQtpTAGUUNj-AxzWtw7BiMhrUwGKlh7dGXA6Ho1mPzNPFOQGaQN1uePBwdqjBQUEoOWa3pjQEEAPKQgByAAiACigF0iEsyUP06A3gwsKTlEv4ASBgEANp4KkSAZJkhTFHgAC6-SmKAJEAHo1gM7b6l2PZ9p0A57iO-xjtME7hOe1i0JU1H6D80IoB4KDiJgchhOklAAILdr2sBJLcuDhkwpzhOA86LtAy6PBabzutet4mjaAIpvQoAAFSeNAHSQHQpkCkg4qSisKhoLcMHHBQCDWmaLAGUgd4MJgaC9qQ+gMIeX5fGe9wzrQqgmU8LzKHFBBILcSSQZslBJD4L5vlubkMABSFAaBdLQvBUFGAVoCsZB8JQv+xUoehmHYbhJSEbcJGgORlFDDAegPggWocBSpmmasEjjYOw57EVf4lYBvSgNxLqQKArSrA+hnODN-jwMItzzchoErFueDDqKpDKDQK0wAJCqMkwM66dxO6gEkealo+-zHYt3RyaYm03jsnirFy5pFBIy1xaa+jYIygQztaRpqMgdCbms+gSPoDkMIs6OY-AvH6AAhMmEJpuVbEiZmLpuhIX0+lEaYZk69M5ozJY8tTdV9F1PUUbcervbt7i4MDg3bvjaxg1SWkCLAtC9kjsa6e4hx8O4726MwEKrLcHHI6aG2WdZ3xIOEthLOQZzjnVlLYLVcLqEi8ACJ6CA7u6tCrJgrmrKF6i6W8OB09mrx+a6n7K44azcZ2gLUmD4g7De2rSD4QA).
- */
-type IsBounded<T> = (T extends unknown ? Or<IsBoundedString<T>, Or<IsNumericLiteral<T>, IsSymbolLiteral<T>>> : never) extends true ? true : false;
-/**
- * Literal strings can be unbounded when they are a template literal which
- * contains non-literal components (e.g. `prefix_${string}`), this is because
- * there are an infinite number of possible values that satisfy it.
- */
-type IsBoundedString<T> = T extends string ? IsStringLiteral<T> extends true ? Split<T, ''>[number] extends infer U ? [`${number}`] extends [U] ? false : [string] extends [U] ? false : true : false : false : false;
-
-/**
- * Check if a type is guaranteed to be a bounded record: a record with a finite
- * set of keys.
- *
- * See the docs for `IsBounded` to understand more.
- *
- * @example
- *   IsBoundedRecord<{ a: 1, 1: "a" }>; //=> true
- *   IsBoundedRecord<Record<string | number, unknown>>; //=> false
- *   IsBoundedRecord<Record<`prefix_${number}`, unknown>>; //=> false
- */
-type IsBoundedRecord<T> = IsBounded<KeysOfUnion<T>>;
-
-export type { IsBoundedRecord as I, IsBounded as a };

package/dist/is-union-Bx34mF34.d.cts

@@ -1,6 +0,0 @@
-import { IsNever } from 'type-fest';
-
-type IsUnion<T> = InternalIsUnion<T>;
-type InternalIsUnion<T, U = T> = (IsNever<T> extends true ? false : T extends any ? [U] extends [T] ? false : true : never) extends infer Result ? boolean extends Result ? true : Result : never;
-
-export type { IsUnion as I };

package/dist/is-union-Bx34mF34.d.ts

@@ -1,6 +0,0 @@
-import { IsNever } from 'type-fest';
-
-type IsUnion<T> = InternalIsUnion<T>;
-type InternalIsUnion<T, U = T> = (IsNever<T> extends true ? false : T extends any ? [U] extends [T] ? false : true : never) extends infer Result ? boolean extends Result ? true : Result : never;
-
-export type { IsUnion as I };

package/dist/iterable-container-BTpDVdNc.d.cts

@@ -1,15 +0,0 @@
-/**
- * This should only be used for defining generics which extend any kind of JS
- * array under the hood, this includes arrays *AND* tuples (of the form [x, y],
- * and of the form [x, ...y[]], etc...), and their readonly equivalent. This
- * allows us to be more inclusive to what functions can process.
- *
- * @example
- *   function map<T extends IterableContainer>(items: T) { ... }
- *
- * We would've named this `ArrayLike`, but that's already used by typescript...
- * @see This was inspired by the type-definition of Promise.all (https://github.com/microsoft/TypeScript/blob/1df5717b120cddd325deab8b0f2b2c3eecaf2b01/src/lib/es2015.promise.d.ts#L21)
- */
-type IterableContainer<T = unknown> = readonly [] | ReadonlyArray<T>;
-
-export type { IterableContainer as I };

package/dist/iterable-container-BTpDVdNc.d.ts

@@ -1,15 +0,0 @@
-/**
- * This should only be used for defining generics which extend any kind of JS
- * array under the hood, this includes arrays *AND* tuples (of the form [x, y],
- * and of the form [x, ...y[]], etc...), and their readonly equivalent. This
- * allows us to be more inclusive to what functions can process.
- *
- * @example
- *   function map<T extends IterableContainer>(items: T) { ... }
- *
- * We would've named this `ArrayLike`, but that's already used by typescript...
- * @see This was inspired by the type-definition of Promise.all (https://github.com/microsoft/TypeScript/blob/1df5717b120cddd325deab8b0f2b2c3eecaf2b01/src/lib/es2015.promise.d.ts#L21)
- */
-type IterableContainer<T = unknown> = readonly [] | ReadonlyArray<T>;
-
-export type { IterableContainer as I };

package/dist/magic-string.es-2ADFIHOO.cjs

@@ -1,13 +0,0 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});require('./chunk-MBGSSEZN.cjs');var y="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",L=new Uint8Array(64),N=new Uint8Array(128);for(let l=0;l<y.length;l++){let t=y.charCodeAt(l);L[l]=t,N[t]=l}function d(l,t,e){let n=t-e;n=n<0?-n<<1|1:n<<1;do{let i=n&31;n>>>=5,n>0&&(i|=32),l.write(L[i])}while(n>0);return t}var E=1024*16,v=typeof TextDecoder<"u"?new TextDecoder:typeof Buffer<"u"?{decode(l){return Buffer.from(l.buffer,l.byteOffset,l.byteLength).toString()}}:{decode(l){let t="";for(let e=0;e<l.length;e++)t+=String.fromCharCode(l[e]);return t}},S=class{constructor(){this.pos=0,this.out="",this.buffer=new Uint8Array(E)}write(t){let{buffer:e}=this;e[this.pos++]=t,this.pos===E&&(this.out+=v.decode(e),this.pos=0)}flush(){let{buffer:t,out:e,pos:n}=this;return n>0?e+v.decode(t.subarray(0,n)):e}};function k(l){let t=new S,e=0,n=0,i=0,r=0;for(let s=0;s<l.length;s++){let h=l[s];if(s>0&&t.write(59),h.length===0)continue;let o=0;for(let u=0;u<h.length;u++){let a=h[u];u>0&&t.write(44),o=d(t,a[0],o),a.length!==1&&(e=d(t,a[1],e),n=d(t,a[2],n),i=d(t,a[3],i),a.length!==4&&(r=d(t,a[4],r)))}}return t.flush()}var p=class l{constructor(t){this.bits=t instanceof l?t.bits.slice():[]}add(t){this.bits[t>>5]|=1<<(t&31)}has(t){return!!(this.bits[t>>5]&1<<(t&31))}},m=class l{constructor(t,e,n){this.start=t,this.end=e,this.original=n,this.intro="",this.outro="",this.content=n,this.storeName=!1,this.edited=!1,this.previous=null,this.next=null}appendLeft(t){this.outro+=t}appendRight(t){this.intro=this.intro+t}clone(){let t=new l(this.start,this.end,this.original);return t.intro=this.intro,t.outro=this.outro,t.content=this.content,t.storeName=this.storeName,t.edited=this.edited,t}contains(t){return this.start<t&&t<this.end}eachNext(t){let e=this;for(;e;)t(e),e=e.next}eachPrevious(t){let e=this;for(;e;)t(e),e=e.previous}edit(t,e,n){return this.content=t,n||(this.intro="",this.outro=""),this.storeName=e,this.edited=!0,this}prependLeft(t){this.outro=t+this.outro}prependRight(t){this.intro=t+this.intro}reset(){this.intro="",this.outro="",this.edited&&(this.content=this.original,this.storeName=!1,this.edited=!1)}split(t){let e=t-this.start,n=this.original.slice(0,e),i=this.original.slice(e);this.original=n;let r=new l(t,this.end,i);return r.outro=this.outro,this.outro="",this.end=t,this.edited?(r.edit("",!1),this.content=""):this.content=n,r.next=this.next,r.next&&(r.next.previous=r),r.previous=this,this.next=r,r}toString(){return this.intro+this.content+this.outro}trimEnd(t){if(this.outro=this.outro.replace(t,""),this.outro.length)return!0;let e=this.content.replace(t,"");if(e.length)return e!==this.content&&(this.split(this.start+e.length).edit("",void 0,!0),this.edited&&this.edit(e,this.storeName,!0)),!0;if(this.edit("",void 0,!0),this.intro=this.intro.replace(t,""),this.intro.length)return!0}trimStart(t){if(this.intro=this.intro.replace(t,""),this.intro.length)return!0;let e=this.content.replace(t,"");if(e.length){if(e!==this.content){let n=this.split(this.end-e.length);this.edited&&n.edit(e,this.storeName,!0),this.edit("",void 0,!0)}return!0}else if(this.edit("",void 0,!0),this.outro=this.outro.replace(t,""),this.outro.length)return!0}};function A(){return typeof globalThis<"u"&&typeof globalThis.btoa=="function"?l=>globalThis.btoa(unescape(encodeURIComponent(l))):typeof Buffer=="function"?l=>Buffer.from(l,"utf-8").toString("base64"):()=>{throw new Error("Unsupported environment: `window.btoa` or `Buffer` should be supported.")}}var j=A(),w= exports.SourceMap =class{constructor(t){this.version=3,this.file=t.file,this.sources=t.sources,this.sourcesContent=t.sourcesContent,this.names=t.names,this.mappings=k(t.mappings),typeof t.x_google_ignoreList<"u"&&(this.x_google_ignoreList=t.x_google_ignoreList),typeof t.debugId<"u"&&(this.debugId=t.debugId)}toString(){return JSON.stringify(this)}toUrl(){return"data:application/json;charset=utf-8;base64,"+j(this.toString())}};function $(l){let t=l.split(`
-`),e=t.filter(r=>/^\t+/.test(r)),n=t.filter(r=>/^ {2,}/.test(r));if(e.length===0&&n.length===0)return null;if(e.length>=n.length)return"	";let i=n.reduce((r,s)=>{let h=/^ +/.exec(s)[0].length;return Math.min(h,r)},1/0);return new Array(i+1).join(" ")}function O(l,t){let e=l.split(/[/\\]/),n=t.split(/[/\\]/);for(e.pop();e[0]===n[0];)e.shift(),n.shift();if(e.length){let i=e.length;for(;i--;)e[i]=".."}return e.concat(n).join("/")}var q=Object.prototype.toString;function _(l){return q.call(l)==="[object Object]"}function x(l){let t=l.split(`
-`),e=[];for(let n=0,i=0;n<t.length;n++)e.push(i),i+=t[n].length+1;return function(i){let r=0,s=e.length;for(;r<s;){let u=r+s>>1;i<e[u]?s=u:r=u+1}let h=r-1,o=i-e[h];return{line:h,column:o}}}var T=/\w/,b=class{constructor(t){this.hires=t,this.generatedCodeLine=0,this.generatedCodeColumn=0,this.raw=[],this.rawSegments=this.raw[this.generatedCodeLine]=[],this.pending=null}addEdit(t,e,n,i){if(e.length){let r=e.length-1,s=e.indexOf(`
-`,0),h=-1;for(;s>=0&&r>s;){let u=[this.generatedCodeColumn,t,n.line,n.column];i>=0&&u.push(i),this.rawSegments.push(u),this.generatedCodeLine+=1,this.raw[this.generatedCodeLine]=this.rawSegments=[],this.generatedCodeColumn=0,h=s,s=e.indexOf(`
-`,s+1)}let o=[this.generatedCodeColumn,t,n.line,n.column];i>=0&&o.push(i),this.rawSegments.push(o),this.advance(e.slice(h+1))}else this.pending&&(this.rawSegments.push(this.pending),this.advance(e));this.pending=null}addUneditedChunk(t,e,n,i,r){let s=e.start,h=!0,o=!1;for(;s<e.end;){if(n[s]===`
-`)i.line+=1,i.column=0,this.generatedCodeLine+=1,this.raw[this.generatedCodeLine]=this.rawSegments=[],this.generatedCodeColumn=0,h=!0,o=!1;else{if(this.hires||h||r.has(s)){let u=[this.generatedCodeColumn,t,i.line,i.column];this.hires==="boundary"?T.test(n[s])?o||(this.rawSegments.push(u),o=!0):(this.rawSegments.push(u),o=!1):this.rawSegments.push(u)}i.column+=1,this.generatedCodeColumn+=1,h=!1}s+=1}this.pending=null}advance(t){if(!t)return;let e=t.split(`
-`);if(e.length>1){for(let n=0;n<e.length-1;n++)this.generatedCodeLine++,this.raw[this.generatedCodeLine]=this.rawSegments=[];this.generatedCodeColumn=0}this.generatedCodeColumn+=e[e.length-1].length}},g=`
-`,f={insertLeft:!1,insertRight:!1,storeName:!1},C= exports.default =class l{constructor(t,e={}){let n=new m(0,t.length,t);Object.defineProperties(this,{original:{writable:!0,value:t},outro:{writable:!0,value:""},intro:{writable:!0,value:""},firstChunk:{writable:!0,value:n},lastChunk:{writable:!0,value:n},lastSearchedChunk:{writable:!0,value:n},byStart:{writable:!0,value:{}},byEnd:{writable:!0,value:{}},filename:{writable:!0,value:e.filename},indentExclusionRanges:{writable:!0,value:e.indentExclusionRanges},sourcemapLocations:{writable:!0,value:new p},storedNames:{writable:!0,value:{}},indentStr:{writable:!0,value:void 0},ignoreList:{writable:!0,value:e.ignoreList},offset:{writable:!0,value:e.offset||0}}),this.byStart[0]=n,this.byEnd[t.length]=n}addSourcemapLocation(t){this.sourcemapLocations.add(t)}append(t){if(typeof t!="string")throw new TypeError("outro content must be a string");return this.outro+=t,this}appendLeft(t,e){if(t=t+this.offset,typeof e!="string")throw new TypeError("inserted content must be a string");this._split(t);let n=this.byEnd[t];return n?n.appendLeft(e):this.intro+=e,this}appendRight(t,e){if(t=t+this.offset,typeof e!="string")throw new TypeError("inserted content must be a string");this._split(t);let n=this.byStart[t];return n?n.appendRight(e):this.outro+=e,this}clone(){let t=new l(this.original,{filename:this.filename,offset:this.offset}),e=this.firstChunk,n=t.firstChunk=t.lastSearchedChunk=e.clone();for(;e;){t.byStart[n.start]=n,t.byEnd[n.end]=n;let i=e.next,r=i&&i.clone();r&&(n.next=r,r.previous=n,n=r),e=i}return t.lastChunk=n,this.indentExclusionRanges&&(t.indentExclusionRanges=this.indentExclusionRanges.slice()),t.sourcemapLocations=new p(this.sourcemapLocations),t.intro=this.intro,t.outro=this.outro,t}generateDecodedMap(t){t=t||{};let e=0,n=Object.keys(this.storedNames),i=new b(t.hires),r=x(this.original);return this.intro&&i.advance(this.intro),this.firstChunk.eachNext(s=>{let h=r(s.start);s.intro.length&&i.advance(s.intro),s.edited?i.addEdit(e,s.content,h,s.storeName?n.indexOf(s.original):-1):i.addUneditedChunk(e,s,this.original,h,this.sourcemapLocations),s.outro.length&&i.advance(s.outro)}),{file:t.file?t.file.split(/[/\\]/).pop():void 0,sources:[t.source?O(t.file||"",t.source):t.file||""],sourcesContent:t.includeContent?[this.original]:void 0,names:n,mappings:i.raw,x_google_ignoreList:this.ignoreList?[e]:void 0}}generateMap(t){return new w(this.generateDecodedMap(t))}_ensureindentStr(){this.indentStr===void 0&&(this.indentStr=$(this.original))}_getRawIndentString(){return this._ensureindentStr(),this.indentStr}getIndentString(){return this._ensureindentStr(),this.indentStr===null?"	":this.indentStr}indent(t,e){let n=/^[^\r\n]/gm;if(_(t)&&(e=t,t=void 0),t===void 0&&(this._ensureindentStr(),t=this.indentStr||"	"),t==="")return this;e=e||{};let i={};e.exclude&&(typeof e.exclude[0]=="number"?[e.exclude]:e.exclude).forEach(a=>{for(let c=a[0];c<a[1];c+=1)i[c]=!0});let r=e.indentStart!==!1,s=u=>r?`${t}${u}`:(r=!0,u);this.intro=this.intro.replace(n,s);let h=0,o=this.firstChunk;for(;o;){let u=o.end;if(o.edited)i[h]||(o.content=o.content.replace(n,s),o.content.length&&(r=o.content[o.content.length-1]===`
-`));else for(h=o.start;h<u;){if(!i[h]){let a=this.original[h];a===`
-`?r=!0:a!=="\r"&&r&&(r=!1,h===o.start||(this._splitChunk(o,h),o=o.next),o.prependRight(t))}h+=1}h=o.end,o=o.next}return this.outro=this.outro.replace(n,s),this}insert(){throw new Error("magicString.insert(...) is deprecated. Use prependRight(...) or appendLeft(...)")}insertLeft(t,e){return f.insertLeft||(console.warn("magicString.insertLeft(...) is deprecated. Use magicString.appendLeft(...) instead"),f.insertLeft=!0),this.appendLeft(t,e)}insertRight(t,e){return f.insertRight||(console.warn("magicString.insertRight(...) is deprecated. Use magicString.prependRight(...) instead"),f.insertRight=!0),this.prependRight(t,e)}move(t,e,n){if(t=t+this.offset,e=e+this.offset,n=n+this.offset,n>=t&&n<=e)throw new Error("Cannot move a selection inside itself");this._split(t),this._split(e),this._split(n);let i=this.byStart[t],r=this.byEnd[e],s=i.previous,h=r.next,o=this.byStart[n];if(!o&&r===this.lastChunk)return this;let u=o?o.previous:this.lastChunk;return s&&(s.next=h),h&&(h.previous=s),u&&(u.next=i),o&&(o.previous=r),i.previous||(this.firstChunk=r.next),r.next||(this.lastChunk=i.previous,this.lastChunk.next=null),i.previous=u,r.next=o||null,u||(this.firstChunk=i),o||(this.lastChunk=r),this}overwrite(t,e,n,i){return i=i||{},this.update(t,e,n,{...i,overwrite:!i.contentOnly})}update(t,e,n,i){if(t=t+this.offset,e=e+this.offset,typeof n!="string")throw new TypeError("replacement content must be a string");if(this.original.length!==0){for(;t<0;)t+=this.original.length;for(;e<0;)e+=this.original.length}if(e>this.original.length)throw new Error("end is out of bounds");if(t===e)throw new Error("Cannot overwrite a zero-length range \u2013 use appendLeft or prependRight instead");this._split(t),this._split(e),i===!0&&(f.storeName||(console.warn("The final argument to magicString.overwrite(...) should be an options object. See https://github.com/rich-harris/magic-string"),f.storeName=!0),i={storeName:!0});let r=i!==void 0?i.storeName:!1,s=i!==void 0?i.overwrite:!1;if(r){let u=this.original.slice(t,e);Object.defineProperty(this.storedNames,u,{writable:!0,value:!0,enumerable:!0})}let h=this.byStart[t],o=this.byEnd[e];if(h){let u=h;for(;u!==o;){if(u.next!==this.byStart[u.end])throw new Error("Cannot overwrite across a split point");u=u.next,u.edit("",!1)}h.edit(n,r,!s)}else{let u=new m(t,e,"").edit(n,r);o.next=u,u.previous=o}return this}prepend(t){if(typeof t!="string")throw new TypeError("outro content must be a string");return this.intro=t+this.intro,this}prependLeft(t,e){if(t=t+this.offset,typeof e!="string")throw new TypeError("inserted content must be a string");this._split(t);let n=this.byEnd[t];return n?n.prependLeft(e):this.intro=e+this.intro,this}prependRight(t,e){if(t=t+this.offset,typeof e!="string")throw new TypeError("inserted content must be a string");this._split(t);let n=this.byStart[t];return n?n.prependRight(e):this.outro=e+this.outro,this}remove(t,e){if(t=t+this.offset,e=e+this.offset,this.original.length!==0){for(;t<0;)t+=this.original.length;for(;e<0;)e+=this.original.length}if(t===e)return this;if(t<0||e>this.original.length)throw new Error("Character is out of bounds");if(t>e)throw new Error("end must be greater than start");this._split(t),this._split(e);let n=this.byStart[t];for(;n;)n.intro="",n.outro="",n.edit(""),n=e>n.end?this.byStart[n.end]:null;return this}reset(t,e){if(t=t+this.offset,e=e+this.offset,this.original.length!==0){for(;t<0;)t+=this.original.length;for(;e<0;)e+=this.original.length}if(t===e)return this;if(t<0||e>this.original.length)throw new Error("Character is out of bounds");if(t>e)throw new Error("end must be greater than start");this._split(t),this._split(e);let n=this.byStart[t];for(;n;)n.reset(),n=e>n.end?this.byStart[n.end]:null;return this}lastChar(){if(this.outro.length)return this.outro[this.outro.length-1];let t=this.lastChunk;do{if(t.outro.length)return t.outro[t.outro.length-1];if(t.content.length)return t.content[t.content.length-1];if(t.intro.length)return t.intro[t.intro.length-1]}while(t=t.previous);return this.intro.length?this.intro[this.intro.length-1]:""}lastLine(){let t=this.outro.lastIndexOf(g);if(t!==-1)return this.outro.substr(t+1);let e=this.outro,n=this.lastChunk;do{if(n.outro.length>0){if(t=n.outro.lastIndexOf(g),t!==-1)return n.outro.substr(t+1)+e;e=n.outro+e}if(n.content.length>0){if(t=n.content.lastIndexOf(g),t!==-1)return n.content.substr(t+1)+e;e=n.content+e}if(n.intro.length>0){if(t=n.intro.lastIndexOf(g),t!==-1)return n.intro.substr(t+1)+e;e=n.intro+e}}while(n=n.previous);return t=this.intro.lastIndexOf(g),t!==-1?this.intro.substr(t+1)+e:this.intro+e}slice(t=0,e=this.original.length-this.offset){if(t=t+this.offset,e=e+this.offset,this.original.length!==0){for(;t<0;)t+=this.original.length;for(;e<0;)e+=this.original.length}let n="",i=this.firstChunk;for(;i&&(i.start>t||i.end<=t);){if(i.start<e&&i.end>=e)return n;i=i.next}if(i&&i.edited&&i.start!==t)throw new Error(`Cannot use replaced character ${t} as slice start anchor.`);let r=i;for(;i;){i.intro&&(r!==i||i.start===t)&&(n+=i.intro);let s=i.start<e&&i.end>=e;if(s&&i.edited&&i.end!==e)throw new Error(`Cannot use replaced character ${e} as slice end anchor.`);let h=r===i?t-i.start:0,o=s?i.content.length+e-i.end:i.content.length;if(n+=i.content.slice(h,o),i.outro&&(!s||i.end===e)&&(n+=i.outro),s)break;i=i.next}return n}snip(t,e){let n=this.clone();return n.remove(0,t),n.remove(e,n.original.length),n}_split(t){if(this.byStart[t]||this.byEnd[t])return;let e=this.lastSearchedChunk,n=t>e.end;for(;e;){if(e.contains(t))return this._splitChunk(e,t);e=n?this.byStart[e.end]:this.byEnd[e.start]}}_splitChunk(t,e){if(t.edited&&t.content.length){let i=x(this.original)(e);throw new Error(`Cannot split a chunk that has already been edited (${i.line}:${i.column} \u2013 "${t.original}")`)}let n=t.split(e);return this.byEnd[e]=t,this.byStart[e]=n,this.byEnd[n.end]=n,t===this.lastChunk&&(this.lastChunk=n),this.lastSearchedChunk=t,!0}toString(){let t=this.intro,e=this.firstChunk;for(;e;)t+=e.toString(),e=e.next;return t+this.outro}isEmpty(){let t=this.firstChunk;do if(t.intro.length&&t.intro.trim()||t.content.length&&t.content.trim()||t.outro.length&&t.outro.trim())return!1;while(t=t.next);return!0}length(){let t=this.firstChunk,e=0;do e+=t.intro.length+t.content.length+t.outro.length;while(t=t.next);return e}trimLines(){return this.trim("[\\r\\n]")}trim(t){return this.trimStart(t).trimEnd(t)}trimEndAborted(t){let e=new RegExp((t||"\\s")+"+$");if(this.outro=this.outro.replace(e,""),this.outro.length)return!0;let n=this.lastChunk;do{let i=n.end,r=n.trimEnd(e);if(n.end!==i&&(this.lastChunk===n&&(this.lastChunk=n.next),this.byEnd[n.end]=n,this.byStart[n.next.start]=n.next,this.byEnd[n.next.end]=n.next),r)return!0;n=n.previous}while(n);return!1}trimEnd(t){return this.trimEndAborted(t),this}trimStartAborted(t){let e=new RegExp("^"+(t||"\\s")+"+");if(this.intro=this.intro.replace(e,""),this.intro.length)return!0;let n=this.firstChunk;do{let i=n.end,r=n.trimStart(e);if(n.end!==i&&(n===this.lastChunk&&(this.lastChunk=n.next),this.byEnd[n.end]=n,this.byStart[n.next.start]=n.next,this.byEnd[n.next.end]=n.next),r)return!0;n=n.next}while(n);return!1}trimStart(t){return this.trimStartAborted(t),this}hasChanged(){return this.original!==this.toString()}_replaceRegexp(t,e){function n(r,s){return typeof e=="string"?e.replace(/\$(\$|&|\d+)/g,(h,o)=>o==="$"?"$":o==="&"?r[0]:+o<r.length?r[+o]:`$${o}`):e(...r,r.index,s,r.groups)}function i(r,s){let h,o=[];for(;h=r.exec(s);)o.push(h);return o}if(t.global)i(t,this.original).forEach(s=>{if(s.index!=null){let h=n(s,this.original);h!==s[0]&&this.overwrite(s.index,s.index+s[0].length,h)}});else{let r=this.original.match(t);if(r&&r.index!=null){let s=n(r,this.original);s!==r[0]&&this.overwrite(r.index,r.index+r[0].length,s)}}return this}_replaceString(t,e){let{original:n}=this,i=n.indexOf(t);return i!==-1&&this.overwrite(i,i+t.length,e),this}replace(t,e){return typeof t=="string"?this._replaceString(t,e):this._replaceRegexp(t,e)}_replaceAllString(t,e){let{original:n}=this,i=t.length;for(let r=n.indexOf(t);r!==-1;r=n.indexOf(t,r+i))n.slice(r,r+i)!==e&&this.overwrite(r,r+i,e);return this}replaceAll(t,e){if(typeof t=="string")return this._replaceAllString(t,e);if(!t.global)throw new TypeError("MagicString.prototype.replaceAll called with a non-global RegExp argument");return this._replaceRegexp(t,e)}},R=Object.prototype.hasOwnProperty,I= exports.Bundle =class l{constructor(t={}){this.intro=t.intro||"",this.separator=t.separator!==void 0?t.separator:`
-`,this.sources=[],this.uniqueSources=[],this.uniqueSourceIndexByFilename={}}addSource(t){if(t instanceof C)return this.addSource({content:t,filename:t.filename,separator:this.separator});if(!_(t)||!t.content)throw new Error("bundle.addSource() takes an object with a `content` property, which should be an instance of MagicString, and an optional `filename`");if(["filename","ignoreList","indentExclusionRanges","separator"].forEach(e=>{R.call(t,e)||(t[e]=t.content[e])}),t.separator===void 0&&(t.separator=this.separator),t.filename)if(!R.call(this.uniqueSourceIndexByFilename,t.filename))this.uniqueSourceIndexByFilename[t.filename]=this.uniqueSources.length,this.uniqueSources.push({filename:t.filename,content:t.content.original});else{let e=this.uniqueSources[this.uniqueSourceIndexByFilename[t.filename]];if(t.content.original!==e.content)throw new Error(`Illegal source: same filename (${t.filename}), different contents`)}return this.sources.push(t),this}append(t,e){return this.addSource({content:new C(t),separator:e&&e.separator||""}),this}clone(){let t=new l({intro:this.intro,separator:this.separator});return this.sources.forEach(e=>{t.addSource({filename:e.filename,content:e.content.clone(),separator:e.separator})}),t}generateDecodedMap(t={}){let e=[],n;this.sources.forEach(r=>{Object.keys(r.content.storedNames).forEach(s=>{~e.indexOf(s)||e.push(s)})});let i=new b(t.hires);return this.intro&&i.advance(this.intro),this.sources.forEach((r,s)=>{s>0&&i.advance(this.separator);let h=r.filename?this.uniqueSourceIndexByFilename[r.filename]:-1,o=r.content,u=x(o.original);o.intro&&i.advance(o.intro),o.firstChunk.eachNext(a=>{let c=u(a.start);a.intro.length&&i.advance(a.intro),r.filename?a.edited?i.addEdit(h,a.content,c,a.storeName?e.indexOf(a.original):-1):i.addUneditedChunk(h,a,o.original,c,o.sourcemapLocations):i.advance(a.content),a.outro.length&&i.advance(a.outro)}),o.outro&&i.advance(o.outro),r.ignoreList&&h!==-1&&(n===void 0&&(n=[]),n.push(h))}),{file:t.file?t.file.split(/[/\\]/).pop():void 0,sources:this.uniqueSources.map(r=>t.file?O(t.file,r.filename):r.filename),sourcesContent:this.uniqueSources.map(r=>t.includeContent?r.content:null),names:e,mappings:i.raw,x_google_ignoreList:n}}generateMap(t){return new w(this.generateDecodedMap(t))}getIndentString(){let t={};return this.sources.forEach(e=>{let n=e.content._getRawIndentString();n!==null&&(t[n]||(t[n]=0),t[n]+=1)}),Object.keys(t).sort((e,n)=>t[e]-t[n])[0]||"	"}indent(t){if(arguments.length||(t=this.getIndentString()),t==="")return this;let e=!this.intro||this.intro.slice(-1)===`
-`;return this.sources.forEach((n,i)=>{let r=n.separator!==void 0?n.separator:this.separator,s=e||i>0&&/\r?\n$/.test(r);n.content.indent(t,{exclude:n.indentExclusionRanges,indentStart:s}),e=n.content.lastChar()===`
-`}),this.intro&&(this.intro=t+this.intro.replace(/^[^\n]/gm,(n,i)=>i>0?t+n:n)),this}prepend(t){return this.intro=t+this.intro,this}toString(){let t=this.sources.map((e,n)=>{let i=e.separator!==void 0?e.separator:this.separator;return(n>0?i:"")+e.content.toString()}).join("");return this.intro+t}isEmpty(){return!(this.intro.length&&this.intro.trim()||this.sources.some(t=>!t.content.isEmpty()))}length(){return this.sources.reduce((t,e)=>t+e.content.length(),this.intro.length)}trimLines(){return this.trim("[\\r\\n]")}trim(t){return this.trimStart(t).trimEnd(t)}trimStart(t){let e=new RegExp("^"+(t||"\\s")+"+");if(this.intro=this.intro.replace(e,""),!this.intro){let n,i=0;do if(n=this.sources[i++],!n)break;while(!n.content.trimStartAborted(t))}return this}trimEnd(t){let e=new RegExp((t||"\\s")+"+$"),n,i=this.sources.length-1;do if(n=this.sources[i--],!n){this.intro=this.intro.replace(e,"");break}while(!n.content.trimEndAborted(t));return this}};exports.Bundle = I; exports.SourceMap = w; exports.default = C;