@amazon/vinyl-util 1.0.0

package/dist/types/current/util/collection/LruCache.js

@@ -0,0 +1,170 @@
+/*
+ * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { mapIter } from '../../util/iteration/iterable';
+import { LinkedList } from './LinkedList';
+import { IllegalStateError } from '../../error/IllegalStateError';
+/**
+ * An LRU Cache implementation.
+ * An LRU (Least Recently Used) Cache is a Map with a fixed capacity. When the capacity is
+ * exceeded, the least recently used element will be removed.
+ * An element is considered to be used when it has been retrieved via `get`, or when it's been
+ * `set`.
+ * Iteration does not affect ordering.
+ */
+export class LruCache {
+    /**
+     * A map of the list nodes.
+     *
+     * @private
+     */
+    cache = new Map();
+    /**
+     * Most recently used elements are at the tail, least recently used are at the head.
+     * @private
+     */
+    list = new LinkedList();
+    /**
+     * An element is about to be removed. Should return true if the element may be evicted,
+     * otherwise false.
+     * If false is returned for all elements, an IllegalStateError is thrown.
+     */
+    onEvicting = null;
+    /**
+     * When an element is added when at capacity, the least recently used element will be removed.
+     * This callback can be set to be notified with the element being evicted, which may be used
+     * for disposal.
+     */
+    onEvict = null;
+    _capacity = 0;
+    constructor(initialCapacity) {
+        this._capacity = initialCapacity;
+    }
+    get capacity() {
+        return this._capacity;
+    }
+    set capacity(value) {
+        this._capacity = value;
+        while (this.cache.size > this.capacity) {
+            this.evictLeastRecentlyUsed();
+        }
+    }
+    /**
+     * @returns the number of elements in the Map.
+     */
+    get size() {
+        return this.cache.size;
+    }
+    /**
+     * @returns boolean indicating whether an element with the specified key exists or not.
+     */
+    has(key) {
+        return this.cache.has(key);
+    }
+    /**
+     * Returns the mapped value for the given key, and moves the element to the most recently
+     * used position.
+     *
+     * @returns Returns the element associated with the given key, or undefined if no such
+     * element exists.
+     */
+    get(key) {
+        const node = this.cache.get(key);
+        if (!node)
+            return undefined;
+        this.list.pushNode(node);
+        return node.value[1];
+    }
+    /**
+     * Adds a new element with a specified key and value to the Map. If an element with the
+     * same key already exists, the element will be updated and position moved to most recently
+     * used.
+     */
+    set(key, value) {
+        if (this.has(key)) {
+            const node = this.cache.get(key);
+            node.value[1] = value;
+            this.list.pushNode(node);
+        }
+        else {
+            const node = this.list.push([key, value]);
+            this.cache.set(key, node);
+            if (this.cache.size > this.capacity) {
+                this.evictLeastRecentlyUsed();
+            }
+        }
+        return this;
+    }
+    evictLeastRecentlyUsed() {
+        let node = this.list.head;
+        while (node) {
+            const [key, value] = node.value;
+            const allowed = this.onEvicting?.call(null, value, key, this) ?? true;
+            if (allowed)
+                break;
+            node = node.next;
+        }
+        if (!node)
+            throw new IllegalStateError('onEvicting returned false for all elements');
+        const [key, value] = node.value;
+        this.list.remove(node);
+        this.cache.delete(node.value[0]);
+        this.onEvict?.call(null, value, key, this);
+    }
+    /**
+     * Clears all elements from the cache.
+     */
+    clear() {
+        this.list.clear();
+        this.cache.clear();
+    }
+    /**
+     * @returns true if an element in the Map existed and has been removed, or false if the element does not exist.
+     */
+    delete(key) {
+        if (!this.has(key))
+            return false;
+        const node = this.cache.get(key);
+        this.cache.delete(key);
+        this.list.remove(node);
+        return true;
+    }
+    /**
+     * Executes a provided function once per each key/value pair in the Map, in insertion order.
+     *
+     * @param callback A callback to invoke for every element in the cache.
+     * @param thisArg Value to use as this when executing callback
+     */
+    forEach(callback, thisArg) {
+        return this.list.forEach((entry) => {
+            callback.call(thisArg, entry[1], entry[0], this);
+        });
+    }
+    /**
+     * Returns an iterable of key, value pairs for every entry in the map.
+     */
+    entries() {
+        return this[Symbol.iterator]();
+    }
+    /**
+     * Returns an iterable of keys in the map. This will be ordered from least recently used to
+     * most.
+     */
+    keys() {
+        return mapIter(this.list, ([key]) => key);
+    }
+    /**
+     * Returns an iterable of values in the map. This will be ordered from least recently used to
+     * most.
+     */
+    values() {
+        return mapIter(this.list, ([, value]) => value);
+    }
+    [Symbol.iterator]() {
+        return this.list[Symbol.iterator]();
+    }
+    get [Symbol.toStringTag]() {
+        return 'LruCache';
+    }
+}

package/dist/types/current/util/collection/array.d.ts

@@ -0,0 +1,207 @@
+import { type Comparator } from '../../util/comparison/compare';
+import type { Maybe, MaybePromise, Primitive } from '../../util/type';
+export type FilterPredicateAsync<T> = (value: T, index: number, array: ArrayLike<T>) => Promise<boolean>;
+export type FilterPredicate<T> = (value: T, index: number, array: ArrayLike<T>) => boolean;
+/**
+ * indexOf on ArrayLike objects.
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/indexOf
+ */
+export declare function indexOf<E>(arrayLike: ArrayLike<E>, element: E): number;
+/**
+ * lastIndexOf on ArrayLike objects.
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/lastIndexOf
+ */
+export declare function lastIndexOf<E>(arrayLike: ArrayLike<E>, element: E): number;
+export declare function filter<T, S extends T>(arrayLike: ArrayLike<T>, predicate: (value: T, index: number, array: ArrayLike<T>) => value is S, thisArg?: any): S[];
+export declare function filter<T>(arrayLike: ArrayLike<T>, predicate: (value: T, index: number, array: ArrayLike<T>) => boolean, thisArg?: any): T[];
+/**
+ * Filter an ArrayLike with an asynchronous predicate.
+ *
+ * Runs the predicate across all elements, then filters the elements by the booleans
+ * resolved by the predicate.
+ *
+ * @param arrayLike The array-like object to filter
+ * @param predicate Async function that tests each element
+ * @param options Optional configuration object
+ * @param options.simultaneous Maximum number of predicates to run simultaneously (default: 1)
+ */
+export declare function filterAsync<T>(arrayLike: MaybePromise<ArrayLike<T>>, predicate: (value: T, index: number, array: ArrayLike<T>) => Promise<boolean>, options?: {
+    readonly simultaneous?: number;
+}): Promise<T[]>;
+/**
+ * map on ArrayLike objects.
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map
+ */
+export declare function map<T, U>(arrayLike: ArrayLike<T>, transform: (value: T, index: number, array: ArrayLike<T>) => U, thisArg?: any): U[];
+/**
+ * Map on ArrayLike objects with an asynchronous transformer.
+ *
+ * @param arrayLike The array-like object to transform
+ * @param transform Async function that transforms each element
+ * @param options Optional configuration object
+ * @param options.simultaneous Maximum number of transforms to run simultaneously (default: 1)
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map
+ */
+export declare function mapAsync<T, U>(arrayLike: MaybePromise<ArrayLike<T>>, transform: (value: T, index: number, array: ArrayLike<T>) => Promise<U>, options?: {
+    readonly simultaneous?: number;
+}): Promise<U[]>;
+/**
+ * Determines whether all the members of an array satisfy the specified test.
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/every
+ */
+export declare function every<T>(arrayLike: ArrayLike<T>, predicate: (value: T, index: number, array: ArrayLike<T>) => boolean, thisArg?: any): boolean;
+/**
+ * Determines whether any the members of an array satisfy the specified test.
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/some
+ */
+export declare function some<T>(arrayLike: ArrayLike<T>, predicate: (value: T, index: number, array: ArrayLike<T>) => boolean, thisArg?: any): boolean;
+/**
+ * Determines whether all the members of an array satisfy the specified asynchronous test.
+ *
+ * @param arrayLike The array-like object to test
+ * @param predicate Async function that tests each element
+ * @param options Optional configuration object
+ * @param options.simultaneous Maximum number of predicates to run simultaneously (default: 1)
+ */
+export declare function everyAsync<T>(arrayLike: MaybePromise<ArrayLike<T>>, predicate: (value: T, index: number, array: ArrayLike<T>) => Promise<boolean>, options?: {
+    readonly simultaneous?: number;
+}): Promise<boolean>;
+/**
+ * Determines whether any the members of an array satisfy the specified asynchronous test.
+ *
+ * @param arrayLike The array-like object to test
+ * @param predicate Async function that tests each element
+ * @param options Optional configuration object
+ * @param options.simultaneous Maximum number of predicates to run simultaneously (default: 1)
+ */
+export declare function someAsync<T>(arrayLike: MaybePromise<ArrayLike<T>>, predicate: (value: T, index: number, array: ArrayLike<T>) => Promise<boolean>, options?: {
+    readonly simultaneous?: number;
+}): Promise<boolean>;
+/**
+ * forEach on ArrayLike objects.
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach
+ */
+export declare function forEach<T>(arrayLike: ArrayLike<T>, action: (value: T, index: number, array: ArrayLike<T>) => void, thisArg?: any): void;
+/**
+ * Executes an asynchronous function on each element in an array.
+ *
+ * @param arrayLike The array-like object to iterate over
+ * @param executor Async function to execute for each element
+ * @param options Optional configuration object
+ * @param options.simultaneous Maximum number of executors to run simultaneously (default: 1)
+ */
+export declare function forEachAsync<T>(arrayLike: MaybePromise<ArrayLike<T>>, executor: (value: T, index: number, array: ArrayLike<T>) => Promise<void>, options?: {
+    readonly simultaneous?: number;
+}): Promise<void>;
+export declare function find<T, S extends T>(arrayLike: ArrayLike<T>, predicate: (this: void, value: T, index: number, obj: T[]) => value is S, thisArg?: any): S | undefined;
+export declare function find<T>(arrayLike: ArrayLike<T>, predicate: (value: T, index: number, obj: T[]) => boolean, thisArg?: any): T | undefined;
+/**
+ * findIndex on ArrayLike objects
+ * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/findIndex
+ */
+export declare function findIndex<T>(arrayLike: ArrayLike<T>, predicate: (value: T, index: number, obj: ArrayLike<T>) => unknown, thisArg?: any): number;
+/**
+ * Returns the first element of an ArrayLike.
+ */
+export declare function first<T>(arrayLike: Maybe<ArrayLike<T>>): T | undefined;
+/**
+ * Returns the last element of an ArrayLike.
+ */
+export declare function last<T>(arrayLike: Maybe<ArrayLike<T>>): T | undefined;
+/**
+ * Returns the first `count` elements of an ArrayLike.
+ * @param arrayLike
+ * @param count
+ */
+export declare function takeFirst<T>(arrayLike: ArrayLike<T>, count: number): T[];
+/**
+ * Returns the last `count` elements of an ArrayLike.
+ *
+ * @param arrayLike
+ * @param count
+ */
+export declare function takeLast<T>(arrayLike: ArrayLike<T>, count: number): T[];
+/**
+ * Returns a subsection of an array-like.
+ * For both start and end, a negative index can be used to indicate an offset from the end of
+ * the array.
+ * For example, -2 refers to the second to last element of the array.
+ *
+ * @param arrayLike An ArrayLike to copy.
+ * @param start The beginning index of the array-like. Default: 0
+ * @param end The end index of the specified portion of the array-like (exclusive). Default: length
+ */
+export declare function slice<T>(arrayLike: ArrayLike<T>, start?: number, end?: number): T[];
+/**
+ * Removes an element from the array, returning true if it was found.
+ */
+export declare function remove<T>(array: T[], element: T): boolean;
+/**
+ * Removes an element from the array at the given index, returning the removed element if the index
+ * was within range.
+ * @param array The Array to update.
+ * @param index If negative, will remove from the end of the list (-1 is last element), if
+ * greater than or equal to the list length, undefined will be returned.
+ */
+export declare function removeAt<T>(array: T[], index: number): T | undefined;
+/**
+ * Returns the index of the first element in the given array with the highest value according to
+ * the comparator.
+ * @param array
+ * @param comparator
+ */
+export declare function indexOfHighest<T>(array: ArrayLike<T>, comparator: Comparator<T>): number;
+/**
+ * Returns the index of the last element in the given array with the highest value according to
+ * the comparator.
+ * To find the index of the lowest value, use `util.comparator.reversed`
+ * @param array
+ * @param comparator
+ */
+export declare function lastIndexOfHighest<T>(array: ArrayLike<T>, comparator: Comparator<T>): number;
+/**
+ * Given an array using the given comparator function, finds the insertion index of an element.
+ *
+ * @param array An array sorted using the comparator.
+ * @param element The element to compare against array elements.
+ * @param comparator A function where given the return value of `comparator(element, array[i])`
+ * if less than zero the returned index will be before i, otherwise after.
+ * @param start The starting index (inclusive). Default: 0
+ * @param end The ending index (exclusive). Default: array.length
+ */
+export declare function sortedInsertionIndex<T, U = T>(array: ArrayLike<T>, element: U, comparator: Comparator<U, T>, start?: number, end?: number): number;
+/**
+ * Creates an iterator for an ArrayLike.
+ * If the given ArrayLike is iterable, then use its provided iterator.
+ *
+ * @param arrayLike
+ */
+export declare function createArrayLikeIterator<T>(arrayLike: ArrayLike<T>): IterableIterator<T>;
+/**
+ * Gets the element in the ArrayLike at the given index, or throws an IllegalArgumentError if out of range.
+ */
+export declare function getElementAt<T>(array: ArrayLike<T>, index: number): T;
+/**
+ * Gets the element in the ArrayLike at the given index, or returns the provided default value.
+ */
+export declare function getElementOrDefault<T, V>(array: ArrayLike<T>, index: number, defaultValue: V): T | V;
+/**
+ * Counts the number of elements in an array that return true when passed to a predicate function.
+ *
+ * @param array
+ * @param predicate
+ */
+export declare function countElements<T>(array: ArrayLike<T>, predicate: (value: T, index: number, obj: ArrayLike<T>) => boolean): number;
+/**
+ * Splits an array into chunks of the specified size.
+ *
+ * @param array The array to chunk
+ * @param chunkSize Maximum size of each chunk
+ * @returns Array of chunks
+ */
+export declare function chunk<T>(array: ArrayLike<T>, chunkSize: number): T[][];
+export declare function min<T extends Exclude<Primitive, symbol>>(arrayLike: ArrayLike<T>): T | undefined;
+export declare function min<T>(arrayLike: ArrayLike<T>, comparator: Comparator<T>): T | undefined;
+export declare function max<T extends Exclude<Primitive, symbol>>(arrayLike: ArrayLike<T>): T | undefined;
+export declare function max<T>(arrayLike: ArrayLike<T>, comparator: Comparator<T>): T | undefined;
+//# sourceMappingURL=array.d.ts.map

package/dist/types/current/util/collection/array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../../../../src/util/collection/array.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,KAAK,UAAU,EAAW,MAAM,2BAA2B,CAAA;AACpE,OAAO,KAAK,EAAE,KAAK,EAAE,YAAY,EAAE,SAAS,EAAE,MAAM,aAAa,CAAA;AAIjE,MAAM,MAAM,oBAAoB,CAAC,CAAC,IAAI,CAClC,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAClB,OAAO,CAAC,OAAO,CAAC,CAAA;AAErB,MAAM,MAAM,eAAe,CAAC,CAAC,IAAI,CAC7B,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAClB,OAAO,CAAA;AAEZ;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,MAAM,CAEtE;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,MAAM,CAE1E;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACjC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,EACvE,OAAO,CAAC,EAAE,GAAG,GACd,CAAC,EAAE,CAAA;AAEN,wBAAgB,MAAM,CAAC,CAAC,EACpB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,EACpE,OAAO,CAAC,EAAE,GAAG,GACd,CAAC,EAAE,CAAA;AAcN;;;;;;;;;;GAUG;AACH,wBAAsB,WAAW,CAAC,CAAC,EAC/B,SAAS,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EACrC,SAAS,EAAE,CACP,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAClB,OAAO,CAAC,OAAO,CAAC,EACrB,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAC7C,OAAO,CAAC,CAAC,EAAE,CAAC,CAGd;AAED;;;GAGG;AACH,wBAAgB,GAAG,CAAC,CAAC,EAAE,CAAC,EACpB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,EAC9D,OAAO,CAAC,EAAE,GAAG,GACd,CAAC,EAAE,CAEL;AAED;;;;;;;;GAQG;AACH,wBAAsB,QAAQ,CAAC,CAAC,EAAE,CAAC,EAC/B,SAAS,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EACrC,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,EACvE,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAC7C,OAAO,CAAC,CAAC,EAAE,CAAC,CAsBd;AAED;;;GAGG;AACH,wBAAgB,KAAK,CAAC,CAAC,EACnB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,EACpE,OAAO,CAAC,EAAE,GAAG,GACd,OAAO,CAET;AAED;;;GAGG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAClB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,EACpE,OAAO,CAAC,EAAE,GAAG,GACd,OAAO,CAET;AAED;;;;;;;GAOG;AACH,wBAAsB,UAAU,CAAC,CAAC,EAC9B,SAAS,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EACrC,SAAS,EAAE,CACP,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAClB,OAAO,CAAC,OAAO,CAAC,EACrB,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAC7C,OAAO,CAAC,OAAO,CAAC,CAiBlB;AAED;;;;;;;GAOG;AACH,wBAAsB,SAAS,CAAC,CAAC,EAC7B,SAAS,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EACrC,SAAS,EAAE,CACP,KAAK,EAAE,CAAC,EACR,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAClB,OAAO,CAAC,OAAO,CAAC,EACrB,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAC7C,OAAO,CAAC,OAAO,CAAC,CAMlB;AAED;;;GAGG;AACH,wBAAgB,OAAO,CAAC,CAAC,EACrB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,MAAM,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAC9D,OAAO,CAAC,EAAE,GAAG,GACd,IAAI,CAEN;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAC1B,SAAS,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EACrC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,EACzE,OAAO,CAAC,EAAE;IAAE,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAA;CAAE,GAC7C,OAAO,CAAC,IAAI,CAAC,CAEf;AAED,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EAC/B,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,KAAK,IAAI,CAAC,EACxE,OAAO,CAAC,EAAE,GAAG,GACd,CAAC,GAAG,SAAS,CAAA;AAEhB,wBAAgB,IAAI,CAAC,CAAC,EAClB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,OAAO,EACzD,OAAO,CAAC,EAAE,GAAG,GACd,CAAC,GAAG,SAAS,CAAA;AAchB;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EACvB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,EAClE,OAAO,CAAC,EAAE,GAAG,GACd,MAAM,CAER;AAED;;GAEG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAGtE;AAED;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,SAAS,CAGrE;AAED;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAGxE;AAED;;;;;GAKG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAGvE;AAED;;;;;;;;;GASG;AACH,wBAAgB,KAAK,CAAC,CAAC,EACnB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,KAAK,CAAC,EAAE,MAAM,EACd,GAAG,CAAC,EAAE,MAAM,GACb,CAAC,EAAE,CAEL;AAED;;GAEG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,GAAG,OAAO,CAKzD;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS,CAEpE;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAC5B,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAC1B,MAAM,CAYR;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAChC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAC1B,MAAM,CAYR;AAED;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EACzC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,OAAO,EAAE,CAAC,EACV,UAAU,EAAE,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAC5B,KAAK,SAAI,EACT,GAAG,SAAe,GACnB,MAAM,CAaR;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EACrC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GACxB,gBAAgB,CAAC,CAAC,CAAC,CAyBrB;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,CAMrE;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,CAAC,EACpC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,MAAM,EACb,YAAY,EAAE,CAAC,GAChB,CAAC,GAAG,CAAC,CAMP;AAED;;;;;GAKG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC3B,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,GACnE,MAAM,CASR;AAED;;;;;;GAMG;AACH,wBAAgB,KAAK,CAAC,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,GAAG,CAAC,EAAE,EAAE,CAMtE;AAED,wBAAgB,GAAG,CAAC,CAAC,SAAS,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,EACpD,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GACxB,CAAC,GAAG,SAAS,CAAA;AAChB,wBAAgB,GAAG,CAAC,CAAC,EACjB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAC1B,CAAC,GAAG,SAAS,CAAA;AAuBhB,wBAAgB,GAAG,CAAC,CAAC,SAAS,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,EACpD,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,GACxB,CAAC,GAAG,SAAS,CAAA;AAChB,wBAAgB,GAAG,CAAC,CAAC,EACjB,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC,EACvB,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC,GAC1B,CAAC,GAAG,SAAS,CAAA"}