npm - @weavelogic/knowledge-graph-agent - Versions diffs - 0.6.0 → 0.7.1 - Mend

@weavelogic/knowledge-graph-agent 0.6.0 → 0.7.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (219) hide show

package/dist/node_modules/@xenova/transformers/src/utils/tensor.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"tensor.js","sources":["../../../../../../node_modules/@xenova/transformers/src/utils/tensor.js"],"sourcesContent":["/**\n * @file Helper module for `Tensor` processing.\n * \n * These functions and classes are only used internally, \n * meaning an end-user shouldn't need to access anything here.\n * \n * @module utils/tensor\n */\n\nimport { ONNX } from '../backends/onnx.js';\n\nimport {\n interpolate_data,\n permute_data\n} from './maths.js';\n\n\nconst DataTypeMap = Object.freeze({\n float32: Float32Array,\n float64: Float64Array,\n string: Array, // string[]\n int8: Int8Array,\n uint8: Uint8Array,\n int16: Int16Array,\n uint16: Uint16Array,\n int32: Int32Array,\n uint32: Uint32Array,\n int64: BigInt64Array,\n uint64: BigUint64Array,\n bool: Uint8Array,\n});\n\n/**\n * @typedef {keyof typeof DataTypeMap} DataType\n * @typedef {import('./maths.js').AnyTypedArray | any[]} DataArray\n */\n\nconst ONNXTensor = ONNX.Tensor;\n\nexport class Tensor {\n /** @type {number[]} Dimensions of the tensor. */\n dims;\n\n /** @type {DataType} Type of the tensor. */\n type;\n\n /** @type {DataArray} The data stored in the tensor. */\n data;\n\n /** @type {number} The number of elements in the tensor. */\n size;\n\n /**\n * Create a new Tensor or copy an existing Tensor.\n * @param {[DataType, DataArray, number[]]|[import('onnxruntime-common').Tensor]} args\n */\n constructor(...args) {\n if (args[0] instanceof ONNXTensor) {\n // Create shallow copy\n Object.assign(this, args[0]);\n\n } else {\n // Create new tensor\n Object.assign(this, new ONNXTensor(\n /** @type {DataType} */(args[0]),\n /** @type {Exclude<import('./maths.js').AnyTypedArray, Uint8ClampedArray>} */(args[1]),\n args[2]\n ));\n }\n\n return new Proxy(this, {\n get: (obj, key) => {\n if (typeof key === 'string') {\n let index = Number(key);\n if (Number.isInteger(index)) {\n // key is an integer (i.e., index)\n return obj._getitem(index);\n }\n }\n // @ts-ignore\n return obj[key];\n },\n set: (obj, key, value) => {\n // TODO allow setting of data\n\n // @ts-ignore\n return obj[key] = value;\n }\n });\n }\n\n /**\n * Returns an iterator object for iterating over the tensor data in row-major order.\n * If the tensor has more than one dimension, the iterator will yield subarrays.\n * @returns {Iterator} An iterator object for iterating over the tensor data in row-major order.\n */\n *[Symbol.iterator]() {\n const [iterLength, ...iterDims] = this.dims;\n\n if (iterDims.length > 0) {\n const iterSize = iterDims.reduce((a, b) => a * b);\n for (let i = 0; i < iterLength; ++i) {\n yield this._subarray(i, iterSize, iterDims);\n }\n } else {\n yield* this.data\n }\n\n }\n\n /**\n * Index into a Tensor object.\n * @param {number} index The index to access.\n * @returns {Tensor} The data at the specified index.\n */\n _getitem(index) {\n const [iterLength, ...iterDims] = this.dims;\n\n index = safeIndex(index, iterLength);\n\n if (iterDims.length > 0) {\n const iterSize = iterDims.reduce((a, b) => a * b);\n return this._subarray(index, iterSize, iterDims);\n } else {\n return new Tensor(this.type, [this.data[index]], iterDims);\n }\n }\n\n /**\n * @param {number|bigint} item The item to search for in the tensor\n * @returns {number} The index of the first occurrence of item in the tensor data.\n */\n indexOf(item) {\n for (let index = 0; index < this.data.length; ++index) {\n // Note: == instead of === so we can match Ints with BigInts\n if (this.data[index] == item) {\n return index;\n }\n }\n return -1;\n }\n\n /**\n * @param {number} index \n * @param {number} iterSize \n * @param {any} iterDims \n * @returns {Tensor}\n */\n _subarray(index, iterSize, iterDims) {\n const o1 = index * iterSize;\n const o2 = (index + 1) * iterSize;\n\n // We use subarray if available (typed array), otherwise we use slice (normal array)\n const data =\n ('subarray' in this.data)\n ? this.data.subarray(o1, o2)\n : this.data.slice(o1, o2);\n return new Tensor(this.type, data, iterDims);\n }\n\n /**\n * Returns the value of this tensor as a standard JavaScript Number. This only works\n * for tensors with one element. For other cases, see `Tensor.tolist()`.\n * @returns {number|bigint} The value of this tensor as a standard JavaScript Number.\n * @throws {Error} If the tensor has more than one element.\n */\n item() {\n if (this.data.length !== 1) {\n throw new Error(`a Tensor with ${this.data.length} elements cannot be converted to Scalar`);\n }\n return this.data[0];\n }\n\n /**\n * Convert tensor data to a n-dimensional JS list\n * @returns {Array}\n */\n tolist() {\n return reshape(this.data, this.dims)\n }\n\n /**\n * Return a new Tensor with the sigmoid function applied to each element.\n * @returns {Tensor} The tensor with the sigmoid function applied.\n */\n sigmoid() {\n return this.clone().sigmoid_();\n }\n\n /**\n * Applies the sigmoid function to the tensor in place.\n * @returns {Tensor} Returns `this`.\n */\n sigmoid_() {\n for (let i = 0; i < this.data.length; ++i) {\n this.data[i] = 1 / (1 + Math.exp(-this.data[i]));\n }\n return this;\n }\n\n /**\n * Return a new Tensor with every element multiplied by a constant.\n * @param {number} val The value to multiply by.\n * @returns {Tensor} The new tensor.\n */\n mul(val) {\n return this.clone().mul_(val);\n }\n\n /**\n * Multiply the tensor by a constant in place.\n * @param {number} val The value to multiply by.\n * @returns {Tensor} Returns `this`.\n */\n mul_(val) {\n for (let i = 0; i < this.data.length; ++i) {\n this.data[i] *= val;\n }\n return this;\n }\n\n\n /**\n * Return a new Tensor with every element added by a constant.\n * @param {number} val The value to add by.\n * @returns {Tensor} The new tensor.\n */\n add(val) {\n return this.clone().add_(val);\n }\n\n /**\n * Add the tensor by a constant in place.\n * @param {number} val The value to add by.\n * @returns {Tensor} Returns `this`.\n */\n add_(val) {\n for (let i = 0; i < this.data.length; ++i) {\n this.data[i] += val;\n }\n return this;\n }\n clone() {\n return new Tensor(this.type, this.data.slice(), this.dims.slice());\n }\n\n slice(...slices) {\n // This allows for slicing with ranges and numbers\n let newTensorDims = [];\n let newOffsets = [];\n\n // slices is an array of numbers or arrays of numbers\n // e.g., slices = [0, [1, 3], null, [0, 3]]\n for (let sliceIndex = 0; sliceIndex < this.dims.length; ++sliceIndex) {\n let slice = slices[sliceIndex];\n\n if (slice === null || slice === undefined) {\n // null or undefined means take the whole dimension\n newOffsets.push([0, this.dims[sliceIndex]]);\n newTensorDims.push(this.dims[sliceIndex]);\n\n } else if (typeof slice === 'number') {\n slice = safeIndex(slice, this.dims[sliceIndex], sliceIndex);\n\n // A number means take a single element\n newOffsets.push([slice, slice + 1]);\n\n } else if (Array.isArray(slice) && slice.length === 2) {\n // An array of length 2 means take a range of elements\n\n if (slice[0] > slice[1]) {\n throw new Error(`Invalid slice: ${slice}`);\n }\n\n let offsets = [\n Math.max(slice[0], 0),\n Math.min(slice[1], this.dims[sliceIndex])\n ];\n\n newOffsets.push(offsets);\n newTensorDims.push(offsets[1] - offsets[0]);\n\n } else {\n throw new Error(`Invalid slice: ${slice}`);\n }\n }\n\n let newDims = newOffsets.map(([start, end]) => end - start);\n let newBufferSize = newDims.reduce((a, b) => a * b);\n\n // Allocate memory\n // @ts-ignore\n let data = new this.data.constructor(newBufferSize);\n\n // Precompute strides\n const stride = this.stride();\n\n for (let i = 0; i < newBufferSize; ++i) {\n let originalIndex = 0;\n for (let j = newDims.length - 1, num = i; j >= 0; --j) {\n const size = newDims[j];\n originalIndex += ((num % size) + newOffsets[j][0]) * stride[j];\n num = Math.floor(num / size);\n }\n data[i] = this.data[originalIndex];\n }\n return new Tensor(this.type, data, newTensorDims);\n\n }\n\n /**\n * Return a permuted version of this Tensor, according to the provided dimensions.\n * @param {...number} dims Dimensions to permute.\n * @returns {Tensor} The permuted tensor.\n */\n permute(...dims) {\n return permute(this, dims);\n }\n\n // TODO: implement transpose. For now (backwards compatibility), it's just an alias for permute()\n transpose(...dims) {\n return this.permute(...dims);\n }\n\n // TODO add .max() and .min() methods\n\n /**\n * Returns the sum of each row of the input tensor in the given dimension dim.\n * \n * @param {number} [dim=null] The dimension or dimensions to reduce. If `null`, all dimensions are reduced.\n * @param {boolean} keepdim Whether the output tensor has `dim` retained or not.\n * @returns The summed tensor\n */\n sum(dim = null, keepdim = false) {\n return this.norm(1, dim, keepdim);\n }\n\n /**\n * Returns the matrix norm or vector norm of a given tensor.\n * @param {number|string} [p='fro'] The order of norm\n * @param {number} [dim=null] Specifies which dimension of the tensor to calculate the norm across.\n * If dim is None, the norm will be calculated across all dimensions of input.\n * @param {boolean} [keepdim=false] Whether the output tensors have dim retained or not.\n * @returns {Tensor} The norm of the tensor.\n */\n norm(p = 'fro', dim = null, keepdim = false) {\n if (p === 'fro') {\n // NOTE: Since we only support integer dims, Frobenius norm produces the same result as p=2.\n p = 2;\n } else if (typeof p === 'string') {\n throw Error(`Unsupported norm: ${p}`);\n }\n\n if (dim === null) {\n // @ts-ignore\n let val = this.data.reduce((a, b) => a + (b ** p), 0) ** (1 / p);\n return new Tensor(this.type, [val], []);\n }\n\n // Negative indexing\n dim = safeIndex(dim, this.dims.length);\n\n // Calculate the shape of the resulting array after summation\n const resultDims = this.dims.slice(); // Copy the original dimensions\n resultDims[dim] = 1; // Remove the specified axis\n\n // Create a new array to store the accumulated values\n // @ts-ignore\n const result = new this.data.constructor(this.data.length / this.dims[dim]);\n\n // Iterate over the data array\n for (let i = 0; i < this.data.length; ++i) {\n\n // Calculate the index in the resulting array\n let resultIndex = 0;\n\n for (let j = this.dims.length - 1, num = i, resultMultiplier = 1; j >= 0; --j) {\n const size = this.dims[j];\n if (j !== dim) {\n const index = num % size;\n resultIndex += index * resultMultiplier;\n resultMultiplier *= resultDims[j];\n }\n num = Math.floor(num / size);\n }\n\n // Accumulate the value at the current index\n result[resultIndex] += (this.data[i]) ** p;\n }\n\n if (p !== 1) {\n for (let i = 0; i < result.length; ++i) {\n result[i] = result[i] ** (1 / p);\n }\n }\n\n if (!keepdim) {\n resultDims.splice(dim, 1);\n }\n\n return new Tensor(this.type, result, resultDims);\n }\n\n /**\n * Performs `L_p` normalization of inputs over specified dimension. Operates in place.\n * @param {number} [p=2] The exponent value in the norm formulation\n * @param {number} [dim=1] The dimension to reduce\n * @returns {Tensor} `this` for operation chaining.\n */\n normalize_(p = 2.0, dim = 1) {\n dim = safeIndex(dim, this.dims.length);\n\n const norm = this.norm(p, dim, true);\n\n for (let i = 0; i < this.data.length; ++i) {\n\n // Calculate the index in the resulting array\n let resultIndex = 0;\n\n for (let j = this.dims.length - 1, num = i, resultMultiplier = 1; j >= 0; --j) {\n const size = this.dims[j];\n if (j !== dim) {\n const index = num % size;\n resultIndex += index * resultMultiplier;\n resultMultiplier *= this.dims[j];\n }\n num = Math.floor(num / size);\n }\n\n // Divide by normalized value\n this.data[i] /= norm.data[resultIndex];\n }\n\n return this;\n }\n\n /**\n * Performs `L_p` normalization of inputs over specified dimension.\n * @param {number} [p=2] The exponent value in the norm formulation\n * @param {number} [dim=1] The dimension to reduce\n * @returns {Tensor} The normalized tensor.\n */\n normalize(p = 2.0, dim = 1) {\n return this.clone().normalize_(p, dim);\n }\n\n /**\n * Compute and return the stride of this tensor.\n * Stride is the jump necessary to go from one element to the next one in the specified dimension dim.\n * @returns {number[]} The stride of this tensor.\n */\n stride() {\n return dimsToStride(this.dims);\n }\n\n /**\n * Returns a tensor with all specified dimensions of input of size 1 removed.\n * \n * NOTE: The returned tensor shares the storage with the input tensor, so changing the contents of one will change the contents of the other.\n * If you would like a copy, use `tensor.clone()` before squeezing.\n * \n * @param {number} [dim=null] If given, the input will be squeezed only in the specified dimensions.\n * @returns The squeezed tensor\n */\n squeeze(dim = null) {\n return new Tensor(\n this.type,\n this.data,\n calc_squeeze_dims(this.dims, dim)\n )\n }\n\n /**\n * In-place version of @see {@link Tensor.squeeze}\n */\n squeeze_(dim = null) {\n this.dims = calc_squeeze_dims(this.dims, dim);\n return this;\n }\n\n /**\n * Returns a new tensor with a dimension of size one inserted at the specified position.\n * \n * NOTE: The returned tensor shares the same underlying data with this tensor.\n * \n * @param {number} dim The index at which to insert the singleton dimension\n * @returns The unsqueezed tensor\n */\n unsqueeze(dim = null) {\n return new Tensor(\n this.type,\n this.data,\n calc_unsqueeze_dims(this.dims, dim)\n );\n }\n\n /**\n * In-place version of @see {@link Tensor.unsqueeze}\n */\n unsqueeze_(dim = null) {\n this.dims = calc_unsqueeze_dims(this.dims, dim);\n return this;\n }\n\n /**\n * In-place version of @see {@link Tensor.flatten}\n */\n flatten_(start_dim = 0, end_dim = -1) {\n // TODO validate inputs\n end_dim = (end_dim + this.dims.length) % this.dims.length;\n\n let dimsToKeepBefore = this.dims.slice(0, start_dim);\n let dimsToFlatten = this.dims.slice(start_dim, end_dim + 1);\n let dimsToKeepAfter = this.dims.slice(end_dim + 1);\n\n this.dims = [...dimsToKeepBefore, dimsToFlatten.reduce((a, b) => a * b, 1), ...dimsToKeepAfter]\n return this;\n }\n\n /**\n * Flattens input by reshaping it into a one-dimensional tensor.\n * If `start_dim` or `end_dim` are passed, only dimensions starting with `start_dim`\n * and ending with `end_dim` are flattened. The order of elements in input is unchanged.\n * @param {number} start_dim the first dim to flatten\n * @param {number} end_dim the last dim to flatten\n * @returns The flattened tensor.\n */\n flatten(start_dim = 0, end_dim = -1) {\n return this.clone().flatten_(start_dim, end_dim);\n }\n\n /**\n * Returns a new tensor with the same data as the `self` tensor but of a different `shape`.\n * @param {...number} dims the desired size\n * @returns {Tensor} The tensor with the same data but different shape\n */\n view(...dims) {\n // TODO: validate dims\n let inferredIndex = -1;\n for (let i = 0; i < dims.length; ++i) {\n if (dims[i] === -1) {\n if (inferredIndex !== -1) {\n throw new Error(\"Only one dimension can be inferred\");\n }\n inferredIndex = i;\n }\n }\n\n if (inferredIndex !== -1) {\n // Some dimension must be inferred\n const productOther = dims.reduce((product, curr, index) => {\n return index !== inferredIndex ? product * curr : product\n }, 1);\n\n dims[inferredIndex] = this.data.length / productOther;\n }\n return new Tensor(this.type, this.data, dims); // NOTE: uses same underlying storage\n }\n\n neg_() {\n for (let i = 0; i < this.data.length; ++i) {\n this.data[i] = -this.data[i];\n }\n return this;\n }\n neg() {\n return this.clone().neg_();\n }\n\n /**\n * In-place version of @see {@link Tensor.clamp}\n */\n clamp_(min, max) {\n for (let i = 0; i < this.data.length; ++i) {\n this.data[i] = Math.min(Math.max(this.data[i], min), max);\n }\n return this;\n }\n\n /**\n * Clamps all elements in input into the range [ min, max ]\n * @param {number} min lower-bound of the range to be clamped to\n * @param {number} max upper-bound of the range to be clamped to\n * @returns the output tensor.\n */\n clamp(min, max) {\n return this.clone().clamp_(min, max);\n }\n\n /**\n * In-place version of @see {@link Tensor.round}\n */\n round_() {\n for (let i = 0; i < this.data.length; ++i) {\n this.data[i] = Math.round(this.data[i]);\n }\n return this;\n }\n\n /**\n * Rounds elements of input to the nearest integer.\n * @returns the output tensor.\n */\n round() {\n return this.clone().round_();\n }\n\n /**\n * Performs Tensor dtype conversion.\n * @param {DataType} type The desired data type.\n * @returns {Tensor} The converted tensor.\n */\n to(type) {\n // If the self Tensor already has the correct dtype, then self is returned.\n if (this.type === type) return this;\n\n // Otherwise, the returned tensor is a copy of self with the desired dtype.\n if (!DataTypeMap.hasOwnProperty(type)) {\n throw new Error(`Unsupported type: ${type}`);\n }\n // @ts-ignore\n return new Tensor(type, DataTypeMap[type].from(this.data), this.dims);\n }\n}\n\n/**\n * This creates a nested array of a given type and depth (see examples).\n * \n * @example\n * NestArray<string, 1>; // string[]\n * @example\n * NestArray<number, 2>; // number[][]\n * @example\n * NestArray<string, 3>; // string[][][] etc.\n * @template T\n * @template {number} Depth\n * @template {never[]} [Acc=[]]\n * @typedef {Acc['length'] extends Depth ? T : NestArray<T[], Depth, [...Acc, never]>} NestArray\n */\n\n/**\n * Reshapes a 1-dimensional array into an n-dimensional array, according to the provided dimensions.\n *\n * @example\n * reshape([10 ], [1 ]); // Type: number[] Value: [10]\n * reshape([1, 2, 3, 4 ], [2, 2 ]); // Type: number[][] Value: [[1, 2], [3, 4]]\n * reshape([1, 2, 3, 4, 5, 6, 7, 8], [2, 2, 2]); // Type: number[][][] Value: [[[1, 2], [3, 4]], [[5, 6], [7, 8]]]\n * reshape([1, 2, 3, 4, 5, 6, 7, 8], [4, 2 ]); // Type: number[][] Value: [[1, 2], [3, 4], [5, 6], [7, 8]]\n * @param {T[]|DataArray} data The input array to reshape.\n * @param {DIM} dimensions The target shape/dimensions.\n * @template T\n * @template {[number]|number[]} DIM\n * @returns {NestArray<T, DIM[\"length\"]>} The reshaped array.\n */\nfunction reshape(data, dimensions) {\n\n const totalElements = data.length;\n const dimensionSize = dimensions.reduce((a, b) => a * b);\n\n if (totalElements !== dimensionSize) {\n throw Error(`cannot reshape array of size ${totalElements} into shape (${dimensions})`);\n }\n\n /** @type {any} */\n let reshapedArray = data;\n\n for (let i = dimensions.length - 1; i >= 0; i--) {\n reshapedArray = reshapedArray.reduce((acc, val) => {\n let lastArray = acc[acc.length - 1];\n\n if (lastArray.length < dimensions[i]) {\n lastArray.push(val);\n } else {\n acc.push([val]);\n }\n\n return acc;\n }, [[]]);\n }\n\n return reshapedArray[0];\n}\n\n/**\n * Permutes a tensor according to the provided axes.\n * @param {any} tensor The input tensor to permute.\n * @param {Array} axes The axes to permute the tensor along.\n * @returns {Tensor} The permuted tensor.\n */\nexport function permute(tensor, axes) {\n const [permutedData, shape] = permute_data(tensor.data, tensor.dims, axes);\n return new Tensor(tensor.type, permutedData, shape);\n}\n\n\n/**\n * Interpolates an Tensor to the given size.\n * @param {Tensor} input The input tensor to interpolate. Data must be channel-first (i.e., [c, h, w])\n * @param {number[]} size The output size of the image\n * @param {string} mode The interpolation mode\n * @param {boolean} align_corners Whether to align corners.\n * @returns {Tensor} The interpolated tensor.\n */\nexport function interpolate(input, [out_height, out_width], mode = 'bilinear', align_corners = false) {\n\n // Input image dimensions\n const in_channels = input.dims.at(-3) ?? 1;\n const in_height = input.dims.at(-2);\n const in_width = input.dims.at(-1);\n\n let output = interpolate_data(\n /** @type {import('./maths.js').TypedArray}*/(input.data),\n [in_channels, in_height, in_width],\n [out_height, out_width],\n mode,\n align_corners\n );\n return new Tensor(input.type, output, [in_channels, out_height, out_width]);\n}\n\n/**\n * Perform mean pooling of the last hidden state followed by a normalization step.\n * @param {Tensor} last_hidden_state Tensor of shape [batchSize, seqLength, embedDim]\n * @param {Tensor} attention_mask Tensor of shape [batchSize, seqLength]\n * @returns {Tensor} Returns a new Tensor of shape [batchSize, embedDim].\n */\nexport function mean_pooling(last_hidden_state, attention_mask) {\n // last_hidden_state: [batchSize, seqLength, embedDim]\n // attention_mask: [batchSize, seqLength]\n\n let shape = [last_hidden_state.dims[0], last_hidden_state.dims[2]];\n // @ts-ignore\n let returnedData = new last_hidden_state.data.constructor(shape[0] * shape[1]);\n let [batchSize, seqLength, embedDim] = last_hidden_state.dims;\n\n let outIndex = 0;\n for (let i = 0; i < batchSize; ++i) {\n let offset = i * embedDim * seqLength;\n\n for (let k = 0; k < embedDim; ++k) {\n let sum = 0;\n let count = 0;\n\n let attnMaskOffset = i * seqLength;\n let offset2 = offset + k;\n // Pool over all words in sequence\n for (let j = 0; j < seqLength; ++j) {\n // index into attention mask\n let attn = Number(attention_mask.data[attnMaskOffset + j]);\n\n count += attn;\n sum += last_hidden_state.data[offset2 + j * embedDim] * attn;\n }\n\n let avg = sum / count;\n returnedData[outIndex++] = avg;\n }\n }\n\n return new Tensor(\n last_hidden_state.type,\n returnedData,\n shape\n )\n}\n\n/**\n * Apply Layer Normalization for last certain number of dimensions.\n * @param {Tensor} input The input tensor\n * @param {number[]} normalized_shape input shape from an expected input of size\n * @param {Object} options The options for the layer normalization\n * @param {number} [options.eps=1e-5] A value added to the denominator for numerical stability.\n * @returns {Tensor} The normalized tensor.\n */\nexport function layer_norm(input, normalized_shape, {\n eps = 1e-5,\n} = {}) {\n if (input.dims.length !== 2) {\n throw new Error('`layer_norm` currently only supports 2D input.');\n }\n\n const [batchSize, featureDim] = input.dims;\n\n if (normalized_shape.length !== 1 && normalized_shape[0] !== featureDim) {\n throw new Error('`normalized_shape` must be a 1D array with shape `[input.dims[1]]`.');\n }\n\n const [std, mean] = std_mean(input, 1, 0, true);\n\n // @ts-ignore\n const returnedData = new input.data.constructor(input.data.length);\n\n for (let i = 0; i < batchSize; ++i) {\n const offset = i * featureDim;\n for (let j = 0; j < featureDim; ++j) {\n const offset2 = offset + j;\n returnedData[offset2] = (input.data[offset2] - mean.data[i]) / (std.data[i] + eps);\n }\n }\n return new Tensor(input.type, returnedData, input.dims);\n}\n\n/**\n * Helper function to calculate new dimensions when performing a squeeze operation.\n * @param {number[]} dims The dimensions of the tensor.\n * @param {number|number[]|null} dim The dimension(s) to squeeze.\n * @returns The new dimensions.\n * @private\n */\nfunction calc_squeeze_dims(dims, dim) {\n dims = dims.slice();\n if (dim === null) {\n dims = dims.filter((d) => d !== 1);\n } else if (typeof dim === 'number') {\n if (dims[dim] === 1) {\n dims.splice(dim, 1);\n }\n } else if (Array.isArray(dim)) {\n dims = dims.filter((x, i) => {\n return x !== 1 || !dim.includes(i);\n });\n }\n return dims;\n}\n\n/**\n * Helper function to calculate new dimensions when performing an unsqueeze operation.\n * @param {number[]} dims The dimensions of the tensor.\n * @param {number} dim The dimension to unsqueeze.\n * @returns The new dimensions.\n * @private\n */\nfunction calc_unsqueeze_dims(dims, dim) {\n // Dimension out of range (e.g., \"expected to be in range of [-4, 3], but got 4\")\n // + 1 since we allow inserting at the end (i.e. dim = -1)\n dim = safeIndex(dim, dims.length + 1);\n dims = dims.slice();\n // Insert 1 into specified dimension\n dims.splice(dim, 0, 1);\n return dims;\n}\n\n/**\n * Safely calculate the index for an array of a given size, allowing negative indexing.\n * @param {number} index The index that will be used.\n * @param {number} size The size of the array.\n * @param {number} [dimension=null] The dimension that the index is for (optional).\n * @returns {number} The index, guaranteed to be non-negative and less than `arrayLength`.\n * \n * @throws {Error} If the index is out of range.\n * @private\n */\nfunction safeIndex(index, size, dimension = null) {\n if (index < -size || index >= size) {\n throw new Error(`IndexError: index ${index} is out of bounds for dimension${dimension === null ? '' : ' ' + dimension} with size ${size}`);\n }\n\n if (index < 0) {\n // Negative indexing, ensuring positive index\n index = ((index % size) + size) % size;\n }\n return index;\n}\n\n/**\n * Concatenates an array of tensors along a specified dimension.\n * @param {Tensor[]} tensors The array of tensors to concatenate.\n * @param {number} dim The dimension to concatenate along.\n * @returns {Tensor} The concatenated tensor.\n */\nexport function cat(tensors, dim = 0) {\n dim = safeIndex(dim, tensors[0].dims.length);\n\n // TODO do validation of shapes\n\n const resultDims = tensors[0].dims.slice();\n resultDims[dim] = tensors.reduce((a, b) => a + b.dims[dim], 0);\n\n // Create a new array to store the accumulated values\n const resultSize = resultDims.reduce((a, b) => a * b, 1);\n // @ts-ignore\n const result = new tensors[0].data.constructor(resultSize);\n\n // Create output tensor of same type as first\n const resultType = tensors[0].type;\n\n if (dim === 0) {\n // Handle special case for performance reasons\n\n let offset = 0;\n for (let t of tensors) {\n result.set(t.data, offset);\n offset += t.data.length;\n }\n\n } else {\n\n let currentDim = 0;\n\n for (let t = 0; t < tensors.length; ++t) {\n let tensor = tensors[t];\n\n // Iterate over the data array\n for (let i = 0; i < tensor.data.length; ++i) {\n // Calculate the index in the resulting array\n let resultIndex = 0;\n\n for (let j = tensor.dims.length - 1, num = i, resultMultiplier = 1; j >= 0; --j) {\n const size = tensor.dims[j];\n let index = num % size;\n if (j === dim) {\n index += currentDim;\n }\n resultIndex += index * resultMultiplier;\n resultMultiplier *= resultDims[j];\n num = Math.floor(num / size);\n }\n // Accumulate the value at the current index\n result[resultIndex] = tensor.data[i];\n }\n\n currentDim += tensor.dims[dim];\n }\n }\n return new Tensor(resultType, result, resultDims);\n}\n\n/**\n * Stack an array of tensors along a specified dimension.\n * @param {Tensor[]} tensors The array of tensors to stack.\n * @param {number} dim The dimension to stack along.\n * @returns {Tensor} The stacked tensor.\n */\nexport function stack(tensors, dim = 0) {\n // TODO do validation of shapes\n // NOTE: stack expects each tensor to be equal size\n return cat(tensors.map(t => t.unsqueeze(dim)), dim);\n}\n\n\n/**\n * Calculates the standard deviation and mean over the dimensions specified by dim. dim can be a single dimension or `null` to reduce over all dimensions.\n * @param {Tensor} input the input tenso\n * @param {number|null} dim the dimension to reduce. If None, all dimensions are reduced.\n * @param {number} correction difference between the sample size and sample degrees of freedom. Defaults to Bessel's correction, correction=1.\n * @param {boolean} keepdim whether the output tensor has dim retained or not.\n * @returns {Tensor[]} A tuple of (std, mean) tensors.\n */\nexport function std_mean(input, dim = null, correction = 1, keepdim = false) {\n\n if (dim === null) {\n // None to reduce over all dimensions.\n // @ts-ignore\n const sum = input.data.reduce((a, b) => a + b, 0);\n const mean = sum / input.data.length;\n // @ts-ignore\n const std = Math.sqrt(input.data.reduce((a, b) => a + (b - mean) ** 2, 0) / (input.data.length - correction));\n\n const meanTensor = new Tensor(input.type, [mean], [/* scalar */]);\n const stdTensor = new Tensor(input.type, [std], [/* scalar */]);\n\n return [stdTensor, meanTensor];\n }\n\n // Negative indexing\n dim = safeIndex(dim, input.dims.length);\n\n const meanTensor = mean(input, dim, keepdim);\n\n // Calculate the shape of the resulting array after summation\n const resultDims = input.dims.slice(); // Copy the original dimensions\n resultDims[dim] = 1; // Remove the specified axis\n\n // Create a new array to store the accumulated values\n // @ts-ignore\n const result = new input.data.constructor(input.data.length / input.dims[dim]);\n\n // Iterate over the data array\n for (let i = 0; i < input.data.length; ++i) {\n\n // Calculate the index in the resulting array\n let resultIndex = 0;\n\n for (let j = input.dims.length - 1, num = i, resultMultiplier = 1; j >= 0; --j) {\n const size = input.dims[j];\n if (j !== dim) {\n const index = num % size;\n resultIndex += index * resultMultiplier;\n resultMultiplier *= resultDims[j];\n }\n num = Math.floor(num / size);\n }\n\n // Accumulate the value at the current index\n result[resultIndex] += (input.data[i] - meanTensor.data[resultIndex]) ** 2;\n }\n\n for (let i = 0; i < result.length; ++i) {\n result[i] = Math.sqrt(result[i] / (input.dims[dim] - correction));\n }\n\n if (!keepdim) {\n resultDims.splice(dim, 1);\n }\n\n const stdTensor = new Tensor(input.type, result, resultDims);\n\n return [stdTensor, meanTensor];\n}\n\n\n/**\n * Returns the mean value of each row of the input tensor in the given dimension dim.\n * @param {Tensor} input the input tensor.\n * @param {number|null} dim the dimension to reduce.\n * @param {boolean} keepdim whether the output tensor has dim retained or not.\n * @returns A new tensor with means taken along the specified dimension.\n */\nexport function mean(input, dim = null, keepdim = false) {\n\n if (dim === null) {\n // None to reduce over all dimensions.\n // @ts-ignore\n let val = input.data.reduce((a, b) => a + b, 0);\n return new Tensor(input.type, [val / input.data.length], [/* scalar */]);\n }\n\n // Negative indexing\n dim = safeIndex(dim, input.dims.length);\n\n // Calculate the shape of the resulting array after summation\n const resultDims = input.dims.slice(); // Copy the original dimensions\n resultDims[dim] = 1; // Remove the specified axis\n\n // Create a new array to store the accumulated values\n // @ts-ignore\n const result = new input.data.constructor(input.data.length / input.dims[dim]);\n\n // Iterate over the data array\n for (let i = 0; i < input.data.length; ++i) {\n\n // Calculate the index in the resulting array\n let resultIndex = 0;\n\n for (let j = input.dims.length - 1, num = i, resultMultiplier = 1; j >= 0; --j) {\n const size = input.dims[j];\n if (j !== dim) {\n const index = num % size;\n resultIndex += index * resultMultiplier;\n resultMultiplier *= resultDims[j];\n }\n num = Math.floor(num / size);\n }\n\n // Accumulate the value at the current index\n result[resultIndex] += input.data[i];\n }\n\n if (input.dims[dim] !== 1) {\n for (let i = 0; i < result.length; ++i) {\n result[i] = result[i] / input.dims[dim];\n }\n }\n\n if (!keepdim) {\n resultDims.splice(dim, 1);\n }\n\n return new Tensor(input.type, result, resultDims);\n}\n\n\n/**\n *\n * Measures similarity between two temporal sequences (e.g., input audio and output tokens\n * to generate token-level timestamps).\n * @param {Tensor} matrix \n * @returns {number[][]}\n */\nexport function dynamicTimeWarping(matrix) {\n const [output_length, input_length] = matrix.dims;\n\n const outputShape = [output_length + 1, input_length + 1];\n\n const cost = new Tensor(\n 'float32',\n new Float32Array(outputShape[0] * outputShape[1]).fill(Infinity),\n outputShape\n );\n\n const trace = new Tensor(\n 'float32',\n new Float32Array(outputShape[0] * outputShape[1]).fill(-1),\n outputShape\n )\n\n // same as `cost[0][0] = 0`;\n cost[0].data[0] = 0;\n\n for (let j = 1; j < input_length + 1; ++j) {\n for (let i = 1; i < output_length + 1; ++i) {\n\n const c0 = cost[i - 1][j - 1].item();\n const c1 = cost[i - 1][j].item();\n const c2 = cost[i][j - 1].item();\n\n let c, t;\n if (c0 < c1 && c0 < c2) {\n c = c0;\n t = 0;\n } else if (c1 < c0 && c1 < c2) {\n c = c1;\n t = 1;\n } else {\n c = c2;\n t = 2;\n }\n\n cost[i].data[j] = matrix[i - 1][j - 1].item() + c;\n trace[i].data[j] = t;\n }\n }\n\n // backtrace\n let i = output_length;\n let j = input_length;\n\n // @ts-ignore\n trace.data.fill(2, 0, outputShape[1]) // trace[0, :] = 2\n for (let i = 0; i < outputShape[0]; ++i) { // trace[:, 0] = 1\n trace[i].data[0] = 1;\n }\n\n let text_indices = [];\n let time_indices = [];\n\n while (i > 0 || j > 0) {\n text_indices.push(i - 1);\n time_indices.push(j - 1);\n\n const t = trace[i][j].item();\n switch (t) {\n case 0:\n --i; --j;\n break;\n case 1:\n --i;\n break;\n case 2:\n --j;\n break;\n default:\n throw new Error(\n `Internal error in dynamic time warping. Unexpected trace[${i}, ${j}]. Please file a bug report.`\n )\n }\n }\n\n text_indices.reverse();\n time_indices.reverse();\n\n return [text_indices, time_indices];\n\n}\n\nfunction dimsToStride(dims) {\n const stride = new Array(dims.length);\n for (let i = dims.length - 1, s2 = 1; i >= 0; --i) {\n stride[i] = s2;\n s2 *= dims[i];\n }\n return stride;\n}\n\n/**\n * Returns a tensor filled with the scalar value 1, with the shape defined by the variable argument size.\n * @param {number[]} size A sequence of integers defining the shape of the output tensor.\n */\nexport function ones(size) {\n const numElements = size.reduce((a, b) => a * b, 1);\n return new Tensor(\n 'int64',\n new BigInt64Array(numElements).fill(1n),\n size\n )\n}\n\n/**\n * Returns a tensor filled with the scalar value 1, with the same size as input.\n * @param {Tensor} tensor The size of input will determine size of the output tensor.\n * @returns The ones tensor.\n */\nexport function ones_like(tensor) {\n return ones(tensor.dims);\n}\n\n/**\n * Quantizes the embeddings tensor to binary or unsigned binary precision.\n * @param {Tensor} tensor The tensor to quantize.\n * @param {'binary'|'ubinary'} precision The precision to use for quantization.\n * @returns {Tensor} The quantized tensor.\n */\nexport function quantize_embeddings(tensor, precision) {\n if (tensor.dims.length !== 2) {\n throw new Error(\"The tensor must have 2 dimensions\");\n }\n if (tensor.dims.at(-1) % 8 !== 0) {\n throw new Error(\"The last dimension of the tensor must be a multiple of 8\");\n }\n if (!['binary', 'ubinary'].includes(precision)) {\n throw new Error(\"The precision must be either 'binary' or 'ubinary'\");\n }\n\n const signed = precision === 'binary';\n const dtype = signed ? 'int8' : 'uint8';\n\n // Create a typed array to store the packed bits\n const cls = signed ? Int8Array : Uint8Array;\n const inputData = tensor.data;\n const outputData = new cls(inputData.length / 8);\n\n // Iterate over each number in the array\n for (let i = 0; i < inputData.length; ++i) {\n // Determine if the number is greater than 0\n const bit = inputData[i] > 0 ? 1 : 0;\n\n // Calculate the index in the typed array and the position within the byte\n const arrayIndex = Math.floor(i / 8);\n const bitPosition = i % 8;\n\n // Pack the bit into the typed array\n outputData[arrayIndex] |= bit << (7 - bitPosition);\n if (signed && bitPosition === 0) {\n outputData[arrayIndex] -= 128;\n }\n };\n\n return new Tensor(dtype, outputData, [tensor.dims[0], tensor.dims[1] / 8]);\n}\n"],"names":["mean","meanTensor","stdTensor","j","i"],"mappings":";;AAiBA,MAAM,cAAc,OAAO,OAAO;AAAA,EAC9B,SAAS;AAAA,EACT,SAAS;AAAA,EACT,QAAQ;AAAA;AAAA,EACR,MAAM;AAAA,EACN,OAAO;AAAA,EACP,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,OAAO;AAAA,EACP,QAAQ;AAAA,EACR,MAAM;AACV,CAAC;AAOD,MAAM,aAAa,KAAK;AAEjB,MAAM,OAAO;AAAA;AAAA,EAEhB;AAAA;AAAA,EAGA;AAAA;AAAA,EAGA;AAAA;AAAA,EAGA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAe,MAAM;AACjB,QAAI,KAAK,CAAC,aAAa,YAAY;AAE/B,aAAO,OAAO,MAAM,KAAK,CAAC,CAAC;AAAA,IAE/B,OAAO;AAEH,aAAO,OAAO,MAAM,IAAI;AAAA;AAAA,QACI,KAAK,CAAC;AAAA;AAAA,QACgD,KAAK,CAAC;AAAA,QACpF,KAAK,CAAC;AAAA,MACtB,CAAa;AAAA,IACL;AAEA,WAAO,IAAI,MAAM,MAAM;AAAA,MACnB,KAAK,CAAC,KAAK,QAAQ;AACf,YAAI,OAAO,QAAQ,UAAU;AACzB,cAAI,QAAQ,OAAO,GAAG;AACtB,cAAI,OAAO,UAAU,KAAK,GAAG;AAEzB,mBAAO,IAAI,SAAS,KAAK;AAAA,UAC7B;AAAA,QACJ;AAEA,eAAO,IAAI,GAAG;AAAA,MAClB;AAAA,MACA,KAAK,CAAC,KAAK,KAAK,UAAU;AAItB,eAAO,IAAI,GAAG,IAAI;AAAA,MACtB;AAAA,IACZ,CAAS;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,EAAE,OAAO,QAAQ,IAAI;AACjB,UAAM,CAAC,YAAY,GAAG,QAAQ,IAAI,KAAK;AAEvC,QAAI,SAAS,SAAS,GAAG;AACrB,YAAM,WAAW,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC;AAChD,eAAS,IAAI,GAAG,IAAI,YAAY,EAAE,GAAG;AACjC,cAAM,KAAK,UAAU,GAAG,UAAU,QAAQ;AAAA,MAC9C;AAAA,IACJ,OAAO;AACH,aAAO,KAAK;AAAA,IAChB;AAAA,EAEJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,OAAO;AACZ,UAAM,CAAC,YAAY,GAAG,QAAQ,IAAI,KAAK;AAEvC,YAAQ,UAAU,OAAO,UAAU;AAEnC,QAAI,SAAS,SAAS,GAAG;AACrB,YAAM,WAAW,SAAS,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC;AAChD,aAAO,KAAK,UAAU,OAAO,UAAU,QAAQ;AAAA,IACnD,OAAO;AACH,aAAO,IAAI,OAAO,KAAK,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC,GAAG,QAAQ;AAAA,IAC7D;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ,MAAM;AACV,aAAS,QAAQ,GAAG,QAAQ,KAAK,KAAK,QAAQ,EAAE,OAAO;AAEnD,UAAI,KAAK,KAAK,KAAK,KAAK,MAAM;AAC1B,eAAO;AAAA,MACX;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,OAAO,UAAU,UAAU;AACjC,UAAM,KAAK,QAAQ;AACnB,UAAM,MAAM,QAAQ,KAAK;AAGzB,UAAM,OACD,cAAc,KAAK,OACd,KAAK,KAAK,SAAS,IAAI,EAAE,IACzB,KAAK,KAAK,MAAM,IAAI,EAAE;AAChC,WAAO,IAAI,OAAO,KAAK,MAAM,MAAM,QAAQ;AAAA,EAC/C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,OAAO;AACH,QAAI,KAAK,KAAK,WAAW,GAAG;AACxB,YAAM,IAAI,MAAM,iBAAiB,KAAK,KAAK,MAAM,yCAAyC;AAAA,IAC9F;AACA,WAAO,KAAK,KAAK,CAAC;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAAS;AACL,WAAO,QAAQ,KAAK,MAAM,KAAK,IAAI;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU;AACN,WAAO,KAAK,MAAK,EAAG,SAAQ;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW;AACP,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,EAAE,GAAG;AACvC,WAAK,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;AAAA,IAClD;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,KAAK;AACL,WAAO,KAAK,QAAQ,KAAK,GAAG;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAK,KAAK;AACN,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,EAAE,GAAG;AACvC,WAAK,KAAK,CAAC,KAAK;AAAA,IACpB;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,IAAI,KAAK;AACL,WAAO,KAAK,QAAQ,KAAK,GAAG;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAK,KAAK;AACN,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,EAAE,GAAG;AACvC,WAAK,KAAK,CAAC,KAAK;AAAA,IACpB;AACA,WAAO;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,IAAI,OAAO,KAAK,MAAM,KAAK,KAAK,SAAS,KAAK,KAAK,MAAK,CAAE;AAAA,EACrE;AAAA,EAEA,SAAS,QAAQ;AAEb,QAAI,gBAAgB,CAAA;AACpB,QAAI,aAAa,CAAA;AAIjB,aAAS,aAAa,GAAG,aAAa,KAAK,KAAK,QAAQ,EAAE,YAAY;AAClE,UAAI,QAAQ,OAAO,UAAU;AAE7B,UAAI,UAAU,QAAQ,UAAU,QAAW;AAEvC,mBAAW,KAAK,CAAC,GAAG,KAAK,KAAK,UAAU,CAAC,CAAC;AAC1C,sBAAc,KAAK,KAAK,KAAK,UAAU,CAAC;AAAA,MAE5C,WAAW,OAAO,UAAU,UAAU;AAClC,gBAAQ,UAAU,OAAO,KAAK,KAAK,UAAU,GAAG,UAAU;AAG1D,mBAAW,KAAK,CAAC,OAAO,QAAQ,CAAC,CAAC;AAAA,MAEtC,WAAW,MAAM,QAAQ,KAAK,KAAK,MAAM,WAAW,GAAG;AAGnD,YAAI,MAAM,CAAC,IAAI,MAAM,CAAC,GAAG;AACrB,gBAAM,IAAI,MAAM,kBAAkB,KAAK,EAAE;AAAA,QAC7C;AAEA,YAAI,UAAU;AAAA,UACV,KAAK,IAAI,MAAM,CAAC,GAAG,CAAC;AAAA,UACpB,KAAK,IAAI,MAAM,CAAC,GAAG,KAAK,KAAK,UAAU,CAAC;AAAA,QAC5D;AAEgB,mBAAW,KAAK,OAAO;AACvB,sBAAc,KAAK,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC;AAAA,MAE9C,OAAO;AACH,cAAM,IAAI,MAAM,kBAAkB,KAAK,EAAE;AAAA,MAC7C;AAAA,IACJ;AAEA,QAAI,UAAU,WAAW,IAAI,CAAC,CAAC,OAAO,GAAG,MAAM,MAAM,KAAK;AAC1D,QAAI,gBAAgB,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC;AAIlD,QAAI,OAAO,IAAI,KAAK,KAAK,YAAY,aAAa;AAGlD,UAAM,SAAS,KAAK,OAAM;AAE1B,aAAS,IAAI,GAAG,IAAI,eAAe,EAAE,GAAG;AACpC,UAAI,gBAAgB;AACpB,eAAS,IAAI,QAAQ,SAAS,GAAG,MAAM,GAAG,KAAK,GAAG,EAAE,GAAG;AACnD,cAAM,OAAO,QAAQ,CAAC;AACtB,0BAAmB,MAAM,OAAQ,WAAW,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;AAC7D,cAAM,KAAK,MAAM,MAAM,IAAI;AAAA,MAC/B;AACA,WAAK,CAAC,IAAI,KAAK,KAAK,aAAa;AAAA,IACrC;AACA,WAAO,IAAI,OAAO,KAAK,MAAM,MAAM,aAAa;AAAA,EAEpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,WAAW,MAAM;AACb,WAAO,QAAQ,MAAM,IAAI;AAAA,EAC7B;AAAA;AAAA,EAGA,aAAa,MAAM;AACf,WAAO,KAAK,QAAQ,GAAG,IAAI;AAAA,EAC/B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,IAAI,MAAM,MAAM,UAAU,OAAO;AAC7B,WAAO,KAAK,KAAK,GAAG,KAAK,OAAO;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,KAAK,IAAI,OAAO,MAAM,MAAM,UAAU,OAAO;AACzC,QAAI,MAAM,OAAO;AAEb,UAAI;AAAA,IACR,WAAW,OAAO,MAAM,UAAU;AAC9B,YAAM,MAAM,qBAAqB,CAAC,EAAE;AAAA,IACxC;AAEA,QAAI,QAAQ,MAAM;AAEd,UAAI,MAAM,KAAK,KAAK,OAAO,CAAC,GAAG,MAAM,IAAK,KAAK,GAAI,CAAC,MAAM,IAAI;AAC9D,aAAO,IAAI,OAAO,KAAK,MAAM,CAAC,GAAG,GAAG,EAAE;AAAA,IAC1C;AAGA,UAAM,UAAU,KAAK,KAAK,KAAK,MAAM;AAGrC,UAAM,aAAa,KAAK,KAAK,MAAK;AAClC,eAAW,GAAG,IAAI;AAIlB,UAAM,SAAS,IAAI,KAAK,KAAK,YAAY,KAAK,KAAK,SAAS,KAAK,KAAK,GAAG,CAAC;AAG1E,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,EAAE,GAAG;AAGvC,UAAI,cAAc;AAElB,eAAS,IAAI,KAAK,KAAK,SAAS,GAAG,MAAM,GAAG,mBAAmB,GAAG,KAAK,GAAG,EAAE,GAAG;AAC3E,cAAM,OAAO,KAAK,KAAK,CAAC;AACxB,YAAI,MAAM,KAAK;AACX,gBAAM,QAAQ,MAAM;AACpB,yBAAe,QAAQ;AACvB,8BAAoB,WAAW,CAAC;AAAA,QACpC;AACA,cAAM,KAAK,MAAM,MAAM,IAAI;AAAA,MAC/B;AAGA,aAAO,WAAW,KAAM,KAAK,KAAK,CAAC,KAAM;AAAA,IAC7C;AAEA,QAAI,MAAM,GAAG;AACT,eAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AACpC,eAAO,CAAC,IAAI,OAAO,CAAC,MAAM,IAAI;AAAA,MAClC;AAAA,IACJ;AAEA,QAAI,CAAC,SAAS;AACV,iBAAW,OAAO,KAAK,CAAC;AAAA,IAC5B;AAEA,WAAO,IAAI,OAAO,KAAK,MAAM,QAAQ,UAAU;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,WAAW,IAAI,GAAK,MAAM,GAAG;AACzB,UAAM,UAAU,KAAK,KAAK,KAAK,MAAM;AAErC,UAAM,OAAO,KAAK,KAAK,GAAG,KAAK,IAAI;AAEnC,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,EAAE,GAAG;AAGvC,UAAI,cAAc;AAElB,eAAS,IAAI,KAAK,KAAK,SAAS,GAAG,MAAM,GAAG,mBAAmB,GAAG,KAAK,GAAG,EAAE,GAAG;AAC3E,cAAM,OAAO,KAAK,KAAK,CAAC;AACxB,YAAI,MAAM,KAAK;AACX,gBAAM,QAAQ,MAAM;AACpB,yBAAe,QAAQ;AACvB,8BAAoB,KAAK,KAAK,CAAC;AAAA,QACnC;AACA,cAAM,KAAK,MAAM,MAAM,IAAI;AAAA,MAC/B;AAGA,WAAK,KAAK,CAAC,KAAK,KAAK,KAAK,WAAW;AAAA,IACzC;AAEA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,IAAI,GAAK,MAAM,GAAG;AACxB,WAAO,KAAK,MAAK,EAAG,WAAW,GAAG,GAAG;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS;AACL,WAAO,aAAa,KAAK,IAAI;AAAA,EACjC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,QAAQ,MAAM,MAAM;AAChB,WAAO,IAAI;AAAA,MACP,KAAK;AAAA,MACL,KAAK;AAAA,MACL,kBAAkB,KAAK,MAAM,GAAG;AAAA,IAC5C;AAAA,EACI;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,MAAM,MAAM;AACjB,SAAK,OAAO,kBAAkB,KAAK,MAAM,GAAG;AAC5C,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,UAAU,MAAM,MAAM;AAClB,WAAO,IAAI;AAAA,MACP,KAAK;AAAA,MACL,KAAK;AAAA,MACL,oBAAoB,KAAK,MAAM,GAAG;AAAA,IAC9C;AAAA,EACI;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW,MAAM,MAAM;AACnB,SAAK,OAAO,oBAAoB,KAAK,MAAM,GAAG;AAC9C,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS,YAAY,GAAG,UAAU,IAAI;AAElC,eAAW,UAAU,KAAK,KAAK,UAAU,KAAK,KAAK;AAEnD,QAAI,mBAAmB,KAAK,KAAK,MAAM,GAAG,SAAS;AACnD,QAAI,gBAAgB,KAAK,KAAK,MAAM,WAAW,UAAU,CAAC;AAC1D,QAAI,kBAAkB,KAAK,KAAK,MAAM,UAAU,CAAC;AAEjD,SAAK,OAAO,CAAC,GAAG,kBAAkB,cAAc,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,eAAe;AAC9F,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,QAAQ,YAAY,GAAG,UAAU,IAAI;AACjC,WAAO,KAAK,MAAK,EAAG,SAAS,WAAW,OAAO;AAAA,EACnD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ,MAAM;AAEV,QAAI,gBAAgB;AACpB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAClC,UAAI,KAAK,CAAC,MAAM,IAAI;AAChB,YAAI,kBAAkB,IAAI;AACtB,gBAAM,IAAI,MAAM,oCAAoC;AAAA,QACxD;AACA,wBAAgB;AAAA,MACpB;AAAA,IACJ;AAEA,QAAI,kBAAkB,IAAI;AAEtB,YAAM,eAAe,KAAK,OAAO,CAAC,SAAS,MAAM,UAAU;AACvD,eAAO,UAAU,gBAAgB,UAAU,OAAO;AAAA,MACtD,GAAG,CAAC;AAEJ,WAAK,aAAa,IAAI,KAAK,KAAK,SAAS;AAAA,IAC7C;AACA,WAAO,IAAI,OAAO,KAAK,MAAM,KAAK,MAAM,IAAI;AAAA,EAChD;AAAA,EAEA,OAAO;AACH,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,EAAE,GAAG;AACvC,WAAK,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC;AAAA,IAC/B;AACA,WAAO;AAAA,EACX;AAAA,EACA,MAAM;AACF,WAAO,KAAK,MAAK,EAAG,KAAI;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,KAAK,KAAK;AACb,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,EAAE,GAAG;AACvC,WAAK,KAAK,CAAC,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,CAAC,GAAG,GAAG,GAAG,GAAG;AAAA,IAC5D;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,MAAM,KAAK,KAAK;AACZ,WAAO,KAAK,MAAK,EAAG,OAAO,KAAK,GAAG;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS;AACL,aAAS,IAAI,GAAG,IAAI,KAAK,KAAK,QAAQ,EAAE,GAAG;AACvC,WAAK,KAAK,CAAC,IAAI,KAAK,MAAM,KAAK,KAAK,CAAC,CAAC;AAAA,IAC1C;AACA,WAAO;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQ;AACJ,WAAO,KAAK,MAAK,EAAG,OAAM;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,GAAG,MAAM;AAEL,QAAI,KAAK,SAAS,KAAM,QAAO;AAG/B,QAAI,CAAC,YAAY,eAAe,IAAI,GAAG;AACnC,YAAM,IAAI,MAAM,qBAAqB,IAAI,EAAE;AAAA,IAC/C;AAEA,WAAO,IAAI,OAAO,MAAM,YAAY,IAAI,EAAE,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI;AAAA,EACxE;AACJ;AA+BA,SAAS,QAAQ,MAAM,YAAY;AAE/B,QAAM,gBAAgB,KAAK;AAC3B,QAAM,gBAAgB,WAAW,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC;AAEvD,MAAI,kBAAkB,eAAe;AACjC,UAAM,MAAM,gCAAgC,aAAa,gBAAgB,UAAU,GAAG;AAAA,EAC1F;AAGA,MAAI,gBAAgB;AAEpB,WAAS,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;AAC7C,oBAAgB,cAAc,OAAO,CAAC,KAAK,QAAQ;AAC/C,UAAI,YAAY,IAAI,IAAI,SAAS,CAAC;AAElC,UAAI,UAAU,SAAS,WAAW,CAAC,GAAG;AAClC,kBAAU,KAAK,GAAG;AAAA,MACtB,OAAO;AACH,YAAI,KAAK,CAAC,GAAG,CAAC;AAAA,MAClB;AAEA,aAAO;AAAA,IACX,GAAG,CAAC,CAAA,CAAE,CAAC;AAAA,EACX;AAEA,SAAO,cAAc,CAAC;AAC1B;AAQO,SAAS,QAAQ,QAAQ,MAAM;AAClC,QAAM,CAAC,cAAc,KAAK,IAAI,aAAa,OAAO,MAAM,OAAO,MAAM,IAAI;AACzE,SAAO,IAAI,OAAO,OAAO,MAAM,cAAc,KAAK;AACtD;AAqHA,SAAS,kBAAkB,MAAM,KAAK;AAClC,SAAO,KAAK,MAAK;AACjB,MAAI,QAAQ,MAAM;AACd,WAAO,KAAK,OAAO,CAAC,MAAM,MAAM,CAAC;AAAA,EACrC,WAAW,OAAO,QAAQ,UAAU;AAChC,QAAI,KAAK,GAAG,MAAM,GAAG;AACjB,WAAK,OAAO,KAAK,CAAC;AAAA,IACtB;AAAA,EACJ,WAAW,MAAM,QAAQ,GAAG,GAAG;AAC3B,WAAO,KAAK,OAAO,CAAC,GAAG,MAAM;AACzB,aAAO,MAAM,KAAK,CAAC,IAAI,SAAS,CAAC;AAAA,IACrC,CAAC;AAAA,EACL;AACA,SAAO;AACX;AASA,SAAS,oBAAoB,MAAM,KAAK;AAGpC,QAAM,UAAU,KAAK,KAAK,SAAS,CAAC;AACpC,SAAO,KAAK,MAAK;AAEjB,OAAK,OAAO,KAAK,GAAG,CAAC;AACrB,SAAO;AACX;AAYA,SAAS,UAAU,OAAO,MAAM,YAAY,MAAM;AAC9C,MAAI,QAAQ,CAAC,QAAQ,SAAS,MAAM;AAChC,UAAM,IAAI,MAAM,qBAAqB,KAAK,kCAAkC,cAAc,OAAO,KAAK,MAAM,SAAS,cAAc,IAAI,EAAE;AAAA,EAC7I;AAEA,MAAI,QAAQ,GAAG;AAEX,aAAU,QAAQ,OAAQ,QAAQ;AAAA,EACtC;AACA,SAAO;AACX;AAQO,SAAS,IAAI,SAAS,MAAM,GAAG;AAClC,QAAM,UAAU,KAAK,QAAQ,CAAC,EAAE,KAAK,MAAM;AAI3C,QAAM,aAAa,QAAQ,CAAC,EAAE,KAAK,MAAK;AACxC,aAAW,GAAG,IAAI,QAAQ,OAAO,CAAC,GAAG,MAAM,IAAI,EAAE,KAAK,GAAG,GAAG,CAAC;AAG7D,QAAM,aAAa,WAAW,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAEvD,QAAM,SAAS,IAAI,QAAQ,CAAC,EAAE,KAAK,YAAY,UAAU;AAGzD,QAAM,aAAa,QAAQ,CAAC,EAAE;AAE9B,MAAI,QAAQ,GAAG;AAGX,QAAI,SAAS;AACb,aAAS,KAAK,SAAS;AACnB,aAAO,IAAI,EAAE,MAAM,MAAM;AACzB,gBAAU,EAAE,KAAK;AAAA,IACrB;AAAA,EAEJ,OAAO;AAEH,QAAI,aAAa;AAEjB,aAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACrC,UAAI,SAAS,QAAQ,CAAC;AAGtB,eAAS,IAAI,GAAG,IAAI,OAAO,KAAK,QAAQ,EAAE,GAAG;AAEzC,YAAI,cAAc;AAElB,iBAAS,IAAI,OAAO,KAAK,SAAS,GAAG,MAAM,GAAG,mBAAmB,GAAG,KAAK,GAAG,EAAE,GAAG;AAC7E,gBAAM,OAAO,OAAO,KAAK,CAAC;AAC1B,cAAI,QAAQ,MAAM;AAClB,cAAI,MAAM,KAAK;AACX,qBAAS;AAAA,UACb;AACA,yBAAe,QAAQ;AACvB,8BAAoB,WAAW,CAAC;AAChC,gBAAM,KAAK,MAAM,MAAM,IAAI;AAAA,QAC/B;AAEA,eAAO,WAAW,IAAI,OAAO,KAAK,CAAC;AAAA,MACvC;AAEA,oBAAc,OAAO,KAAK,GAAG;AAAA,IACjC;AAAA,EACJ;AACA,SAAO,IAAI,OAAO,YAAY,QAAQ,UAAU;AACpD;AAQO,SAAS,MAAM,SAAS,MAAM,GAAG;AAGpC,SAAO,IAAI,QAAQ,IAAI,OAAK,EAAE,UAAU,GAAG,CAAC,GAAG,GAAG;AACtD;AAWO,SAAS,SAAS,OAAO,MAAM,MAAM,aAAa,GAAG,UAAU,OAAO;AAEzE,MAAI,QAAQ,MAAM;AAGd,UAAM,MAAM,MAAM,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAChD,UAAMA,QAAO,MAAM,MAAM,KAAK;AAE9B,UAAM,MAAM,KAAK,KAAK,MAAM,KAAK,OAAO,CAAC,GAAG,MAAM,KAAK,IAAIA,UAAS,GAAG,CAAC,KAAK,MAAM,KAAK,SAAS,WAAW;AAE5G,UAAMC,cAAa,IAAI,OAAO,MAAM,MAAM,CAACD,KAAI,GAAG;AAAA;AAAA,KAAc;AAChE,UAAME,aAAY,IAAI,OAAO,MAAM,MAAM,CAAC,GAAG,GAAG;AAAA;AAAA,KAAc;AAE9D,WAAO,CAACA,YAAWD,WAAU;AAAA,EACjC;AAGA,QAAM,UAAU,KAAK,MAAM,KAAK,MAAM;AAEtC,QAAM,aAAa,KAAK,OAAO,KAAK,OAAO;AAG3C,QAAM,aAAa,MAAM,KAAK,MAAK;AACnC,aAAW,GAAG,IAAI;AAIlB,QAAM,SAAS,IAAI,MAAM,KAAK,YAAY,MAAM,KAAK,SAAS,MAAM,KAAK,GAAG,CAAC;AAG7E,WAAS,IAAI,GAAG,IAAI,MAAM,KAAK,QAAQ,EAAE,GAAG;AAGxC,QAAI,cAAc;AAElB,aAAS,IAAI,MAAM,KAAK,SAAS,GAAG,MAAM,GAAG,mBAAmB,GAAG,KAAK,GAAG,EAAE,GAAG;AAC5E,YAAM,OAAO,MAAM,KAAK,CAAC;AACzB,UAAI,MAAM,KAAK;AACX,cAAM,QAAQ,MAAM;AACpB,uBAAe,QAAQ;AACvB,4BAAoB,WAAW,CAAC;AAAA,MACpC;AACA,YAAM,KAAK,MAAM,MAAM,IAAI;AAAA,IAC/B;AAGA,WAAO,WAAW,MAAM,MAAM,KAAK,CAAC,IAAI,WAAW,KAAK,WAAW,MAAM;AAAA,EAC7E;AAEA,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AACpC,WAAO,CAAC,IAAI,KAAK,KAAK,OAAO,CAAC,KAAK,MAAM,KAAK,GAAG,IAAI,WAAW;AAAA,EACpE;AAEA,MAAI,CAAC,SAAS;AACV,eAAW,OAAO,KAAK,CAAC;AAAA,EAC5B;AAEA,QAAM,YAAY,IAAI,OAAO,MAAM,MAAM,QAAQ,UAAU;AAE3D,SAAO,CAAC,WAAW,UAAU;AACjC;AAUO,SAAS,KAAK,OAAO,MAAM,MAAM,UAAU,OAAO;AAErD,MAAI,QAAQ,MAAM;AAGd,QAAI,MAAM,MAAM,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAC9C,WAAO,IAAI,OAAO,MAAM,MAAM,CAAC,MAAM,MAAM,KAAK,MAAM,GAAG;AAAA;AAAA,KAAc;AAAA,EAC3E;AAGA,QAAM,UAAU,KAAK,MAAM,KAAK,MAAM;AAGtC,QAAM,aAAa,MAAM,KAAK,MAAK;AACnC,aAAW,GAAG,IAAI;AAIlB,QAAM,SAAS,IAAI,MAAM,KAAK,YAAY,MAAM,KAAK,SAAS,MAAM,KAAK,GAAG,CAAC;AAG7E,WAAS,IAAI,GAAG,IAAI,MAAM,KAAK,QAAQ,EAAE,GAAG;AAGxC,QAAI,cAAc;AAElB,aAAS,IAAI,MAAM,KAAK,SAAS,GAAG,MAAM,GAAG,mBAAmB,GAAG,KAAK,GAAG,EAAE,GAAG;AAC5E,YAAM,OAAO,MAAM,KAAK,CAAC;AACzB,UAAI,MAAM,KAAK;AACX,cAAM,QAAQ,MAAM;AACpB,uBAAe,QAAQ;AACvB,4BAAoB,WAAW,CAAC;AAAA,MACpC;AACA,YAAM,KAAK,MAAM,MAAM,IAAI;AAAA,IAC/B;AAGA,WAAO,WAAW,KAAK,MAAM,KAAK,CAAC;AAAA,EACvC;AAEA,MAAI,MAAM,KAAK,GAAG,MAAM,GAAG;AACvB,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,EAAE,GAAG;AACpC,aAAO,CAAC,IAAI,OAAO,CAAC,IAAI,MAAM,KAAK,GAAG;AAAA,IAC1C;AAAA,EACJ;AAEA,MAAI,CAAC,SAAS;AACV,eAAW,OAAO,KAAK,CAAC;AAAA,EAC5B;AAEA,SAAO,IAAI,OAAO,MAAM,MAAM,QAAQ,UAAU;AACpD;AAUO,SAAS,mBAAmB,QAAQ;AACvC,QAAM,CAAC,eAAe,YAAY,IAAI,OAAO;AAE7C,QAAM,cAAc,CAAC,gBAAgB,GAAG,eAAe,CAAC;AAExD,QAAM,OAAO,IAAI;AAAA,IACb;AAAA,IACA,IAAI,aAAa,YAAY,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,KAAK,QAAQ;AAAA,IAC/D;AAAA,EACR;AAEI,QAAM,QAAQ,IAAI;AAAA,IACd;AAAA,IACA,IAAI,aAAa,YAAY,CAAC,IAAI,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE;AAAA,IACzD;AAAA,EACR;AAGI,OAAK,CAAC,EAAE,KAAK,CAAC,IAAI;AAElB,WAASE,KAAI,GAAGA,KAAI,eAAe,GAAG,EAAEA,IAAG;AACvC,aAASC,KAAI,GAAGA,KAAI,gBAAgB,GAAG,EAAEA,IAAG;AAExC,YAAM,KAAK,KAAKA,KAAI,CAAC,EAAED,KAAI,CAAC,EAAE,KAAI;AAClC,YAAM,KAAK,KAAKC,KAAI,CAAC,EAAED,EAAC,EAAE,KAAI;AAC9B,YAAM,KAAK,KAAKC,EAAC,EAAED,KAAI,CAAC,EAAE,KAAI;AAE9B,UAAI,GAAG;AACP,UAAI,KAAK,MAAM,KAAK,IAAI;AACpB,YAAI;AACJ,YAAI;AAAA,MACR,WAAW,KAAK,MAAM,KAAK,IAAI;AAC3B,YAAI;AACJ,YAAI;AAAA,MACR,OAAO;AACH,YAAI;AACJ,YAAI;AAAA,MACR;AAEA,WAAKC,EAAC,EAAE,KAAKD,EAAC,IAAI,OAAOC,KAAI,CAAC,EAAED,KAAI,CAAC,EAAE,KAAI,IAAK;AAChD,YAAMC,EAAC,EAAE,KAAKD,EAAC,IAAI;AAAA,IACvB;AAAA,EACJ;AAGA,MAAI,IAAI;AACR,MAAI,IAAI;AAGR,QAAM,KAAK,KAAK,GAAG,GAAG,YAAY,CAAC,CAAC;AACpC,WAASC,KAAI,GAAGA,KAAI,YAAY,CAAC,GAAG,EAAEA,IAAG;AACrC,UAAMA,EAAC,EAAE,KAAK,CAAC,IAAI;AAAA,EACvB;AAEA,MAAI,eAAe,CAAA;AACnB,MAAI,eAAe,CAAA;AAEnB,SAAO,IAAI,KAAK,IAAI,GAAG;AACnB,iBAAa,KAAK,IAAI,CAAC;AACvB,iBAAa,KAAK,IAAI,CAAC;AAEvB,UAAM,IAAI,MAAM,CAAC,EAAE,CAAC,EAAE,KAAI;AAC1B,YAAQ,GAAC;AAAA,MACL,KAAK;AACD,UAAE;AAAG,UAAE;AACP;AAAA,MACJ,KAAK;AACD,UAAE;AACF;AAAA,MACJ,KAAK;AACD,UAAE;AACF;AAAA,MACJ;AACI,cAAM,IAAI;AAAA,UACN,4DAA4D,CAAC,KAAK,CAAC;AAAA,QACvF;AAAA,IACA;AAAA,EACI;AAEA,eAAa,QAAO;AACpB,eAAa,QAAO;AAEpB,SAAO,CAAC,cAAc,YAAY;AAEtC;AAEA,SAAS,aAAa,MAAM;AACxB,QAAM,SAAS,IAAI,MAAM,KAAK,MAAM;AACpC,WAAS,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK,GAAG,EAAE,GAAG;AAC/C,WAAO,CAAC,IAAI;AACZ,UAAM,KAAK,CAAC;AAAA,EAChB;AACA,SAAO;AACX;AAMO,SAAS,KAAK,MAAM;AACvB,QAAM,cAAc,KAAK,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAClD,SAAO,IAAI;AAAA,IACP;AAAA,IACA,IAAI,cAAc,WAAW,EAAE,KAAK,EAAE;AAAA,IACtC;AAAA,EACR;AACA;AAOO,SAAS,UAAU,QAAQ;AAC9B,SAAO,KAAK,OAAO,IAAI;AAC3B;","x_google_ignoreList":[0]}

package/dist/node_modules/fdir/dist/index.js CHANGED Viewed

@@ -1,6 +1,6 @@
 import { __exports as dist } from "../../../_virtual/index10.js";
 import path__default from "path";
-import require$$1 from "fs";
+import fs from "fs";
 import { __require as requirePicomatch } from "../../picomatch/index.js";
 var hasRequiredDist;
 function requireDist() {
@@ -27,7 +27,7 @@ function requireDist() {
     enumerable: true
   }) : target, mod));
   const path = __toESM(path__default);
-  const fs = __toESM(require$$1);
+  const fs$1 = __toESM(fs);
   function cleanPath(path$1) {
     let normalized = (0, path.normalize)(path$1);
     if (normalized.length > 1 && normalized[normalized.length - 1] === path.sep) normalized = normalized.substring(0, normalized.length - 1);
@@ -139,11 +139,11 @@ function requireDist() {
     return options.group ? groupFiles : empty;
   }
   const resolveSymlinksAsync = function(path$1, state, callback$1) {
-    const { queue, fs: fs$1, options: { suppressErrors } } = state;
+    const { queue, fs: fs$12, options: { suppressErrors } } = state;
     queue.enqueue();
-    fs$1.realpath(path$1, (error, resolvedPath) => {
+    fs$12.realpath(path$1, (error, resolvedPath) => {
       if (error) return queue.dequeue(suppressErrors ? null : error, state);
-      fs$1.stat(resolvedPath, (error$1, stat) => {
+      fs$12.stat(resolvedPath, (error$1, stat) => {
         if (error$1) return queue.dequeue(suppressErrors ? null : error$1, state);
         if (stat.isDirectory() && isRecursive(path$1, resolvedPath, state)) return queue.dequeue(null, state);
         callback$1(stat, resolvedPath);
@@ -152,11 +152,11 @@ function requireDist() {
     });
   };
   const resolveSymlinks = function(path$1, state, callback$1) {
-    const { queue, fs: fs$1, options: { suppressErrors } } = state;
+    const { queue, fs: fs$12, options: { suppressErrors } } = state;
     queue.enqueue();
     try {
-      const resolvedPath = fs$1.realpathSync(path$1);
-      const stat = fs$1.statSync(resolvedPath);
+      const resolvedPath = fs$12.realpathSync(path$1);
+      const stat = fs$12.statSync(resolvedPath);
       if (stat.isDirectory() && isRecursive(path$1, resolvedPath, state)) return;
       callback$1(stat, resolvedPath);
     } catch (e) {
@@ -226,22 +226,22 @@ function requireDist() {
   const walkAsync = (state, crawlPath, directoryPath, currentDepth, callback$1) => {
     state.queue.enqueue();
     if (currentDepth < 0) return state.queue.dequeue(null, state);
-    const { fs: fs$1 } = state;
+    const { fs: fs$12 } = state;
     state.visited.push(crawlPath);
     state.counts.directories++;
-    fs$1.readdir(crawlPath || ".", readdirOpts, (error, entries = []) => {
+    fs$12.readdir(crawlPath || ".", readdirOpts, (error, entries = []) => {
       callback$1(entries, directoryPath, currentDepth);
       state.queue.dequeue(state.options.suppressErrors ? null : error, state);
     });
   };
   const walkSync = (state, crawlPath, directoryPath, currentDepth, callback$1) => {
-    const { fs: fs$1 } = state;
+    const { fs: fs$12 } = state;
     if (currentDepth < 0) return;
     state.visited.push(crawlPath);
     state.counts.directories++;
     let entries = [];
     try {
-      entries = fs$1.readdirSync(crawlPath || ".", readdirOpts);
+      entries = fs$12.readdirSync(crawlPath || ".", readdirOpts);
     } catch (e) {
       if (!state.options.suppressErrors) throw e;
     }
@@ -324,7 +324,7 @@ function requireDist() {
         symlinks: /* @__PURE__ */ new Map(),
         visited: [""].slice(0, 0),
         controller: new Aborter(),
-        fs: options.fs || fs
+        fs: options.fs || fs$1
       };
       this.joinPath = build$7(this.root, options);
       this.pushDirectory = build$6(this.root, options);

package/dist/node_modules/fdir/dist/index.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.js","sources":["../../../../node_modules/fdir/dist/index.cjs"],"sourcesContent":["//#region rolldown:runtime\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __copyProps = (to, from, except, desc) => {\n\tif (from && typeof from === \"object\" \|\| typeof from === \"function\") for (var keys = __getOwnPropNames(from), i = 0, n = keys.length, key; i < n; i++) {\n\t\tkey = keys[i];\n\t\tif (!__hasOwnProp.call(to, key) && key !== except) __defProp(to, key, {\n\t\t\tget: ((k) => from[k]).bind(null, key),\n\t\t\tenumerable: !(desc = __getOwnPropDesc(from, key)) \|\| desc.enumerable\n\t\t});\n\t}\n\treturn to;\n};\nvar __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(isNodeMode \|\| !mod \|\| !mod.__esModule ? __defProp(target, \"default\", {\n\tvalue: mod,\n\tenumerable: true\n}) : target, mod));\n\n//#endregion\nconst path = __toESM(require(\"path\"));\nconst fs = __toESM(require(\"fs\"));\n\n//#region src/utils.ts\nfunction cleanPath(path$1) {\n\tlet normalized = (0, path.normalize)(path$1);\n\tif (normalized.length > 1 && normalized[normalized.length - 1] === path.sep) normalized = normalized.substring(0, normalized.length - 1);\n\treturn normalized;\n}\nconst SLASHES_REGEX = /[\\\\/]/g;\nfunction convertSlashes(path$1, separator) {\n\treturn path$1.replace(SLASHES_REGEX, separator);\n}\nconst WINDOWS_ROOT_DIR_REGEX = /^[a-z]:[\\\\/]$/i;\nfunction isRootDirectory(path$1) {\n\treturn path$1 === \"/\" \|\| WINDOWS_ROOT_DIR_REGEX.test(path$1);\n}\nfunction normalizePath(path$1, options) {\n\tconst { resolvePaths, normalizePath: normalizePath$1, pathSeparator } = options;\n\tconst pathNeedsCleaning = process.platform === \"win32\" && path$1.includes(\"/\") \|\| path$1.startsWith(\".\");\n\tif (resolvePaths) path$1 = (0, path.resolve)(path$1);\n\tif (normalizePath$1 \|\| pathNeedsCleaning) path$1 = cleanPath(path$1);\n\tif (path$1 === \".\") return \"\";\n\tconst needsSeperator = path$1[path$1.length - 1] !== pathSeparator;\n\treturn convertSlashes(needsSeperator ? path$1 + pathSeparator : path$1, pathSeparator);\n}\n\n//#endregion\n//#region src/api/functions/join-path.ts\nfunction joinPathWithBasePath(filename, directoryPath) {\n\treturn directoryPath + filename;\n}\nfunction joinPathWithRelativePath(root, options) {\n\treturn function(filename, directoryPath) {\n\t\tconst sameRoot = directoryPath.startsWith(root);\n\t\tif (sameRoot) return directoryPath.slice(root.length) + filename;\n\t\telse return convertSlashes((0, path.relative)(root, directoryPath), options.pathSeparator) + options.pathSeparator + filename;\n\t};\n}\nfunction joinPath(filename) {\n\treturn filename;\n}\nfunction joinDirectoryPath(filename, directoryPath, separator) {\n\treturn directoryPath + filename + separator;\n}\nfunction build$7(root, options) {\n\tconst { relativePaths, includeBasePath } = options;\n\treturn relativePaths && root ? joinPathWithRelativePath(root, options) : includeBasePath ? joinPathWithBasePath : joinPath;\n}\n\n//#endregion\n//#region src/api/functions/push-directory.ts\nfunction pushDirectoryWithRelativePath(root) {\n\treturn function(directoryPath, paths) {\n\t\tpaths.push(directoryPath.substring(root.length) \|\| \".\");\n\t};\n}\nfunction pushDirectoryFilterWithRelativePath(root) {\n\treturn function(directoryPath, paths, filters) {\n\t\tconst relativePath = directoryPath.substring(root.length) \|\| \".\";\n\t\tif (filters.every((filter) => filter(relativePath, true))) paths.push(relativePath);\n\t};\n}\nconst pushDirectory = (directoryPath, paths) => {\n\tpaths.push(directoryPath \|\| \".\");\n};\nconst pushDirectoryFilter = (directoryPath, paths, filters) => {\n\tconst path$1 = directoryPath \|\| \".\";\n\tif (filters.every((filter) => filter(path$1, true))) paths.push(path$1);\n};\nconst empty$2 = () => {};\nfunction build$6(root, options) {\n\tconst { includeDirs, filters, relativePaths } = options;\n\tif (!includeDirs) return empty$2;\n\tif (relativePaths) return filters && filters.length ? pushDirectoryFilterWithRelativePath(root) : pushDirectoryWithRelativePath(root);\n\treturn filters && filters.length ? pushDirectoryFilter : pushDirectory;\n}\n\n//#endregion\n//#region src/api/functions/push-file.ts\nconst pushFileFilterAndCount = (filename, _paths, counts, filters) => {\n\tif (filters.every((filter) => filter(filename, false))) counts.files++;\n};\nconst pushFileFilter = (filename, paths, _counts, filters) => {\n\tif (filters.every((filter) => filter(filename, false))) paths.push(filename);\n};\nconst pushFileCount = (_filename, _paths, counts, _filters) => {\n\tcounts.files++;\n};\nconst pushFile = (filename, paths) => {\n\tpaths.push(filename);\n};\nconst empty$1 = () => {};\nfunction build$5(options) {\n\tconst { excludeFiles, filters, onlyCounts } = options;\n\tif (excludeFiles) return empty$1;\n\tif (filters && filters.length) return onlyCounts ? pushFileFilterAndCount : pushFileFilter;\n\telse if (onlyCounts) return pushFileCount;\n\telse return pushFile;\n}\n\n//#endregion\n//#region src/api/functions/get-array.ts\nconst getArray = (paths) => {\n\treturn paths;\n};\nconst getArrayGroup = () => {\n\treturn [\"\"].slice(0, 0);\n};\nfunction build$4(options) {\n\treturn options.group ? getArrayGroup : getArray;\n}\n\n//#endregion\n//#region src/api/functions/group-files.ts\nconst groupFiles = (groups, directory, files) => {\n\tgroups.push({\n\t\tdirectory,\n\t\tfiles,\n\t\tdir: directory\n\t});\n};\nconst empty = () => {};\nfunction build$3(options) {\n\treturn options.group ? groupFiles : empty;\n}\n\n//#endregion\n//#region src/api/functions/resolve-symlink.ts\nconst resolveSymlinksAsync = function(path$1, state, callback$1) {\n\tconst { queue, fs: fs$1, options: { suppressErrors } } = state;\n\tqueue.enqueue();\n\tfs$1.realpath(path$1, (error, resolvedPath) => {\n\t\tif (error) return queue.dequeue(suppressErrors ? null : error, state);\n\t\tfs$1.stat(resolvedPath, (error$1, stat) => {\n\t\t\tif (error$1) return queue.dequeue(suppressErrors ? null : error$1, state);\n\t\t\tif (stat.isDirectory() && isRecursive(path$1, resolvedPath, state)) return queue.dequeue(null, state);\n\t\t\tcallback$1(stat, resolvedPath);\n\t\t\tqueue.dequeue(null, state);\n\t\t});\n\t});\n};\nconst resolveSymlinks = function(path$1, state, callback$1) {\n\tconst { queue, fs: fs$1, options: { suppressErrors } } = state;\n\tqueue.enqueue();\n\ttry {\n\t\tconst resolvedPath = fs$1.realpathSync(path$1);\n\t\tconst stat = fs$1.statSync(resolvedPath);\n\t\tif (stat.isDirectory() && isRecursive(path$1, resolvedPath, state)) return;\n\t\tcallback$1(stat, resolvedPath);\n\t} catch (e) {\n\t\tif (!suppressErrors) throw e;\n\t}\n};\nfunction build$2(options, isSynchronous) {\n\tif (!options.resolveSymlinks \|\| options.excludeSymlinks) return null;\n\treturn isSynchronous ? resolveSymlinks : resolveSymlinksAsync;\n}\nfunction isRecursive(path$1, resolved, state) {\n\tif (state.options.useRealPaths) return isRecursiveUsingRealPaths(resolved, state);\n\tlet parent = (0, path.dirname)(path$1);\n\tlet depth = 1;\n\twhile (parent !== state.root && depth < 2) {\n\t\tconst resolvedPath = state.symlinks.get(parent);\n\t\tconst isSameRoot = !!resolvedPath && (resolvedPath === resolved \|\| resolvedPath.startsWith(resolved) \|\| resolved.startsWith(resolvedPath));\n\t\tif (isSameRoot) depth++;\n\t\telse parent = (0, path.dirname)(parent);\n\t}\n\tstate.symlinks.set(path$1, resolved);\n\treturn depth > 1;\n}\nfunction isRecursiveUsingRealPaths(resolved, state) {\n\treturn state.visited.includes(resolved + state.options.pathSeparator);\n}\n\n//#endregion\n//#region src/api/functions/invoke-callback.ts\nconst onlyCountsSync = (state) => {\n\treturn state.counts;\n};\nconst groupsSync = (state) => {\n\treturn state.groups;\n};\nconst defaultSync = (state) => {\n\treturn state.paths;\n};\nconst limitFilesSync = (state) => {\n\treturn state.paths.slice(0, state.options.maxFiles);\n};\nconst onlyCountsAsync = (state, error, callback$1) => {\n\treport(error, callback$1, state.counts, state.options.suppressErrors);\n\treturn null;\n};\nconst defaultAsync = (state, error, callback$1) => {\n\treport(error, callback$1, state.paths, state.options.suppressErrors);\n\treturn null;\n};\nconst limitFilesAsync = (state, error, callback$1) => {\n\treport(error, callback$1, state.paths.slice(0, state.options.maxFiles), state.options.suppressErrors);\n\treturn null;\n};\nconst groupsAsync = (state, error, callback$1) => {\n\treport(error, callback$1, state.groups, state.options.suppressErrors);\n\treturn null;\n};\nfunction report(error, callback$1, output, suppressErrors) {\n\tif (error && !suppressErrors) callback$1(error, output);\n\telse callback$1(null, output);\n}\nfunction build$1(options, isSynchronous) {\n\tconst { onlyCounts, group, maxFiles } = options;\n\tif (onlyCounts) return isSynchronous ? onlyCountsSync : onlyCountsAsync;\n\telse if (group) return isSynchronous ? groupsSync : groupsAsync;\n\telse if (maxFiles) return isSynchronous ? limitFilesSync : limitFilesAsync;\n\telse return isSynchronous ? defaultSync : defaultAsync;\n}\n\n//#endregion\n//#region src/api/functions/walk-directory.ts\nconst readdirOpts = { withFileTypes: true };\nconst walkAsync = (state, crawlPath, directoryPath, currentDepth, callback$1) => {\n\tstate.queue.enqueue();\n\tif (currentDepth < 0) return state.queue.dequeue(null, state);\n\tconst { fs: fs$1 } = state;\n\tstate.visited.push(crawlPath);\n\tstate.counts.directories++;\n\tfs$1.readdir(crawlPath \|\| \".\", readdirOpts, (error, entries = []) => {\n\t\tcallback$1(entries, directoryPath, currentDepth);\n\t\tstate.queue.dequeue(state.options.suppressErrors ? null : error, state);\n\t});\n};\nconst walkSync = (state, crawlPath, directoryPath, currentDepth, callback$1) => {\n\tconst { fs: fs$1 } = state;\n\tif (currentDepth < 0) return;\n\tstate.visited.push(crawlPath);\n\tstate.counts.directories++;\n\tlet entries = [];\n\ttry {\n\t\tentries = fs$1.readdirSync(crawlPath \|\| \".\", readdirOpts);\n\t} catch (e) {\n\t\tif (!state.options.suppressErrors) throw e;\n\t}\n\tcallback$1(entries, directoryPath, currentDepth);\n};\nfunction build(isSynchronous) {\n\treturn isSynchronous ? walkSync : walkAsync;\n}\n\n//#endregion\n//#region src/api/queue.ts\n/*\n This is a custom stateless queue to track concurrent async fs calls.\n* It increments a counter whenever a call is queued and decrements it\n* as soon as it completes. When the counter hits 0, it calls onQueueEmpty.\n/\nvar Queue = class {\n\tcount = 0;\n\tconstructor(onQueueEmpty) {\n\t\tthis.onQueueEmpty = onQueueEmpty;\n\t}\n\tenqueue() {\n\t\tthis.count++;\n\t\treturn this.count;\n\t}\n\tdequeue(error, output) {\n\t\tif (this.onQueueEmpty && (--this.count <= 0 \|\| error)) {\n\t\t\tthis.onQueueEmpty(error, output);\n\t\t\tif (error) {\n\t\t\t\toutput.controller.abort();\n\t\t\t\tthis.onQueueEmpty = void 0;\n\t\t\t}\n\t\t}\n\t}\n};\n\n//#endregion\n//#region src/api/counter.ts\nvar Counter = class {\n\t_files = 0;\n\t_directories = 0;\n\tset files(num) {\n\t\tthis._files = num;\n\t}\n\tget files() {\n\t\treturn this._files;\n\t}\n\tset directories(num) {\n\t\tthis._directories = num;\n\t}\n\tget directories() {\n\t\treturn this._directories;\n\t}\n\t/\n\t @deprecated use `directories` instead\n\t/\n\t/ c8 ignore next 3 /\n\tget dirs() {\n\t\treturn this._directories;\n\t}\n};\n\n//#endregion\n//#region src/api/aborter.ts\n/\n AbortController is not supported on Node 14 so we use this until we can drop\n* support for Node 14.\n/\nvar Aborter = class {\n\taborted = false;\n\tabort() {\n\t\tthis.aborted = true;\n\t}\n};\n\n//#endregion\n//#region src/api/walker.ts\nvar Walker = class {\n\troot;\n\tisSynchronous;\n\tstate;\n\tjoinPath;\n\tpushDirectory;\n\tpushFile;\n\tgetArray;\n\tgroupFiles;\n\tresolveSymlink;\n\twalkDirectory;\n\tcallbackInvoker;\n\tconstructor(root, options, callback$1) {\n\t\tthis.isSynchronous = !callback$1;\n\t\tthis.callbackInvoker = build$1(options, this.isSynchronous);\n\t\tthis.root = normalizePath(root, options);\n\t\tthis.state = {\n\t\t\troot: isRootDirectory(this.root) ? this.root : this.root.slice(0, -1),\n\t\t\tpaths: [\"\"].slice(0, 0),\n\t\t\tgroups: [],\n\t\t\tcounts: new Counter(),\n\t\t\toptions,\n\t\t\tqueue: new Queue((error, state) => this.callbackInvoker(state, error, callback$1)),\n\t\t\tsymlinks: / @__PURE__ / new Map(),\n\t\t\tvisited: [\"\"].slice(0, 0),\n\t\t\tcontroller: new Aborter(),\n\t\t\tfs: options.fs \|\| fs\n\t\t};\n\t\tthis.joinPath = build$7(this.root, options);\n\t\tthis.pushDirectory = build$6(this.root, options);\n\t\tthis.pushFile = build$5(options);\n\t\tthis.getArray = build$4(options);\n\t\tthis.groupFiles = build$3(options);\n\t\tthis.resolveSymlink = build$2(options, this.isSynchronous);\n\t\tthis.walkDirectory = build(this.isSynchronous);\n\t}\n\tstart() {\n\t\tthis.pushDirectory(this.root, this.state.paths, this.state.options.filters);\n\t\tthis.walkDirectory(this.state, this.root, this.root, this.state.options.maxDepth, this.walk);\n\t\treturn this.isSynchronous ? this.callbackInvoker(this.state, null) : null;\n\t}\n\twalk = (entries, directoryPath, depth) => {\n\t\tconst { paths, options: { filters, resolveSymlinks: resolveSymlinks$1, excludeSymlinks, exclude, maxFiles, signal, useRealPaths, pathSeparator }, controller } = this.state;\n\t\tif (controller.aborted \|\| signal && signal.aborted \|\| maxFiles && paths.length > maxFiles) return;\n\t\tconst files = this.getArray(this.state.paths);\n\t\tfor (let i = 0; i < entries.length; ++i) {\n\t\t\tconst entry = entries[i];\n\t\t\tif (entry.isFile() \|\| entry.isSymbolicLink() && !resolveSymlinks$1 && !excludeSymlinks) {\n\t\t\t\tconst filename = this.joinPath(entry.name, directoryPath);\n\t\t\t\tthis.pushFile(filename, files, this.state.counts, filters);\n\t\t\t} else if (entry.isDirectory()) {\n\t\t\t\tlet path$1 = joinDirectoryPath(entry.name, directoryPath, this.state.options.pathSeparator);\n\t\t\t\tif (exclude && exclude(entry.name, path$1)) continue;\n\t\t\t\tthis.pushDirectory(path$1, paths, filters);\n\t\t\t\tthis.walkDirectory(this.state, path$1, path$1, depth - 1, this.walk);\n\t\t\t} else if (this.resolveSymlink && entry.isSymbolicLink()) {\n\t\t\t\tlet path$1 = joinPathWithBasePath(entry.name, directoryPath);\n\t\t\t\tthis.resolveSymlink(path$1, this.state, (stat, resolvedPath) => {\n\t\t\t\t\tif (stat.isDirectory()) {\n\t\t\t\t\t\tresolvedPath = normalizePath(resolvedPath, this.state.options);\n\t\t\t\t\t\tif (exclude && exclude(entry.name, useRealPaths ? resolvedPath : path$1 + pathSeparator)) return;\n\t\t\t\t\t\tthis.walkDirectory(this.state, resolvedPath, useRealPaths ? resolvedPath : path$1 + pathSeparator, depth - 1, this.walk);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresolvedPath = useRealPaths ? resolvedPath : path$1;\n\t\t\t\t\t\tconst filename = (0, path.basename)(resolvedPath);\n\t\t\t\t\t\tconst directoryPath$1 = normalizePath((0, path.dirname)(resolvedPath), this.state.options);\n\t\t\t\t\t\tresolvedPath = this.joinPath(filename, directoryPath$1);\n\t\t\t\t\t\tthis.pushFile(resolvedPath, files, this.state.counts, filters);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\tthis.groupFiles(this.state.groups, directoryPath, files);\n\t};\n};\n\n//#endregion\n//#region src/api/async.ts\nfunction promise(root, options) {\n\treturn new Promise((resolve$1, reject) => {\n\t\tcallback(root, options, (err, output) => {\n\t\t\tif (err) return reject(err);\n\t\t\tresolve$1(output);\n\t\t});\n\t});\n}\nfunction callback(root, options, callback$1) {\n\tlet walker = new Walker(root, options, callback$1);\n\twalker.start();\n}\n\n//#endregion\n//#region src/api/sync.ts\nfunction sync(root, options) {\n\tconst walker = new Walker(root, options);\n\treturn walker.start();\n}\n\n//#endregion\n//#region src/builder/api-builder.ts\nvar APIBuilder = class {\n\tconstructor(root, options) {\n\t\tthis.root = root;\n\t\tthis.options = options;\n\t}\n\twithPromise() {\n\t\treturn promise(this.root, this.options);\n\t}\n\twithCallback(cb) {\n\t\tcallback(this.root, this.options, cb);\n\t}\n\tsync() {\n\t\treturn sync(this.root, this.options);\n\t}\n};\n\n//#endregion\n//#region src/builder/index.ts\nlet pm = null;\n/ c8 ignore next 6 /\ntry {\n\trequire.resolve(\"picomatch\");\n\tpm = require(\"picomatch\");\n} catch {}\nvar Builder = class {\n\tglobCache = {};\n\toptions = {\n\t\tmaxDepth: Infinity,\n\t\tsuppressErrors: true,\n\t\tpathSeparator: path.sep,\n\t\tfilters: []\n\t};\n\tglobFunction;\n\tconstructor(options) {\n\t\tthis.options = {\n\t\t\t...this.options,\n\t\t\t...options\n\t\t};\n\t\tthis.globFunction = this.options.globFunction;\n\t}\n\tgroup() {\n\t\tthis.options.group = true;\n\t\treturn this;\n\t}\n\twithPathSeparator(separator) {\n\t\tthis.options.pathSeparator = separator;\n\t\treturn this;\n\t}\n\twithBasePath() {\n\t\tthis.options.includeBasePath = true;\n\t\treturn this;\n\t}\n\twithRelativePaths() {\n\t\tthis.options.relativePaths = true;\n\t\treturn this;\n\t}\n\twithDirs() {\n\t\tthis.options.includeDirs = true;\n\t\treturn this;\n\t}\n\twithMaxDepth(depth) {\n\t\tthis.options.maxDepth = depth;\n\t\treturn this;\n\t}\n\twithMaxFiles(limit) {\n\t\tthis.options.maxFiles = limit;\n\t\treturn this;\n\t}\n\twithFullPaths() {\n\t\tthis.options.resolvePaths = true;\n\t\tthis.options.includeBasePath = true;\n\t\treturn this;\n\t}\n\twithErrors() {\n\t\tthis.options.suppressErrors = false;\n\t\treturn this;\n\t}\n\twithSymlinks({ resolvePaths = true } = {}) {\n\t\tthis.options.resolveSymlinks = true;\n\t\tthis.options.useRealPaths = resolvePaths;\n\t\treturn this.withFullPaths();\n\t}\n\twithAbortSignal(signal) {\n\t\tthis.options.signal = signal;\n\t\treturn this;\n\t}\n\tnormalize() {\n\t\tthis.options.normalizePath = true;\n\t\treturn this;\n\t}\n\tfilter(predicate) {\n\t\tthis.options.filters.push(predicate);\n\t\treturn this;\n\t}\n\tonlyDirs() {\n\t\tthis.options.excludeFiles = true;\n\t\tthis.options.includeDirs = true;\n\t\treturn this;\n\t}\n\texclude(predicate) {\n\t\tthis.options.exclude = predicate;\n\t\treturn this;\n\t}\n\tonlyCounts() {\n\t\tthis.options.onlyCounts = true;\n\t\treturn this;\n\t}\n\tcrawl(root) {\n\t\treturn new APIBuilder(root \|\| \".\", this.options);\n\t}\n\twithGlobFunction(fn) {\n\t\tthis.globFunction = fn;\n\t\treturn this;\n\t}\n\t/\n\t @deprecated Pass options using the constructor instead:\n\t* ```ts\n\t* new fdir(options).crawl(\"/path/to/root\");\n\t* ```\n\t* This method will be removed in v7.0\n\t/\n\t/ c8 ignore next 4 /\n\tcrawlWithOptions(root, options) {\n\t\tthis.options = {\n\t\t\t...this.options,\n\t\t\t...options\n\t\t};\n\t\treturn new APIBuilder(root \|\| \".\", this.options);\n\t}\n\tglob(...patterns) {\n\t\tif (this.globFunction) return this.globWithOptions(patterns);\n\t\treturn this.globWithOptions(patterns, ...[{ dot: true }]);\n\t}\n\tglobWithOptions(patterns, ...options) {\n\t\tconst globFn = this.globFunction \|\| pm;\n\t\t/ c8 ignore next 5 */\n\t\tif (!globFn) throw new Error(\"Please specify a glob function to use glob matching.\");\n\t\tvar isMatch = this.globCache[patterns.join(\"\\0\")];\n\t\tif (!isMatch) {\n\t\t\tisMatch = globFn(patterns, ...options);\n\t\t\tthis.globCache[patterns.join(\"\\0\")] = isMatch;\n\t\t}\n\t\tthis.options.filters.push((path$1) => isMatch(path$1));\n\t\treturn this;\n\t}\n};\n\n//#endregion\nexports.fdir = Builder;"],"names":["require$$0","require$$2"],"mappings":";;;;;;;;AACA,MAAI,WAAW,OAAO;AACtB,MAAI,YAAY,OAAO;AACvB,MAAI,mBAAmB,OAAO;AAC9B,MAAI,oBAAoB,OAAO;AAC/B,MAAI,eAAe,OAAO;AAC1B,MAAI,eAAe,OAAO,UAAU;AACpC,MAAI,cAAc,CAAC,IAAI,MAAM,QAAQ,SAAS;AAC7C,QAAI,QAAQ,OAAO,SAAS,YAAY,OAAO,SAAS,WAAY,UAAS,OAAO,kBAAkB,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG,KAAK;AACrJ,YAAM,KAAK,CAAC;AACZ,UAAI,CAAC,aAAa,KAAK,IAAI,GAAG,KAAK,QAAQ,OAAQ,WAAU,IAAI,KAAK;AAAA,QACrE,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,KAAK,MAAM,GAAG;AAAA,QACpC,YAAY,EAAE,OAAO,iBAAiB,MAAM,GAAG,MAAM,KAAK;AAAA,MAC7D,CAAG;AAAA,IACH;AACC,WAAO;AAAA,EACR;AACA,MAAI,UAAU,CAAC,KAAK,YAAY,YAAY,SAAS,OAAO,OAAO,SAAS,aAAa,GAAG,CAAC,IAAI,CAAA,GAAI,YAA0B,CAAC,OAAO,CAAC,IAAI,aAAa,UAAU,QAAQ,WAAW;AAAA,IACrL,OAAO;AAAA,IACP,YAAY;AAAA,EACb,CAAC,IAAI,QAAQ,GAAG;AAGhB,QAAM,OAAO,QAAQA,aAAe;AACpC,QAAM,KAAK,QAAQ,UAAa;AAGhC,WAAS,UAAU,QAAQ;AAC1B,QAAI,cAAa,GAAI,KAAK,WAAW,MAAM;AAC3C,QAAI,WAAW,SAAS,KAAK,WAAW,WAAW,SAAS,CAAC,MAAM,KAAK,IAAK,cAAa,WAAW,UAAU,GAAG,WAAW,SAAS,CAAC;AACvI,WAAO;AAAA,EACR;AACA,QAAM,gBAAgB;AACtB,WAAS,eAAe,QAAQ,WAAW;AAC1C,WAAO,OAAO,QAAQ,eAAe,SAAS;AAAA,EAC/C;AACA,QAAM,yBAAyB;AAC/B,WAAS,gBAAgB,QAAQ;AAChC,WAAO,WAAW,OAAO,uBAAuB,KAAK,MAAM;AAAA,EAC5D;AACA,WAAS,cAAc,QAAQ,SAAS;AACvC,UAAM,EAAE,cAAc,eAAe,iBAAiB,cAAa,IAAK;AACxE,UAAM,oBAAoB,QAAQ,aAAa,WAAW,OAAO,SAAS,GAAG,KAAK,OAAO,WAAW,GAAG;AACvG,QAAI,aAAc,WAAS,GAAI,KAAK,SAAS,MAAM;AACnD,QAAI,mBAAmB,kBAAmB,UAAS,UAAU,MAAM;AACnE,QAAI,WAAW,IAAK,QAAO;AAC3B,UAAM,iBAAiB,OAAO,OAAO,SAAS,CAAC,MAAM;AACrD,WAAO,eAAe,iBAAiB,SAAS,gBAAgB,QAAQ,aAAa;AAAA,EACtF;AAIA,WAAS,qBAAqB,UAAU,eAAe;AACtD,WAAO,gBAAgB;AAAA,EACxB;AACA,WAAS,yBAAyB,MAAM,SAAS;AAChD,WAAO,SAAS,UAAU,eAAe;AACxC,YAAM,WAAW,cAAc,WAAW,IAAI;AAC9C,UAAI,SAAU,QAAO,cAAc,MAAM,KAAK,MAAM,IAAI;AAAA,UACnD,QAAO,gBAAe,GAAI,KAAK,UAAU,MAAM,aAAa,GAAG,QAAQ,aAAa,IAAI,QAAQ,gBAAgB;AAAA,IACvH;AAAA,EACA;AACA,WAAS,SAAS,UAAU;AAC3B,WAAO;AAAA,EACR;AACA,WAAS,kBAAkB,UAAU,eAAe,WAAW;AAC9D,WAAO,gBAAgB,WAAW;AAAA,EACnC;AACA,WAAS,QAAQ,MAAM,SAAS;AAC/B,UAAM,EAAE,eAAe,gBAAe,IAAK;AAC3C,WAAO,iBAAiB,OAAO,yBAAyB,MAAM,OAAO,IAAI,kBAAkB,uBAAuB;AAAA,EACnH;AAIA,WAAS,8BAA8B,MAAM;AAC5C,WAAO,SAAS,eAAe,OAAO;AACrC,YAAM,KAAK,cAAc,UAAU,KAAK,MAAM,KAAK,GAAG;AAAA,IACxD;AAAA,EACA;AACA,WAAS,oCAAoC,MAAM;AAClD,WAAO,SAAS,eAAe,OAAO,SAAS;AAC9C,YAAM,eAAe,cAAc,UAAU,KAAK,MAAM,KAAK;AAC7D,UAAI,QAAQ,MAAM,CAAC,WAAW,OAAO,cAAc,IAAI,CAAC,EAAG,OAAM,KAAK,YAAY;AAAA,IACpF;AAAA,EACA;AACA,QAAM,gBAAgB,CAAC,eAAe,UAAU;AAC/C,UAAM,KAAK,iBAAiB,GAAG;AAAA,EAChC;AACA,QAAM,sBAAsB,CAAC,eAAe,OAAO,YAAY;AAC9D,UAAM,SAAS,iBAAiB;AAChC,QAAI,QAAQ,MAAM,CAAC,WAAW,OAAO,QAAQ,IAAI,CAAC,EAAG,OAAM,KAAK,MAAM;AAAA,EACvE;AACA,QAAM,UAAU,MAAM;AAAA,EAAA;AACtB,WAAS,QAAQ,MAAM,SAAS;AAC/B,UAAM,EAAE,aAAa,SAAS,cAAa,IAAK;AAChD,QAAI,CAAC,YAAa,QAAO;AACzB,QAAI,cAAe,QAAO,WAAW,QAAQ,SAAS,oCAAoC,IAAI,IAAI,8BAA8B,IAAI;AACpI,WAAO,WAAW,QAAQ,SAAS,sBAAsB;AAAA,EAC1D;AAIA,QAAM,yBAAyB,CAAC,UAAU,QAAQ,QAAQ,YAAY;AACrE,QAAI,QAAQ,MAAM,CAAC,WAAW,OAAO,UAAU,KAAK,CAAC,EAAG,QAAO;AAAA,EAChE;AACA,QAAM,iBAAiB,CAAC,UAAU,OAAO,SAAS,YAAY;AAC7D,QAAI,QAAQ,MAAM,CAAC,WAAW,OAAO,UAAU,KAAK,CAAC,EAAG,OAAM,KAAK,QAAQ;AAAA,EAC5E;AACA,QAAM,gBAAgB,CAAC,WAAW,QAAQ,QAAQ,aAAa;AAC9D,WAAO;AAAA,EACR;AACA,QAAM,WAAW,CAAC,UAAU,UAAU;AACrC,UAAM,KAAK,QAAQ;AAAA,EACpB;AACA,QAAM,UAAU,MAAM;AAAA,EAAA;AACtB,WAAS,QAAQ,SAAS;AACzB,UAAM,EAAE,cAAc,SAAS,WAAU,IAAK;AAC9C,QAAI,aAAc,QAAO;AACzB,QAAI,WAAW,QAAQ,OAAQ,QAAO,aAAa,yBAAyB;AAAA,aACnE,WAAY,QAAO;AAAA,QACvB,QAAO;AAAA,EACb;AAIA,QAAM,WAAW,CAAC,UAAU;AAC3B,WAAO;AAAA,EACR;AACA,QAAM,gBAAgB,MAAM;AAC3B,WAAO,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC;AAAA,EACvB;AACA,WAAS,QAAQ,SAAS;AACzB,WAAO,QAAQ,QAAQ,gBAAgB;AAAA,EACxC;AAIA,QAAM,aAAa,CAAC,QAAQ,WAAW,UAAU;AAChD,WAAO,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,KAAK;AAAA,IACP,CAAE;AAAA,EACF;AACA,QAAM,QAAQ,MAAM;AAAA,EAAA;AACpB,WAAS,QAAQ,SAAS;AACzB,WAAO,QAAQ,QAAQ,aAAa;AAAA,EACrC;AAIA,QAAM,uBAAuB,SAAS,QAAQ,OAAO,YAAY;AAChE,UAAM,EAAE,OAAO,IAAI,MAAM,SAAS,EAAE,eAAc,EAAE,IAAK;AACzD,UAAM,QAAO;AACb,SAAK,SAAS,QAAQ,CAAC,OAAO,iBAAiB;AAC9C,UAAI,MAAO,QAAO,MAAM,QAAQ,iBAAiB,OAAO,OAAO,KAAK;AACpE,WAAK,KAAK,cAAc,CAAC,SAAS,SAAS;AAC1C,YAAI,QAAS,QAAO,MAAM,QAAQ,iBAAiB,OAAO,SAAS,KAAK;AACxE,YAAI,KAAK,iBAAiB,YAAY,QAAQ,cAAc,KAAK,EAAG,QAAO,MAAM,QAAQ,MAAM,KAAK;AACpG,mBAAW,MAAM,YAAY;AAC7B,cAAM,QAAQ,MAAM,KAAK;AAAA,MAC5B,CAAG;AAAA,IACH,CAAE;AAAA,EACF;AACA,QAAM,kBAAkB,SAAS,QAAQ,OAAO,YAAY;AAC3D,UAAM,EAAE,OAAO,IAAI,MAAM,SAAS,EAAE,eAAc,EAAE,IAAK;AACzD,UAAM,QAAO;AACb,QAAI;AACH,YAAM,eAAe,KAAK,aAAa,MAAM;AAC7C,YAAM,OAAO,KAAK,SAAS,YAAY;AACvC,UAAI,KAAK,iBAAiB,YAAY,QAAQ,cAAc,KAAK,EAAG;AACpE,iBAAW,MAAM,YAAY;AAAA,IAC/B,SAAU,GAAG;AACX,UAAI,CAAC,eAAgB,OAAM;AAAA,IAC7B;AAAA,EACA;AACA,WAAS,QAAQ,SAAS,eAAe;AACxC,QAAI,CAAC,QAAQ,mBAAmB,QAAQ,gBAAiB,QAAO;AAChE,WAAO,gBAAgB,kBAAkB;AAAA,EAC1C;AACA,WAAS,YAAY,QAAQ,UAAU,OAAO;AAC7C,QAAI,MAAM,QAAQ,aAAc,QAAO,0BAA0B,UAAU,KAAK;AAChF,QAAI,UAAS,GAAI,KAAK,SAAS,MAAM;AACrC,QAAI,QAAQ;AACZ,WAAO,WAAW,MAAM,QAAQ,QAAQ,GAAG;AAC1C,YAAM,eAAe,MAAM,SAAS,IAAI,MAAM;AAC9C,YAAM,aAAa,CAAC,CAAC,iBAAiB,iBAAiB,YAAY,aAAa,WAAW,QAAQ,KAAK,SAAS,WAAW,YAAY;AACxI,UAAI,WAAY;AAAA,UACX,WAAS,GAAI,KAAK,SAAS,MAAM;AAAA,IACxC;AACC,UAAM,SAAS,IAAI,QAAQ,QAAQ;AACnC,WAAO,QAAQ;AAAA,EAChB;AACA,WAAS,0BAA0B,UAAU,OAAO;AACnD,WAAO,MAAM,QAAQ,SAAS,WAAW,MAAM,QAAQ,aAAa;AAAA,EACrE;AAIA,QAAM,iBAAiB,CAAC,UAAU;AACjC,WAAO,MAAM;AAAA,EACd;AACA,QAAM,aAAa,CAAC,UAAU;AAC7B,WAAO,MAAM;AAAA,EACd;AACA,QAAM,cAAc,CAAC,UAAU;AAC9B,WAAO,MAAM;AAAA,EACd;AACA,QAAM,iBAAiB,CAAC,UAAU;AACjC,WAAO,MAAM,MAAM,MAAM,GAAG,MAAM,QAAQ,QAAQ;AAAA,EACnD;AACA,QAAM,kBAAkB,CAAC,OAAO,OAAO,eAAe;AACrD,WAAO,OAAO,YAAY,MAAM,QAAQ,MAAM,QAAQ,cAAc;AACpE,WAAO;AAAA,EACR;AACA,QAAM,eAAe,CAAC,OAAO,OAAO,eAAe;AAClD,WAAO,OAAO,YAAY,MAAM,OAAO,MAAM,QAAQ,cAAc;AACnE,WAAO;AAAA,EACR;AACA,QAAM,kBAAkB,CAAC,OAAO,OAAO,eAAe;AACrD,WAAO,OAAO,YAAY,MAAM,MAAM,MAAM,GAAG,MAAM,QAAQ,QAAQ,GAAG,MAAM,QAAQ,cAAc;AACpG,WAAO;AAAA,EACR;AACA,QAAM,cAAc,CAAC,OAAO,OAAO,eAAe;AACjD,WAAO,OAAO,YAAY,MAAM,QAAQ,MAAM,QAAQ,cAAc;AACpE,WAAO;AAAA,EACR;AACA,WAAS,OAAO,OAAO,YAAY,QAAQ,gBAAgB;AAC1D,QAAI,SAAS,CAAC,eAAgB,YAAW,OAAO,MAAM;AAAA,QACjD,YAAW,MAAM,MAAM;AAAA,EAC7B;AACA,WAAS,QAAQ,SAAS,eAAe;AACxC,UAAM,EAAE,YAAY,OAAO,SAAQ,IAAK;AACxC,QAAI,WAAY,QAAO,gBAAgB,iBAAiB;AAAA,aAC/C,MAAO,QAAO,gBAAgB,aAAa;AAAA,aAC3C,SAAU,QAAO,gBAAgB,iBAAiB;AAAA,QACtD,QAAO,gBAAgB,cAAc;AAAA,EAC3C;AAIA,QAAM,cAAc,EAAE,eAAe,KAAI;AACzC,QAAM,YAAY,CAAC,OAAO,WAAW,eAAe,cAAc,eAAe;AAChF,UAAM,MAAM,QAAO;AACnB,QAAI,eAAe,EAAG,QAAO,MAAM,MAAM,QAAQ,MAAM,KAAK;AAC5D,UAAM,EAAE,IAAI,KAAI,IAAK;AACrB,UAAM,QAAQ,KAAK,SAAS;AAC5B,UAAM,OAAO;AACb,SAAK,QAAQ,aAAa,KAAK,aAAa,CAAC,OAAO,UAAU,OAAO;AACpE,iBAAW,SAAS,eAAe,YAAY;AAC/C,YAAM,MAAM,QAAQ,MAAM,QAAQ,iBAAiB,OAAO,OAAO,KAAK;AAAA,IACxE,CAAE;AAAA,EACF;AACA,QAAM,WAAW,CAAC,OAAO,WAAW,eAAe,cAAc,eAAe;AAC/E,UAAM,EAAE,IAAI,KAAI,IAAK;AACrB,QAAI,eAAe,EAAG;AACtB,UAAM,QAAQ,KAAK,SAAS;AAC5B,UAAM,OAAO;AACb,QAAI,UAAU,CAAA;AACd,QAAI;AACH,gBAAU,KAAK,YAAY,aAAa,KAAK,WAAW;AAAA,IAC1D,SAAU,GAAG;AACX,UAAI,CAAC,MAAM,QAAQ,eAAgB,OAAM;AAAA,IAC3C;AACC,eAAW,SAAS,eAAe,YAAY;AAAA,EAChD;AACA,WAAS,MAAM,eAAe;AAC7B,WAAO,gBAAgB,WAAW;AAAA,EACnC;AASA,MAAI,QAAQ,MAAM;AAAA,IACjB,QAAQ;AAAA,IACR,YAAY,cAAc;AACzB,WAAK,eAAe;AAAA,IACtB;AAAA,IACC,UAAU;AACT,WAAK;AACL,aAAO,KAAK;AAAA,IACd;AAAA,IACC,QAAQ,OAAO,QAAQ;AACtB,UAAI,KAAK,iBAAiB,EAAE,KAAK,SAAS,KAAK,QAAQ;AACtD,aAAK,aAAa,OAAO,MAAM;AAC/B,YAAI,OAAO;AACV,iBAAO,WAAW,MAAK;AACvB,eAAK,eAAe;AAAA,QACxB;AAAA,MACA;AAAA,IACA;AAAA;AAKA,MAAI,UAAU,MAAM;AAAA,IACnB,SAAS;AAAA,IACT,eAAe;AAAA,IACf,IAAI,MAAM,KAAK;AACd,WAAK,SAAS;AAAA,IAChB;AAAA,IACC,IAAI,QAAQ;AACX,aAAO,KAAK;AAAA,IACd;AAAA,IACC,IAAI,YAAY,KAAK;AACpB,WAAK,eAAe;AAAA,IACtB;AAAA,IACC,IAAI,cAAc;AACjB,aAAO,KAAK;AAAA,IACd;AAAA;AAAA;AAAA;AAAA;AAAA,IAKC,IAAI,OAAO;AACV,aAAO,KAAK;AAAA,IACd;AAAA;AASA,MAAI,UAAU,MAAM;AAAA,IACnB,UAAU;AAAA,IACV,QAAQ;AACP,WAAK,UAAU;AAAA,IACjB;AAAA;AAKA,MAAI,SAAS,MAAM;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,MAAM,SAAS,YAAY;AACtC,WAAK,gBAAgB,CAAC;AACtB,WAAK,kBAAkB,QAAQ,SAAS,KAAK,aAAa;AAC1D,WAAK,OAAO,cAAc,MAAM,OAAO;AACvC,WAAK,QAAQ;AAAA,QACZ,MAAM,gBAAgB,KAAK,IAAI,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAAA,QACpE,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC;AAAA,QACtB,QAAQ,CAAA;AAAA,QACR,QAAQ,IAAI,QAAO;AAAA,QACnB;AAAA,QACA,OAAO,IAAI,MAAM,CAAC,OAAO,UAAU,KAAK,gBAAgB,OAAO,OAAO,UAAU,CAAC;AAAA,QACjF,UAA0B,oBAAI,IAAG;AAAA,QACjC,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC;AAAA,QACxB,YAAY,IAAI,QAAO;AAAA,QACvB,IAAI,QAAQ,MAAM;AAAA;AAEnB,WAAK,WAAW,QAAQ,KAAK,MAAM,OAAO;AAC1C,WAAK,gBAAgB,QAAQ,KAAK,MAAM,OAAO;AAC/C,WAAK,WAAW,QAAQ,OAAO;AAC/B,WAAK,WAAW,QAAQ,OAAO;AAC/B,WAAK,aAAa,QAAQ,OAAO;AACjC,WAAK,iBAAiB,QAAQ,SAAS,KAAK,aAAa;AACzD,WAAK,gBAAgB,MAAM,KAAK,aAAa;AAAA,IAC/C;AAAA,IACC,QAAQ;AACP,WAAK,cAAc,KAAK,MAAM,KAAK,MAAM,OAAO,KAAK,MAAM,QAAQ,OAAO;AAC1E,WAAK,cAAc,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,QAAQ,UAAU,KAAK,IAAI;AAC3F,aAAO,KAAK,gBAAgB,KAAK,gBAAgB,KAAK,OAAO,IAAI,IAAI;AAAA,IACvE;AAAA,IACC,OAAO,CAAC,SAAS,eAAe,UAAU;AACzC,YAAM,EAAE,OAAO,SAAS,EAAE,SAAS,iBAAiB,mBAAmB,iBAAiB,SAAS,UAAU,QAAQ,cAAc,cAAa,GAAI,WAAU,IAAK,KAAK;AACtK,UAAI,WAAW,WAAW,UAAU,OAAO,WAAW,YAAY,MAAM,SAAS,SAAU;AAC3F,YAAM,QAAQ,KAAK,SAAS,KAAK,MAAM,KAAK;AAC5C,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACxC,cAAM,QAAQ,QAAQ,CAAC;AACvB,YAAI,MAAM,OAAM,KAAM,MAAM,eAAc,KAAM,CAAC,qBAAqB,CAAC,iBAAiB;AACvF,gBAAM,WAAW,KAAK,SAAS,MAAM,MAAM,aAAa;AACxD,eAAK,SAAS,UAAU,OAAO,KAAK,MAAM,QAAQ,OAAO;AAAA,QAC7D,WAAc,MAAM,eAAe;AAC/B,cAAI,SAAS,kBAAkB,MAAM,MAAM,eAAe,KAAK,MAAM,QAAQ,aAAa;AAC1F,cAAI,WAAW,QAAQ,MAAM,MAAM,MAAM,EAAG;AAC5C,eAAK,cAAc,QAAQ,OAAO,OAAO;AACzC,eAAK,cAAc,KAAK,OAAO,QAAQ,QAAQ,QAAQ,GAAG,KAAK,IAAI;AAAA,QACvE,WAAc,KAAK,kBAAkB,MAAM,eAAc,GAAI;AACzD,cAAI,SAAS,qBAAqB,MAAM,MAAM,aAAa;AAC3D,eAAK,eAAe,QAAQ,KAAK,OAAO,CAAC,MAAM,iBAAiB;AAC/D,gBAAI,KAAK,eAAe;AACvB,6BAAe,cAAc,cAAc,KAAK,MAAM,OAAO;AAC7D,kBAAI,WAAW,QAAQ,MAAM,MAAM,eAAe,eAAe,SAAS,aAAa,EAAG;AAC1F,mBAAK,cAAc,KAAK,OAAO,cAAc,eAAe,eAAe,SAAS,eAAe,QAAQ,GAAG,KAAK,IAAI;AAAA,YAC7H,OAAY;AACN,6BAAe,eAAe,eAAe;AAC7C,oBAAM,YAAW,GAAI,KAAK,UAAU,YAAY;AAChD,oBAAM,kBAAkB,eAAc,GAAI,KAAK,SAAS,YAAY,GAAG,KAAK,MAAM,OAAO;AACzF,6BAAe,KAAK,SAAS,UAAU,eAAe;AACtD,mBAAK,SAAS,cAAc,OAAO,KAAK,MAAM,QAAQ,OAAO;AAAA,YACnE;AAAA,UACA,CAAK;AAAA,QACL;AAAA,MACA;AACE,WAAK,WAAW,KAAK,MAAM,QAAQ,eAAe,KAAK;AAAA,IACzD;AAAA;AAKA,WAAS,QAAQ,MAAM,SAAS;AAC/B,WAAO,IAAI,QAAQ,CAAC,WAAW,WAAW;AACzC,eAAS,MAAM,SAAS,CAAC,KAAK,WAAW;AACxC,YAAI,IAAK,QAAO,OAAO,GAAG;AAC1B,kBAAU,MAAM;AAAA,MACnB,CAAG;AAAA,IACH,CAAE;AAAA,EACF;AACA,WAAS,SAAS,MAAM,SAAS,YAAY;AAC5C,QAAI,SAAS,IAAI,OAAO,MAAM,SAAS,UAAU;AACjD,WAAO,MAAK;AAAA,EACb;AAIA,WAAS,KAAK,MAAM,SAAS;AAC5B,UAAM,SAAS,IAAI,OAAO,MAAM,OAAO;AACvC,WAAO,OAAO,MAAK;AAAA,EACpB;AAIA,MAAI,aAAa,MAAM;AAAA,IACtB,YAAY,MAAM,SAAS;AAC1B,WAAK,OAAO;AACZ,WAAK,UAAU;AAAA,IACjB;AAAA,IACC,cAAc;AACb,aAAO,QAAQ,KAAK,MAAM,KAAK,OAAO;AAAA,IACxC;AAAA,IACC,aAAa,IAAI;AAChB,eAAS,KAAK,MAAM,KAAK,SAAS,EAAE;AAAA,IACtC;AAAA,IACC,OAAO;AACN,aAAO,KAAK,KAAK,MAAM,KAAK,OAAO;AAAA,IACrC;AAAA;AAKA,MAAI,KAAK;AAET,MAAI;AACH,oBAAgB,WAAW;AAC3B,SAAKC,iCAAA;AAAA,EACN,QAAQ;AAAA,EAAA;AACR,MAAI,UAAU,MAAM;AAAA,IACnB,YAAY,CAAA;AAAA,IACZ,UAAU;AAAA,MACT,UAAU;AAAA,MACV,gBAAgB;AAAA,MAChB,eAAe,KAAK;AAAA,MACpB,SAAS,CAAA;AAAA;IAEV;AAAA,IACA,YAAY,SAAS;AACpB,WAAK,UAAU;AAAA,QACd,GAAG,KAAK;AAAA,QACR,GAAG;AAAA;AAEJ,WAAK,eAAe,KAAK,QAAQ;AAAA,IACnC;AAAA,IACC,QAAQ;AACP,WAAK,QAAQ,QAAQ;AACrB,aAAO;AAAA,IACT;AAAA,IACC,kBAAkB,WAAW;AAC5B,WAAK,QAAQ,gBAAgB;AAC7B,aAAO;AAAA,IACT;AAAA,IACC,eAAe;AACd,WAAK,QAAQ,kBAAkB;AAC/B,aAAO;AAAA,IACT;AAAA,IACC,oBAAoB;AACnB,WAAK,QAAQ,gBAAgB;AAC7B,aAAO;AAAA,IACT;AAAA,IACC,WAAW;AACV,WAAK,QAAQ,cAAc;AAC3B,aAAO;AAAA,IACT;AAAA,IACC,aAAa,OAAO;AACnB,WAAK,QAAQ,WAAW;AACxB,aAAO;AAAA,IACT;AAAA,IACC,aAAa,OAAO;AACnB,WAAK,QAAQ,WAAW;AACxB,aAAO;AAAA,IACT;AAAA,IACC,gBAAgB;AACf,WAAK,QAAQ,eAAe;AAC5B,WAAK,QAAQ,kBAAkB;AAC/B,aAAO;AAAA,IACT;AAAA,IACC,aAAa;AACZ,WAAK,QAAQ,iBAAiB;AAC9B,aAAO;AAAA,IACT;AAAA,IACC,aAAa,EAAE,eAAe,KAAI,IAAK,CAAA,GAAI;AAC1C,WAAK,QAAQ,kBAAkB;AAC/B,WAAK,QAAQ,eAAe;AAC5B,aAAO,KAAK,cAAa;AAAA,IAC3B;AAAA,IACC,gBAAgB,QAAQ;AACvB,WAAK,QAAQ,SAAS;AACtB,aAAO;AAAA,IACT;AAAA,IACC,YAAY;AACX,WAAK,QAAQ,gBAAgB;AAC7B,aAAO;AAAA,IACT;AAAA,IACC,OAAO,WAAW;AACjB,WAAK,QAAQ,QAAQ,KAAK,SAAS;AACnC,aAAO;AAAA,IACT;AAAA,IACC,WAAW;AACV,WAAK,QAAQ,eAAe;AAC5B,WAAK,QAAQ,cAAc;AAC3B,aAAO;AAAA,IACT;AAAA,IACC,QAAQ,WAAW;AAClB,WAAK,QAAQ,UAAU;AACvB,aAAO;AAAA,IACT;AAAA,IACC,aAAa;AACZ,WAAK,QAAQ,aAAa;AAC1B,aAAO;AAAA,IACT;AAAA,IACC,MAAM,MAAM;AACX,aAAO,IAAI,WAAW,QAAQ,KAAK,KAAK,OAAO;AAAA,IACjD;AAAA,IACC,iBAAiB,IAAI;AACpB,WAAK,eAAe;AACpB,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASC,iBAAiB,MAAM,SAAS;AAC/B,WAAK,UAAU;AAAA,QACd,GAAG,KAAK;AAAA,QACR,GAAG;AAAA;AAEJ,aAAO,IAAI,WAAW,QAAQ,KAAK,KAAK,OAAO;AAAA,IACjD;AAAA,IACC,QAAQ,UAAU;AACjB,UAAI,KAAK,aAAc,QAAO,KAAK,gBAAgB,QAAQ;AAC3D,aAAO,KAAK,gBAAgB,UAAU,GAAG,CAAC,EAAE,KAAK,KAAI,CAAE,CAAC;AAAA,IAC1D;AAAA,IACC,gBAAgB,aAAa,SAAS;AACrC,YAAM,SAAS,KAAK,gBAAgB;AAEpC,UAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,sDAAsD;AACnF,UAAI,UAAU,KAAK,UAAU,SAAS,KAAK,IAAI,CAAC;AAChD,UAAI,CAAC,SAAS;AACb,kBAAU,OAAO,UAAU,GAAG,OAAO;AACrC,aAAK,UAAU,SAAS,KAAK,IAAI,CAAC,IAAI;AAAA,MACzC;AACE,WAAK,QAAQ,QAAQ,KAAK,CAAC,WAAW,QAAQ,MAAM,CAAC;AACrD,aAAO;AAAA,IACT;AAAA;AAIA,OAAA,OAAe;;;","x_google_ignoreList":[0]}
1	+ {"version":3,"file":"index.js","sources":["../../../../node_modules/fdir/dist/index.cjs"],"sourcesContent":["//#region rolldown:runtime\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __copyProps = (to, from, except, desc) => {\n\tif (from && typeof from === \"object\" \|\| typeof from === \"function\") for (var keys = __getOwnPropNames(from), i = 0, n = keys.length, key; i < n; i++) {\n\t\tkey = keys[i];\n\t\tif (!__hasOwnProp.call(to, key) && key !== except) __defProp(to, key, {\n\t\t\tget: ((k) => from[k]).bind(null, key),\n\t\t\tenumerable: !(desc = __getOwnPropDesc(from, key)) \|\| desc.enumerable\n\t\t});\n\t}\n\treturn to;\n};\nvar __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__getProtoOf(mod)) : {}, __copyProps(isNodeMode \|\| !mod \|\| !mod.__esModule ? __defProp(target, \"default\", {\n\tvalue: mod,\n\tenumerable: true\n}) : target, mod));\n\n//#endregion\nconst path = __toESM(require(\"path\"));\nconst fs = __toESM(require(\"fs\"));\n\n//#region src/utils.ts\nfunction cleanPath(path$1) {\n\tlet normalized = (0, path.normalize)(path$1);\n\tif (normalized.length > 1 && normalized[normalized.length - 1] === path.sep) normalized = normalized.substring(0, normalized.length - 1);\n\treturn normalized;\n}\nconst SLASHES_REGEX = /[\\\\/]/g;\nfunction convertSlashes(path$1, separator) {\n\treturn path$1.replace(SLASHES_REGEX, separator);\n}\nconst WINDOWS_ROOT_DIR_REGEX = /^[a-z]:[\\\\/]$/i;\nfunction isRootDirectory(path$1) {\n\treturn path$1 === \"/\" \|\| WINDOWS_ROOT_DIR_REGEX.test(path$1);\n}\nfunction normalizePath(path$1, options) {\n\tconst { resolvePaths, normalizePath: normalizePath$1, pathSeparator } = options;\n\tconst pathNeedsCleaning = process.platform === \"win32\" && path$1.includes(\"/\") \|\| path$1.startsWith(\".\");\n\tif (resolvePaths) path$1 = (0, path.resolve)(path$1);\n\tif (normalizePath$1 \|\| pathNeedsCleaning) path$1 = cleanPath(path$1);\n\tif (path$1 === \".\") return \"\";\n\tconst needsSeperator = path$1[path$1.length - 1] !== pathSeparator;\n\treturn convertSlashes(needsSeperator ? path$1 + pathSeparator : path$1, pathSeparator);\n}\n\n//#endregion\n//#region src/api/functions/join-path.ts\nfunction joinPathWithBasePath(filename, directoryPath) {\n\treturn directoryPath + filename;\n}\nfunction joinPathWithRelativePath(root, options) {\n\treturn function(filename, directoryPath) {\n\t\tconst sameRoot = directoryPath.startsWith(root);\n\t\tif (sameRoot) return directoryPath.slice(root.length) + filename;\n\t\telse return convertSlashes((0, path.relative)(root, directoryPath), options.pathSeparator) + options.pathSeparator + filename;\n\t};\n}\nfunction joinPath(filename) {\n\treturn filename;\n}\nfunction joinDirectoryPath(filename, directoryPath, separator) {\n\treturn directoryPath + filename + separator;\n}\nfunction build$7(root, options) {\n\tconst { relativePaths, includeBasePath } = options;\n\treturn relativePaths && root ? joinPathWithRelativePath(root, options) : includeBasePath ? joinPathWithBasePath : joinPath;\n}\n\n//#endregion\n//#region src/api/functions/push-directory.ts\nfunction pushDirectoryWithRelativePath(root) {\n\treturn function(directoryPath, paths) {\n\t\tpaths.push(directoryPath.substring(root.length) \|\| \".\");\n\t};\n}\nfunction pushDirectoryFilterWithRelativePath(root) {\n\treturn function(directoryPath, paths, filters) {\n\t\tconst relativePath = directoryPath.substring(root.length) \|\| \".\";\n\t\tif (filters.every((filter) => filter(relativePath, true))) paths.push(relativePath);\n\t};\n}\nconst pushDirectory = (directoryPath, paths) => {\n\tpaths.push(directoryPath \|\| \".\");\n};\nconst pushDirectoryFilter = (directoryPath, paths, filters) => {\n\tconst path$1 = directoryPath \|\| \".\";\n\tif (filters.every((filter) => filter(path$1, true))) paths.push(path$1);\n};\nconst empty$2 = () => {};\nfunction build$6(root, options) {\n\tconst { includeDirs, filters, relativePaths } = options;\n\tif (!includeDirs) return empty$2;\n\tif (relativePaths) return filters && filters.length ? pushDirectoryFilterWithRelativePath(root) : pushDirectoryWithRelativePath(root);\n\treturn filters && filters.length ? pushDirectoryFilter : pushDirectory;\n}\n\n//#endregion\n//#region src/api/functions/push-file.ts\nconst pushFileFilterAndCount = (filename, _paths, counts, filters) => {\n\tif (filters.every((filter) => filter(filename, false))) counts.files++;\n};\nconst pushFileFilter = (filename, paths, _counts, filters) => {\n\tif (filters.every((filter) => filter(filename, false))) paths.push(filename);\n};\nconst pushFileCount = (_filename, _paths, counts, _filters) => {\n\tcounts.files++;\n};\nconst pushFile = (filename, paths) => {\n\tpaths.push(filename);\n};\nconst empty$1 = () => {};\nfunction build$5(options) {\n\tconst { excludeFiles, filters, onlyCounts } = options;\n\tif (excludeFiles) return empty$1;\n\tif (filters && filters.length) return onlyCounts ? pushFileFilterAndCount : pushFileFilter;\n\telse if (onlyCounts) return pushFileCount;\n\telse return pushFile;\n}\n\n//#endregion\n//#region src/api/functions/get-array.ts\nconst getArray = (paths) => {\n\treturn paths;\n};\nconst getArrayGroup = () => {\n\treturn [\"\"].slice(0, 0);\n};\nfunction build$4(options) {\n\treturn options.group ? getArrayGroup : getArray;\n}\n\n//#endregion\n//#region src/api/functions/group-files.ts\nconst groupFiles = (groups, directory, files) => {\n\tgroups.push({\n\t\tdirectory,\n\t\tfiles,\n\t\tdir: directory\n\t});\n};\nconst empty = () => {};\nfunction build$3(options) {\n\treturn options.group ? groupFiles : empty;\n}\n\n//#endregion\n//#region src/api/functions/resolve-symlink.ts\nconst resolveSymlinksAsync = function(path$1, state, callback$1) {\n\tconst { queue, fs: fs$1, options: { suppressErrors } } = state;\n\tqueue.enqueue();\n\tfs$1.realpath(path$1, (error, resolvedPath) => {\n\t\tif (error) return queue.dequeue(suppressErrors ? null : error, state);\n\t\tfs$1.stat(resolvedPath, (error$1, stat) => {\n\t\t\tif (error$1) return queue.dequeue(suppressErrors ? null : error$1, state);\n\t\t\tif (stat.isDirectory() && isRecursive(path$1, resolvedPath, state)) return queue.dequeue(null, state);\n\t\t\tcallback$1(stat, resolvedPath);\n\t\t\tqueue.dequeue(null, state);\n\t\t});\n\t});\n};\nconst resolveSymlinks = function(path$1, state, callback$1) {\n\tconst { queue, fs: fs$1, options: { suppressErrors } } = state;\n\tqueue.enqueue();\n\ttry {\n\t\tconst resolvedPath = fs$1.realpathSync(path$1);\n\t\tconst stat = fs$1.statSync(resolvedPath);\n\t\tif (stat.isDirectory() && isRecursive(path$1, resolvedPath, state)) return;\n\t\tcallback$1(stat, resolvedPath);\n\t} catch (e) {\n\t\tif (!suppressErrors) throw e;\n\t}\n};\nfunction build$2(options, isSynchronous) {\n\tif (!options.resolveSymlinks \|\| options.excludeSymlinks) return null;\n\treturn isSynchronous ? resolveSymlinks : resolveSymlinksAsync;\n}\nfunction isRecursive(path$1, resolved, state) {\n\tif (state.options.useRealPaths) return isRecursiveUsingRealPaths(resolved, state);\n\tlet parent = (0, path.dirname)(path$1);\n\tlet depth = 1;\n\twhile (parent !== state.root && depth < 2) {\n\t\tconst resolvedPath = state.symlinks.get(parent);\n\t\tconst isSameRoot = !!resolvedPath && (resolvedPath === resolved \|\| resolvedPath.startsWith(resolved) \|\| resolved.startsWith(resolvedPath));\n\t\tif (isSameRoot) depth++;\n\t\telse parent = (0, path.dirname)(parent);\n\t}\n\tstate.symlinks.set(path$1, resolved);\n\treturn depth > 1;\n}\nfunction isRecursiveUsingRealPaths(resolved, state) {\n\treturn state.visited.includes(resolved + state.options.pathSeparator);\n}\n\n//#endregion\n//#region src/api/functions/invoke-callback.ts\nconst onlyCountsSync = (state) => {\n\treturn state.counts;\n};\nconst groupsSync = (state) => {\n\treturn state.groups;\n};\nconst defaultSync = (state) => {\n\treturn state.paths;\n};\nconst limitFilesSync = (state) => {\n\treturn state.paths.slice(0, state.options.maxFiles);\n};\nconst onlyCountsAsync = (state, error, callback$1) => {\n\treport(error, callback$1, state.counts, state.options.suppressErrors);\n\treturn null;\n};\nconst defaultAsync = (state, error, callback$1) => {\n\treport(error, callback$1, state.paths, state.options.suppressErrors);\n\treturn null;\n};\nconst limitFilesAsync = (state, error, callback$1) => {\n\treport(error, callback$1, state.paths.slice(0, state.options.maxFiles), state.options.suppressErrors);\n\treturn null;\n};\nconst groupsAsync = (state, error, callback$1) => {\n\treport(error, callback$1, state.groups, state.options.suppressErrors);\n\treturn null;\n};\nfunction report(error, callback$1, output, suppressErrors) {\n\tif (error && !suppressErrors) callback$1(error, output);\n\telse callback$1(null, output);\n}\nfunction build$1(options, isSynchronous) {\n\tconst { onlyCounts, group, maxFiles } = options;\n\tif (onlyCounts) return isSynchronous ? onlyCountsSync : onlyCountsAsync;\n\telse if (group) return isSynchronous ? groupsSync : groupsAsync;\n\telse if (maxFiles) return isSynchronous ? limitFilesSync : limitFilesAsync;\n\telse return isSynchronous ? defaultSync : defaultAsync;\n}\n\n//#endregion\n//#region src/api/functions/walk-directory.ts\nconst readdirOpts = { withFileTypes: true };\nconst walkAsync = (state, crawlPath, directoryPath, currentDepth, callback$1) => {\n\tstate.queue.enqueue();\n\tif (currentDepth < 0) return state.queue.dequeue(null, state);\n\tconst { fs: fs$1 } = state;\n\tstate.visited.push(crawlPath);\n\tstate.counts.directories++;\n\tfs$1.readdir(crawlPath \|\| \".\", readdirOpts, (error, entries = []) => {\n\t\tcallback$1(entries, directoryPath, currentDepth);\n\t\tstate.queue.dequeue(state.options.suppressErrors ? null : error, state);\n\t});\n};\nconst walkSync = (state, crawlPath, directoryPath, currentDepth, callback$1) => {\n\tconst { fs: fs$1 } = state;\n\tif (currentDepth < 0) return;\n\tstate.visited.push(crawlPath);\n\tstate.counts.directories++;\n\tlet entries = [];\n\ttry {\n\t\tentries = fs$1.readdirSync(crawlPath \|\| \".\", readdirOpts);\n\t} catch (e) {\n\t\tif (!state.options.suppressErrors) throw e;\n\t}\n\tcallback$1(entries, directoryPath, currentDepth);\n};\nfunction build(isSynchronous) {\n\treturn isSynchronous ? walkSync : walkAsync;\n}\n\n//#endregion\n//#region src/api/queue.ts\n/*\n This is a custom stateless queue to track concurrent async fs calls.\n* It increments a counter whenever a call is queued and decrements it\n* as soon as it completes. When the counter hits 0, it calls onQueueEmpty.\n/\nvar Queue = class {\n\tcount = 0;\n\tconstructor(onQueueEmpty) {\n\t\tthis.onQueueEmpty = onQueueEmpty;\n\t}\n\tenqueue() {\n\t\tthis.count++;\n\t\treturn this.count;\n\t}\n\tdequeue(error, output) {\n\t\tif (this.onQueueEmpty && (--this.count <= 0 \|\| error)) {\n\t\t\tthis.onQueueEmpty(error, output);\n\t\t\tif (error) {\n\t\t\t\toutput.controller.abort();\n\t\t\t\tthis.onQueueEmpty = void 0;\n\t\t\t}\n\t\t}\n\t}\n};\n\n//#endregion\n//#region src/api/counter.ts\nvar Counter = class {\n\t_files = 0;\n\t_directories = 0;\n\tset files(num) {\n\t\tthis._files = num;\n\t}\n\tget files() {\n\t\treturn this._files;\n\t}\n\tset directories(num) {\n\t\tthis._directories = num;\n\t}\n\tget directories() {\n\t\treturn this._directories;\n\t}\n\t/\n\t @deprecated use `directories` instead\n\t/\n\t/ c8 ignore next 3 /\n\tget dirs() {\n\t\treturn this._directories;\n\t}\n};\n\n//#endregion\n//#region src/api/aborter.ts\n/\n AbortController is not supported on Node 14 so we use this until we can drop\n* support for Node 14.\n/\nvar Aborter = class {\n\taborted = false;\n\tabort() {\n\t\tthis.aborted = true;\n\t}\n};\n\n//#endregion\n//#region src/api/walker.ts\nvar Walker = class {\n\troot;\n\tisSynchronous;\n\tstate;\n\tjoinPath;\n\tpushDirectory;\n\tpushFile;\n\tgetArray;\n\tgroupFiles;\n\tresolveSymlink;\n\twalkDirectory;\n\tcallbackInvoker;\n\tconstructor(root, options, callback$1) {\n\t\tthis.isSynchronous = !callback$1;\n\t\tthis.callbackInvoker = build$1(options, this.isSynchronous);\n\t\tthis.root = normalizePath(root, options);\n\t\tthis.state = {\n\t\t\troot: isRootDirectory(this.root) ? this.root : this.root.slice(0, -1),\n\t\t\tpaths: [\"\"].slice(0, 0),\n\t\t\tgroups: [],\n\t\t\tcounts: new Counter(),\n\t\t\toptions,\n\t\t\tqueue: new Queue((error, state) => this.callbackInvoker(state, error, callback$1)),\n\t\t\tsymlinks: / @__PURE__ / new Map(),\n\t\t\tvisited: [\"\"].slice(0, 0),\n\t\t\tcontroller: new Aborter(),\n\t\t\tfs: options.fs \|\| fs\n\t\t};\n\t\tthis.joinPath = build$7(this.root, options);\n\t\tthis.pushDirectory = build$6(this.root, options);\n\t\tthis.pushFile = build$5(options);\n\t\tthis.getArray = build$4(options);\n\t\tthis.groupFiles = build$3(options);\n\t\tthis.resolveSymlink = build$2(options, this.isSynchronous);\n\t\tthis.walkDirectory = build(this.isSynchronous);\n\t}\n\tstart() {\n\t\tthis.pushDirectory(this.root, this.state.paths, this.state.options.filters);\n\t\tthis.walkDirectory(this.state, this.root, this.root, this.state.options.maxDepth, this.walk);\n\t\treturn this.isSynchronous ? this.callbackInvoker(this.state, null) : null;\n\t}\n\twalk = (entries, directoryPath, depth) => {\n\t\tconst { paths, options: { filters, resolveSymlinks: resolveSymlinks$1, excludeSymlinks, exclude, maxFiles, signal, useRealPaths, pathSeparator }, controller } = this.state;\n\t\tif (controller.aborted \|\| signal && signal.aborted \|\| maxFiles && paths.length > maxFiles) return;\n\t\tconst files = this.getArray(this.state.paths);\n\t\tfor (let i = 0; i < entries.length; ++i) {\n\t\t\tconst entry = entries[i];\n\t\t\tif (entry.isFile() \|\| entry.isSymbolicLink() && !resolveSymlinks$1 && !excludeSymlinks) {\n\t\t\t\tconst filename = this.joinPath(entry.name, directoryPath);\n\t\t\t\tthis.pushFile(filename, files, this.state.counts, filters);\n\t\t\t} else if (entry.isDirectory()) {\n\t\t\t\tlet path$1 = joinDirectoryPath(entry.name, directoryPath, this.state.options.pathSeparator);\n\t\t\t\tif (exclude && exclude(entry.name, path$1)) continue;\n\t\t\t\tthis.pushDirectory(path$1, paths, filters);\n\t\t\t\tthis.walkDirectory(this.state, path$1, path$1, depth - 1, this.walk);\n\t\t\t} else if (this.resolveSymlink && entry.isSymbolicLink()) {\n\t\t\t\tlet path$1 = joinPathWithBasePath(entry.name, directoryPath);\n\t\t\t\tthis.resolveSymlink(path$1, this.state, (stat, resolvedPath) => {\n\t\t\t\t\tif (stat.isDirectory()) {\n\t\t\t\t\t\tresolvedPath = normalizePath(resolvedPath, this.state.options);\n\t\t\t\t\t\tif (exclude && exclude(entry.name, useRealPaths ? resolvedPath : path$1 + pathSeparator)) return;\n\t\t\t\t\t\tthis.walkDirectory(this.state, resolvedPath, useRealPaths ? resolvedPath : path$1 + pathSeparator, depth - 1, this.walk);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tresolvedPath = useRealPaths ? resolvedPath : path$1;\n\t\t\t\t\t\tconst filename = (0, path.basename)(resolvedPath);\n\t\t\t\t\t\tconst directoryPath$1 = normalizePath((0, path.dirname)(resolvedPath), this.state.options);\n\t\t\t\t\t\tresolvedPath = this.joinPath(filename, directoryPath$1);\n\t\t\t\t\t\tthis.pushFile(resolvedPath, files, this.state.counts, filters);\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t}\n\t\tthis.groupFiles(this.state.groups, directoryPath, files);\n\t};\n};\n\n//#endregion\n//#region src/api/async.ts\nfunction promise(root, options) {\n\treturn new Promise((resolve$1, reject) => {\n\t\tcallback(root, options, (err, output) => {\n\t\t\tif (err) return reject(err);\n\t\t\tresolve$1(output);\n\t\t});\n\t});\n}\nfunction callback(root, options, callback$1) {\n\tlet walker = new Walker(root, options, callback$1);\n\twalker.start();\n}\n\n//#endregion\n//#region src/api/sync.ts\nfunction sync(root, options) {\n\tconst walker = new Walker(root, options);\n\treturn walker.start();\n}\n\n//#endregion\n//#region src/builder/api-builder.ts\nvar APIBuilder = class {\n\tconstructor(root, options) {\n\t\tthis.root = root;\n\t\tthis.options = options;\n\t}\n\twithPromise() {\n\t\treturn promise(this.root, this.options);\n\t}\n\twithCallback(cb) {\n\t\tcallback(this.root, this.options, cb);\n\t}\n\tsync() {\n\t\treturn sync(this.root, this.options);\n\t}\n};\n\n//#endregion\n//#region src/builder/index.ts\nlet pm = null;\n/ c8 ignore next 6 /\ntry {\n\trequire.resolve(\"picomatch\");\n\tpm = require(\"picomatch\");\n} catch {}\nvar Builder = class {\n\tglobCache = {};\n\toptions = {\n\t\tmaxDepth: Infinity,\n\t\tsuppressErrors: true,\n\t\tpathSeparator: path.sep,\n\t\tfilters: []\n\t};\n\tglobFunction;\n\tconstructor(options) {\n\t\tthis.options = {\n\t\t\t...this.options,\n\t\t\t...options\n\t\t};\n\t\tthis.globFunction = this.options.globFunction;\n\t}\n\tgroup() {\n\t\tthis.options.group = true;\n\t\treturn this;\n\t}\n\twithPathSeparator(separator) {\n\t\tthis.options.pathSeparator = separator;\n\t\treturn this;\n\t}\n\twithBasePath() {\n\t\tthis.options.includeBasePath = true;\n\t\treturn this;\n\t}\n\twithRelativePaths() {\n\t\tthis.options.relativePaths = true;\n\t\treturn this;\n\t}\n\twithDirs() {\n\t\tthis.options.includeDirs = true;\n\t\treturn this;\n\t}\n\twithMaxDepth(depth) {\n\t\tthis.options.maxDepth = depth;\n\t\treturn this;\n\t}\n\twithMaxFiles(limit) {\n\t\tthis.options.maxFiles = limit;\n\t\treturn this;\n\t}\n\twithFullPaths() {\n\t\tthis.options.resolvePaths = true;\n\t\tthis.options.includeBasePath = true;\n\t\treturn this;\n\t}\n\twithErrors() {\n\t\tthis.options.suppressErrors = false;\n\t\treturn this;\n\t}\n\twithSymlinks({ resolvePaths = true } = {}) {\n\t\tthis.options.resolveSymlinks = true;\n\t\tthis.options.useRealPaths = resolvePaths;\n\t\treturn this.withFullPaths();\n\t}\n\twithAbortSignal(signal) {\n\t\tthis.options.signal = signal;\n\t\treturn this;\n\t}\n\tnormalize() {\n\t\tthis.options.normalizePath = true;\n\t\treturn this;\n\t}\n\tfilter(predicate) {\n\t\tthis.options.filters.push(predicate);\n\t\treturn this;\n\t}\n\tonlyDirs() {\n\t\tthis.options.excludeFiles = true;\n\t\tthis.options.includeDirs = true;\n\t\treturn this;\n\t}\n\texclude(predicate) {\n\t\tthis.options.exclude = predicate;\n\t\treturn this;\n\t}\n\tonlyCounts() {\n\t\tthis.options.onlyCounts = true;\n\t\treturn this;\n\t}\n\tcrawl(root) {\n\t\treturn new APIBuilder(root \|\| \".\", this.options);\n\t}\n\twithGlobFunction(fn) {\n\t\tthis.globFunction = fn;\n\t\treturn this;\n\t}\n\t/\n\t @deprecated Pass options using the constructor instead:\n\t* ```ts\n\t* new fdir(options).crawl(\"/path/to/root\");\n\t* ```\n\t* This method will be removed in v7.0\n\t/\n\t/ c8 ignore next 4 /\n\tcrawlWithOptions(root, options) {\n\t\tthis.options = {\n\t\t\t...this.options,\n\t\t\t...options\n\t\t};\n\t\treturn new APIBuilder(root \|\| \".\", this.options);\n\t}\n\tglob(...patterns) {\n\t\tif (this.globFunction) return this.globWithOptions(patterns);\n\t\treturn this.globWithOptions(patterns, ...[{ dot: true }]);\n\t}\n\tglobWithOptions(patterns, ...options) {\n\t\tconst globFn = this.globFunction \|\| pm;\n\t\t/ c8 ignore next 5 */\n\t\tif (!globFn) throw new Error(\"Please specify a glob function to use glob matching.\");\n\t\tvar isMatch = this.globCache[patterns.join(\"\\0\")];\n\t\tif (!isMatch) {\n\t\t\tisMatch = globFn(patterns, ...options);\n\t\t\tthis.globCache[patterns.join(\"\\0\")] = isMatch;\n\t\t}\n\t\tthis.options.filters.push((path$1) => isMatch(path$1));\n\t\treturn this;\n\t}\n};\n\n//#endregion\nexports.fdir = Builder;"],"names":["require$$0","fs","require$$1","fs$1","require$$2"],"mappings":";;;;;;;;AACA,MAAI,WAAW,OAAO;AACtB,MAAI,YAAY,OAAO;AACvB,MAAI,mBAAmB,OAAO;AAC9B,MAAI,oBAAoB,OAAO;AAC/B,MAAI,eAAe,OAAO;AAC1B,MAAI,eAAe,OAAO,UAAU;AACpC,MAAI,cAAc,CAAC,IAAI,MAAM,QAAQ,SAAS;AAC7C,QAAI,QAAQ,OAAO,SAAS,YAAY,OAAO,SAAS,WAAY,UAAS,OAAO,kBAAkB,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG,KAAK;AACrJ,YAAM,KAAK,CAAC;AACZ,UAAI,CAAC,aAAa,KAAK,IAAI,GAAG,KAAK,QAAQ,OAAQ,WAAU,IAAI,KAAK;AAAA,QACrE,MAAM,CAAC,MAAM,KAAK,CAAC,GAAG,KAAK,MAAM,GAAG;AAAA,QACpC,YAAY,EAAE,OAAO,iBAAiB,MAAM,GAAG,MAAM,KAAK;AAAA,MAC7D,CAAG;AAAA,IACH;AACC,WAAO;AAAA,EACR;AACA,MAAI,UAAU,CAAC,KAAK,YAAY,YAAY,SAAS,OAAO,OAAO,SAAS,aAAa,GAAG,CAAC,IAAI,CAAA,GAAI,YAA0B,CAAC,OAAO,CAAC,IAAI,aAAa,UAAU,QAAQ,WAAW;AAAA,IACrL,OAAO;AAAA,IACP,YAAY;AAAA,EACb,CAAC,IAAI,QAAQ,GAAG;AAGhB,QAAM,OAAO,QAAQA,aAAe;AACpC,QAAMC,OAAK,QAAQC,EAAa;AAGhC,WAAS,UAAU,QAAQ;AAC1B,QAAI,cAAa,GAAI,KAAK,WAAW,MAAM;AAC3C,QAAI,WAAW,SAAS,KAAK,WAAW,WAAW,SAAS,CAAC,MAAM,KAAK,IAAK,cAAa,WAAW,UAAU,GAAG,WAAW,SAAS,CAAC;AACvI,WAAO;AAAA,EACR;AACA,QAAM,gBAAgB;AACtB,WAAS,eAAe,QAAQ,WAAW;AAC1C,WAAO,OAAO,QAAQ,eAAe,SAAS;AAAA,EAC/C;AACA,QAAM,yBAAyB;AAC/B,WAAS,gBAAgB,QAAQ;AAChC,WAAO,WAAW,OAAO,uBAAuB,KAAK,MAAM;AAAA,EAC5D;AACA,WAAS,cAAc,QAAQ,SAAS;AACvC,UAAM,EAAE,cAAc,eAAe,iBAAiB,cAAa,IAAK;AACxE,UAAM,oBAAoB,QAAQ,aAAa,WAAW,OAAO,SAAS,GAAG,KAAK,OAAO,WAAW,GAAG;AACvG,QAAI,aAAc,WAAS,GAAI,KAAK,SAAS,MAAM;AACnD,QAAI,mBAAmB,kBAAmB,UAAS,UAAU,MAAM;AACnE,QAAI,WAAW,IAAK,QAAO;AAC3B,UAAM,iBAAiB,OAAO,OAAO,SAAS,CAAC,MAAM;AACrD,WAAO,eAAe,iBAAiB,SAAS,gBAAgB,QAAQ,aAAa;AAAA,EACtF;AAIA,WAAS,qBAAqB,UAAU,eAAe;AACtD,WAAO,gBAAgB;AAAA,EACxB;AACA,WAAS,yBAAyB,MAAM,SAAS;AAChD,WAAO,SAAS,UAAU,eAAe;AACxC,YAAM,WAAW,cAAc,WAAW,IAAI;AAC9C,UAAI,SAAU,QAAO,cAAc,MAAM,KAAK,MAAM,IAAI;AAAA,UACnD,QAAO,gBAAe,GAAI,KAAK,UAAU,MAAM,aAAa,GAAG,QAAQ,aAAa,IAAI,QAAQ,gBAAgB;AAAA,IACvH;AAAA,EACA;AACA,WAAS,SAAS,UAAU;AAC3B,WAAO;AAAA,EACR;AACA,WAAS,kBAAkB,UAAU,eAAe,WAAW;AAC9D,WAAO,gBAAgB,WAAW;AAAA,EACnC;AACA,WAAS,QAAQ,MAAM,SAAS;AAC/B,UAAM,EAAE,eAAe,gBAAe,IAAK;AAC3C,WAAO,iBAAiB,OAAO,yBAAyB,MAAM,OAAO,IAAI,kBAAkB,uBAAuB;AAAA,EACnH;AAIA,WAAS,8BAA8B,MAAM;AAC5C,WAAO,SAAS,eAAe,OAAO;AACrC,YAAM,KAAK,cAAc,UAAU,KAAK,MAAM,KAAK,GAAG;AAAA,IACxD;AAAA,EACA;AACA,WAAS,oCAAoC,MAAM;AAClD,WAAO,SAAS,eAAe,OAAO,SAAS;AAC9C,YAAM,eAAe,cAAc,UAAU,KAAK,MAAM,KAAK;AAC7D,UAAI,QAAQ,MAAM,CAAC,WAAW,OAAO,cAAc,IAAI,CAAC,EAAG,OAAM,KAAK,YAAY;AAAA,IACpF;AAAA,EACA;AACA,QAAM,gBAAgB,CAAC,eAAe,UAAU;AAC/C,UAAM,KAAK,iBAAiB,GAAG;AAAA,EAChC;AACA,QAAM,sBAAsB,CAAC,eAAe,OAAO,YAAY;AAC9D,UAAM,SAAS,iBAAiB;AAChC,QAAI,QAAQ,MAAM,CAAC,WAAW,OAAO,QAAQ,IAAI,CAAC,EAAG,OAAM,KAAK,MAAM;AAAA,EACvE;AACA,QAAM,UAAU,MAAM;AAAA,EAAA;AACtB,WAAS,QAAQ,MAAM,SAAS;AAC/B,UAAM,EAAE,aAAa,SAAS,cAAa,IAAK;AAChD,QAAI,CAAC,YAAa,QAAO;AACzB,QAAI,cAAe,QAAO,WAAW,QAAQ,SAAS,oCAAoC,IAAI,IAAI,8BAA8B,IAAI;AACpI,WAAO,WAAW,QAAQ,SAAS,sBAAsB;AAAA,EAC1D;AAIA,QAAM,yBAAyB,CAAC,UAAU,QAAQ,QAAQ,YAAY;AACrE,QAAI,QAAQ,MAAM,CAAC,WAAW,OAAO,UAAU,KAAK,CAAC,EAAG,QAAO;AAAA,EAChE;AACA,QAAM,iBAAiB,CAAC,UAAU,OAAO,SAAS,YAAY;AAC7D,QAAI,QAAQ,MAAM,CAAC,WAAW,OAAO,UAAU,KAAK,CAAC,EAAG,OAAM,KAAK,QAAQ;AAAA,EAC5E;AACA,QAAM,gBAAgB,CAAC,WAAW,QAAQ,QAAQ,aAAa;AAC9D,WAAO;AAAA,EACR;AACA,QAAM,WAAW,CAAC,UAAU,UAAU;AACrC,UAAM,KAAK,QAAQ;AAAA,EACpB;AACA,QAAM,UAAU,MAAM;AAAA,EAAA;AACtB,WAAS,QAAQ,SAAS;AACzB,UAAM,EAAE,cAAc,SAAS,WAAU,IAAK;AAC9C,QAAI,aAAc,QAAO;AACzB,QAAI,WAAW,QAAQ,OAAQ,QAAO,aAAa,yBAAyB;AAAA,aACnE,WAAY,QAAO;AAAA,QACvB,QAAO;AAAA,EACb;AAIA,QAAM,WAAW,CAAC,UAAU;AAC3B,WAAO;AAAA,EACR;AACA,QAAM,gBAAgB,MAAM;AAC3B,WAAO,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC;AAAA,EACvB;AACA,WAAS,QAAQ,SAAS;AACzB,WAAO,QAAQ,QAAQ,gBAAgB;AAAA,EACxC;AAIA,QAAM,aAAa,CAAC,QAAQ,WAAW,UAAU;AAChD,WAAO,KAAK;AAAA,MACX;AAAA,MACA;AAAA,MACA,KAAK;AAAA,IACP,CAAE;AAAA,EACF;AACA,QAAM,QAAQ,MAAM;AAAA,EAAA;AACpB,WAAS,QAAQ,SAAS;AACzB,WAAO,QAAQ,QAAQ,aAAa;AAAA,EACrC;AAIA,QAAM,uBAAuB,SAAS,QAAQ,OAAO,YAAY;AAChE,UAAM,EAAE,OAAO,IAAIC,OAAM,SAAS,EAAE,eAAc,EAAE,IAAK;AACzD,UAAM,QAAO;AACb,IAAAA,MAAK,SAAS,QAAQ,CAAC,OAAO,iBAAiB;AAC9C,UAAI,MAAO,QAAO,MAAM,QAAQ,iBAAiB,OAAO,OAAO,KAAK;AACpE,MAAAA,MAAK,KAAK,cAAc,CAAC,SAAS,SAAS;AAC1C,YAAI,QAAS,QAAO,MAAM,QAAQ,iBAAiB,OAAO,SAAS,KAAK;AACxE,YAAI,KAAK,iBAAiB,YAAY,QAAQ,cAAc,KAAK,EAAG,QAAO,MAAM,QAAQ,MAAM,KAAK;AACpG,mBAAW,MAAM,YAAY;AAC7B,cAAM,QAAQ,MAAM,KAAK;AAAA,MAC5B,CAAG;AAAA,IACH,CAAE;AAAA,EACF;AACA,QAAM,kBAAkB,SAAS,QAAQ,OAAO,YAAY;AAC3D,UAAM,EAAE,OAAO,IAAIA,OAAM,SAAS,EAAE,eAAc,EAAE,IAAK;AACzD,UAAM,QAAO;AACb,QAAI;AACH,YAAM,eAAeA,MAAK,aAAa,MAAM;AAC7C,YAAM,OAAOA,MAAK,SAAS,YAAY;AACvC,UAAI,KAAK,iBAAiB,YAAY,QAAQ,cAAc,KAAK,EAAG;AACpE,iBAAW,MAAM,YAAY;AAAA,IAC/B,SAAU,GAAG;AACX,UAAI,CAAC,eAAgB,OAAM;AAAA,IAC7B;AAAA,EACA;AACA,WAAS,QAAQ,SAAS,eAAe;AACxC,QAAI,CAAC,QAAQ,mBAAmB,QAAQ,gBAAiB,QAAO;AAChE,WAAO,gBAAgB,kBAAkB;AAAA,EAC1C;AACA,WAAS,YAAY,QAAQ,UAAU,OAAO;AAC7C,QAAI,MAAM,QAAQ,aAAc,QAAO,0BAA0B,UAAU,KAAK;AAChF,QAAI,UAAS,GAAI,KAAK,SAAS,MAAM;AACrC,QAAI,QAAQ;AACZ,WAAO,WAAW,MAAM,QAAQ,QAAQ,GAAG;AAC1C,YAAM,eAAe,MAAM,SAAS,IAAI,MAAM;AAC9C,YAAM,aAAa,CAAC,CAAC,iBAAiB,iBAAiB,YAAY,aAAa,WAAW,QAAQ,KAAK,SAAS,WAAW,YAAY;AACxI,UAAI,WAAY;AAAA,UACX,WAAS,GAAI,KAAK,SAAS,MAAM;AAAA,IACxC;AACC,UAAM,SAAS,IAAI,QAAQ,QAAQ;AACnC,WAAO,QAAQ;AAAA,EAChB;AACA,WAAS,0BAA0B,UAAU,OAAO;AACnD,WAAO,MAAM,QAAQ,SAAS,WAAW,MAAM,QAAQ,aAAa;AAAA,EACrE;AAIA,QAAM,iBAAiB,CAAC,UAAU;AACjC,WAAO,MAAM;AAAA,EACd;AACA,QAAM,aAAa,CAAC,UAAU;AAC7B,WAAO,MAAM;AAAA,EACd;AACA,QAAM,cAAc,CAAC,UAAU;AAC9B,WAAO,MAAM;AAAA,EACd;AACA,QAAM,iBAAiB,CAAC,UAAU;AACjC,WAAO,MAAM,MAAM,MAAM,GAAG,MAAM,QAAQ,QAAQ;AAAA,EACnD;AACA,QAAM,kBAAkB,CAAC,OAAO,OAAO,eAAe;AACrD,WAAO,OAAO,YAAY,MAAM,QAAQ,MAAM,QAAQ,cAAc;AACpE,WAAO;AAAA,EACR;AACA,QAAM,eAAe,CAAC,OAAO,OAAO,eAAe;AAClD,WAAO,OAAO,YAAY,MAAM,OAAO,MAAM,QAAQ,cAAc;AACnE,WAAO;AAAA,EACR;AACA,QAAM,kBAAkB,CAAC,OAAO,OAAO,eAAe;AACrD,WAAO,OAAO,YAAY,MAAM,MAAM,MAAM,GAAG,MAAM,QAAQ,QAAQ,GAAG,MAAM,QAAQ,cAAc;AACpG,WAAO;AAAA,EACR;AACA,QAAM,cAAc,CAAC,OAAO,OAAO,eAAe;AACjD,WAAO,OAAO,YAAY,MAAM,QAAQ,MAAM,QAAQ,cAAc;AACpE,WAAO;AAAA,EACR;AACA,WAAS,OAAO,OAAO,YAAY,QAAQ,gBAAgB;AAC1D,QAAI,SAAS,CAAC,eAAgB,YAAW,OAAO,MAAM;AAAA,QACjD,YAAW,MAAM,MAAM;AAAA,EAC7B;AACA,WAAS,QAAQ,SAAS,eAAe;AACxC,UAAM,EAAE,YAAY,OAAO,SAAQ,IAAK;AACxC,QAAI,WAAY,QAAO,gBAAgB,iBAAiB;AAAA,aAC/C,MAAO,QAAO,gBAAgB,aAAa;AAAA,aAC3C,SAAU,QAAO,gBAAgB,iBAAiB;AAAA,QACtD,QAAO,gBAAgB,cAAc;AAAA,EAC3C;AAIA,QAAM,cAAc,EAAE,eAAe,KAAI;AACzC,QAAM,YAAY,CAAC,OAAO,WAAW,eAAe,cAAc,eAAe;AAChF,UAAM,MAAM,QAAO;AACnB,QAAI,eAAe,EAAG,QAAO,MAAM,MAAM,QAAQ,MAAM,KAAK;AAC5D,UAAM,EAAE,IAAIA,MAAI,IAAK;AACrB,UAAM,QAAQ,KAAK,SAAS;AAC5B,UAAM,OAAO;AACb,IAAAA,MAAK,QAAQ,aAAa,KAAK,aAAa,CAAC,OAAO,UAAU,OAAO;AACpE,iBAAW,SAAS,eAAe,YAAY;AAC/C,YAAM,MAAM,QAAQ,MAAM,QAAQ,iBAAiB,OAAO,OAAO,KAAK;AAAA,IACxE,CAAE;AAAA,EACF;AACA,QAAM,WAAW,CAAC,OAAO,WAAW,eAAe,cAAc,eAAe;AAC/E,UAAM,EAAE,IAAIA,MAAI,IAAK;AACrB,QAAI,eAAe,EAAG;AACtB,UAAM,QAAQ,KAAK,SAAS;AAC5B,UAAM,OAAO;AACb,QAAI,UAAU,CAAA;AACd,QAAI;AACH,gBAAUA,MAAK,YAAY,aAAa,KAAK,WAAW;AAAA,IAC1D,SAAU,GAAG;AACX,UAAI,CAAC,MAAM,QAAQ,eAAgB,OAAM;AAAA,IAC3C;AACC,eAAW,SAAS,eAAe,YAAY;AAAA,EAChD;AACA,WAAS,MAAM,eAAe;AAC7B,WAAO,gBAAgB,WAAW;AAAA,EACnC;AASA,MAAI,QAAQ,MAAM;AAAA,IACjB,QAAQ;AAAA,IACR,YAAY,cAAc;AACzB,WAAK,eAAe;AAAA,IACtB;AAAA,IACC,UAAU;AACT,WAAK;AACL,aAAO,KAAK;AAAA,IACd;AAAA,IACC,QAAQ,OAAO,QAAQ;AACtB,UAAI,KAAK,iBAAiB,EAAE,KAAK,SAAS,KAAK,QAAQ;AACtD,aAAK,aAAa,OAAO,MAAM;AAC/B,YAAI,OAAO;AACV,iBAAO,WAAW,MAAK;AACvB,eAAK,eAAe;AAAA,QACxB;AAAA,MACA;AAAA,IACA;AAAA;AAKA,MAAI,UAAU,MAAM;AAAA,IACnB,SAAS;AAAA,IACT,eAAe;AAAA,IACf,IAAI,MAAM,KAAK;AACd,WAAK,SAAS;AAAA,IAChB;AAAA,IACC,IAAI,QAAQ;AACX,aAAO,KAAK;AAAA,IACd;AAAA,IACC,IAAI,YAAY,KAAK;AACpB,WAAK,eAAe;AAAA,IACtB;AAAA,IACC,IAAI,cAAc;AACjB,aAAO,KAAK;AAAA,IACd;AAAA;AAAA;AAAA;AAAA;AAAA,IAKC,IAAI,OAAO;AACV,aAAO,KAAK;AAAA,IACd;AAAA;AASA,MAAI,UAAU,MAAM;AAAA,IACnB,UAAU;AAAA,IACV,QAAQ;AACP,WAAK,UAAU;AAAA,IACjB;AAAA;AAKA,MAAI,SAAS,MAAM;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,YAAY,MAAM,SAAS,YAAY;AACtC,WAAK,gBAAgB,CAAC;AACtB,WAAK,kBAAkB,QAAQ,SAAS,KAAK,aAAa;AAC1D,WAAK,OAAO,cAAc,MAAM,OAAO;AACvC,WAAK,QAAQ;AAAA,QACZ,MAAM,gBAAgB,KAAK,IAAI,IAAI,KAAK,OAAO,KAAK,KAAK,MAAM,GAAG,EAAE;AAAA,QACpE,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC;AAAA,QACtB,QAAQ,CAAA;AAAA,QACR,QAAQ,IAAI,QAAO;AAAA,QACnB;AAAA,QACA,OAAO,IAAI,MAAM,CAAC,OAAO,UAAU,KAAK,gBAAgB,OAAO,OAAO,UAAU,CAAC;AAAA,QACjF,UAA0B,oBAAI,IAAG;AAAA,QACjC,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC;AAAA,QACxB,YAAY,IAAI,QAAO;AAAA,QACvB,IAAI,QAAQ,MAAMF;AAAAA;AAEnB,WAAK,WAAW,QAAQ,KAAK,MAAM,OAAO;AAC1C,WAAK,gBAAgB,QAAQ,KAAK,MAAM,OAAO;AAC/C,WAAK,WAAW,QAAQ,OAAO;AAC/B,WAAK,WAAW,QAAQ,OAAO;AAC/B,WAAK,aAAa,QAAQ,OAAO;AACjC,WAAK,iBAAiB,QAAQ,SAAS,KAAK,aAAa;AACzD,WAAK,gBAAgB,MAAM,KAAK,aAAa;AAAA,IAC/C;AAAA,IACC,QAAQ;AACP,WAAK,cAAc,KAAK,MAAM,KAAK,MAAM,OAAO,KAAK,MAAM,QAAQ,OAAO;AAC1E,WAAK,cAAc,KAAK,OAAO,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,QAAQ,UAAU,KAAK,IAAI;AAC3F,aAAO,KAAK,gBAAgB,KAAK,gBAAgB,KAAK,OAAO,IAAI,IAAI;AAAA,IACvE;AAAA,IACC,OAAO,CAAC,SAAS,eAAe,UAAU;AACzC,YAAM,EAAE,OAAO,SAAS,EAAE,SAAS,iBAAiB,mBAAmB,iBAAiB,SAAS,UAAU,QAAQ,cAAc,cAAa,GAAI,WAAU,IAAK,KAAK;AACtK,UAAI,WAAW,WAAW,UAAU,OAAO,WAAW,YAAY,MAAM,SAAS,SAAU;AAC3F,YAAM,QAAQ,KAAK,SAAS,KAAK,MAAM,KAAK;AAC5C,eAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,EAAE,GAAG;AACxC,cAAM,QAAQ,QAAQ,CAAC;AACvB,YAAI,MAAM,OAAM,KAAM,MAAM,eAAc,KAAM,CAAC,qBAAqB,CAAC,iBAAiB;AACvF,gBAAM,WAAW,KAAK,SAAS,MAAM,MAAM,aAAa;AACxD,eAAK,SAAS,UAAU,OAAO,KAAK,MAAM,QAAQ,OAAO;AAAA,QAC7D,WAAc,MAAM,eAAe;AAC/B,cAAI,SAAS,kBAAkB,MAAM,MAAM,eAAe,KAAK,MAAM,QAAQ,aAAa;AAC1F,cAAI,WAAW,QAAQ,MAAM,MAAM,MAAM,EAAG;AAC5C,eAAK,cAAc,QAAQ,OAAO,OAAO;AACzC,eAAK,cAAc,KAAK,OAAO,QAAQ,QAAQ,QAAQ,GAAG,KAAK,IAAI;AAAA,QACvE,WAAc,KAAK,kBAAkB,MAAM,eAAc,GAAI;AACzD,cAAI,SAAS,qBAAqB,MAAM,MAAM,aAAa;AAC3D,eAAK,eAAe,QAAQ,KAAK,OAAO,CAAC,MAAM,iBAAiB;AAC/D,gBAAI,KAAK,eAAe;AACvB,6BAAe,cAAc,cAAc,KAAK,MAAM,OAAO;AAC7D,kBAAI,WAAW,QAAQ,MAAM,MAAM,eAAe,eAAe,SAAS,aAAa,EAAG;AAC1F,mBAAK,cAAc,KAAK,OAAO,cAAc,eAAe,eAAe,SAAS,eAAe,QAAQ,GAAG,KAAK,IAAI;AAAA,YAC7H,OAAY;AACN,6BAAe,eAAe,eAAe;AAC7C,oBAAM,YAAW,GAAI,KAAK,UAAU,YAAY;AAChD,oBAAM,kBAAkB,eAAc,GAAI,KAAK,SAAS,YAAY,GAAG,KAAK,MAAM,OAAO;AACzF,6BAAe,KAAK,SAAS,UAAU,eAAe;AACtD,mBAAK,SAAS,cAAc,OAAO,KAAK,MAAM,QAAQ,OAAO;AAAA,YACnE;AAAA,UACA,CAAK;AAAA,QACL;AAAA,MACA;AACE,WAAK,WAAW,KAAK,MAAM,QAAQ,eAAe,KAAK;AAAA,IACzD;AAAA;AAKA,WAAS,QAAQ,MAAM,SAAS;AAC/B,WAAO,IAAI,QAAQ,CAAC,WAAW,WAAW;AACzC,eAAS,MAAM,SAAS,CAAC,KAAK,WAAW;AACxC,YAAI,IAAK,QAAO,OAAO,GAAG;AAC1B,kBAAU,MAAM;AAAA,MACnB,CAAG;AAAA,IACH,CAAE;AAAA,EACF;AACA,WAAS,SAAS,MAAM,SAAS,YAAY;AAC5C,QAAI,SAAS,IAAI,OAAO,MAAM,SAAS,UAAU;AACjD,WAAO,MAAK;AAAA,EACb;AAIA,WAAS,KAAK,MAAM,SAAS;AAC5B,UAAM,SAAS,IAAI,OAAO,MAAM,OAAO;AACvC,WAAO,OAAO,MAAK;AAAA,EACpB;AAIA,MAAI,aAAa,MAAM;AAAA,IACtB,YAAY,MAAM,SAAS;AAC1B,WAAK,OAAO;AACZ,WAAK,UAAU;AAAA,IACjB;AAAA,IACC,cAAc;AACb,aAAO,QAAQ,KAAK,MAAM,KAAK,OAAO;AAAA,IACxC;AAAA,IACC,aAAa,IAAI;AAChB,eAAS,KAAK,MAAM,KAAK,SAAS,EAAE;AAAA,IACtC;AAAA,IACC,OAAO;AACN,aAAO,KAAK,KAAK,MAAM,KAAK,OAAO;AAAA,IACrC;AAAA;AAKA,MAAI,KAAK;AAET,MAAI;AACH,oBAAgB,WAAW;AAC3B,SAAKG,iCAAA;AAAA,EACN,QAAQ;AAAA,EAAA;AACR,MAAI,UAAU,MAAM;AAAA,IACnB,YAAY,CAAA;AAAA,IACZ,UAAU;AAAA,MACT,UAAU;AAAA,MACV,gBAAgB;AAAA,MAChB,eAAe,KAAK;AAAA,MACpB,SAAS,CAAA;AAAA;IAEV;AAAA,IACA,YAAY,SAAS;AACpB,WAAK,UAAU;AAAA,QACd,GAAG,KAAK;AAAA,QACR,GAAG;AAAA;AAEJ,WAAK,eAAe,KAAK,QAAQ;AAAA,IACnC;AAAA,IACC,QAAQ;AACP,WAAK,QAAQ,QAAQ;AACrB,aAAO;AAAA,IACT;AAAA,IACC,kBAAkB,WAAW;AAC5B,WAAK,QAAQ,gBAAgB;AAC7B,aAAO;AAAA,IACT;AAAA,IACC,eAAe;AACd,WAAK,QAAQ,kBAAkB;AAC/B,aAAO;AAAA,IACT;AAAA,IACC,oBAAoB;AACnB,WAAK,QAAQ,gBAAgB;AAC7B,aAAO;AAAA,IACT;AAAA,IACC,WAAW;AACV,WAAK,QAAQ,cAAc;AAC3B,aAAO;AAAA,IACT;AAAA,IACC,aAAa,OAAO;AACnB,WAAK,QAAQ,WAAW;AACxB,aAAO;AAAA,IACT;AAAA,IACC,aAAa,OAAO;AACnB,WAAK,QAAQ,WAAW;AACxB,aAAO;AAAA,IACT;AAAA,IACC,gBAAgB;AACf,WAAK,QAAQ,eAAe;AAC5B,WAAK,QAAQ,kBAAkB;AAC/B,aAAO;AAAA,IACT;AAAA,IACC,aAAa;AACZ,WAAK,QAAQ,iBAAiB;AAC9B,aAAO;AAAA,IACT;AAAA,IACC,aAAa,EAAE,eAAe,KAAI,IAAK,CAAA,GAAI;AAC1C,WAAK,QAAQ,kBAAkB;AAC/B,WAAK,QAAQ,eAAe;AAC5B,aAAO,KAAK,cAAa;AAAA,IAC3B;AAAA,IACC,gBAAgB,QAAQ;AACvB,WAAK,QAAQ,SAAS;AACtB,aAAO;AAAA,IACT;AAAA,IACC,YAAY;AACX,WAAK,QAAQ,gBAAgB;AAC7B,aAAO;AAAA,IACT;AAAA,IACC,OAAO,WAAW;AACjB,WAAK,QAAQ,QAAQ,KAAK,SAAS;AACnC,aAAO;AAAA,IACT;AAAA,IACC,WAAW;AACV,WAAK,QAAQ,eAAe;AAC5B,WAAK,QAAQ,cAAc;AAC3B,aAAO;AAAA,IACT;AAAA,IACC,QAAQ,WAAW;AAClB,WAAK,QAAQ,UAAU;AACvB,aAAO;AAAA,IACT;AAAA,IACC,aAAa;AACZ,WAAK,QAAQ,aAAa;AAC1B,aAAO;AAAA,IACT;AAAA,IACC,MAAM,MAAM;AACX,aAAO,IAAI,WAAW,QAAQ,KAAK,KAAK,OAAO;AAAA,IACjD;AAAA,IACC,iBAAiB,IAAI;AACpB,WAAK,eAAe;AACpB,aAAO;AAAA,IACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IASC,iBAAiB,MAAM,SAAS;AAC/B,WAAK,UAAU;AAAA,QACd,GAAG,KAAK;AAAA,QACR,GAAG;AAAA;AAEJ,aAAO,IAAI,WAAW,QAAQ,KAAK,KAAK,OAAO;AAAA,IACjD;AAAA,IACC,QAAQ,UAAU;AACjB,UAAI,KAAK,aAAc,QAAO,KAAK,gBAAgB,QAAQ;AAC3D,aAAO,KAAK,gBAAgB,UAAU,GAAG,CAAC,EAAE,KAAK,KAAI,CAAE,CAAC;AAAA,IAC1D;AAAA,IACC,gBAAgB,aAAa,SAAS;AACrC,YAAM,SAAS,KAAK,gBAAgB;AAEpC,UAAI,CAAC,OAAQ,OAAM,IAAI,MAAM,sDAAsD;AACnF,UAAI,UAAU,KAAK,UAAU,SAAS,KAAK,IAAI,CAAC;AAChD,UAAI,CAAC,SAAS;AACb,kBAAU,OAAO,UAAU,GAAG,OAAO;AACrC,aAAK,UAAU,SAAS,KAAK,IAAI,CAAC,IAAI;AAAA,MACzC;AACE,WAAK,QAAQ,QAAQ,KAAK,CAAC,WAAW,QAAQ,MAAM,CAAC;AACrD,aAAO;AAAA,IACT;AAAA;AAIA,OAAA,OAAe;;;","x_google_ignoreList":[0]}

package/dist/node_modules/onnxruntime-common/dist/lib/backend-impl.js ADDED Viewed

@@ -0,0 +1,67 @@
+const backends = {};
+const backendsSortedByPriority = [];
+const registerBackend = (name, backend, priority) => {
+  if (backend && typeof backend.init === "function" && typeof backend.createSessionHandler === "function") {
+    const currentBackend = backends[name];
+    if (currentBackend === void 0) {
+      backends[name] = { backend, priority };
+    } else if (currentBackend.priority > priority) {
+      return;
+    } else if (currentBackend.priority === priority) {
+      if (currentBackend.backend !== backend) {
+        throw new Error(`cannot register backend "${name}" using priority ${priority}`);
+      }
+    }
+    if (priority >= 0) {
+      const i = backendsSortedByPriority.indexOf(name);
+      if (i !== -1) {
+        backendsSortedByPriority.splice(i, 1);
+      }
+      for (let i2 = 0; i2 < backendsSortedByPriority.length; i2++) {
+        if (backends[backendsSortedByPriority[i2]].priority <= priority) {
+          backendsSortedByPriority.splice(i2, 0, name);
+          return;
+        }
+      }
+      backendsSortedByPriority.push(name);
+    }
+    return;
+  }
+  throw new TypeError("not a valid backend");
+};
+const resolveBackend = async (backendHints) => {
+  const backendNames = backendHints.length === 0 ? backendsSortedByPriority : backendHints;
+  const errors = [];
+  for (const backendName of backendNames) {
+    const backendInfo = backends[backendName];
+    if (backendInfo) {
+      if (backendInfo.initialized) {
+        return backendInfo.backend;
+      } else if (backendInfo.aborted) {
+        continue;
+      }
+      const isInitializing = !!backendInfo.initPromise;
+      try {
+        if (!isInitializing) {
+          backendInfo.initPromise = backendInfo.backend.init();
+        }
+        await backendInfo.initPromise;
+        backendInfo.initialized = true;
+        return backendInfo.backend;
+      } catch (e) {
+        if (!isInitializing) {
+          errors.push({ name: backendName, err: e });
+        }
+        backendInfo.aborted = true;
+      } finally {
+        delete backendInfo.initPromise;
+      }
+    }
+  }
+  throw new Error(`no available backend found. ERR: ${errors.map((e) => `[${e.name}] ${e.err}`).join(", ")}`);
+};
+export {
+  registerBackend,
+  resolveBackend
+};
+//# sourceMappingURL=backend-impl.js.map

package/dist/node_modules/onnxruntime-common/dist/lib/backend-impl.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"backend-impl.js","sources":["../../../../../node_modules/onnxruntime-common/dist/lib/backend-impl.js"],"sourcesContent":["// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\nconst backends = {};\nconst backendsSortedByPriority = [];\n/**\n * Register a backend.\n *\n * @param name - the name as a key to lookup as an execution provider.\n * @param backend - the backend object.\n * @param priority - an integer indicating the priority of the backend. Higher number means higher priority. if priority\n * < 0, it will be considered as a 'beta' version and will not be used as a fallback backend by default.\n *\n * @internal\n */\nexport const registerBackend = (name, backend, priority) => {\n if (backend && typeof backend.init === 'function' && typeof backend.createSessionHandler === 'function') {\n const currentBackend = backends[name];\n if (currentBackend === undefined) {\n backends[name] = { backend, priority };\n }\n else if (currentBackend.priority > priority) {\n // same name is already registered with a higher priority. skip registeration.\n return;\n }\n else if (currentBackend.priority === priority) {\n if (currentBackend.backend !== backend) {\n throw new Error(`cannot register backend \"${name}\" using priority ${priority}`);\n }\n }\n if (priority >= 0) {\n const i = backendsSortedByPriority.indexOf(name);\n if (i !== -1) {\n backendsSortedByPriority.splice(i, 1);\n }\n for (let i = 0; i < backendsSortedByPriority.length; i++) {\n if (backends[backendsSortedByPriority[i]].priority <= priority) {\n backendsSortedByPriority.splice(i, 0, name);\n return;\n }\n }\n backendsSortedByPriority.push(name);\n }\n return;\n }\n throw new TypeError('not a valid backend');\n};\n/**\n * Resolve backend by specified hints.\n *\n * @param backendHints - a list of execution provider names to lookup. If omitted use registered backends as list.\n * @returns a promise that resolves to the backend.\n *\n * @internal\n */\nexport const resolveBackend = async (backendHints) => {\n const backendNames = backendHints.length === 0 ? backendsSortedByPriority : backendHints;\n const errors = [];\n for (const backendName of backendNames) {\n const backendInfo = backends[backendName];\n if (backendInfo) {\n if (backendInfo.initialized) {\n return backendInfo.backend;\n }\n else if (backendInfo.aborted) {\n continue; // current backend is unavailable; try next\n }\n const isInitializing = !!backendInfo.initPromise;\n try {\n if (!isInitializing) {\n backendInfo.initPromise = backendInfo.backend.init();\n }\n await backendInfo.initPromise;\n backendInfo.initialized = true;\n return backendInfo.backend;\n }\n catch (e) {\n if (!isInitializing) {\n errors.push({ name: backendName, err: e });\n }\n backendInfo.aborted = true;\n }\n finally {\n delete backendInfo.initPromise;\n }\n }\n }\n throw new Error(`no available backend found. ERR: ${errors.map(e => `[${e.name}] ${e.err}`).join(', ')}`);\n};\n//# sourceMappingURL=backend-impl.js.map"],"names":["i"],"mappings":"AAEA,MAAM,WAAW,CAAA;AACjB,MAAM,2BAA2B,CAAA;AAWrB,MAAC,kBAAkB,CAAC,MAAM,SAAS,aAAa;AACxD,MAAI,WAAW,OAAO,QAAQ,SAAS,cAAc,OAAO,QAAQ,yBAAyB,YAAY;AACrG,UAAM,iBAAiB,SAAS,IAAI;AACpC,QAAI,mBAAmB,QAAW;AAC9B,eAAS,IAAI,IAAI,EAAE,SAAS,SAAQ;AAAA,IACxC,WACS,eAAe,WAAW,UAAU;AAEzC;AAAA,IACJ,WACS,eAAe,aAAa,UAAU;AAC3C,UAAI,eAAe,YAAY,SAAS;AACpC,cAAM,IAAI,MAAM,4BAA4B,IAAI,oBAAoB,QAAQ,EAAE;AAAA,MAClF;AAAA,IACJ;AACA,QAAI,YAAY,GAAG;AACf,YAAM,IAAI,yBAAyB,QAAQ,IAAI;AAC/C,UAAI,MAAM,IAAI;AACV,iCAAyB,OAAO,GAAG,CAAC;AAAA,MACxC;AACA,eAASA,KAAI,GAAGA,KAAI,yBAAyB,QAAQA,MAAK;AACtD,YAAI,SAAS,yBAAyBA,EAAC,CAAC,EAAE,YAAY,UAAU;AAC5D,mCAAyB,OAAOA,IAAG,GAAG,IAAI;AAC1C;AAAA,QACJ;AAAA,MACJ;AACA,+BAAyB,KAAK,IAAI;AAAA,IACtC;AACA;AAAA,EACJ;AACA,QAAM,IAAI,UAAU,qBAAqB;AAC7C;AASY,MAAC,iBAAiB,OAAO,iBAAiB;AAClD,QAAM,eAAe,aAAa,WAAW,IAAI,2BAA2B;AAC5E,QAAM,SAAS,CAAA;AACf,aAAW,eAAe,cAAc;AACpC,UAAM,cAAc,SAAS,WAAW;AACxC,QAAI,aAAa;AACb,UAAI,YAAY,aAAa;AACzB,eAAO,YAAY;AAAA,MACvB,WACS,YAAY,SAAS;AAC1B;AAAA,MACJ;AACA,YAAM,iBAAiB,CAAC,CAAC,YAAY;AACrC,UAAI;AACA,YAAI,CAAC,gBAAgB;AACjB,sBAAY,cAAc,YAAY,QAAQ,KAAI;AAAA,QACtD;AACA,cAAM,YAAY;AAClB,oBAAY,cAAc;AAC1B,eAAO,YAAY;AAAA,MACvB,SACO,GAAG;AACN,YAAI,CAAC,gBAAgB;AACjB,iBAAO,KAAK,EAAE,MAAM,aAAa,KAAK,GAAG;AAAA,QAC7C;AACA,oBAAY,UAAU;AAAA,MAC1B,UACZ;AACgB,eAAO,YAAY;AAAA,MACvB;AAAA,IACJ;AAAA,EACJ;AACA,QAAM,IAAI,MAAM,oCAAoC,OAAO,IAAI,OAAK,IAAI,EAAE,IAAI,KAAK,EAAE,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE;AAC5G;","x_google_ignoreList":[0]}

package/dist/node_modules/onnxruntime-common/dist/lib/env-impl.js ADDED Viewed

@@ -0,0 +1,24 @@
+class EnvImpl {
+  constructor() {
+    this.wasm = {};
+    this.webgl = {};
+    this.logLevelInternal = "warning";
+  }
+  // TODO standadize the getter and setter convention in env for other fields.
+  set logLevel(value) {
+    if (value === void 0) {
+      return;
+    }
+    if (typeof value !== "string" || ["verbose", "info", "warning", "error", "fatal"].indexOf(value) === -1) {
+      throw new Error(`Unsupported logging level: ${value}`);
+    }
+    this.logLevelInternal = value;
+  }
+  get logLevel() {
+    return this.logLevelInternal;
+  }
+}
+export {
+  EnvImpl
+};
+//# sourceMappingURL=env-impl.js.map

package/dist/node_modules/onnxruntime-common/dist/lib/env-impl.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"env-impl.js","sources":["../../../../../node_modules/onnxruntime-common/dist/lib/env-impl.js"],"sourcesContent":["// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\nexport class EnvImpl {\n constructor() {\n this.wasm = {};\n this.webgl = {};\n this.logLevelInternal = 'warning';\n }\n // TODO standadize the getter and setter convention in env for other fields.\n set logLevel(value) {\n if (value === undefined) {\n return;\n }\n if (typeof value !== 'string' || ['verbose', 'info', 'warning', 'error', 'fatal'].indexOf(value) === -1) {\n throw new Error(`Unsupported logging level: ${value}`);\n }\n this.logLevelInternal = value;\n }\n get logLevel() {\n return this.logLevelInternal;\n }\n}\n//# sourceMappingURL=env-impl.js.map"],"names":[],"mappings":"AAEO,MAAM,QAAQ;AAAA,EACjB,cAAc;AACV,SAAK,OAAO,CAAA;AACZ,SAAK,QAAQ,CAAA;AACb,SAAK,mBAAmB;AAAA,EAC5B;AAAA;AAAA,EAEA,IAAI,SAAS,OAAO;AAChB,QAAI,UAAU,QAAW;AACrB;AAAA,IACJ;AACA,QAAI,OAAO,UAAU,YAAY,CAAC,WAAW,QAAQ,WAAW,SAAS,OAAO,EAAE,QAAQ,KAAK,MAAM,IAAI;AACrG,YAAM,IAAI,MAAM,8BAA8B,KAAK,EAAE;AAAA,IACzD;AACA,SAAK,mBAAmB;AAAA,EAC5B;AAAA,EACA,IAAI,WAAW;AACX,WAAO,KAAK;AAAA,EAChB;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/onnxruntime-common/dist/lib/env.js ADDED Viewed

@@ -0,0 +1,6 @@
+import { EnvImpl } from "./env-impl.js";
+const env = new EnvImpl();
+export {
+  env
+};
+//# sourceMappingURL=env.js.map

package/dist/node_modules/onnxruntime-common/dist/lib/env.js.map ADDED Viewed

@@ -0,0 +1 @@

+ {"version":3,"file":"env.js","sources":["../../../../../node_modules/onnxruntime-common/dist/lib/env.js"],"sourcesContent":["// Copyright (c) Microsoft Corporation. All rights reserved.\n// Licensed under the MIT License.\nimport { EnvImpl } from './env-impl';\n/**\n * Represent a set of flags as a global singleton.\n */\nexport const env = new EnvImpl();\n//# sourceMappingURL=env.js.map"],"names":[],"mappings":";AAMY,MAAC,MAAM,IAAI,QAAO;","x_google_ignoreList":[0]}

package/dist/node_modules/onnxruntime-common/dist/lib/index.js ADDED Viewed

@@ -0,0 +1,11 @@
+import { registerBackend } from "./backend-impl.js";
+import { env } from "./env.js";
+import { InferenceSession } from "./inference-session.js";
+import { Tensor } from "./tensor.js";
+export {
+  InferenceSession,
+  Tensor,
+  env,
+  registerBackend
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/onnxruntime-common/dist/lib/index.js.map ADDED Viewed

	@@ -0,0 +1 @@
1	+ {"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;"}