@amazon/vinyl-util 1.0.0

package/dist/types/current/util/error/stack.d.ts

@@ -0,0 +1,79 @@
+import type { Maybe } from '../../util/type';
+/**
+ * A location in code.
+ */
+export interface CodeLocation {
+    /**
+     * The source location - may provide the function name or in some browsers the source file if
+     * source maps are enabled.
+     */
+    readonly source: string | null;
+    /**
+     * The url to the file.
+     */
+    readonly file: string | null;
+    /**
+     * The row (line) number.
+     */
+    readonly row: number;
+    /**
+     * The column number. May not be present on all browsers (e.g. Firefox < 30).
+     */
+    readonly col: number | null;
+}
+/**
+ * A Comparator for determining if one code location is before or after another.
+ *
+ * @private
+ */
+export declare const codeLocationComparator: import("../../util/comparison/compare").Comparator<Maybe<CodeLocation>, Maybe<CodeLocation>>;
+/**
+ * Boundary code locations, used to determine if an error is within a certain range of code.
+ * The start and end boundaries must be the same path and file to be a valid range.
+ */
+export interface CodeRange {
+    /**
+     * The starting code location (inclusive)
+     */
+    readonly start: CodeLocation | null;
+    /**
+     * The ending code location (exclusive)
+     */
+    readonly end: CodeLocation | null;
+}
+/**
+ * Creates a code range object from two error markers.
+ * @see parseStackLocation
+ */
+export declare function createRangeFromErrorMarkers(start: Error | undefined, end: Error | undefined): CodeRange;
+/**
+ * Returns true if the given location is within a range of code.
+ *
+ * @param location The location of the code to check if within bounds. If falsy, false is
+ * returned.
+ * @param range The boundaries to check against. If both start and end are null, false is
+ * returned. The range will consider `range.start` to be inclusive, and `range.end` to be exclusive.
+ */
+export declare function isCodeLocationInRange(location: Maybe<CodeLocation>, range: CodeRange): boolean;
+/**
+ * Returns the location of the stack's first line match; the location the error was constructed.
+ *
+ * @param stack
+ */
+export declare function parseStackLocation(stack?: Maybe<string>): CodeLocation | null;
+/**
+ * Used in comparison with `stackNoiseError2` to determine what leading stack lines should be
+ * trimmed.
+ * @private
+ */
+export declare const stackNoiseError1: Error;
+/**
+ * @private
+ */
+export declare const stackNoiseError2: Error;
+/**
+ * When corejs polyfills Error with clearErrorStack, the stack may begin with the polyfill
+ * location. Trim the beginning of stacks with the leading lines common to all errors.
+ */
+export declare const stackNoise: import("../../util/object/lazy").Lazy<string>;
+//# sourceMappingURL=stack.d.ts.map

package/dist/types/current/util/error/stack.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack.d.ts","sourceRoot":"","sources":["../../../../../src/util/error/stack.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAExC;;GAEG;AACH,MAAM,WAAW,YAAY;IACzB;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAA;IAE9B;;OAEG;IACH,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,CAAA;IAE5B;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;IAEpB;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAA;CAC9B;AAED;;;;GAIG;AACH,eAAO,MAAM,sBAAsB,0FAIlC,CAAA;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACtB;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,YAAY,GAAG,IAAI,CAAA;IAEnC;;OAEG;IACH,QAAQ,CAAC,GAAG,EAAE,YAAY,GAAG,IAAI,CAAA;CACpC;AAED;;;GAGG;AACH,wBAAgB,2BAA2B,CACvC,KAAK,EAAE,KAAK,GAAG,SAAS,EACxB,GAAG,EAAE,KAAK,GAAG,SAAS,GACvB,SAAS,CAKX;AAED;;;;;;;GAOG;AACH,wBAAgB,qBAAqB,CACjC,QAAQ,EAAE,KAAK,CAAC,YAAY,CAAC,EAC7B,KAAK,EAAE,SAAS,GACjB,OAAO,CAMT;AAgFD;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,YAAY,GAAG,IAAI,CAiB7E;AAED;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,OAAc,CAAA;AAE3C;;GAEG;AACH,eAAO,MAAM,gBAAgB,OAAc,CAAA;AAE3C;;;GAGG;AACH,eAAO,MAAM,UAAU,2CAUrB,CAAA"}

package/dist/types/current/util/error/stack.js

@@ -0,0 +1,135 @@
+/*
+ * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { compareBy } from '../../util/comparison/compare';
+import { lazy } from '../../util/object/lazy';
+/**
+ * A Comparator for determining if one code location is before or after another.
+ *
+ * @private
+ */
+export const codeLocationComparator = compareBy((stack) => stack.file, (stack) => stack.row, (stack) => stack.col);
+/**
+ * Creates a code range object from two error markers.
+ * @see parseStackLocation
+ */
+export function createRangeFromErrorMarkers(start, end) {
+    return {
+        start: parseStackLocation(start?.stack),
+        end: parseStackLocation(end?.stack),
+    };
+}
+/**
+ * Returns true if the given location is within a range of code.
+ *
+ * @param location The location of the code to check if within bounds. If falsy, false is
+ * returned.
+ * @param range The boundaries to check against. If both start and end are null, false is
+ * returned. The range will consider `range.start` to be inclusive, and `range.end` to be exclusive.
+ */
+export function isCodeLocationInRange(location, range) {
+    if (!location)
+        return false;
+    const { start, end } = range;
+    if (!start && !end)
+        return false;
+    if (start && codeLocationComparator(location, start) < 0)
+        return false;
+    return !(end && codeLocationComparator(location, end) >= 0);
+}
+/**
+ * Regex possibilities to parse the stack.
+ * The first one to match will be used.
+ */
+const parseOptions = [
+    {
+        // V8 (Chrome/Node) / Chakra (Edge), with source location
+        regex: /^\s*at\s*(.*)\s+\(((?:.+\/)?[^:]*):(\d+)(?::(\d+))?\)/m,
+        sourceGroup: 1,
+        fileGroup: 2,
+        rowGroup: 3,
+        colGroup: 4,
+    },
+    {
+        // V8 (Chrome/Node) / Chakra (Edge), no source location
+        regex: /^\s*at\s*((?:.+\/)?[^:]*):(\d+)(?::(\d+))?/m,
+        sourceGroup: null,
+        fileGroup: 1,
+        rowGroup: 2,
+        colGroup: 3,
+    },
+    {
+        // SpiderMonkey (Firefox) / JavaScriptCore (Safari)
+        regex: /^\s*(.+)?@((?:.+\/)?[^:]*):(\d+)(?::(\d+))?/m,
+        sourceGroup: 1,
+        fileGroup: 2,
+        rowGroup: 3,
+        colGroup: 4,
+    },
+];
+/**
+ * Returns the value of the group by index, or null if the group doesn't exist or the group
+ * index is null. The value will be parsed if it exists.
+ */
+function getOptionalGroup(match, index, parse) {
+    if (index == null)
+        return null;
+    const value = match[index];
+    if (value == null)
+        return null;
+    return parse(value);
+}
+/**
+ * Returns the location of the stack's first line match; the location the error was constructed.
+ *
+ * @param stack
+ */
+export function parseStackLocation(stack) {
+    if (!stack)
+        return null;
+    const noise = stackNoise.value;
+    if (stack.substring(0, noise.length) === noise) {
+        stack = stack.substring(noise.length);
+    }
+    for (const o of parseOptions) {
+        const match = o.regex.exec(stack);
+        if (!match)
+            continue;
+        return {
+            source: getOptionalGroup(match, o.sourceGroup, String),
+            file: match[o.fileGroup],
+            row: parseInt(match[o.rowGroup]),
+            col: getOptionalGroup(match, o.colGroup, parseInt),
+        };
+    }
+    return null;
+}
+/**
+ * Used in comparison with `stackNoiseError2` to determine what leading stack lines should be
+ * trimmed.
+ * @private
+ */
+export const stackNoiseError1 = new Error();
+/**
+ * @private
+ */
+export const stackNoiseError2 = new Error();
+/**
+ * When corejs polyfills Error with clearErrorStack, the stack may begin with the polyfill
+ * location. Trim the beginning of stacks with the leading lines common to all errors.
+ */
+export const stackNoise = lazy(() => {
+    if (!stackNoiseError1.stack)
+        return '';
+    const stack1 = stackNoiseError1.stack.split('\n');
+    const stack2 = stackNoiseError2.stack.split('\n');
+    let noise = '';
+    for (let i = 0; i < Math.min(stack1.length, stack2.length); i++) {
+        if (stack1[i] === stack2[i])
+            noise += stack1[i] + '\n';
+        else
+            break;
+    }
+    return noise;
+});

package/dist/types/current/util/fun/debounce.d.ts

@@ -0,0 +1,12 @@
+import type { Disposable } from '../../core/disposable';
+export type DebounceCallback = Disposable & (() => void);
+/**
+ * Debounce wraps a callback, ensuring it only executes after a certain period of inactivity.
+ *
+ * @param inner The function to execute after a given period of inactivity.
+ * @param duration The number of seconds the returned wrapper function must not be called before the inner function
+ * is invoked.
+ * @return Returns callback wrapper that enforces inactivity. This may be disposed.
+ */
+export declare function debounce(inner: () => void, duration: number): DebounceCallback;
+//# sourceMappingURL=debounce.d.ts.map

package/dist/types/current/util/fun/debounce.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"debounce.d.ts","sourceRoot":"","sources":["../../../../../src/util/fun/debounce.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAInD,MAAM,MAAM,gBAAgB,GAAG,UAAU,GAAG,CAAC,MAAM,IAAI,CAAC,CAAA;AAExD;;;;;;;GAOG;AACH,wBAAgB,QAAQ,CACpB,KAAK,EAAE,MAAM,IAAI,EACjB,QAAQ,EAAE,MAAM,GACjB,gBAAgB,CAelB"}

package/dist/types/current/util/fun/debounce.js

@@ -0,0 +1,28 @@
+/*
+ * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { DisposedError } from '../../core/disposable';
+import { TimeoutSlot } from '../../util/async/TimeoutSlot';
+/**
+ * Debounce wraps a callback, ensuring it only executes after a certain period of inactivity.
+ *
+ * @param inner The function to execute after a given period of inactivity.
+ * @param duration The number of seconds the returned wrapper function must not be called before the inner function
+ * is invoked.
+ * @return Returns callback wrapper that enforces inactivity. This may be disposed.
+ */
+export function debounce(inner, duration) {
+    const timeout = new TimeoutSlot();
+    let disposed = false;
+    return Object.assign(() => {
+        if (disposed)
+            throw new DisposedError();
+        timeout.set(inner, duration);
+    }, {
+        dispose() {
+            disposed = true;
+            timeout.dispose();
+        },
+    });
+}

package/dist/types/current/util/fun/flow.d.ts

@@ -0,0 +1,38 @@
+import type { MaybePromise } from '../type';
+/**
+ * Creates a function that is the composition of the provided functions.
+ * Each function consumes the return value of the function that follows.
+ */
+export declare function flow<A, B>(f1: (a: A) => B): (a: A) => B;
+export declare function flow<A, B, C>(f1: (a: A) => B, f2: (b: B) => C): (a: A) => C;
+export declare function flow<A, B, C, D>(f1: (a: A) => B, f2: (b: B) => C, f3: (c: C) => D): (a: A) => D;
+export declare function flow<A, B, C, D, E>(f1: (a: A) => B, f2: (b: B) => C, f3: (c: C) => D, f4: (d: D) => E): (a: A) => E;
+export declare function flow<A, B, C, D, E, F>(f1: (a: A) => B, f2: (b: B) => C, f3: (c: C) => D, f4: (d: D) => E, f5: (e: E) => F): (a: A) => F;
+/**
+ * Creates a function that is the composition of the provided functions.
+ * Each function consumes the return value of the function that precedes.
+ */
+export declare function flowRight<A, B>(f1: (a: A) => B): (a: A) => B;
+export declare function flowRight<A, B, C>(f1: (b: B) => C, f2: (a: A) => B): (a: A) => C;
+export declare function flowRight<A, B, C, D>(f1: (c: C) => D, f2: (b: B) => C, f3: (a: A) => B): (a: A) => D;
+export declare function flowRight<A, B, C, D, E>(f1: (d: D) => E, f2: (c: C) => D, f3: (b: B) => C, f4: (a: A) => B): (a: A) => E;
+export declare function flowRight<A, B, C, D, E, F>(f1: (e: E) => F, f2: (d: D) => E, f3: (c: C) => D, f4: (b: B) => C, f5: (a: A) => B): (a: A) => F;
+/**
+ * Creates a function that is the composition of the provided async functions.
+ * Each function consumes the return value of the function that follows.
+ */
+export declare function flowAsync<A, B>(f1: (a: A) => MaybePromise<B>): (a: A) => Promise<B>;
+export declare function flowAsync<A, B, C>(f1: (a: A) => MaybePromise<B>, f2: (b: B) => MaybePromise<C>): (a: A) => Promise<C>;
+export declare function flowAsync<A, B, C, D>(f1: (a: A) => MaybePromise<B>, f2: (b: B) => MaybePromise<C>, f3: (c: C) => MaybePromise<D>): (a: A) => Promise<D>;
+export declare function flowAsync<A, B, C, D, E>(f1: (a: A) => MaybePromise<B>, f2: (b: B) => MaybePromise<C>, f3: (c: C) => MaybePromise<D>, f4: (d: D) => MaybePromise<E>): (a: A) => Promise<E>;
+export declare function flowAsync<A, B, C, D, E, F>(f1: (a: A) => MaybePromise<B>, f2: (b: B) => MaybePromise<C>, f3: (c: C) => MaybePromise<D>, f4: (d: D) => MaybePromise<E>, f5: (e: E) => MaybePromise<F>): (a: A) => Promise<F>;
+/**
+ * Creates a function that is the composition of the provided async functions.
+ * Each function consumes the return value of the function that precedes.
+ */
+export declare function flowRightAsync<A, B>(f1: (a: A) => MaybePromise<B>): (a: A) => Promise<B>;
+export declare function flowRightAsync<A, B, C>(f1: (b: B) => MaybePromise<C>, f2: (a: A) => MaybePromise<B>): (a: A) => Promise<C>;
+export declare function flowRightAsync<A, B, C, D>(f1: (c: C) => MaybePromise<D>, f2: (b: B) => MaybePromise<C>, f3: (a: A) => MaybePromise<B>): (a: A) => Promise<D>;
+export declare function flowRightAsync<A, B, C, D, E>(f1: (d: D) => MaybePromise<E>, f2: (c: C) => MaybePromise<D>, f3: (b: B) => MaybePromise<C>, f4: (a: A) => MaybePromise<B>): (a: A) => Promise<E>;
+export declare function flowRightAsync<A, B, C, D, E, F>(f1: (e: E) => MaybePromise<F>, f2: (d: D) => MaybePromise<E>, f3: (c: C) => MaybePromise<D>, f4: (b: B) => MaybePromise<C>, f5: (a: A) => MaybePromise<B>): (a: A) => Promise<F>;
+//# sourceMappingURL=flow.d.ts.map

package/dist/types/current/util/fun/flow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"flow.d.ts","sourceRoot":"","sources":["../../../../../src/util/fun/flow.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AAE3C;;;GAGG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AACxD,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AAC5E,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAC3B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AACd,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAC9B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AACd,wBAAgB,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACjC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AAKd;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AAC7D,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AACd,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAChC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AACd,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACnC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AACd,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACtC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EACf,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAChB,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;AAKd;;;GAGG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAC1B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAChC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACnC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACtC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AAavB;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAC/B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAClC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACrC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACxC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,wBAAgB,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAC3C,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,EAC7B,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,YAAY,CAAC,CAAC,CAAC,GAC9B,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAA"}

package/dist/types/current/util/fun/flow.js

@@ -0,0 +1,28 @@
+/*
+ * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
+ * SPDX-License-Identifier: Apache-2.0
+ */
+export function flow(...fns) {
+    return (arg) => fns.reduce((acc, fn) => fn(acc), arg);
+}
+export function flowRight(...fns) {
+    return (arg) => fns.reduceRight((acc, fn) => fn(acc), arg);
+}
+export function flowAsync(...fns) {
+    return async (arg) => {
+        let result = arg;
+        for (const fn of fns) {
+            result = await fn(result);
+        }
+        return result;
+    };
+}
+export function flowRightAsync(...fns) {
+    return async (arg) => {
+        let result = arg;
+        for (let i = fns.length - 1; i >= 0; i--) {
+            result = await fns[i](result);
+        }
+        return result;
+    };
+}

package/dist/types/current/util/fun/function.d.ts

@@ -0,0 +1,5 @@
+/**
+ * No-op, does nothing.
+ */
+export declare function noop(..._: any[]): void;
+//# sourceMappingURL=function.d.ts.map

package/dist/types/current/util/fun/function.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"function.d.ts","sourceRoot":"","sources":["../../../../../src/util/fun/function.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,wBAAgB,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAG"}

package/dist/types/current/util/fun/function.js

@@ -0,0 +1,8 @@
+/*
+ * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
+ * SPDX-License-Identifier: Apache-2.0
+ */
+/**
+ * No-op, does nothing.
+ */
+export function noop(..._) { }

package/dist/types/current/util/fun/memoize.d.ts

@@ -0,0 +1,24 @@
+import type { Fun } from '../../util/type';
+export interface MemoizedFunction {
+    clear(): void;
+}
+/**
+ * Returns a wrapper function where when called, retains the return value of `inner`, returning that
+ * value on consecutive calls without invoking `inner` again.
+ *
+ * @param inner The function to memoize results.
+ * @return Returns a memoized function with a `clear` method to reset the cached value.
+ */
+export declare function memoize<T extends () => any>(inner: T): MemoizedFunction & T;
+/**
+ * Returns a wrapper function where when called, retains the return value of `inner`, returning that
+ * value on consecutive calls without invoking `inner` again.
+ *
+ * @param inner The function to memoize results.
+ * @param keyProvider When more than one parameter is expected, a keyProvider is required, which
+ * returns a unique key given the arguments provided to the memoized function.
+ * @param capacity
+ * @return Returns a memoized function with a `clear` method to reset the cache.
+ */
+export declare function memoize<T extends Fun>(inner: T, keyProvider: (...args: Parameters<T>) => any, capacity?: number): MemoizedFunction & T;
+//# sourceMappingURL=memoize.d.ts.map

package/dist/types/current/util/fun/memoize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoize.d.ts","sourceRoot":"","sources":["../../../../../src/util/fun/memoize.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,aAAa,CAAA;AAEtC,MAAM,WAAW,gBAAgB;IAC7B,KAAK,IAAI,IAAI,CAAA;CAChB;AAED;;;;;;GAMG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,MAAM,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,gBAAgB,GAAG,CAAC,CAAA;AAE5E;;;;;;;;;GASG;AACH,wBAAgB,OAAO,CAAC,CAAC,SAAS,GAAG,EACjC,KAAK,EAAE,CAAC,EACR,WAAW,EAAE,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,GAAG,EAC5C,QAAQ,CAAC,EAAE,MAAM,GAClB,gBAAgB,GAAG,CAAC,CAAA"}

package/dist/types/current/util/fun/memoize.js

@@ -0,0 +1,62 @@
+/*
+ * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { LruCache } from '../../util/collection/LruCache';
+import { getOrSet } from '../../util/map/map';
+export function memoize(inner, keyProvider, capacity = 500) {
+    if (!keyProvider) {
+        let cached = false;
+        let value = undefined;
+        const memoized = () => {
+            if (!cached) {
+                cached = true;
+                value = inner();
+            }
+            return value;
+        };
+        return Object.assign(memoized, {
+            clear: () => {
+                cached = false;
+                value = undefined;
+            },
+        });
+    }
+    else if (capacity === 0) {
+        const memoized = (...args) => inner(...args);
+        return Object.assign(memoized, {
+            clear: () => { },
+        });
+    }
+    else if (capacity === 1) {
+        let hasValue = false;
+        let cachedKey;
+        let cachedValue;
+        const memoized = (...args) => {
+            const key = keyProvider(...args);
+            if (!hasValue || cachedKey !== key) {
+                hasValue = true;
+                cachedKey = key;
+                cachedValue = inner(...args);
+            }
+            return cachedValue;
+        };
+        return Object.assign(memoized, {
+            clear: () => {
+                hasValue = false;
+            },
+        });
+    }
+    else {
+        const cache = new LruCache(capacity);
+        const memoized = (...args) => {
+            const key = keyProvider(...args);
+            return getOrSet(cache, key, () => inner(...args));
+        };
+        return Object.assign(memoized, {
+            clear: () => {
+                cache.clear();
+            },
+        });
+    }
+}

package/dist/types/current/util/fun/throttle.d.ts

@@ -0,0 +1,34 @@
+import type { Disposable } from '../../core/disposable';
+export interface ThrottleOptions {
+    /**
+     * If true, the first invocation of a throttled function will pass through.
+     */
+    readonly leading: boolean;
+    /**
+     * If true, when the throttle window time has elapsed, the function will be invoked.
+     * Either leading or trailing must be true.
+     * When trailing is true, timers will be used
+     */
+    readonly trailing: boolean;
+}
+export interface ThrottledCallback extends Disposable {
+    (): void;
+    /**
+     * Resets the throttle timer.
+     * If an inner call is pending, it will be immediately invoked.
+     */
+    reset(): void;
+}
+/**
+ * Throttle returns a function that limits the rate of invocations.
+ *
+ * @param inner The function to invoke at a throttled rate.
+ * @param duration The interval (in seconds) for which the throttled function will be limited.
+ * @param options Options for which ends of the window the function should be invoked. If omitted,
+ * leading and trailing will be true.
+ * @return Returns a method that, when invoked, will invoke the inner method at a throttled rate.
+ * The returned method will have a `dispose` handle to clear any active timers and prevent
+ * further invocation.
+ */
+export declare function throttle(inner: () => void, duration: number, options?: Partial<ThrottleOptions>): ThrottledCallback;
+//# sourceMappingURL=throttle.d.ts.map

package/dist/types/current/util/fun/throttle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"throttle.d.ts","sourceRoot":"","sources":["../../../../../src/util/fun/throttle.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAKnD,MAAM,WAAW,eAAe;IAC5B;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAA;IAEzB;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAA;CAC7B;AAED,MAAM,WAAW,iBAAkB,SAAQ,UAAU;IACjD,IAAI,IAAI,CAAA;IAER;;;OAGG;IACH,KAAK,IAAI,IAAI,CAAA;CAChB;AAOD;;;;;;;;;;GAUG;AACH,wBAAgB,QAAQ,CACpB,KAAK,EAAE,MAAM,IAAI,EACjB,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE,OAAO,CAAC,eAAe,CAA0B,GAC3D,iBAAiB,CAoDnB"}

package/dist/types/current/util/fun/throttle.js

@@ -0,0 +1,66 @@
+/*
+ * Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
+ * SPDX-License-Identifier: Apache-2.0
+ */
+import { DisposedError } from '../../core/disposable';
+import { IllegalArgumentError } from '../../error/IllegalArgumentError';
+import { TimeoutSlot } from '../../util/async/TimeoutSlot';
+const defaultThrottleOptions = {
+    leading: true,
+    trailing: true,
+};
+/**
+ * Throttle returns a function that limits the rate of invocations.
+ *
+ * @param inner The function to invoke at a throttled rate.
+ * @param duration The interval (in seconds) for which the throttled function will be limited.
+ * @param options Options for which ends of the window the function should be invoked. If omitted,
+ * leading and trailing will be true.
+ * @return Returns a method that, when invoked, will invoke the inner method at a throttled rate.
+ * The returned method will have a `dispose` handle to clear any active timers and prevent
+ * further invocation.
+ */
+export function throttle(inner, duration, options = defaultThrottleOptions) {
+    options = {
+        leading: false,
+        trailing: false,
+        ...options,
+    };
+    if (!options.leading && !options.trailing)
+        throw new IllegalArgumentError('One of leading or trailing must be true.');
+    // The last timestamp the inner method was invoked.
+    let lastTime = Number.NEGATIVE_INFINITY;
+    const timeout = new TimeoutSlot();
+    let disposed = false;
+    return Object.assign(() => {
+        if (disposed)
+            throw new DisposedError();
+        const now = Date.now() / 1000;
+        const pastDuration = now - lastTime >= duration;
+        if (pastDuration) {
+            lastTime = now;
+            if (options.leading)
+                inner();
+        }
+        if (!timeout.active &&
+            options.trailing &&
+            !(pastDuration && options.leading)) {
+            timeout.set(() => {
+                lastTime = Date.now() / 1000;
+                inner();
+            }, duration - now + lastTime);
+        }
+    }, {
+        reset() {
+            lastTime = Number.NEGATIVE_INFINITY;
+            if (timeout.active) {
+                timeout.clear();
+                inner();
+            }
+        },
+        dispose() {
+            disposed = true;
+            timeout.dispose();
+        },
+    });
+}

package/dist/types/current/util/iteration/iterable.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Returns an array of numbers between start and end, incrementing by step.
+ *
+ * E.g.
+ * ```
+ * range(1, 10) // [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+ * range(5, 2) // [5, 4, 3, 2]
+ * range(5, 4, -0.2) // [5.0, 4.8, 4.6, 4.4, 4.2, 4.0]
+ * ```
+ * @param start Start position (inclusive)
+ * @param endInclusive End position (inclusive)
+ * @param step The amount to increment.
+ */
+export declare function createRangeIter(start: number, endInclusive: number, step?: number): IterableIterator<number>;
+/**
+ * Maps an iterable object using the given transform.
+ * Unlike `Array#map`, this doesn't create a new Array in memory, the transform is done on
+ * iteration.
+ *
+ * @param iterable
+ * @param transform Transforms each element as it's requested.
+ */
+export declare function mapIter<T, U>(iterable: Iterable<T>, transform: (element: T) => U): IterableIterator<U>;
+export declare function filterIter<T, S extends T>(iterable: Iterable<T>, predicate: (value: T) => value is S): IterableIterator<S>;
+export declare function filterIter<T>(iterable: Iterable<T>, predicate: (value: T) => boolean): IterableIterator<T>;
+//# sourceMappingURL=iterable.d.ts.map

package/dist/types/current/util/iteration/iterable.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"iterable.d.ts","sourceRoot":"","sources":["../../../../../src/util/iteration/iterable.ts"],"names":[],"mappings":"AAOA;;;;;;;;;;;;GAYG;AACH,wBAAgB,eAAe,CAC3B,KAAK,EAAE,MAAM,EACb,YAAY,EAAE,MAAM,EACpB,IAAI,SAAI,GACT,gBAAgB,CAAC,MAAM,CAAC,CAuB1B;AAED;;;;;;;GAOG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,CAAC,EACxB,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,SAAS,EAAE,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,GAC7B,gBAAgB,CAAC,CAAC,CAAC,CAerB;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,EACrC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,GACpC,gBAAgB,CAAC,CAAC,CAAC,CAAA;AAEtB,wBAAgB,UAAU,CAAC,CAAC,EACxB,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EACrB,SAAS,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,OAAO,GACjC,gBAAgB,CAAC,CAAC,CAAC,CAAA"}