@waku/sds 0.0.6-ced989a.0 → 0.0.6-e1212cc.0

package/dist/message_channel/sorted_array_base.d.ts

@@ -1,50 +0,0 @@
-type SortedArrayInterface<T> = Omit<Array<T>, "reverse" | "sort">;
-/**
- * Base class that implements a sorted array interface.
- * Automatically maintains sort order after any mutating operation.
- */
-export declare abstract class SortedArrayBase<T> implements SortedArrayInterface<T> {
-    protected readonly items: Array<T>;
-    private previousLength;
-    constructor();
-    [n: number]: T;
-    get length(): number;
-    private updateIndexedProperties;
-    toString(): string;
-    toLocaleString(): string;
-    pop(): T | undefined;
-    push(...items: T[]): number;
-    concat(...items: ConcatArray<T>[]): T[];
-    concat(...items: (T | ConcatArray<T>)[]): T[];
-    join(separator?: string): string;
-    shift(): T | undefined;
-    slice(start?: number, end?: number): T[];
-    splice(start: number, deleteCount?: number, ...items: T[]): T[];
-    unshift(...items: T[]): number;
-    indexOf(searchElement: T, fromIndex?: number): number;
-    lastIndexOf(searchElement: T, fromIndex?: number): number;
-    every<S extends T>(predicate: (value: T, index: number, array: T[]) => value is S, thisArg?: any): this is S[];
-    some(predicate: (value: T, index: number, array: T[]) => unknown, thisArg?: any): boolean;
-    forEach(callbackfn: (value: T, index: number, array: T[]) => void, thisArg?: any): void;
-    map<U>(callbackfn: (value: T, index: number, array: T[]) => U, thisArg?: any): U[];
-    filter<S extends T>(predicate: (value: T, index: number, array: T[]) => value is S, thisArg?: any): S[];
-    reduce<U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: number, array: T[]) => U, initialValue?: U): U;
-    reduceRight<U>(callbackfn: (previousValue: U, currentValue: T, currentIndex: number, array: T[]) => U, initialValue?: U): U;
-    find<S extends T>(predicate: (this: void, value: T, index: number, obj: T[]) => value is S, thisArg?: any): S | undefined;
-    findIndex(predicate: (value: T, index: number, obj: T[]) => unknown, thisArg?: any): number;
-    fill(value: T, start?: number, end?: number): T[];
-    copyWithin(target: number, start: number, end?: number): T[];
-    entries(): ArrayIterator<[number, T]>;
-    keys(): ArrayIterator<number>;
-    values(): ArrayIterator<T>;
-    includes(searchElement: T, fromIndex?: number): boolean;
-    flatMap<U, This = undefined>(callback: (this: This, value: T, index: number, array: T[]) => U | readonly U[], thisArg?: This | undefined): U[];
-    flat<A, D extends number = 1>(this: A, depth?: D | undefined): FlatArray<A, D>[];
-    at(index: number): T | undefined;
-    [Symbol.iterator](): ArrayIterator<T>;
-    readonly [Symbol.unscopables]: any;
-    protected abstract getCompareFn(): (a: T, b: T) => number;
-    protected sort(): void;
-    protected sortArray(array: T[]): T[];
-}
-export {};

package/dist/message_channel/sorted_array_base.js

@@ -1,199 +0,0 @@
-/**
- * Base class that implements a sorted array interface.
- * Automatically maintains sort order after any mutating operation.
- */
-export class SortedArrayBase {
-    items;
-    previousLength = 0;
-    constructor() {
-        this.items = [];
-        this.updateIndexedProperties();
-    }
-    get length() {
-        return this.items.length;
-    }
-    updateIndexedProperties() {
-        // Remove old properties
-        for (let i = this.items.length; i < this.previousLength; i++) {
-            delete this[i];
-        }
-        // Add/update current properties
-        for (let i = 0; i < this.items.length; i++) {
-            this[i] = this.items[i];
-        }
-        this.previousLength = this.items.length;
-    }
-    toString() {
-        return this.items.toString();
-    }
-    toLocaleString() {
-        return this.items.toLocaleString();
-    }
-    pop() {
-        const result = this.items.pop();
-        this.updateIndexedProperties();
-        return result;
-    }
-    push(...items) {
-        // Filter out duplicates both from existing items and within the new items
-        const uniqueItems = [];
-        for (const item of items) {
-            if (!this.items.includes(item) && !uniqueItems.includes(item)) {
-                uniqueItems.push(item);
-            }
-        }
-        this.items.push(...uniqueItems);
-        this.sort();
-        this.updateIndexedProperties();
-        return this.items.length;
-    }
-    concat(...items) {
-        const result = this.items.concat(...items);
-        return this.sortArray(result);
-    }
-    join(separator) {
-        return this.items.join(separator);
-    }
-    shift() {
-        const result = this.items.shift();
-        this.updateIndexedProperties();
-        return result;
-    }
-    slice(start, end) {
-        return this.items.slice(start, end);
-    }
-    splice(start, deleteCount, ...items) {
-        // First perform the deletion
-        const result = this.items.splice(start, deleteCount || 0);
-        // Then add unique items
-        const uniqueItems = [];
-        for (const item of items) {
-            if (!this.items.includes(item) && !uniqueItems.includes(item)) {
-                uniqueItems.push(item);
-            }
-        }
-        this.items.push(...uniqueItems);
-        this.sort();
-        this.updateIndexedProperties();
-        return result;
-    }
-    unshift(...items) {
-        // Filter out duplicates both from existing items and within the new items
-        const uniqueItems = [];
-        for (const item of items) {
-            if (!this.items.includes(item) && !uniqueItems.includes(item)) {
-                uniqueItems.push(item);
-            }
-        }
-        this.items.unshift(...uniqueItems);
-        this.sort();
-        this.updateIndexedProperties();
-        return this.items.length;
-    }
-    indexOf(searchElement, fromIndex) {
-        if (fromIndex === undefined) {
-            return this.items.indexOf(searchElement);
-        }
-        return this.items.indexOf(searchElement, fromIndex);
-    }
-    lastIndexOf(searchElement, fromIndex) {
-        if (fromIndex === undefined) {
-            return this.items.lastIndexOf(searchElement);
-        }
-        return this.items.lastIndexOf(searchElement, fromIndex);
-    }
-    every(predicate, thisArg) {
-        return this.items.every(predicate, thisArg);
-    }
-    some(predicate, thisArg) {
-        return this.items.some(predicate, thisArg);
-    }
-    forEach(callbackfn, thisArg) {
-        this.items.forEach(callbackfn, thisArg);
-    }
-    map(callbackfn, thisArg) {
-        return this.items.map(callbackfn, thisArg);
-    }
-    filter(predicate, thisArg) {
-        return this.items.filter(predicate, thisArg);
-    }
-    reduce(callbackfn, initialValue) {
-        if (arguments.length >= 2) {
-            return this.items.reduce(callbackfn, initialValue);
-        }
-        else {
-            return this.items.reduce(callbackfn);
-        }
-    }
-    reduceRight(callbackfn, initialValue) {
-        if (arguments.length >= 2) {
-            return this.items.reduceRight(callbackfn, initialValue);
-        }
-        else {
-            return this.items.reduceRight(callbackfn);
-        }
-    }
-    find(predicate, thisArg) {
-        return this.items.find(predicate, thisArg);
-    }
-    findIndex(predicate, thisArg) {
-        return this.items.findIndex(predicate, thisArg);
-    }
-    fill(value, start, end) {
-        // Perform the fill operation first
-        this.items.fill(value, start, end);
-        // Then remove duplicates by creating a unique set
-        const uniqueItems = [...new Set(this.items)];
-        this.items.length = 0;
-        this.items.push(...uniqueItems);
-        this.sort();
-        this.updateIndexedProperties();
-        return this.items;
-    }
-    copyWithin(target, start, end) {
-        this.items.copyWithin(target, start, end);
-        this.sort();
-        this.updateIndexedProperties();
-        return this.items;
-    }
-    entries() {
-        return this.items.entries();
-    }
-    keys() {
-        return this.items.keys();
-    }
-    values() {
-        return this.items.values();
-    }
-    includes(searchElement, fromIndex) {
-        return this.items.includes(searchElement, fromIndex);
-    }
-    flatMap(callback, thisArg) {
-        return this.items.flatMap(callback, thisArg);
-    }
-    flat(depth) {
-        return this.items.flat(depth);
-    }
-    at(index) {
-        return this.items.at(index);
-    }
-    [Symbol.iterator]() {
-        return this.items[Symbol.iterator]();
-    }
-    [Symbol.unscopables] = {
-        copyWithin: true,
-        entries: true,
-        fill: true,
-        find: true,
-        findIndex: true,
-        keys: true,
-        values: true
-    };
-    sort() {
-        this.items.sort(this.getCompareFn());
-    }
-    sortArray(array) {
-        return array.sort(this.getCompareFn());
-    }
-}
-//# sourceMappingURL=sorted_array_base.js.map

package/dist/message_channel/sorted_array_base.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sorted_array_base.js","sourceRoot":"","sources":["../../src/message_channel/sorted_array_base.ts"],"names":[],"mappings":"AAEA;;;GAGG;AACH,MAAM,OAAgB,eAAe;IAChB,KAAK,CAAW;IAC3B,cAAc,GAAG,CAAC,CAAC;IAE3B;QACE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,uBAAuB,EAAE,CAAC;IACjC,CAAC;IAID,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAEO,uBAAuB;QAC7B,wBAAwB;QACxB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7D,OAAQ,IAAY,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;QAED,gCAAgC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAY,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC1C,CAAC;IAEM,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC;IAEM,cAAc;QACnB,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;IACrC,CAAC;IAEM,GAAG;QACR,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAChC,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,IAAI,CAAC,GAAG,KAAU;QACvB,0EAA0E;QAC1E,MAAM,WAAW,GAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAIM,MAAM,CAAC,GAAG,KAA6B;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAEM,IAAI,CAAC,SAAkB;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IAEM,KAAK;QACV,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QAClC,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,KAAK,CAAC,KAAc,EAAE,GAAY;QACvC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IACtC,CAAC;IAEM,MAAM,CAAC,KAAa,EAAE,WAAoB,EAAE,GAAG,KAAU;QAC9D,6BAA6B;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,IAAI,CAAC,CAAC,CAAC;QAE1D,wBAAwB;QACxB,MAAM,WAAW,GAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,OAAO,MAAM,CAAC;IAChB,CAAC;IAEM,OAAO,CAAC,GAAG,KAAU;QAC1B,0EAA0E;QAC1E,MAAM,WAAW,GAAQ,EAAE,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9D,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,WAAW,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAEM,OAAO,CAAC,aAAgB,EAAE,SAAkB;QACjD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;QAC3C,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACtD,CAAC;IAEM,WAAW,CAAC,aAAgB,EAAE,SAAkB;QACrD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;QAC/C,CAAC;QACD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IAC1D,CAAC;IAMM,KAAK,CACV,SAA2D,EAC3D,OAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAEM,IAAI,CACT,SAA2D,EAC3D,OAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAEM,OAAO,CACZ,UAAyD,EACzD,OAAa;QAEb,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC1C,CAAC;IAEM,GAAG,CACR,UAAsD,EACtD,OAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAMM,MAAM,CACX,SAA2D,EAC3D,OAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;IAEM,MAAM,CACX,UAKM,EACN,YAAgB;QAEhB,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,EAAE,YAAa,CAAC,CAAC;QACtD,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAiB,CAAiB,CAAC;QAC9D,CAAC;IACH,CAAC;IAEM,WAAW,CAChB,UAKM,EACN,YAAgB;QAEhB,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1B,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAU,EAAE,YAAa,CAAC,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,UAAiB,CAAiB,CAAC;QACnE,CAAC;IACH,CAAC;IAMM,IAAI,CACT,SAAyD,EACzD,OAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IAEM,SAAS,CACd,SAAyD,EACzD,OAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAClD,CAAC;IAEM,IAAI,CAAC,KAAQ,EAAE,KAAc,EAAE,GAAY;QAChD,mCAAmC;QACnC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAEnC,kDAAkD;QAClD,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QAEhC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAEM,UAAU,CAAC,MAAc,EAAE,KAAa,EAAE,GAAY;QAC3D,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAC1C,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC/B,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAEM,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC9B,CAAC;IAEM,IAAI;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAEM,MAAM;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC7B,CAAC;IAEM,QAAQ,CAAC,aAAgB,EAAE,SAAkB;QAClD,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;IACvD,CAAC;IAEM,OAAO,CACZ,QAKqB,EACrB,OAA0B;QAE1B,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;IAEM,IAAI,CAET,KAAqB;QAErB,OAAS,IAAY,CAAC,KAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;IAEM,EAAE,CAAC,KAAa;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACvC,CAAC;IAEe,CAAC,MAAM,CAAC,WAAW,CAAC,GAAQ;QAC1C,UAAU,EAAE,IAAI;QAChB,OAAO,EAAE,IAAI;QACb,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,IAAI;QACV,SAAS,EAAE,IAAI;QACf,IAAI,EAAE,IAAI;QACV,MAAM,EAAE,IAAI;KACb,CAAC;IAIQ,IAAI;QACZ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IACvC,CAAC;IAES,SAAS,CAAC,KAAU;QAC5B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;IACzC,CAAC;CACF"}

package/src/message_channel/sorted_array_base.ts

@@ -1,306 +0,0 @@
-type SortedArrayInterface<T> = Omit<Array<T>, "reverse" | "sort">;
-
-/**
- * Base class that implements a sorted array interface.
- * Automatically maintains sort order after any mutating operation.
- */
-export abstract class SortedArrayBase<T> implements SortedArrayInterface<T> {
-  protected readonly items: Array<T>;
-  private previousLength = 0;
-
-  public constructor() {
-    this.items = [];
-    this.updateIndexedProperties();
-  }
-
-  [n: number]: T;
-
-  public get length(): number {
-    return this.items.length;
-  }
-
-  private updateIndexedProperties(): void {
-    // Remove old properties
-    for (let i = this.items.length; i < this.previousLength; i++) {
-      delete (this as any)[i];
-    }
-
-    // Add/update current properties
-    for (let i = 0; i < this.items.length; i++) {
-      (this as any)[i] = this.items[i];
-    }
-
-    this.previousLength = this.items.length;
-  }
-
-  public toString(): string {
-    return this.items.toString();
-  }
-
-  public toLocaleString(): string {
-    return this.items.toLocaleString();
-  }
-
-  public pop(): T | undefined {
-    const result = this.items.pop();
-    this.updateIndexedProperties();
-    return result;
-  }
-
-  public push(...items: T[]): number {
-    // Filter out duplicates both from existing items and within the new items
-    const uniqueItems: T[] = [];
-    for (const item of items) {
-      if (!this.items.includes(item) && !uniqueItems.includes(item)) {
-        uniqueItems.push(item);
-      }
-    }
-    this.items.push(...uniqueItems);
-    this.sort();
-    this.updateIndexedProperties();
-    return this.items.length;
-  }
-
-  public concat(...items: ConcatArray<T>[]): T[];
-  public concat(...items: (T | ConcatArray<T>)[]): T[];
-  public concat(...items: (T | ConcatArray<T>)[]): T[] {
-    const result = this.items.concat(...items);
-    return this.sortArray(result);
-  }
-
-  public join(separator?: string): string {
-    return this.items.join(separator);
-  }
-
-  public shift(): T | undefined {
-    const result = this.items.shift();
-    this.updateIndexedProperties();
-    return result;
-  }
-
-  public slice(start?: number, end?: number): T[] {
-    return this.items.slice(start, end);
-  }
-
-  public splice(start: number, deleteCount?: number, ...items: T[]): T[] {
-    // First perform the deletion
-    const result = this.items.splice(start, deleteCount || 0);
-
-    // Then add unique items
-    const uniqueItems: T[] = [];
-    for (const item of items) {
-      if (!this.items.includes(item) && !uniqueItems.includes(item)) {
-        uniqueItems.push(item);
-      }
-    }
-    this.items.push(...uniqueItems);
-    this.sort();
-    this.updateIndexedProperties();
-    return result;
-  }
-
-  public unshift(...items: T[]): number {
-    // Filter out duplicates both from existing items and within the new items
-    const uniqueItems: T[] = [];
-    for (const item of items) {
-      if (!this.items.includes(item) && !uniqueItems.includes(item)) {
-        uniqueItems.push(item);
-      }
-    }
-    this.items.unshift(...uniqueItems);
-    this.sort();
-    this.updateIndexedProperties();
-    return this.items.length;
-  }
-
-  public indexOf(searchElement: T, fromIndex?: number): number {
-    if (fromIndex === undefined) {
-      return this.items.indexOf(searchElement);
-    }
-    return this.items.indexOf(searchElement, fromIndex);
-  }
-
-  public lastIndexOf(searchElement: T, fromIndex?: number): number {
-    if (fromIndex === undefined) {
-      return this.items.lastIndexOf(searchElement);
-    }
-    return this.items.lastIndexOf(searchElement, fromIndex);
-  }
-
-  public every<S extends T>(
-    predicate: (value: T, index: number, array: T[]) => value is S,
-    thisArg?: any
-  ): this is S[];
-  public every(
-    predicate: (value: T, index: number, array: T[]) => unknown,
-    thisArg?: any
-  ): boolean {
-    return this.items.every(predicate, thisArg);
-  }
-
-  public some(
-    predicate: (value: T, index: number, array: T[]) => unknown,
-    thisArg?: any
-  ): boolean {
-    return this.items.some(predicate, thisArg);
-  }
-
-  public forEach(
-    callbackfn: (value: T, index: number, array: T[]) => void,
-    thisArg?: any
-  ): void {
-    this.items.forEach(callbackfn, thisArg);
-  }
-
-  public map<U>(
-    callbackfn: (value: T, index: number, array: T[]) => U,
-    thisArg?: any
-  ): U[] {
-    return this.items.map(callbackfn, thisArg);
-  }
-
-  public filter<S extends T>(
-    predicate: (value: T, index: number, array: T[]) => value is S,
-    thisArg?: any
-  ): S[];
-  public filter(
-    predicate: (value: T, index: number, array: T[]) => unknown,
-    thisArg?: any
-  ): T[] {
-    return this.items.filter(predicate, thisArg);
-  }
-
-  public reduce<U>(
-    callbackfn: (
-      previousValue: U,
-      currentValue: T,
-      currentIndex: number,
-      array: T[]
-    ) => U,
-    initialValue?: U
-  ): U {
-    if (arguments.length >= 2) {
-      return this.items.reduce(callbackfn, initialValue!);
-    } else {
-      return this.items.reduce(callbackfn as any) as unknown as U;
-    }
-  }
-
-  public reduceRight<U>(
-    callbackfn: (
-      previousValue: U,
-      currentValue: T,
-      currentIndex: number,
-      array: T[]
-    ) => U,
-    initialValue?: U
-  ): U {
-    if (arguments.length >= 2) {
-      return this.items.reduceRight(callbackfn, initialValue!);
-    } else {
-      return this.items.reduceRight(callbackfn as any) as unknown as U;
-    }
-  }
-
-  public find<S extends T>(
-    predicate: (this: void, value: T, index: number, obj: T[]) => value is S,
-    thisArg?: any
-  ): S | undefined;
-  public find(
-    predicate: (value: T, index: number, obj: T[]) => unknown,
-    thisArg?: any
-  ): T | undefined {
-    return this.items.find(predicate, thisArg);
-  }
-
-  public findIndex(
-    predicate: (value: T, index: number, obj: T[]) => unknown,
-    thisArg?: any
-  ): number {
-    return this.items.findIndex(predicate, thisArg);
-  }
-
-  public fill(value: T, start?: number, end?: number): T[] {
-    // Perform the fill operation first
-    this.items.fill(value, start, end);
-
-    // Then remove duplicates by creating a unique set
-    const uniqueItems = [...new Set(this.items)];
-    this.items.length = 0;
-    this.items.push(...uniqueItems);
-
-    this.sort();
-    this.updateIndexedProperties();
-    return this.items;
-  }
-
-  public copyWithin(target: number, start: number, end?: number): T[] {
-    this.items.copyWithin(target, start, end);
-    this.sort();
-    this.updateIndexedProperties();
-    return this.items;
-  }
-
-  public entries(): ArrayIterator<[number, T]> {
-    return this.items.entries();
-  }
-
-  public keys(): ArrayIterator<number> {
-    return this.items.keys();
-  }
-
-  public values(): ArrayIterator<T> {
-    return this.items.values();
-  }
-
-  public includes(searchElement: T, fromIndex?: number): boolean {
-    return this.items.includes(searchElement, fromIndex);
-  }
-
-  public flatMap<U, This = undefined>(
-    callback: (
-      this: This,
-      value: T,
-      index: number,
-      array: T[]
-    ) => U | readonly U[],
-    thisArg?: This | undefined
-  ): U[] {
-    return this.items.flatMap(callback, thisArg);
-  }
-
-  public flat<A, D extends number = 1>(
-    this: A,
-    depth?: D | undefined
-  ): FlatArray<A, D>[] {
-    return ((this as any).items as any).flat(depth);
-  }
-
-  public at(index: number): T | undefined {
-    return this.items.at(index);
-  }
-
-  public [Symbol.iterator](): ArrayIterator<T> {
-    return this.items[Symbol.iterator]();
-  }
-
-  public readonly [Symbol.unscopables]: any = {
-    copyWithin: true,
-    entries: true,
-    fill: true,
-    find: true,
-    findIndex: true,
-    keys: true,
-    values: true
-  };
-
-  protected abstract getCompareFn(): (a: T, b: T) => number;
-
-  protected sort(): void {
-    this.items.sort(this.getCompareFn());
-  }
-
-  protected sortArray(array: T[]): T[] {
-    return array.sort(this.getCompareFn());
-  }
-}