@bitbeater/ecma-utils 2.7.0

package/README.md

@@ -0,0 +1,23 @@
+# ecma-utils
+
+[See Documentation](https://bitbeater.github.io/)
+
+Simple, lightweight, dependenciesless, TypeScript generic helper library.
+
+---
+Compatible with:
+- Node.js
+- Deno
+- Browser
+
+## Installation
+
+npm
+```bash
+npm i @bitBeater/ecma-utils
+```
+
+deno
+```bash
+deno install npm:@bitBeater/ecma-utils
+```

package/dist/bytes.d.ts

@@ -0,0 +1,65 @@
+/**
+ * one chilo byte as bytes.
+ *
+ * ```
+ * 2 ** 10
+ * ```
+ * */
+export declare const kB: number;
+/**
+ * one mega byte as bytes.
+ *
+ * ```
+ * 2 ** 20
+ * ```
+ * */
+export declare const MB: number;
+/**
+ * one giga byte as bytes.
+ *
+ * ```
+ * 2 ** 30
+ * ```
+ * */
+export declare const GB: number;
+/**
+ * one tera byte as bytes.
+ *
+ * ```
+ * 2 ** 40
+ * ```
+ * */
+export declare const TB: number;
+/**
+ * one peta byte as bytes.
+ *
+ * ```
+ * 2 ** 50
+ * ```
+ * */
+export declare const PB: number;
+/**
+ * one exa byte as bytes.
+ *
+ * ```
+ * 2 ** 60
+ * ```
+ * */
+export declare const EB: number;
+/**
+ * one zetta byte as bytes.
+ *
+ * ```
+ * 2 ** 70
+ * ```
+ * */
+export declare const ZB: number;
+/**
+ * one yotta byte as bytes.
+ *
+ * ```
+ * 2 ** 80
+ * ```
+ * */
+export declare const YB: number;
+//# sourceMappingURL=bytes.d.ts.map

package/dist/bytes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes.d.ts","sourceRoot":"","sources":["../src/bytes.ts"],"names":[],"mappings":"AAAA;;;;;;KAMK;AACL,eAAO,MAAM,EAAE,QAAU,CAAC;AAE1B;;;;;;KAMK;AACL,eAAO,MAAM,EAAE,QAAU,CAAC;AAE1B;;;;;;KAMK;AACL,eAAO,MAAM,EAAE,QAAU,CAAC;AAE1B;;;;;;KAMK;AACL,eAAO,MAAM,EAAE,QAAU,CAAC;AAE1B;;;;;;KAMK;AACL,eAAO,MAAM,EAAE,QAAU,CAAC;AAE1B;;;;;;KAMK;AACL,eAAO,MAAM,EAAE,QAAU,CAAC;AAE1B;;;;;;KAMK;AACL,eAAO,MAAM,EAAE,QAAU,CAAC;AAE1B;;;;;;KAMK;AACL,eAAO,MAAM,EAAE,QAAU,CAAC"}

package/dist/bytes.js

@@ -0,0 +1,68 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.YB = exports.ZB = exports.EB = exports.PB = exports.TB = exports.GB = exports.MB = exports.kB = void 0;
+/**
+ * one chilo byte as bytes.
+ *
+ * ```
+ * 2 ** 10
+ * ```
+ * */
+exports.kB = 2 ** 10;
+/**
+ * one mega byte as bytes.
+ *
+ * ```
+ * 2 ** 20
+ * ```
+ * */
+exports.MB = 2 ** 20;
+/**
+ * one giga byte as bytes.
+ *
+ * ```
+ * 2 ** 30
+ * ```
+ * */
+exports.GB = 2 ** 30;
+/**
+ * one tera byte as bytes.
+ *
+ * ```
+ * 2 ** 40
+ * ```
+ * */
+exports.TB = 2 ** 40;
+/**
+ * one peta byte as bytes.
+ *
+ * ```
+ * 2 ** 50
+ * ```
+ * */
+exports.PB = 2 ** 50;
+/**
+ * one exa byte as bytes.
+ *
+ * ```
+ * 2 ** 60
+ * ```
+ * */
+exports.EB = 2 ** 60;
+/**
+ * one zetta byte as bytes.
+ *
+ * ```
+ * 2 ** 70
+ * ```
+ * */
+exports.ZB = 2 ** 70;
+/**
+ * one yotta byte as bytes.
+ *
+ * ```
+ * 2 ** 80
+ * ```
+ * */
+exports.YB = 2 ** 80;
+//# sourceMappingURL=bytes.js.map

package/dist/bytes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bytes.js","sourceRoot":"","sources":["../src/bytes.ts"],"names":[],"mappings":";;;AAAA;;;;;;KAMK;AACQ,QAAA,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAE1B;;;;;;KAMK;AACQ,QAAA,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAE1B;;;;;;KAMK;AACQ,QAAA,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAE1B;;;;;;KAMK;AACQ,QAAA,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAE1B;;;;;;KAMK;AACQ,QAAA,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAE1B;;;;;;KAMK;AACQ,QAAA,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAE1B;;;;;;KAMK;AACQ,QAAA,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC;AAE1B;;;;;;KAMK;AACQ,QAAA,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC"}

package/dist/collection/CircularArray.d.ts

@@ -0,0 +1,98 @@
+/**
+ * A circular array implementation that allows for wrapping around the ends.
+ * @example
+ * ```ts
+ * import { collection } from 'iggs-utils';
+ *
+ * const circularArray = new collection.CircularArray<string>(monday, tuesday, wednesday, thursday, friday, saturday, sunday);
+ *
+ * // accessing elements by position
+ * circularArray.get()   // monday
+ * circularArray.get(0)  // monday
+ * circularArray.get(1)  // tuesday
+ * circularArray.get(2)  // wednesday
+ * circularArray.get(-1) // sunday
+ * circularArray.get(7)  // monday
+ * circularArray.get(-7) // monday
+ *
+ * // navigating the circular array
+ * circularArray.next()       // tuesday
+ * circularArray.next()       // wednesday
+ * circularArray.next()       // thursday
+ * circularArray.next(10)     // sunday
+ * circularArray.get()        // sunday
+ * circularArray.previous()   // saturday
+ * circularArray.previous()   // friday
+ * circularArray.previous()   // thursday
+ * circularArray.previous(10) // monday
+ * circularArray.get()        // monday
+ *
+ * // working with positions
+ * circularArray.setIndex(2)     // wednesday
+ * circularArray.setPosition(10) // thursday
+ * circularArray.getIndex()      // 3
+ * circularArray.getPosition()   // 10
+ * ```
+ */
+export declare class CircularArray<T> {
+    private array;
+    private currentIndex;
+    private currentPosition;
+    constructor(...items: T[]);
+    /**
+     * Moves the current position forward by the specified number of steps (1 by default).
+     * @param steps The number of steps to move forward (default is 1).
+     * @returns The value at the new current position.
+     */
+    next(steps?: number): T;
+    /**
+     * Moves the current position backward by the specified number of steps (1 by default).
+     * @param steps The number of steps to move backward (default is 1).
+     * @returns The value at the new current position.
+     */
+    previous(steps?: number): T;
+    /**
+     * Returns the element at the specified position in the circular array.
+     * @param position The position to peek at (defaults to the current position).
+     * @returns The value at the specified position.
+     */
+    get(position?: number): T;
+    /**
+     * Returns the current index in the circular array.
+     * @returns The current index.
+     */
+    getIndex(): number;
+    /**
+     * Returns the current index in the circular array.
+     * @returns The current index.
+     */
+    getPosition(): number;
+    /**
+     * Returns the size of the circular array.
+     * @returns The size of the circular array.
+     */
+    getSize(): number;
+    /**
+     * Returns a shallow copy of the circular array as a regular array.
+     * @returns A regular array containing the elements of the circular array.
+     */
+    toArray(): T[];
+    /**
+     * Set the current position in the circular array.
+     * @param position The position to set.
+     */
+    setPosition(position: number): T;
+    /**
+     * Set the current index in the circular array.
+     * Also updates the current position at the index value.
+     * @param index The index to set.
+     */
+    setIndex(index: number): T;
+    /**
+     * it converts a given position to a valid index within the array bounds.
+     * @param position can be negative or greater than the array length
+     * @returns a valid index within the array bounds
+     */
+    private positionToIndex;
+}
+//# sourceMappingURL=CircularArray.d.ts.map

package/dist/collection/CircularArray.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CircularArray.d.ts","sourceRoot":"","sources":["../../src/collection/CircularArray.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,qBAAa,aAAa,CAAC,CAAC;IAC3B,OAAO,CAAC,KAAK,CAAM;IAEnB,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,eAAe,CAAK;gBAEhB,GAAG,KAAK,EAAE,CAAC,EAAE;IAIzB;;;;OAIG;IACH,IAAI,CAAC,KAAK,GAAE,MAAU,GAAG,CAAC;IAM1B;;;;OAIG;IACH,QAAQ,CAAC,KAAK,GAAE,MAAU,GAAG,CAAC;IAM9B;;;;OAIG;IACH,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,GAAG,CAAC;IAKzB;;;OAGG;IACH,QAAQ,IAAI,MAAM;IAIlB;;;OAGG;IACH,WAAW,IAAI,MAAM;IAIrB;;;OAGG;IACH,OAAO,IAAI,MAAM;IAIjB;;;OAGG;IACH,OAAO,IAAI,CAAC,EAAE;IAId;;;OAGG;IACH,WAAW,CAAC,QAAQ,EAAE,MAAM,GAAG,CAAC;IAMhC;;;;OAIG;IACH,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,CAAC;IAO1B;;;;OAIG;IACH,OAAO,CAAC,eAAe;CAGvB"}

package/dist/collection/CircularArray.js

@@ -0,0 +1,134 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.CircularArray = void 0;
+/**
+ * A circular array implementation that allows for wrapping around the ends.
+ * @example
+ * ```ts
+ * import { collection } from 'iggs-utils';
+ *
+ * const circularArray = new collection.CircularArray<string>(monday, tuesday, wednesday, thursday, friday, saturday, sunday);
+ *
+ * // accessing elements by position
+ * circularArray.get()   // monday
+ * circularArray.get(0)  // monday
+ * circularArray.get(1)  // tuesday
+ * circularArray.get(2)  // wednesday
+ * circularArray.get(-1) // sunday
+ * circularArray.get(7)  // monday
+ * circularArray.get(-7) // monday
+ *
+ * // navigating the circular array
+ * circularArray.next()       // tuesday
+ * circularArray.next()       // wednesday
+ * circularArray.next()       // thursday
+ * circularArray.next(10)     // sunday
+ * circularArray.get()        // sunday
+ * circularArray.previous()   // saturday
+ * circularArray.previous()   // friday
+ * circularArray.previous()   // thursday
+ * circularArray.previous(10) // monday
+ * circularArray.get()        // monday
+ *
+ * // working with positions
+ * circularArray.setIndex(2)     // wednesday
+ * circularArray.setPosition(10) // thursday
+ * circularArray.getIndex()      // 3
+ * circularArray.getPosition()   // 10
+ * ```
+ */
+class CircularArray {
+    constructor(...items) {
+        this.currentIndex = 0;
+        this.currentPosition = 0;
+        this.array = items || [];
+    }
+    /**
+     * Moves the current position forward by the specified number of steps (1 by default).
+     * @param steps The number of steps to move forward (default is 1).
+     * @returns The value at the new current position.
+     */
+    next(steps = 1) {
+        this.currentPosition += steps;
+        this.currentIndex = this.positionToIndex(this.currentPosition);
+        return this.get();
+    }
+    /**
+     * Moves the current position backward by the specified number of steps (1 by default).
+     * @param steps The number of steps to move backward (default is 1).
+     * @returns The value at the new current position.
+     */
+    previous(steps = 1) {
+        this.currentPosition -= steps;
+        this.currentIndex = this.positionToIndex(this.currentPosition);
+        return this.get();
+    }
+    /**
+     * Returns the element at the specified position in the circular array.
+     * @param position The position to peek at (defaults to the current position).
+     * @returns The value at the specified position.
+     */
+    get(position) {
+        const index = position !== undefined ? this.positionToIndex(position) : this.currentIndex;
+        return this.array[index];
+    }
+    /**
+     * Returns the current index in the circular array.
+     * @returns The current index.
+     */
+    getIndex() {
+        return this.currentIndex;
+    }
+    /**
+     * Returns the current index in the circular array.
+     * @returns The current index.
+     */
+    getPosition() {
+        return this.currentPosition;
+    }
+    /**
+     * Returns the size of the circular array.
+     * @returns The size of the circular array.
+     */
+    getSize() {
+        return this.array.length;
+    }
+    /**
+     * Returns a shallow copy of the circular array as a regular array.
+     * @returns A regular array containing the elements of the circular array.
+     */
+    toArray() {
+        return this.array.slice();
+    }
+    /**
+     * Set the current position in the circular array.
+     * @param position The position to set.
+     */
+    setPosition(position) {
+        this.currentPosition = position;
+        this.currentIndex = this.positionToIndex(position);
+        return this.get();
+    }
+    /**
+     * Set the current index in the circular array.
+     * Also updates the current position at the index value.
+     * @param index The index to set.
+     */
+    setIndex(index) {
+        if (index < 0 || index >= this.array.length)
+            throw new Error(`CircularArray.setIndex(): Index out of bounds: ${index}. Accepted range is 0 to ${this.array.length - 1}`);
+        this.currentIndex = index;
+        this.currentPosition = index;
+        return this.get();
+    }
+    /**
+     * it converts a given position to a valid index within the array bounds.
+     * @param position can be negative or greater than the array length
+     * @returns a valid index within the array bounds
+     */
+    positionToIndex(position) {
+        return ((position % this.array.length) + this.array.length) % this.array.length;
+    }
+}
+exports.CircularArray = CircularArray;
+//# sourceMappingURL=CircularArray.js.map

package/dist/collection/CircularArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CircularArray.js","sourceRoot":"","sources":["../../src/collection/CircularArray.ts"],"names":[],"mappings":";;;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,MAAa,aAAa;IAMzB,YAAY,GAAG,KAAU;QAHjB,iBAAY,GAAG,CAAC,CAAC;QACjB,oBAAe,GAAG,CAAC,CAAC;QAG3B,IAAI,CAAC,KAAK,GAAG,KAAK,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,QAAgB,CAAC;QACrB,IAAI,CAAC,eAAe,IAAI,KAAK,CAAC;QAC9B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,QAAgB,CAAC;QACzB,IAAI,CAAC,eAAe,IAAI,KAAK,CAAC;QAC9B,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,QAAiB;QACpB,MAAM,KAAK,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;QAC1F,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,QAAQ;QACP,OAAO,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,WAAW;QACV,OAAO,IAAI,CAAC,eAAe,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,OAAO;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,OAAO;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,QAAgB;QAC3B,IAAI,CAAC,eAAe,GAAG,QAAQ,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACH,QAAQ,CAAC,KAAa;QACrB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,kDAAkD,KAAK,4BAA4B,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;QACzK,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;QAC1B,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC;QAC7B,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACK,eAAe,CAAC,QAAgB;QACvC,OAAO,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IACjF,CAAC;CACD;AAxGD,sCAwGC"}

package/dist/collection/EvictingDequeue.d.ts

@@ -0,0 +1,22 @@
+/**
+ * A non-blocking de-queue which automatically evicts elements from queue when attempting to add new elements onto the queue and it is full
+ *
+ * @example
+ * ```js
+ * const maxSize=3;
+ * const evictingDequeue = new EvictingDequeue<number>(maxSize,[1,2,3]);
+ *
+ *	evictingDequeue;            // [1,2,3]
+ *	evictingDequeue.push(4);    // [2,3,4]
+ *	evictingDequeue.unshift(5); // [5,2,3]
+ *
+ * ```
+ */
+export declare class EvictingDequeue<T> extends Array<T> {
+    #private;
+    constructor(maxLenght: number, items?: T[]);
+    push(...item: T[]): number;
+    unshift(...item: T[]): number;
+    get maxLenght(): number;
+}
+//# sourceMappingURL=EvictingDequeue.d.ts.map

package/dist/collection/EvictingDequeue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EvictingDequeue.d.ts","sourceRoot":"","sources":["../../src/collection/EvictingDequeue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AACH,qBAAa,eAAe,CAAC,CAAC,CAAE,SAAQ,KAAK,CAAC,CAAC,CAAC;;gBAEnC,SAAS,EAAE,MAAM,EAAE,KAAK,GAAE,CAAC,EAAO;IAM9C,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;IAQjB,OAAO,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;IAQpB,IAAI,SAAS,WAEZ;CACD"}

package/dist/collection/EvictingDequeue.js

@@ -0,0 +1,57 @@
+"use strict";
+var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {
+    if (kind === "m") throw new TypeError("Private method is not writable");
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
+    return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
+};
+var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+};
+var _EvictingDequeue_maxLenght;
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EvictingDequeue = void 0;
+/**
+ * A non-blocking de-queue which automatically evicts elements from queue when attempting to add new elements onto the queue and it is full
+ *
+ * @example
+ * ```js
+ * const maxSize=3;
+ * const evictingDequeue = new EvictingDequeue<number>(maxSize,[1,2,3]);
+ *
+ *	evictingDequeue;            // [1,2,3]
+ *	evictingDequeue.push(4);    // [2,3,4]
+ *	evictingDequeue.unshift(5); // [5,2,3]
+ *
+ * ```
+ */
+class EvictingDequeue extends Array {
+    constructor(maxLenght, items = []) {
+        super();
+        _EvictingDequeue_maxLenght.set(this, void 0);
+        __classPrivateFieldSet(this, _EvictingDequeue_maxLenght, maxLenght, "f");
+        this.push(...items);
+    }
+    push(...item) {
+        super.push(...item);
+        let overflow = this.length - __classPrivateFieldGet(this, _EvictingDequeue_maxLenght, "f");
+        for (; overflow > 0; overflow--)
+            this.shift();
+        return this.length;
+    }
+    unshift(...item) {
+        super.unshift(...item);
+        let overflow = this.length - __classPrivateFieldGet(this, _EvictingDequeue_maxLenght, "f");
+        for (; overflow > 0; overflow--)
+            this.pop();
+        return this.length;
+    }
+    get maxLenght() {
+        return __classPrivateFieldGet(this, _EvictingDequeue_maxLenght, "f");
+    }
+}
+exports.EvictingDequeue = EvictingDequeue;
+_EvictingDequeue_maxLenght = new WeakMap();
+//# sourceMappingURL=EvictingDequeue.js.map

package/dist/collection/EvictingDequeue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EvictingDequeue.js","sourceRoot":"","sources":["../../src/collection/EvictingDequeue.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;AAAA;;;;;;;;;;;;;GAaG;AACH,MAAa,eAAmB,SAAQ,KAAQ;IAE/C,YAAY,SAAiB,EAAE,QAAa,EAAE;QAC7C,KAAK,EAAE,CAAC;QAFA,6CAAmB;QAG3B,uBAAA,IAAI,8BAAc,SAAS,MAAA,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,IAAI,CAAC,GAAG,IAAS;QAChB,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC;QACpB,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,uBAAA,IAAI,kCAAW,CAAC;QAC7C,OAAO,QAAQ,GAAG,CAAC,EAAE,QAAQ,EAAE;YAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAE9C,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,GAAG,IAAS;QACnB,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC;QACvB,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,GAAG,uBAAA,IAAI,kCAAW,CAAC;QAC7C,OAAO,QAAQ,GAAG,CAAC,EAAE,QAAQ,EAAE;YAAE,IAAI,CAAC,GAAG,EAAE,CAAC;QAE5C,OAAO,IAAI,CAAC,MAAM,CAAC;IACpB,CAAC;IAED,IAAI,SAAS;QACZ,OAAO,uBAAA,IAAI,kCAAW,CAAC;IACxB,CAAC;CACD;AA3BD,0CA2BC"}

package/dist/collection/collection.d.ts

@@ -0,0 +1,4 @@
+export { CircularArray } from './CircularArray';
+export { EvictingDequeue } from './EvictingDequeue';
+export * from './collectionOperations';
+//# sourceMappingURL=collection.d.ts.map

package/dist/collection/collection.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collection.d.ts","sourceRoot":"","sources":["../../src/collection/collection.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,cAAc,wBAAwB,CAAC"}

package/dist/collection/collection.js

@@ -0,0 +1,23 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EvictingDequeue = exports.CircularArray = void 0;
+var CircularArray_1 = require("./CircularArray");
+Object.defineProperty(exports, "CircularArray", { enumerable: true, get: function () { return CircularArray_1.CircularArray; } });
+var EvictingDequeue_1 = require("./EvictingDequeue");
+Object.defineProperty(exports, "EvictingDequeue", { enumerable: true, get: function () { return EvictingDequeue_1.EvictingDequeue; } });
+__exportStar(require("./collectionOperations"), exports);
+//# sourceMappingURL=collection.js.map

package/dist/collection/collection.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collection.js","sourceRoot":"","sources":["../../src/collection/collection.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;AAAA,iDAAgD;AAAvC,8GAAA,aAAa,OAAA;AACtB,qDAAoD;AAA3C,kHAAA,eAAe,OAAA;AACxB,yDAAuC"}

package/dist/collection/collectionOperations.d.ts

@@ -0,0 +1,125 @@
+/**
+ *
+ * Compute the element-wise absolute differences between two arrays of numbers.
+ * @example
+ * ```ts
+ *  arrayDifferences([1,2,3],[3,2,1]); // [2,0,2]
+ * ```
+ * @param a1 array to compare
+ * @param a2 array to compare
+ * @returns return the array difference a1-a2
+ */
+export declare function arrayDifferences(a1?: number[], a2?: number[]): number[];
+/**
+ * executes the provided function fn once for each pair of consecutive elements of the provided array.
+ *
+ * @example
+ * ```ts
+ * const array=[1,2,3,4];
+ *
+ * forEachConsPairs(array,console.log);
+ *
+ * // prints
+ * // 1 2
+ * // 2 3
+ * // 3 4
+ * ```
+ *
+ */
+export declare function forEachConsPairs<T>(array: T[], fn: (item1: T, item2: T) => void): void;
+/**
+ * check if the givven array is sorted or not.
+ *
+ * @example check array of numbers
+ * ```ts
+ *  isSorted([1,2,3])	//true
+ *  isSorted([1,3,2])	//false
+ * ```
+ *
+ *  @example check array of strings
+ *```ts
+ *  isSorted(['a','b','c'])	//true
+ *  isSorted(['a','c','b'])	//false
+ * ```
+ *
+ *   @example check array of objects, with compareFn
+ * ```ts
+ *  isSorted([{ x:1}, { x:2}, { x:3}], (o1,o2)=> o1.x-o2.x) // true
+ *  isSorted([{ x:1}, { x:3}, { x:2}], (o1,o2)=> o1.x-o2.x) // false
+ * ```
+ *
+ * @param array array to check if is sorted
+ * @param compareFn function to use for comparison operation
+ */
+export declare function isSorted<T>(array: T[], compareFn?: (item1: T, item2: T) => number): boolean;
+/**
+ * get the last element of an aray.
+ *
+ * @example simply does:
+ * ```ts
+ *  array[array.length - 1];
+ * ```
+ */
+export declare function lastEl<T>(array: T[]): T;
+/**
+ *
+ * like {@link https://lodash.com/docs/4.17.15#takeRight lodash's takeRight}, but also with offset.
+ *
+ *
+ *
+ *
+ ** * *
+ * simply does
+ * ```ts
+ * array?.slice(array.length - n - offset , array.length - offset);
+ * ```
+ * * * *
+ *
+ *
+ * @example
+ * ```ts
+ *	takeRight([0, 1, 2, 3])			//=> [3]
+ *	takeRight([0, 1, 2, 3], 2)		 //=> [2, 3]
+ *	takeRight([0, 1, 2, 3], 2, 1)	  //=> [1, 2]
+ * ```
+ *
+ * @param array The array to query.
+ * @param n The number of elements to take.
+ * @param offset The offset to apply for elements to take.
+ * @returns Returns the slice of array.
+ */
+export declare function takeRight<T>(array: T[], n?: number, offset?: number): T[];
+/**
+ *
+ * Returns a random element from the provided array.
+ *
+ * @param array
+ * @returns a random element from the provided array.
+ */
+export declare function pickRandomElement<T>(array: T[]): T;
+/** *
+ * Returns an array of random elements from the provided array.
+ *
+ * @param array
+ * @param legth number of elements to pick
+ * @returns an array of random elements from the provided array.
+ */
+export declare function pickRandomElements<T>(array: T[], legth: number): T[];
+/**
+ * Returns a random element from the provided array,
+ * and **removes** the element from the array.
+ *
+ * @param array
+ * @returns a random element from the provided array.
+ */
+export declare function takeRandomElement<T>(array: T[]): T;
+/** *
+ * Returns an array of random elements from the provided array,
+ * and **removes** the elements from the array.
+ *
+ * @param array
+ * @param legth number of elements to pick
+ * @returns an array of random elements from the provided array.
+ */
+export declare function takeRandomElements<T>(array: T[], legth: number): T[];
+//# sourceMappingURL=collectionOperations.d.ts.map

package/dist/collection/collectionOperations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collectionOperations.d.ts","sourceRoot":"","sources":["../../src/collection/collectionOperations.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAAC,EAAE,GAAE,MAAM,EAAO,EAAE,EAAE,GAAE,MAAM,EAAO,GAAG,MAAM,EAAE,CAM/E;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,QAS/E;AAED;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,SAAS,GAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAA4B,GAAG,OAAO,CAWhH;AAUD;;;;;;;GAOG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAEvC;AAkBD;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,SAAI,EAAE,MAAM,SAAI,GAAG,CAAC,EAAE,CAE/D;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAElD;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAEpE;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,CAElD;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAEpE"}