@itwin/appui-abstract 4.3.0-dev.8 → 4.3.0

package/lib/esm/appui-abstract/utils/filter/map.js

@@ -1,398 +0,0 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-var _a;
-/**
- * @internal
- */
-// istanbul ignore next
-export class LinkedMap {
-    constructor() {
-        this[_a] = "LinkedMap";
-        this._map = new Map();
-        this._head = undefined;
-        this._tail = undefined;
-        this._size = 0;
-        this._state = 0;
-    }
-    clear() {
-        this._map.clear();
-        this._head = undefined;
-        this._tail = undefined;
-        this._size = 0;
-        this._state++;
-    }
-    isEmpty() {
-        return !this._head && !this._tail;
-    }
-    get size() {
-        return this._size;
-    }
-    get first() {
-        return this._head?.value;
-    }
-    get last() {
-        return this._tail?.value;
-    }
-    has(key) {
-        return this._map.has(key);
-    }
-    get(key, touch = 0 /* Touch.None */) {
-        const item = this._map.get(key);
-        if (!item) {
-            return undefined;
-        }
-        if (touch !== 0 /* Touch.None */) {
-            this.touch(item, touch);
-        }
-        return item.value;
-    }
-    set(key, value, touch = 0 /* Touch.None */) {
-        let item = this._map.get(key);
-        if (item) {
-            item.value = value;
-            if (touch !== 0 /* Touch.None */) {
-                this.touch(item, touch);
-            }
-        }
-        else {
-            item = { key, value, next: undefined, previous: undefined };
-            switch (touch) {
-                case 0 /* Touch.None */:
-                    this.addItemLast(item);
-                    break;
-                case 1 /* Touch.AsOld */:
-                    this.addItemFirst(item);
-                    break;
-                case 2 /* Touch.AsNew */:
-                    this.addItemLast(item);
-                    break;
-                default:
-                    this.addItemLast(item);
-                    break;
-            }
-            this._map.set(key, item);
-            this._size++;
-        }
-        return this;
-    }
-    delete(key) {
-        return !!this.remove(key);
-    }
-    remove(key) {
-        const item = this._map.get(key);
-        if (!item) {
-            return undefined;
-        }
-        this._map.delete(key);
-        this.removeItem(item);
-        this._size--;
-        return item.value;
-    }
-    shift() {
-        if (!this._head && !this._tail) {
-            return undefined;
-        }
-        if (!this._head || !this._tail) {
-            throw new Error("Invalid list");
-        }
-        const item = this._head;
-        this._map.delete(item.key);
-        this.removeItem(item);
-        this._size--;
-        return item.value;
-    }
-    forEach(callbackfn, thisArg) {
-        const state = this._state;
-        let current = this._head;
-        while (current) {
-            if (thisArg) {
-                callbackfn.bind(thisArg)(current.value, current.key, this);
-            }
-            else {
-                callbackfn(current.value, current.key, this);
-            }
-            if (this._state !== state) {
-                throw new Error(`LinkedMap got modified during iteration.`);
-            }
-            current = current.next;
-        }
-    }
-    keys() {
-        const map = this;
-        const state = this._state;
-        let current = this._head;
-        const iterator = {
-            [Symbol.iterator]() {
-                return iterator;
-            },
-            next() {
-                if (map._state !== state) {
-                    throw new Error(`LinkedMap got modified during iteration.`);
-                }
-                if (current) {
-                    const result = { value: current.key, done: false };
-                    current = current.next;
-                    return result;
-                }
-                else {
-                    return { value: undefined, done: true };
-                }
-            },
-        };
-        return iterator;
-    }
-    values() {
-        const map = this;
-        const state = this._state;
-        let current = this._head;
-        const iterator = {
-            [Symbol.iterator]() {
-                return iterator;
-            },
-            next() {
-                if (map._state !== state) {
-                    throw new Error(`LinkedMap got modified during iteration.`);
-                }
-                if (current) {
-                    const result = { value: current.value, done: false };
-                    current = current.next;
-                    return result;
-                }
-                else {
-                    return { value: undefined, done: true };
-                }
-            },
-        };
-        return iterator;
-    }
-    entries() {
-        // eslint-disable-next-line @typescript-eslint/no-this-alias
-        const map = this;
-        const state = this._state;
-        let current = this._head;
-        const iterator = {
-            [Symbol.iterator]() {
-                return iterator;
-            },
-            next() {
-                if (map._state !== state) {
-                    throw new Error(`LinkedMap got modified during iteration.`);
-                }
-                if (current) {
-                    const result = { value: [current.key, current.value], done: false };
-                    current = current.next;
-                    return result;
-                }
-                else {
-                    return { value: undefined, done: true };
-                }
-            },
-        };
-        return iterator;
-    }
-    [(_a = Symbol.toStringTag, Symbol.iterator)]() {
-        return this.entries();
-    }
-    trimOld(newSize) {
-        if (newSize >= this.size) {
-            return;
-        }
-        if (newSize === 0) {
-            this.clear();
-            return;
-        }
-        let current = this._head;
-        let currentSize = this.size;
-        while (current && currentSize > newSize) {
-            this._map.delete(current.key);
-            current = current.next;
-            currentSize--;
-        }
-        this._head = current;
-        this._size = currentSize;
-        if (current) {
-            current.previous = undefined;
-        }
-        this._state++;
-    }
-    addItemFirst(item) {
-        // First time Insert
-        if (!this._head && !this._tail) {
-            this._tail = item;
-        }
-        else if (!this._head) {
-            throw new Error("Invalid list");
-        }
-        else {
-            item.next = this._head;
-            this._head.previous = item;
-        }
-        this._head = item;
-        this._state++;
-    }
-    addItemLast(item) {
-        // First time Insert
-        if (!this._head && !this._tail) {
-            this._head = item;
-        }
-        else if (!this._tail) {
-            throw new Error("Invalid list");
-        }
-        else {
-            item.previous = this._tail;
-            this._tail.next = item;
-        }
-        this._tail = item;
-        this._state++;
-    }
-    removeItem(item) {
-        if (item === this._head && item === this._tail) {
-            this._head = undefined;
-            this._tail = undefined;
-        }
-        else if (item === this._head) {
-            // This can only happend if size === 1 which is handle
-            // by the case above.
-            if (!item.next) {
-                throw new Error("Invalid list");
-            }
-            item.next.previous = undefined;
-            this._head = item.next;
-        }
-        else if (item === this._tail) {
-            // This can only happend if size === 1 which is handle
-            // by the case above.
-            if (!item.previous) {
-                throw new Error("Invalid list");
-            }
-            item.previous.next = undefined;
-            this._tail = item.previous;
-        }
-        else {
-            const next = item.next;
-            const previous = item.previous;
-            if (!next || !previous) {
-                throw new Error("Invalid list");
-            }
-            next.previous = previous;
-            previous.next = next;
-        }
-        item.next = undefined;
-        item.previous = undefined;
-        this._state++;
-    }
-    touch(item, touch) {
-        if (!this._head || !this._tail) {
-            throw new Error("Invalid list");
-        }
-        if ((touch !== 1 /* Touch.AsOld */ && touch !== 2 /* Touch.AsNew */)) {
-            return;
-        }
-        if (touch === 1 /* Touch.AsOld */) {
-            if (item === this._head) {
-                return;
-            }
-            const next = item.next;
-            const previous = item.previous;
-            // Unlink the item
-            if (item === this._tail) {
-                // previous must be defined since item was not head but is tail
-                // So there are more than on item in the map
-                previous.next = undefined;
-                this._tail = previous;
-            }
-            else {
-                // Both next and previous are not undefined since item was neither head nor tail.
-                next.previous = previous;
-                previous.next = next;
-            }
-            // Insert the node at head
-            item.previous = undefined;
-            item.next = this._head;
-            this._head.previous = item;
-            this._head = item;
-            this._state++;
-        }
-        else if (touch === 2 /* Touch.AsNew */) {
-            if (item === this._tail) {
-                return;
-            }
-            const next = item.next;
-            const previous = item.previous;
-            // Unlink the item.
-            if (item === this._head) {
-                // next must be defined since item was not tail but is head
-                // So there are more than on item in the map
-                next.previous = undefined;
-                this._head = next;
-            }
-            else {
-                // Both next and previous are not undefined since item was neither head nor tail.
-                next.previous = previous;
-                previous.next = next;
-            }
-            item.next = undefined;
-            item.previous = this._tail;
-            this._tail.next = item;
-            this._tail = item;
-            this._state++;
-        }
-    }
-    toJSON() {
-        const data = [];
-        this.forEach((value, key) => {
-            data.push([key, value]);
-        });
-        return data;
-    }
-    fromJSON(data) {
-        this.clear();
-        for (const [key, value] of data) {
-            this.set(key, value);
-        }
-    }
-}
-/**
- * @internal
- */
-// istanbul ignore next
-export class LRUCache extends LinkedMap {
-    constructor(limit, ratio = 1) {
-        super();
-        this._limit = limit;
-        this._ratio = Math.min(Math.max(0, ratio), 1);
-    }
-    get limit() {
-        return this._limit;
-    }
-    set limit(limit) {
-        this._limit = limit;
-        this.checkTrim();
-    }
-    get ratio() {
-        return this._ratio;
-    }
-    set ratio(ratio) {
-        this._ratio = Math.min(Math.max(0, ratio), 1);
-        this.checkTrim();
-    }
-    get(key, touch = 2 /* Touch.AsNew */) {
-        return super.get(key, touch);
-    }
-    peek(key) {
-        return super.get(key, 0 /* Touch.None */);
-    }
-    set(key, value) {
-        super.set(key, value, 2 /* Touch.AsNew */);
-        this.checkTrim();
-        return this;
-    }
-    checkTrim() {
-        if (this.size > this._limit) {
-            this.trimOld(Math.round(this._limit * this._ratio));
-        }
-    }
-}
-//# sourceMappingURL=map.js.map

package/lib/esm/appui-abstract/utils/filter/map.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"map.js","sourceRoot":"","sources":["../../../../../src/appui-abstract/utils/filter/map.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;;AAyB/F;;GAEG;AACH,uBAAuB;AACvB,MAAM,OAAO,SAAS;IAWpB;QATS,QAAoB,GAAG,WAAW,CAAC;QAU1C,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAED,OAAO;QACL,OAAO,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;IACpC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;IAC3B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;IAC3B,CAAC;IAED,GAAG,CAAC,GAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,0BAAyB;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,KAAK,uBAAe,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;SACzB;QACD,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,GAAG,CAAC,GAAM,EAAE,KAAQ,EAAE,0BAAyB;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,KAAK,uBAAe,EAAE;gBACxB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;aACzB;SACF;aAAM;YACL,IAAI,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;YAC5D,QAAQ,KAAK,EAAE;gBACb;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;gBACR;oBACE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;oBACxB,MAAM;gBACR;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;gBACR;oBACE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;oBACvB,MAAM;aACT;YACD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACzB,IAAI,CAAC,KAAK,EAAE,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,CAAC,GAAM;QACX,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,OAAO,CAAC,UAA4D,EAAE,OAAa;QACjF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,OAAO,OAAO,EAAE;YACd,IAAI,OAAO,EAAE;gBACX,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;aAC5D;iBAAM;gBACL,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;aAC9C;YACD,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,EAAE;gBACzB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;aAC7D;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;IACH,CAAC;IAED,IAAI;QACF,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAAwB;YACpC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBACnD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,MAAM;QACJ,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAAwB;YACpC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBACrD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO;QACL,4DAA4D;QAC5D,MAAM,GAAG,GAAG,IAAI,CAAC;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,QAAQ,GAA6B;YACzC,CAAC,MAAM,CAAC,QAAQ,CAAC;gBACf,OAAO,QAAQ,CAAC;YAClB,CAAC;YACD,IAAI;gBACF,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,EAAE;oBACxB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;iBAC7D;gBACD,IAAI,OAAO,EAAE;oBACX,MAAM,MAAM,GAA2B,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,OAAO,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;oBAC5F,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;oBACvB,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;iBACzC;YACH,CAAC;SACF,CAAC;QACF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OA3MU,MAAM,CAAC,WAAW,EA2M3B,MAAM,CAAC,QAAQ,EAAC;QACf,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAES,OAAO,CAAC,OAAe;QAC/B,IAAI,OAAO,IAAI,IAAI,CAAC,IAAI,EAAE;YACxB,OAAO;SACR;QACD,IAAI,OAAO,KAAK,CAAC,EAAE;YACjB,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,OAAO;SACR;QACD,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,OAAO,OAAO,IAAI,WAAW,GAAG,OAAO,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAC9B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACvB,WAAW,EAAE,CAAC;SACf;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC;QACzB,IAAI,OAAO,EAAE;YACX,OAAO,CAAC,QAAQ,GAAG,SAAS,CAAC;SAC9B;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,YAAY,CAAC,IAAgB;QACnC,oBAAoB;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SACnB;aAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;aAAM;YACL,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;SAC5B;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,WAAW,CAAC,IAAgB;QAClC,oBAAoB;QACpB,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SACnB;aAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;aAAM;YACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;SACxB;QACD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,UAAU,CAAC,IAAgB;QACjC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9C,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;SACxB;aAAM,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9B,sDAAsD;YACtD,qBAAqB;YACrB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;gBACd,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;SACxB;aAAM,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;YAC9B,sDAAsD;YACtD,qBAAqB;YACrB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;gBAClB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;SAC5B;aAAM;YACL,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC/B,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;gBACtB,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;aACjC;YACD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;YACzB,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC;SACtB;QACD,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC1B,IAAI,CAAC,MAAM,EAAE,CAAC;IAChB,CAAC;IAEO,KAAK,CAAC,IAAgB,EAAE,KAAY;QAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YAC9B,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;SACjC;QACD,IAAI,CAAC,KAAK,wBAAgB,IAAI,KAAK,wBAAgB,CAAC,EAAE;YACpD,OAAO;SACR;QAED,IAAI,KAAK,wBAAgB,EAAE;YACzB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,OAAO;aACR;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE/B,kBAAkB;YAClB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,+DAA+D;gBAC/D,4CAA4C;gBAC5C,QAAS,CAAC,IAAI,GAAG,SAAS,CAAC;gBAC3B,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;aACvB;iBAAM;gBACL,iFAAiF;gBACjF,IAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBAC1B,QAAS,CAAC,IAAI,GAAG,IAAI,CAAC;aACvB;YAED,0BAA0B;YAC1B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;aAAM,IAAI,KAAK,wBAAgB,EAAE;YAChC,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,OAAO;aACR;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;YAE/B,mBAAmB;YACnB,IAAI,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;gBACvB,2DAA2D;gBAC3D,4CAA4C;gBAC5C,IAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;gBAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;aACnB;iBAAM;gBACL,iFAAiF;gBACjF,IAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;gBAC1B,QAAS,CAAC,IAAI,GAAG,IAAI,CAAC;aACvB;YACD,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;YACvB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,MAAM,EAAE,CAAC;SACf;IACH,CAAC;IAED,MAAM;QACJ,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,EAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QAC1B,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,QAAQ,CAAC,IAAc;QACrB,IAAI,CAAC,KAAK,EAAE,CAAC;QAEb,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;YAC/B,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;SACtB;IACH,CAAC;CACF;AAED;;GAEG;AACH,uBAAuB;AACvB,MAAM,OAAO,QAAe,SAAQ,SAAe;IAKjD,YAAY,KAAa,EAAE,QAAgB,CAAC;QAC1C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,IAAI,KAAK,CAAC,KAAa;QACrB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAEQ,GAAG,CAAC,GAAM,EAAE,2BAA0B;QAC7C,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,IAAI,CAAC,GAAM;QACT,OAAO,KAAK,CAAC,GAAG,CAAC,GAAG,qBAAa,CAAC;IACpC,CAAC;IAEQ,GAAG,CAAC,GAAM,EAAE,KAAQ;QAC3B,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,sBAAc,CAAC;QACnC,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,SAAS;QACf,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE;YAC3B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SACrD;IACH,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n// code extracted from https://github.com/microsoft/vscode/blob/master/src/vs/base/common/map.ts\r\n\r\n/* eslint-disable @typescript-eslint/explicit-member-accessibility */\r\n/* eslint-disable @itwin/prefer-get */\r\n/* eslint-disable no-restricted-syntax */\r\n/* eslint-disable @typescript-eslint/no-this-alias */\r\n\r\ninterface Item<K, V> {\r\n  previous: Item<K, V> | undefined;\r\n  next: Item<K, V> | undefined;\r\n  key: K;\r\n  value: V;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport const enum Touch {\r\n  None = 0,\r\n  AsOld = 1,\r\n  AsNew = 2\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\n// istanbul ignore next\r\nexport class LinkedMap<K, V> implements Map<K, V> {\r\n\r\n  readonly [Symbol.toStringTag] = \"LinkedMap\";\r\n\r\n  private _map: Map<K, Item<K, V>>;\r\n  private _head: Item<K, V> | undefined;\r\n  private _tail: Item<K, V> | undefined;\r\n  private _size: number;\r\n\r\n  private _state: number;\r\n\r\n  constructor() {\r\n    this._map = new Map<K, Item<K, V>>();\r\n    this._head = undefined;\r\n    this._tail = undefined;\r\n    this._size = 0;\r\n    this._state = 0;\r\n  }\r\n\r\n  clear(): void {\r\n    this._map.clear();\r\n    this._head = undefined;\r\n    this._tail = undefined;\r\n    this._size = 0;\r\n    this._state++;\r\n  }\r\n\r\n  isEmpty(): boolean {\r\n    return !this._head && !this._tail;\r\n  }\r\n\r\n  get size(): number {\r\n    return this._size;\r\n  }\r\n\r\n  get first(): V | undefined {\r\n    return this._head?.value;\r\n  }\r\n\r\n  get last(): V | undefined {\r\n    return this._tail?.value;\r\n  }\r\n\r\n  has(key: K): boolean {\r\n    return this._map.has(key);\r\n  }\r\n\r\n  get(key: K, touch: Touch = Touch.None): V | undefined {\r\n    const item = this._map.get(key);\r\n    if (!item) {\r\n      return undefined;\r\n    }\r\n    if (touch !== Touch.None) {\r\n      this.touch(item, touch);\r\n    }\r\n    return item.value;\r\n  }\r\n\r\n  set(key: K, value: V, touch: Touch = Touch.None): this {\r\n    let item = this._map.get(key);\r\n    if (item) {\r\n      item.value = value;\r\n      if (touch !== Touch.None) {\r\n        this.touch(item, touch);\r\n      }\r\n    } else {\r\n      item = { key, value, next: undefined, previous: undefined };\r\n      switch (touch) {\r\n        case Touch.None:\r\n          this.addItemLast(item);\r\n          break;\r\n        case Touch.AsOld:\r\n          this.addItemFirst(item);\r\n          break;\r\n        case Touch.AsNew:\r\n          this.addItemLast(item);\r\n          break;\r\n        default:\r\n          this.addItemLast(item);\r\n          break;\r\n      }\r\n      this._map.set(key, item);\r\n      this._size++;\r\n    }\r\n    return this;\r\n  }\r\n\r\n  delete(key: K): boolean {\r\n    return !!this.remove(key);\r\n  }\r\n\r\n  remove(key: K): V | undefined {\r\n    const item = this._map.get(key);\r\n    if (!item) {\r\n      return undefined;\r\n    }\r\n    this._map.delete(key);\r\n    this.removeItem(item);\r\n    this._size--;\r\n    return item.value;\r\n  }\r\n\r\n  shift(): V | undefined {\r\n    if (!this._head && !this._tail) {\r\n      return undefined;\r\n    }\r\n    if (!this._head || !this._tail) {\r\n      throw new Error(\"Invalid list\");\r\n    }\r\n    const item = this._head;\r\n    this._map.delete(item.key);\r\n    this.removeItem(item);\r\n    this._size--;\r\n    return item.value;\r\n  }\r\n\r\n  forEach(callbackfn: (value: V, key: K, map: LinkedMap<K, V>) => void, thisArg?: any): void {\r\n    const state = this._state;\r\n    let current = this._head;\r\n    while (current) {\r\n      if (thisArg) {\r\n        callbackfn.bind(thisArg)(current.value, current.key, this);\r\n      } else {\r\n        callbackfn(current.value, current.key, this);\r\n      }\r\n      if (this._state !== state) {\r\n        throw new Error(`LinkedMap got modified during iteration.`);\r\n      }\r\n      current = current.next;\r\n    }\r\n  }\r\n\r\n  keys(): IterableIterator<K> {\r\n    const map = this;\r\n    const state = this._state;\r\n    let current = this._head;\r\n    const iterator: IterableIterator<K> = {\r\n      [Symbol.iterator]() {\r\n        return iterator;\r\n      },\r\n      next(): IteratorResult<K> {\r\n        if (map._state !== state) {\r\n          throw new Error(`LinkedMap got modified during iteration.`);\r\n        }\r\n        if (current) {\r\n          const result = { value: current.key, done: false };\r\n          current = current.next;\r\n          return result;\r\n        } else {\r\n          return { value: undefined, done: true };\r\n        }\r\n      },\r\n    };\r\n    return iterator;\r\n  }\r\n\r\n  values(): IterableIterator<V> {\r\n    const map = this;\r\n    const state = this._state;\r\n    let current = this._head;\r\n    const iterator: IterableIterator<V> = {\r\n      [Symbol.iterator]() {\r\n        return iterator;\r\n      },\r\n      next(): IteratorResult<V> {\r\n        if (map._state !== state) {\r\n          throw new Error(`LinkedMap got modified during iteration.`);\r\n        }\r\n        if (current) {\r\n          const result = { value: current.value, done: false };\r\n          current = current.next;\r\n          return result;\r\n        } else {\r\n          return { value: undefined, done: true };\r\n        }\r\n      },\r\n    };\r\n    return iterator;\r\n  }\r\n\r\n  entries(): IterableIterator<[K, V]> {\r\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\r\n    const map = this;\r\n    const state = this._state;\r\n    let current = this._head;\r\n    const iterator: IterableIterator<[K, V]> = {\r\n      [Symbol.iterator]() {\r\n        return iterator;\r\n      },\r\n      next(): IteratorResult<[K, V]> {\r\n        if (map._state !== state) {\r\n          throw new Error(`LinkedMap got modified during iteration.`);\r\n        }\r\n        if (current) {\r\n          const result: IteratorResult<[K, V]> = { value: [current.key, current.value], done: false };\r\n          current = current.next;\r\n          return result;\r\n        } else {\r\n          return { value: undefined, done: true };\r\n        }\r\n      },\r\n    };\r\n    return iterator;\r\n  }\r\n\r\n  [Symbol.iterator](): IterableIterator<[K, V]> {\r\n    return this.entries();\r\n  }\r\n\r\n  protected trimOld(newSize: number) {\r\n    if (newSize >= this.size) {\r\n      return;\r\n    }\r\n    if (newSize === 0) {\r\n      this.clear();\r\n      return;\r\n    }\r\n    let current = this._head;\r\n    let currentSize = this.size;\r\n    while (current && currentSize > newSize) {\r\n      this._map.delete(current.key);\r\n      current = current.next;\r\n      currentSize--;\r\n    }\r\n    this._head = current;\r\n    this._size = currentSize;\r\n    if (current) {\r\n      current.previous = undefined;\r\n    }\r\n    this._state++;\r\n  }\r\n\r\n  private addItemFirst(item: Item<K, V>): void {\r\n    // First time Insert\r\n    if (!this._head && !this._tail) {\r\n      this._tail = item;\r\n    } else if (!this._head) {\r\n      throw new Error(\"Invalid list\");\r\n    } else {\r\n      item.next = this._head;\r\n      this._head.previous = item;\r\n    }\r\n    this._head = item;\r\n    this._state++;\r\n  }\r\n\r\n  private addItemLast(item: Item<K, V>): void {\r\n    // First time Insert\r\n    if (!this._head && !this._tail) {\r\n      this._head = item;\r\n    } else if (!this._tail) {\r\n      throw new Error(\"Invalid list\");\r\n    } else {\r\n      item.previous = this._tail;\r\n      this._tail.next = item;\r\n    }\r\n    this._tail = item;\r\n    this._state++;\r\n  }\r\n\r\n  private removeItem(item: Item<K, V>): void {\r\n    if (item === this._head && item === this._tail) {\r\n      this._head = undefined;\r\n      this._tail = undefined;\r\n    } else if (item === this._head) {\r\n      // This can only happend if size === 1 which is handle\r\n      // by the case above.\r\n      if (!item.next) {\r\n        throw new Error(\"Invalid list\");\r\n      }\r\n      item.next.previous = undefined;\r\n      this._head = item.next;\r\n    } else if (item === this._tail) {\r\n      // This can only happend if size === 1 which is handle\r\n      // by the case above.\r\n      if (!item.previous) {\r\n        throw new Error(\"Invalid list\");\r\n      }\r\n      item.previous.next = undefined;\r\n      this._tail = item.previous;\r\n    } else {\r\n      const next = item.next;\r\n      const previous = item.previous;\r\n      if (!next || !previous) {\r\n        throw new Error(\"Invalid list\");\r\n      }\r\n      next.previous = previous;\r\n      previous.next = next;\r\n    }\r\n    item.next = undefined;\r\n    item.previous = undefined;\r\n    this._state++;\r\n  }\r\n\r\n  private touch(item: Item<K, V>, touch: Touch): void {\r\n    if (!this._head || !this._tail) {\r\n      throw new Error(\"Invalid list\");\r\n    }\r\n    if ((touch !== Touch.AsOld && touch !== Touch.AsNew)) {\r\n      return;\r\n    }\r\n\r\n    if (touch === Touch.AsOld) {\r\n      if (item === this._head) {\r\n        return;\r\n      }\r\n\r\n      const next = item.next;\r\n      const previous = item.previous;\r\n\r\n      // Unlink the item\r\n      if (item === this._tail) {\r\n        // previous must be defined since item was not head but is tail\r\n        // So there are more than on item in the map\r\n        previous!.next = undefined;\r\n        this._tail = previous;\r\n      } else {\r\n        // Both next and previous are not undefined since item was neither head nor tail.\r\n        next!.previous = previous;\r\n        previous!.next = next;\r\n      }\r\n\r\n      // Insert the node at head\r\n      item.previous = undefined;\r\n      item.next = this._head;\r\n      this._head.previous = item;\r\n      this._head = item;\r\n      this._state++;\r\n    } else if (touch === Touch.AsNew) {\r\n      if (item === this._tail) {\r\n        return;\r\n      }\r\n\r\n      const next = item.next;\r\n      const previous = item.previous;\r\n\r\n      // Unlink the item.\r\n      if (item === this._head) {\r\n        // next must be defined since item was not tail but is head\r\n        // So there are more than on item in the map\r\n        next!.previous = undefined;\r\n        this._head = next;\r\n      } else {\r\n        // Both next and previous are not undefined since item was neither head nor tail.\r\n        next!.previous = previous;\r\n        previous!.next = next;\r\n      }\r\n      item.next = undefined;\r\n      item.previous = this._tail;\r\n      this._tail.next = item;\r\n      this._tail = item;\r\n      this._state++;\r\n    }\r\n  }\r\n\r\n  toJSON(): [K, V][] {\r\n    const data: [K, V][] = [];\r\n\r\n    this.forEach((value, key) => {\r\n      data.push([key, value]);\r\n    });\r\n\r\n    return data;\r\n  }\r\n\r\n  fromJSON(data: [K, V][]): void {\r\n    this.clear();\r\n\r\n    for (const [key, value] of data) {\r\n      this.set(key, value);\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\n// istanbul ignore next\r\nexport class LRUCache<K, V> extends LinkedMap<K, V> {\r\n\r\n  private _limit: number;\r\n  private _ratio: number;\r\n\r\n  constructor(limit: number, ratio: number = 1) {\r\n    super();\r\n    this._limit = limit;\r\n    this._ratio = Math.min(Math.max(0, ratio), 1);\r\n  }\r\n\r\n  get limit(): number {\r\n    return this._limit;\r\n  }\r\n\r\n  set limit(limit: number) {\r\n    this._limit = limit;\r\n    this.checkTrim();\r\n  }\r\n\r\n  get ratio(): number {\r\n    return this._ratio;\r\n  }\r\n\r\n  set ratio(ratio: number) {\r\n    this._ratio = Math.min(Math.max(0, ratio), 1);\r\n    this.checkTrim();\r\n  }\r\n\r\n  override get(key: K, touch: Touch = Touch.AsNew): V | undefined {\r\n    return super.get(key, touch);\r\n  }\r\n\r\n  peek(key: K): V | undefined {\r\n    return super.get(key, Touch.None);\r\n  }\r\n\r\n  override set(key: K, value: V): this {\r\n    super.set(key, value, Touch.AsNew);\r\n    this.checkTrim();\r\n    return this;\r\n  }\r\n\r\n  private checkTrim() {\r\n    if (this.size > this._limit) {\r\n      this.trimOld(Math.round(this._limit * this._ratio));\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/esm/appui-abstract/utils/filter/strings.d.ts

@@ -1,21 +0,0 @@
-/**
- * @internal
- */
-export declare function convertSimple2RegExpPattern(pattern: string): string;
-/**
- * @internal
- */
-export declare function isLowerAsciiLetter(code: number): boolean;
-/**
- * @internal
- */
-export declare function isUpperAsciiLetter(code: number): boolean;
-/**
- * @internal
- */
-export declare function equalsIgnoreCase(a: string, b: string): boolean;
-/**
- * @internal
- */
-export declare function startsWithIgnoreCase(str: string, candidate: string): boolean;
-//# sourceMappingURL=strings.d.ts.map

package/lib/esm/appui-abstract/utils/filter/strings.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"strings.d.ts","sourceRoot":"","sources":["../../../../../src/appui-abstract/utils/filter/strings.ts"],"names":[],"mappings":"AAOA;;GAEG;AACH,wBAAgB,2BAA2B,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM,CAEnE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAExD;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAExD;AASD;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAE9D;AA+BD;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAO5E"}

package/lib/esm/appui-abstract/utils/filter/strings.js

@@ -1,71 +0,0 @@
-/*---------------------------------------------------------------------------------------------
-* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
-* See LICENSE.md in the project root for license terms and full copyright notice.
-*--------------------------------------------------------------------------------------------*/
-/**
- * @internal
- */
-export function convertSimple2RegExpPattern(pattern) {
-    return pattern.replace(/[\-\\\{\}\+\?\|\^\$\.\,\[\]\(\)\#\s]/g, "\\$&").replace(/[\*]/g, ".*");
-}
-/**
- * @internal
- */
-export function isLowerAsciiLetter(code) {
-    return code >= 97 /* CharCode.a */ && code <= 122 /* CharCode.z */;
-}
-/**
- * @internal
- */
-export function isUpperAsciiLetter(code) {
-    return code >= 65 /* CharCode.A */ && code <= 90 /* CharCode.Z */;
-}
-/**
- * @internal
- */
-function isAsciiLetter(code) {
-    return isLowerAsciiLetter(code) || isUpperAsciiLetter(code);
-}
-/**
- * @internal
- */
-export function equalsIgnoreCase(a, b) {
-    return a.length === b.length && doEqualsIgnoreCase(a, b);
-}
-/**
- * @internal
- */
-function doEqualsIgnoreCase(a, b, stopAt = a.length) {
-    for (let i = 0; i < stopAt; i++) {
-        const codeA = a.charCodeAt(i);
-        const codeB = b.charCodeAt(i);
-        if (codeA === codeB) {
-            continue;
-        }
-        // a-z A-Z
-        if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) {
-            const diff = Math.abs(codeA - codeB);
-            if (diff !== 0 && diff !== 32) {
-                return false;
-            }
-        }
-        else {
-            // Any other char code
-            if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) {
-                return false;
-            }
-        }
-    }
-    return true;
-}
-/**
- * @internal
- */
-export function startsWithIgnoreCase(str, candidate) {
-    const candidateLength = candidate.length;
-    if (candidate.length > str.length) {
-        return false;
-    }
-    return doEqualsIgnoreCase(str, candidate, candidateLength);
-}
-//# sourceMappingURL=strings.js.map

package/lib/esm/appui-abstract/utils/filter/strings.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"strings.js","sourceRoot":"","sources":["../../../../../src/appui-abstract/utils/filter/strings.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAI/F;;GAEG;AACH,MAAM,UAAU,2BAA2B,CAAC,OAAe;IACzD,OAAO,OAAO,CAAC,OAAO,CAAC,uCAAuC,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;AACjG,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI,uBAAc,IAAI,IAAI,wBAAc,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,IAAI,uBAAc,IAAI,IAAI,uBAAc,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,kBAAkB,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,CAAC;AAC9D,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAS,EAAE,CAAS;IACnD,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,CAAS,EAAE,CAAS,EAAE,MAAM,GAAG,CAAC,CAAC,MAAM;IACjE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAE9B,IAAI,KAAK,KAAK,KAAK,EAAE;YACnB,SAAS;SACV;QAED,UAAU;QACV,IAAI,aAAa,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,KAAK,CAAC,EAAE;YAChD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;YACrC,IAAI,IAAI,KAAK,CAAC,IAAI,IAAI,KAAK,EAAE,EAAE;gBAC7B,OAAO,KAAK,CAAC;aACd;SACF;aAAM;YACL,sBAAsB;YACtB,IAAI,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,KAAK,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,EAAE;gBACzF,OAAO,KAAK,CAAC;aACd;SACF;KACF;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAAC,GAAW,EAAE,SAAiB;IACjE,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC;IACzC,IAAI,SAAS,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE;QACjC,OAAO,KAAK,CAAC;KACd;IAED,OAAO,kBAAkB,CAAC,GAAG,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;AAC7D,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\nimport { CharCode } from \"./charCode\";\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function convertSimple2RegExpPattern(pattern: string): string {\r\n  return pattern.replace(/[\\-\\\\\\{\\}\\+\\?\\|\\^\\$\\.\\,\\[\\]\\(\\)\\#\\s]/g, \"\\\\$&\").replace(/[\\*]/g, \".*\");\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function isLowerAsciiLetter(code: number): boolean {\r\n  return code >= CharCode.a && code <= CharCode.z;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function isUpperAsciiLetter(code: number): boolean {\r\n  return code >= CharCode.A && code <= CharCode.Z;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nfunction isAsciiLetter(code: number): boolean {\r\n  return isLowerAsciiLetter(code) || isUpperAsciiLetter(code);\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function equalsIgnoreCase(a: string, b: string): boolean {\r\n  return a.length === b.length && doEqualsIgnoreCase(a, b);\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nfunction doEqualsIgnoreCase(a: string, b: string, stopAt = a.length): boolean {\r\n  for (let i = 0; i < stopAt; i++) {\r\n    const codeA = a.charCodeAt(i);\r\n    const codeB = b.charCodeAt(i);\r\n\r\n    if (codeA === codeB) {\r\n      continue;\r\n    }\r\n\r\n    // a-z A-Z\r\n    if (isAsciiLetter(codeA) && isAsciiLetter(codeB)) {\r\n      const diff = Math.abs(codeA - codeB);\r\n      if (diff !== 0 && diff !== 32) {\r\n        return false;\r\n      }\r\n    } else {\r\n      // Any other char code\r\n      if (String.fromCharCode(codeA).toLowerCase() !== String.fromCharCode(codeB).toLowerCase()) {\r\n        return false;\r\n      }\r\n    }\r\n  }\r\n\r\n  return true;\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport function startsWithIgnoreCase(str: string, candidate: string): boolean {\r\n  const candidateLength = candidate.length;\r\n  if (candidate.length > str.length) {\r\n    return false;\r\n  }\r\n\r\n  return doEqualsIgnoreCase(str, candidate, candidateLength);\r\n}\r\n"]}