@omegagrid/core 0.10.2 → 0.10.5

package/dist/common/options.js

@@ -0,0 +1,29 @@
+import constants from "../constants";
+import { createDateFormatter, getDateFormat } from "./dates";
+import { getLocalDecimalSeparator } from "./numbers";
+import { mergeDeep } from "./utils";
+import { getLocale, setLocale } from "@omegagrid/localize";
+let defaultOptions = {};
+export const setDefaultOptions = (options) => {
+    if (options.locale)
+        setLocale(options.locale);
+    defaultOptions = options;
+};
+export const getDefaultOptions = () => mergeDeep({
+    locale: getLocale(),
+    formatLocale: getLocale(),
+    dateFormat: getDateFormat(),
+    fontSize: constants.FONT_SIZE,
+    systemDecimalSeparator: getLocalDecimalSeparator(getLocale()),
+    user: {
+        id: '0',
+        name: 'Anonymous'
+    }
+}, defaultOptions);
+export function initOptions(options, origOptions = null) {
+    const opts = mergeDeep({}, getDefaultOptions(), origOptions, options);
+    opts.dateFormatter = opts.dateFormatter || createDateFormatter(opts.locale, opts.dateFormat);
+    //console.log(opts.dateFormatter('31.12.2024', opts.dateFormat));
+    return opts;
+}
+//# sourceMappingURL=options.js.map

package/dist/common/options.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"options.js","sourceRoot":"","sources":["../../src/common/options.ts"],"names":[],"mappings":"AAAA,OAAO,SAAS,MAAM,cAAc,CAAC;AAErC,OAAO,EAAE,mBAAmB,EAA2C,aAAa,EAAE,MAAM,SAAS,CAAC;AACtG,OAAO,EAAE,wBAAwB,EAAE,MAAM,WAAW,CAAC;AACrD,OAAO,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AACpC,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAc3D,IAAI,cAAc,GAAqB,EAAE,CAAC;AAE1C,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,OAAyB,EAAE,EAAE;IAC9D,IAAI,OAAO,CAAC,MAAM;QAAE,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9C,cAAc,GAAG,OAAO,CAAC;AAC1B,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAqB,EAAE,CAAC,SAAS,CAAC;IAClE,MAAM,EAAE,SAAS,EAAE;IACnB,YAAY,EAAE,SAAS,EAAE;IACzB,UAAU,EAAE,aAAa,EAAE;IAC3B,QAAQ,EAAE,SAAS,CAAC,SAAS;IAC7B,sBAAsB,EAAE,wBAAwB,CAAC,SAAS,EAAE,CAAC;IAC7D,IAAI,EAAE;QACL,EAAE,EAAE,GAAG;QACP,IAAI,EAAE,WAAW;KACjB;CACD,EAAE,cAAc,CAAC,CAAC;AAEnB,MAAM,UAAU,WAAW,CAA6B,OAAW,EAAE,cAAiB,IAAI;IACzF,MAAM,IAAI,GAAG,SAAS,CAAC,EAAE,EAAE,iBAAiB,EAAO,EAAE,WAAW,EAAE,OAAO,CAAM,CAAC;IAChF,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,IAAI,mBAAmB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IAC7F,iEAAiE;IACjE,OAAO,IAAI,CAAC;AACb,CAAC","sourcesContent":["import constants from \"../constants\";\nimport { DecimalSeparator, User } from \"../types\";\nimport { createDateFormatter, DateFormatString, DateFormatterFunction, getDateFormat } from \"./dates\";\nimport { getLocalDecimalSeparator } from \"./numbers\";\nimport { mergeDeep } from \"./utils\";\nimport { getLocale, setLocale } from \"@omegagrid/localize\";\n\nexport type Options = {\n\t/** formatting, numbers, dates, etc */\n\tformatLocale?: string,\n\t/** translation */\n\tlocale?: string,\n\tdateFormat?: DateFormatString,\n\tdateFormatter?: DateFormatterFunction,\n\tsystemDecimalSeparator?: DecimalSeparator,\n\tfontSize?: number,\n\tuser?: User\n}\n\nlet defaultOptions: Partial<Options> = {};\n\nexport const setDefaultOptions = (options: Partial<Options>) => {\n\tif (options.locale) setLocale(options.locale);\n\tdefaultOptions = options;\n}\n\nexport const getDefaultOptions = (): Partial<Options> => mergeDeep({\n\tlocale: getLocale(),\n\tformatLocale: getLocale(),\n\tdateFormat: getDateFormat(),\n\tfontSize: constants.FONT_SIZE,\n\tsystemDecimalSeparator: getLocalDecimalSeparator(getLocale()),\n\tuser: {\n\t\tid: '0',\n\t\tname: 'Anonymous'\n\t}\n}, defaultOptions);\n\nexport function initOptions<T extends Partial<Options>>(options?: T, origOptions: T = null): T {\n\tconst opts = mergeDeep({}, getDefaultOptions() as T, origOptions, options) as T;\n\topts.dateFormatter = opts.dateFormatter || createDateFormatter(opts.locale, opts.dateFormat);\n\t//console.log(opts.dateFormatter('31.12.2024', opts.dateFormat));\n\treturn opts;\n}"]}

package/dist/common/paper.d.ts

@@ -0,0 +1,8 @@
+export type PaperType = 'Letter' | 'Tabloid' | 'Legal' | 'Executive' | 'A3' | 'A4' | 'A5' | 'A6' | 'B4' | 'B5' | 'Folio' | 'Envelope' | 'Monarch';
+export type PaperSize = {
+    width: number;
+    height: number;
+};
+/** paper sizes in mm */
+export declare const PAPER_SIZES: Record<PaperType, PaperSize>;
+//# sourceMappingURL=paper.d.ts.map

package/dist/common/paper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"paper.d.ts","sourceRoot":"","sources":["../../src/common/paper.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,SAAS,GAAG,QAAQ,GAAC,SAAS,GAAC,OAAO,GAAC,WAAW,GAAC,IAAI,GAAC,IAAI,GAAC,IAAI,GAAC,IAAI,GAAC,IAAI,GAAC,IAAI,GAAC,OAAO,GAAC,UAAU,GAAC,SAAS,CAAC;AAC1H,MAAM,MAAM,SAAS,GAAG;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAC,CAAC;AAExD,wBAAwB;AACxB,eAAO,MAAM,WAAW,EAAE,MAAM,CAAC,SAAS,EAAE,SAAS,CAcpD,CAAC"}

package/dist/common/paper.js

@@ -0,0 +1,17 @@
+/** paper sizes in mm */
+export const PAPER_SIZES = {
+    Letter: { width: 215.9, height: 279.4 },
+    Tabloid: { width: 279.4, height: 431.8 },
+    Legal: { width: 215.9, height: 355.6 },
+    Executive: { width: 184.15, height: 266.7 },
+    A3: { width: 297, height: 420 },
+    A4: { width: 210, height: 297 },
+    A5: { width: 148, height: 210 },
+    A6: { width: 105, height: 148 },
+    B4: { width: 250, height: 353 },
+    B5: { width: 176, height: 250 },
+    Folio: { width: 215.9, height: 330.2 },
+    Envelope: { width: 104.8, height: 241.3 },
+    Monarch: { width: 98.4, height: 190.5 }
+};
+//# sourceMappingURL=paper.js.map

package/dist/common/paper.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"paper.js","sourceRoot":"","sources":["../../src/common/paper.ts"],"names":[],"mappings":"AAGA,wBAAwB;AACxB,MAAM,CAAC,MAAM,WAAW,GAAiC;IACxD,MAAM,EAAE,EAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAC;IACrC,OAAO,EAAE,EAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAC;IACtC,KAAK,EAAE,EAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAC;IACpC,SAAS,EAAE,EAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAC;IACzC,EAAE,EAAE,EAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAC;IAC7B,EAAE,EAAE,EAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAC;IAC7B,EAAE,EAAE,EAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAC;IAC7B,EAAE,EAAE,EAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAC;IAC7B,EAAE,EAAE,EAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAC;IAC7B,EAAE,EAAE,EAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAC;IAC7B,KAAK,EAAE,EAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAC;IACpC,QAAQ,EAAE,EAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAC;IACvC,OAAO,EAAE,EAAC,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAC;CACrC,CAAC","sourcesContent":["export type PaperType = 'Letter'|'Tabloid'|'Legal'|'Executive'|'A3'|'A4'|'A5'|'A6'|'B4'|'B5'|'Folio'|'Envelope'|'Monarch';\nexport type PaperSize = {width: number, height: number};\n\n/** paper sizes in mm */\nexport const PAPER_SIZES: Record<PaperType, PaperSize> = {\n\tLetter: {width: 215.9, height: 279.4},\n\tTabloid: {width: 279.4, height: 431.8},\n\tLegal: {width: 215.9, height: 355.6},\n\tExecutive: {width: 184.15, height: 266.7},\n\tA3: {width: 297, height: 420},\n\tA4: {width: 210, height: 297},\n\tA5: {width: 148, height: 210},\n\tA6: {width: 105, height: 148},\n\tB4: {width: 250, height: 353},\n\tB5: {width: 176, height: 250},\n\tFolio: {width: 215.9, height: 330.2},\n\tEnvelope: {width: 104.8, height: 241.3},\n\tMonarch: {width: 98.4, height: 190.5}\n};\n"]}

package/dist/common/shortcutManager.d.ts

@@ -0,0 +1,17 @@
+export declare class ShortcutEvent extends Event {
+    readonly shortcut: string;
+    readonly action: string;
+    constructor(shortcut: string, action: string);
+}
+export declare class ShortcutManager extends EventTarget {
+    readonly target: HTMLElement;
+    private shortcuts;
+    private stack;
+    constructor(target: HTMLElement);
+    matchStack(): string;
+    private _onKeyUp;
+    private _onKeyDown;
+    reset(): void;
+    register(shortcut: string, action: string): void;
+}
+//# sourceMappingURL=shortcutManager.d.ts.map

package/dist/common/shortcutManager.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortcutManager.d.ts","sourceRoot":"","sources":["../../src/common/shortcutManager.ts"],"names":[],"mappings":"AAAA,qBAAa,aAAc,SAAQ,KAAK;IACvC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;gBAEZ,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAK5C;AAMD,qBAAa,eAAgB,SAAQ,WAAW;IAInC,QAAQ,CAAC,MAAM,EAAE,WAAW;IAHxC,OAAO,CAAC,SAAS,CAA6B;IAC9C,OAAO,CAAC,KAAK,CAAqB;gBAEb,MAAM,EAAE,WAAW;IAMxC,UAAU;IAKV,OAAO,CAAC,QAAQ,CAEf;IAED,OAAO,CAAC,UAAU,CAejB;IAED,KAAK;IAIL,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;CAKzC"}

package/dist/common/shortcutManager.js

@@ -0,0 +1,49 @@
+export class ShortcutEvent extends Event {
+    constructor(shortcut, action) {
+        super('shortcut', { cancelable: true });
+        this.shortcut = shortcut;
+        this.action = action;
+    }
+}
+const keyMap = {
+    'control': 'ctrl',
+};
+export class ShortcutManager extends EventTarget {
+    constructor(target) {
+        super();
+        this.target = target;
+        this.shortcuts = new Map();
+        this.stack = new Set();
+        this._onKeyUp = () => {
+            this.reset();
+        };
+        this._onKeyDown = (e) => {
+            let key = e.key.toLowerCase();
+            if (key in keyMap)
+                key = keyMap[key];
+            if (this.stack.has(key))
+                return;
+            this.stack.add(key);
+            const shortcut = this.matchStack();
+            if (shortcut == null)
+                return;
+            e.preventDefault();
+            e.stopImmediatePropagation();
+            this.reset();
+            this.dispatchEvent(new ShortcutEvent(shortcut, this.shortcuts.get(shortcut)));
+        };
+        target.addEventListener('keydown', this._onKeyDown);
+        target.addEventListener('keyup', this._onKeyUp);
+    }
+    matchStack() {
+        const shortcut = [...this.stack.values()].join('+').toLowerCase();
+        return this.shortcuts.has(shortcut) ? shortcut : null;
+    }
+    reset() {
+        this.stack.clear();
+    }
+    register(shortcut, action) {
+        this.shortcuts.set(shortcut.toLowerCase(), action);
+    }
+}
+//# sourceMappingURL=shortcutManager.js.map

package/dist/common/shortcutManager.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shortcutManager.js","sourceRoot":"","sources":["../../src/common/shortcutManager.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,aAAc,SAAQ,KAAK;IAIvC,YAAY,QAAgB,EAAE,MAAc;QAC3C,KAAK,CAAC,UAAU,EAAE,EAAC,UAAU,EAAE,IAAI,EAAC,CAAC,CAAC;QACtC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;CACD;AAED,MAAM,MAAM,GAA2B;IACtC,SAAS,EAAE,MAAM;CACjB,CAAA;AAED,MAAM,OAAO,eAAgB,SAAQ,WAAW;IAI/C,YAAqB,MAAmB;QACvC,KAAK,EAAE,CAAC;QADY,WAAM,GAAN,MAAM,CAAa;QAHhC,cAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QACtC,UAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAa1B,aAAQ,GAAG,GAAG,EAAE;YACvB,IAAI,CAAC,KAAK,EAAE,CAAC;QACd,CAAC,CAAA;QAEO,eAAU,GAAG,CAAC,CAAgB,EAAE,EAAE;YACzC,IAAI,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC;YAC9B,IAAI,GAAG,IAAI,MAAM;gBAAE,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;YAErC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO;YAChC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEpB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;YACnC,IAAI,QAAQ,IAAI,IAAI;gBAAE,OAAO;YAE7B,CAAC,CAAC,cAAc,EAAE,CAAC;YACnB,CAAC,CAAC,wBAAwB,EAAE,CAAC;YAE7B,IAAI,CAAC,KAAK,EAAE,CAAC;YACb,IAAI,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC/E,CAAC,CAAA;QA5BA,MAAM,CAAC,gBAAgB,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED,UAAU;QACT,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;QAClE,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC;IAuBD,KAAK;QACJ,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;IAED,QAAQ,CAAC,QAAgB,EAAE,MAAc;QACxC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,EAAE,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;CAGD","sourcesContent":["export class ShortcutEvent extends Event {\n\treadonly shortcut: string;\n\treadonly action: string;\n\t\n\tconstructor(shortcut: string, action: string) {\n\t\tsuper('shortcut', {cancelable: true});\n\t\tthis.shortcut = shortcut;\n\t\tthis.action = action;\n\t}\n}\n\nconst keyMap: Record<string, string> = {\n\t'control': 'ctrl',\n}\n\nexport class ShortcutManager extends EventTarget {\n\tprivate shortcuts = new Map<string, string>();\n\tprivate stack = new Set<string>();\n\n\tconstructor(readonly target: HTMLElement) {\n\t\tsuper();\n\t\ttarget.addEventListener('keydown', this._onKeyDown);\n\t\ttarget.addEventListener('keyup', this._onKeyUp);\n\t}\n\n\tmatchStack() {\n\t\tconst shortcut = [...this.stack.values()].join('+').toLowerCase();\n\t\treturn this.shortcuts.has(shortcut) ? shortcut : null;\n\t}\n\t\n\tprivate _onKeyUp = () => {\n\t\tthis.reset();\n\t}\n\n\tprivate _onKeyDown = (e: KeyboardEvent) => {\n\t\tlet key = e.key.toLowerCase();\n\t\tif (key in keyMap) key = keyMap[key];\n\n\t\tif (this.stack.has(key)) return;\n\t\tthis.stack.add(key);\n\n\t\tconst shortcut = this.matchStack();\n\t\tif (shortcut == null) return;\n\t\t\n\t\te.preventDefault();\n\t\te.stopImmediatePropagation();\n\n\t\tthis.reset();\n\t\tthis.dispatchEvent(new ShortcutEvent(shortcut, this.shortcuts.get(shortcut)));\n\t}\n\n\treset() {\n\t\tthis.stack.clear();\n\t}\n\n\tregister(shortcut: string, action: string) {\n\t\tthis.shortcuts.set(shortcut.toLowerCase(), action);\n\t}\n\n\t\n}"]}

package/dist/common/tree.d.ts

@@ -0,0 +1,87 @@
+import { Populatable, Mixin } from "../types";
+export declare enum FilterState {
+    Filtered = 0,
+    Matched = 1,
+    ChildMatched = 2,
+    ParentMatched = 3
+}
+/** Source object type for tree node */
+export type TreeNodeSource = {
+    /** node index (readonly) */
+    i?: number;
+    /** node level */
+    l?: number;
+    /** node level */
+    level?: number;
+    /** parent index */
+    p?: number;
+    /** children count */
+    count?: number;
+    /** initital collapse state */
+    collapsed?: boolean;
+    /** node visibility */
+    hidden?: boolean;
+    /** false for excluding node from sorting, default = true */
+    sortable?: boolean;
+    /** false for excluding node from filtering, default = true */
+    filterable?: boolean;
+};
+export type Constructor<A = Populatable> = new (...input: any[]) => A;
+export declare function TreeNodeMixin<TBase extends Constructor>(Base?: TBase): {
+    new (...input: any[]): {
+        index: number;
+        parentIndex: number;
+        level: number;
+        visibleIndex: number;
+        _children: /*elided*/ any[];
+        _count: number;
+        _parent: /*elided*/ any;
+        _collapsed: boolean;
+        _hidden: boolean;
+        _filterState: FilterState;
+        _filterable: boolean;
+        _sortable: boolean;
+        populate(source: TreeNodeSource): void;
+        getSourceData(): TreeNodeSource;
+        get filterable(): boolean;
+        get sortable(): boolean;
+        get filterState(): FilterState;
+        set filterState(v: FilterState);
+        get hidden(): boolean;
+        set hidden(value: boolean);
+        get visible(): boolean;
+        get collapsed(): boolean;
+        set collapsed(value: boolean);
+        get parent(): /*elided*/ any;
+        set parent(parent: /*elided*/ any);
+        get children(): /*elided*/ any[];
+        set children(value: /*elided*/ any[]);
+        get hasChildren(): boolean;
+        set count(value: number);
+        get isLoaded(): boolean;
+        get isPartialyLoaded(): boolean;
+        get hasParent(): boolean;
+        get firstChild(): /*elided*/ any;
+        get lastChild(): /*elided*/ any;
+        addChild(child: /*elided*/ any): void;
+        insertChildren(children: /*elided*/ any[], index: number): void;
+        deleteChildren(index: number | /*elided*/ any[], count?: number): void;
+        expand(unhide?: boolean): void;
+        collapse(): void;
+        toggleCollapse(recursive?: boolean, unhide?: boolean): void;
+        clearChildren(): void;
+        walk(cb: (m: /*elided*/ any) => unknown | void): void;
+        walkVisible(cb: (m: /*elided*/ any) => unknown | void): void;
+        walkUp(cb: (m: /*elided*/ any) => unknown | void): void;
+        _sort(comparer: (a: /*elided*/ any, b: /*elided*/ any) => number): void;
+        sort(comparer: (a: /*elided*/ any, b: /*elided*/ any) => number): void;
+    };
+} & TBase;
+export type TreeNodeType = Mixin<typeof TreeNodeMixin>;
+export type LevelBasedTreeCreateOptions = {
+    reverse?: boolean;
+};
+export declare function buildLevelBasedTree(nodes: TreeNodeType[], root: TreeNodeType, options?: LevelBasedTreeCreateOptions): number;
+export declare function buildParentBasedTree(nodes: TreeNodeType[], root: TreeNodeType): number;
+export declare function buildTree(nodes: TreeNodeType[], root: TreeNodeType): number;
+//# sourceMappingURL=tree.d.ts.map

package/dist/common/tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.d.ts","sourceRoot":"","sources":["../../src/common/tree.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAE9C,oBAAY,WAAW;IACtB,QAAQ,IAAI;IACZ,OAAO,IAAI;IACX,YAAY,IAAI;IAChB,aAAa,IAAI;CACjB;AAED,uCAAuC;AACvC,MAAM,MAAM,cAAc,GAAG;IAC5B,4BAA4B;IAC5B,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,iBAAiB;IACjB,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,iBAAiB;IACjB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mBAAmB;IACnB,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,qBAAqB;IACrB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,8BAA8B;IAC9B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,sBAAsB;IACtB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,4DAA4D;IAC5D,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,8DAA8D;IAC9D,UAAU,CAAC,EAAE,OAAO,CAAC;CACrB,CAAA;AAOD,MAAM,MAAM,WAAW,CAAC,CAAC,GAAG,WAAW,IAAI,KAAK,GAAG,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AAEtE,wBAAgB,aAAa,CAAC,KAAK,SAAS,WAAW,EAAE,IAAI,GAAE,KAA6B;mBAFlC,GAAG,EAAE;eAKtD,MAAM;qBACA,MAAM;eACZ,MAAM;sBACC,MAAM;mBAET,gBAAU;gBACb,MAAM;;oBAEF,OAAO;iBACV,OAAO;sBACF,WAAW;qBACZ,OAAO;mBACT,OAAO;yBAED,cAAc;;;;2BAuBX,WAAW;2BAAX,WAAW;sBAEb,OAAO;0BAAP,OAAO;;yBAGJ,OAAO;6BAAP,OAAO;;;wBAGR,gBAAU;4BAAV,gBAAU;;yBAMZ,MAAM;;;;;;;iCAcC,gBAAU,SAAS,MAAM;8BAS5B,MAAM,GAAC,gBAAU,UAAU,MAAM;wBAgBvC,OAAO;;qDAQoB,OAAO;;iBAiBzC,CAAC,CAAC,gBAAU,KAAK,OAAO,GAAC,IAAI;wBAMtB,CAAC,CAAC,gBAAU,KAAK,OAAO,GAAC,IAAI;mBAUlC,CAAC,CAAC,gBAAU,KAAK,OAAO,GAAC,IAAI;wBAMxB,CAAC,CAAC,gBAAU,EAAE,CAAC,gBAAU,KAAK,MAAM;uBAOrC,CAAC,CAAC,gBAAU,EAAE,CAAC,gBAAU,KAAK,MAAM;;UAMpD;AAED,MAAM,MAAM,YAAY,GAAG,KAAK,CAAC,OAAO,aAAa,CAAC,CAAC;AAEvD,MAAM,MAAM,2BAA2B,GAAG;IACzC,OAAO,CAAC,EAAE,OAAO,CAAC;CAClB,CAAA;AAED,wBAAgB,mBAAmB,CAClC,KAAK,EAAE,YAAY,EAAE,EACrB,IAAI,EAAE,YAAY,EAClB,OAAO,CAAC,EAAE,2BAA2B,GACnC,MAAM,CA2BR;AAED,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM,CAUtF;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM,CAS3E"}

package/dist/common/tree.js

@@ -0,0 +1,204 @@
+export var FilterState;
+(function (FilterState) {
+    FilterState[FilterState["Filtered"] = 0] = "Filtered";
+    FilterState[FilterState["Matched"] = 1] = "Matched";
+    FilterState[FilterState["ChildMatched"] = 2] = "ChildMatched";
+    FilterState[FilterState["ParentMatched"] = 3] = "ParentMatched";
+})(FilterState || (FilterState = {}));
+class TreeNodeBase {
+    populate(_source) { }
+    getSourceData() { return {}; }
+}
+export function TreeNodeMixin(Base = TreeNodeBase) {
+    return class TreeNode extends Base {
+        constructor() {
+            super(...arguments);
+            this._children = [];
+            this._filterState = FilterState.Matched;
+        }
+        populate(source) {
+            super.populate(source);
+            if (!isNaN(source.i))
+                this.index = source.i;
+            this.level = source.level || source.l || 0;
+            this.parentIndex = source.p;
+            this._count = source.count;
+            this._hidden = source.hidden;
+            this._filterable = source.filterable;
+            this._sortable = source.sortable;
+            if (source.collapsed || source.count)
+                this._collapsed = true;
+        }
+        getSourceData() {
+            const data = super.getSourceData();
+            if (this.level > 0)
+                data.l = this.level;
+            if (this.parentIndex != null)
+                data.p = this.parentIndex;
+            if (this._collapsed != null)
+                data.collapsed = this._collapsed;
+            return data;
+        }
+        get filterable() { return this._filterable !== false; }
+        get sortable() { return this._sortable !== false; }
+        get filterState() { return this._filterState; }
+        set filterState(v) { this._filterState = v; }
+        get hidden() { return this._hidden; }
+        set hidden(value) { this._hidden = value; }
+        get visible() { return !this.hidden && this.filterState > 0; }
+        get collapsed() { return this._collapsed; }
+        set collapsed(value) { this._collapsed = value; }
+        set parent(parent) { this._parent = parent; }
+        get parent() { return this._parent; }
+        set children(value) {
+            this._children = value;
+            this._count = Math.max(this._count || 0, this._children.length);
+        }
+        get children() { return this._children; }
+        get hasChildren() { return this._children.length > 0 || this._count > 0; }
+        set count(value) { this._count = value; }
+        get isLoaded() { return this._count == null || this._count <= this._children.length; }
+        get isPartialyLoaded() { return this._children.length > 0 && this._count > this._children.length; }
+        get hasParent() { return this.parent ? this.parent.level > -1 : false; }
+        get firstChild() { return this.children[0]; }
+        get lastChild() { return this.children[this.children.length - 1]; }
+        addChild(child) {
+            this._children.push(child);
+            child.parent = this;
+            child.level = this.level + 1;
+            this._count = Math.max(this._count || 0, this._children.length);
+        }
+        insertChildren(children, index) {
+            this._children.splice(index, 0, ...children);
+            children.forEach(n => {
+                n.parent = this;
+                n.level = this.level + 1;
+            });
+            this._count = Math.max(this._count || 0, this._children.length);
+        }
+        deleteChildren(index, count) {
+            if (Array.isArray(index)) {
+                const stack = new Set();
+                index.forEach(ch => {
+                    ch.parent = null;
+                    stack.add(ch);
+                });
+                this._children = this._children.filter(ch => !stack.has(ch));
+                this._count -= index.length;
+            }
+            else {
+                count = count || 1;
+                this._children.splice(index, count);
+                this._count -= count;
+            }
+        }
+        expand(unhide) {
+            this._collapsed = false;
+            if (unhide && this.hasChildren) {
+                this.walk(ch => ch.hidden = false);
+            }
+        }
+        collapse() { this._collapsed = true; }
+        toggleCollapse(recursive = false, unhide) {
+            const expand = this._collapsed;
+            if (expand)
+                this.expand(unhide);
+            else
+                this.collapse();
+            if (recursive) {
+                if (expand)
+                    this.walk(ch => ch.expand(unhide));
+                else
+                    this.walk(ch => ch.collapse());
+            }
+        }
+        clearChildren() {
+            this._children.forEach(ch => ch.parent = null);
+            this._children = [];
+            this._count = null;
+        }
+        walk(cb) {
+            this._children.forEach(ch => {
+                if (cb(ch) !== false)
+                    ch.walk(cb);
+            });
+        }
+        walkVisible(cb) {
+            this._children.forEach(ch => {
+                if (ch.visible) {
+                    if (cb(ch) !== false && !ch.collapsed)
+                        ch.walkVisible(cb);
+                }
+                else {
+                    ch.walkVisible(cb);
+                }
+            });
+        }
+        walkUp(cb) {
+            if (this._parent) {
+                if (cb(this._parent) !== false)
+                    this._parent.walkUp(cb);
+            }
+        }
+        _sort(comparer) {
+            if (this.hasChildren) {
+                this._children.sort(comparer);
+                this._children.forEach(ch => ch._sort(comparer));
+            }
+        }
+        sort(comparer) {
+            // use physical index for sorting if one or both nodes are not sortable
+            this._sort((a, b) => a.sortable && b.sortable ? comparer(a, b) : (a.index - b.index));
+        }
+    };
+}
+export function buildLevelBasedTree(nodes, root, options) {
+    // [node, originalLevel]
+    // levels are beeing normalized, so it is necessary to remember the original level during tree building
+    const parents = [[root, -1]];
+    let prev;
+    let prevLevel = -1;
+    let maxLevel = -1;
+    let nodeLevel = 0;
+    if (options?.reverse)
+        nodes = [...nodes].reverse();
+    root._children = [];
+    root._parent = null;
+    nodes.forEach(node => {
+        node._children = [];
+        node._parent = null;
+        nodeLevel = node.level + root.level + 1;
+        if (prev && prevLevel < nodeLevel)
+            parents.push([prev, prevLevel]);
+        while (parents[parents.length - 1][1] >= nodeLevel)
+            parents.pop();
+        prevLevel = nodeLevel;
+        parents[parents.length - 1][0].addChild(node);
+        maxLevel = Math.max(maxLevel, node.level + (node.hasChildren ? 1 : 0));
+        prev = node;
+    });
+    return maxLevel;
+}
+export function buildParentBasedTree(nodes, root) {
+    let maxLevel = -1;
+    nodes.forEach(node => {
+        (node.parentIndex == null ? root : nodes[node.parentIndex]).addChild(node);
+    });
+    root.walk(node => {
+        node.level = node.parent ? node.parent.level + 1 : 0;
+        maxLevel = Math.max(maxLevel, node.level);
+    });
+    return maxLevel;
+}
+export function buildTree(nodes, root) {
+    if (nodes.length > 0) {
+        if (nodes[0].level == null) {
+            return buildParentBasedTree(nodes, root);
+        }
+        else {
+            return buildLevelBasedTree(nodes, root);
+        }
+    }
+    return -1;
+}
+//# sourceMappingURL=tree.js.map

package/dist/common/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sourceRoot":"","sources":["../../src/common/tree.ts"],"names":[],"mappings":"AAGA,MAAM,CAAN,IAAY,WAKX;AALD,WAAY,WAAW;IACtB,qDAAY,CAAA;IACZ,mDAAW,CAAA;IACX,6DAAgB,CAAA;IAChB,+DAAiB,CAAA;AAClB,CAAC,EALW,WAAW,KAAX,WAAW,QAKtB;AAwBD,MAAM,YAAY;IACjB,QAAQ,CAAC,OAAuB,IAAgB,CAAC;IACjD,aAAa,KAAqB,OAAO,EAAE,CAAA,CAAC,CAAC;CAC7C;AAID,MAAM,UAAU,aAAa,CAA4B,OAAc,YAAqB;IAC3F,OAAO,MAAM,QAAS,SAAQ,IAAI;QAA3B;;YAON,cAAS,GAAe,EAAE,CAAC;YAK3B,iBAAY,GAAgB,WAAW,CAAC,OAAO,CAAC;QA2IjD,CAAC;QAvIA,QAAQ,CAAC,MAAsB;YAC9B,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;gBAAE,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC;YAC5C,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,CAAC,CAAC;YAC5B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;YAC3B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;YAC7B,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC;YACrC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAC;YACjC,IAAI,MAAM,CAAC,SAAS,IAAI,MAAM,CAAC,KAAK;gBAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QAC9D,CAAC;QAED,aAAa;YACZ,MAAM,IAAI,GAAG,KAAK,CAAC,aAAa,EAAoB,CAAC;YACrD,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC;gBAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;YACxC,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI;gBAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;YACxD,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI;gBAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC;YAC9D,OAAO,IAAI,CAAC;QACb,CAAC;QAED,IAAI,UAAU,KAAK,OAAO,IAAI,CAAC,WAAW,KAAK,KAAK,CAAA,CAAC,CAAC;QACtD,IAAI,QAAQ,KAAK,OAAO,IAAI,CAAC,SAAS,KAAK,KAAK,CAAA,CAAC,CAAC;QAClD,IAAI,WAAW,KAAK,OAAO,IAAI,CAAC,YAAY,CAAA,CAAC,CAAC;QAC9C,IAAI,WAAW,CAAC,CAAe,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,CAAA,CAAC,CAAC;QAC1D,IAAI,MAAM,KAAK,OAAO,IAAI,CAAC,OAAO,CAAA,CAAC,CAAC;QACpC,IAAI,MAAM,CAAC,KAAc,IAAI,IAAI,CAAC,OAAO,GAAG,KAAK,CAAA,CAAC,CAAC;QACnD,IAAI,OAAO,KAAK,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,CAAA,CAAC,CAAC;QAC7D,IAAI,SAAS,KAAK,OAAO,IAAI,CAAC,UAAU,CAAA,CAAC,CAAC;QAC1C,IAAI,SAAS,CAAC,KAAc,IAAI,IAAI,CAAC,UAAU,GAAG,KAAK,CAAA,CAAC,CAAC;QACzD,IAAI,MAAM,CAAC,MAAgB,IAAI,IAAI,CAAC,OAAO,GAAG,MAAM,CAAA,CAAC,CAAC;QACtD,IAAI,MAAM,KAAK,OAAO,IAAI,CAAC,OAAO,CAAA,CAAC,CAAC;QACpC,IAAI,QAAQ,CAAC,KAAiB;YAC7B,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,QAAQ,KAAK,OAAO,IAAI,CAAC,SAAS,CAAA,CAAC,CAAC;QACxC,IAAI,WAAW,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA,CAAC,CAAC;QACzE,IAAI,KAAK,CAAE,KAAa,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA,CAAC,CAAC;QACjD,IAAI,QAAQ,KAAK,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAA,CAAC,CAAC;QACrF,IAAI,gBAAgB,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAA,CAAC,CAAC;QAClG,IAAI,SAAS,KAAK,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA,CAAC,CAAC;QACvE,IAAI,UAAU,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA,CAAC,CAAC;QAC5C,IAAI,SAAS,KAAK,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA,CAAC,CAAC;QAElE,QAAQ,CAAC,KAAe;YACvB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;YACpB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;YAC7B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACjE,CAAC;QAED,cAAc,CAAC,QAAoB,EAAE,KAAa;YACjD,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,QAAQ,CAAC,CAAC;YAC7C,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBACpB,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;gBAChB,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAA;YACzB,CAAC,CAAC,CAAC;YACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACjE,CAAC;QAED,cAAc,CAAC,KAAwB,EAAE,KAAc;YACtD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAY,CAAC;gBAClC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;oBAClB,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC;oBACjB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACf,CAAC,CAAC,CAAC;gBACH,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7D,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC;YAC7B,CAAC;iBAAM,CAAC;gBACP,KAAK,GAAG,KAAK,IAAI,CAAC,CAAC;gBACnB,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAe,EAAE,KAAK,CAAC,CAAC;gBAC9C,IAAI,CAAC,MAAM,IAAI,KAAK,CAAC;YACtB,CAAC;QACF,CAAC;QAED,MAAM,CAAC,MAAgB;YACtB,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;YACxB,IAAI,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAChC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;YACpC,CAAC;QACF,CAAC;QACD,QAAQ,KAAK,IAAI,CAAC,UAAU,GAAG,IAAI,CAAA,CAAC,CAAC;QAErC,cAAc,CAAC,SAAS,GAAG,KAAK,EAAE,MAAgB;YACjD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;YAC/B,IAAI,MAAM;gBAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;;gBAC3B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAErB,IAAI,SAAS,EAAE,CAAC;gBACf,IAAI,MAAM;oBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;;oBAC1C,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC;YACrC,CAAC;QACF,CAAC;QAED,aAAa;YACZ,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;YAC/C,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;YACpB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACpB,CAAC;QAED,IAAI,CAAC,EAAiC;YACrC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;gBAC3B,IAAI,EAAE,CAAC,EAAE,CAAC,KAAK,KAAK;oBAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC,CAAC,CAAC;QACJ,CAAC;QAED,WAAW,CAAC,EAAiC;YAC5C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;gBAC3B,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;oBAChB,IAAI,EAAE,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,EAAE,CAAC,SAAS;wBAAE,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;gBAC3D,CAAC;qBAAM,CAAC;oBACP,EAAE,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;gBACpB,CAAC;YACF,CAAC,CAAC,CAAC;QACJ,CAAC;QAED,MAAM,CAAC,EAAiC;YACvC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBAClB,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK;oBAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACzD,CAAC;QACF,CAAC;QAED,KAAK,CAAC,QAA8C;YACnD,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC9B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;YAClD,CAAC;QACF,CAAC;QAED,IAAI,CAAC,QAA8C;YAClD,uEAAuE;YACvE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAW,EAAE,CAAW,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3G,CAAC;KAED,CAAA;AACF,CAAC;AAQD,MAAM,UAAU,mBAAmB,CAClC,KAAqB,EACrB,IAAkB,EAClB,OAAqC;IAGrC,wBAAwB;IACxB,uGAAuG;IACvG,MAAM,OAAO,GAAoC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9D,IAAI,IAAkB,CAAC;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;IACnB,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,IAAI,OAAO,EAAE,OAAO;QAAE,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;IAEnD,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;IACpB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACpB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACpB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QAEpB,SAAS,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACxC,IAAI,IAAI,IAAI,SAAS,GAAG,SAAS;YAAE,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QACnE,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS;YAAE,OAAO,CAAC,GAAG,EAAE,CAAC;QAClE,SAAS,GAAG,SAAS,CAAC;QACtB,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9C,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvE,IAAI,GAAG,IAAI,CAAC;IACb,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,KAAqB,EAAE,IAAkB;IAC7E,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC;IAClB,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACpB,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IACH,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;QAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IACH,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,KAAqB,EAAE,IAAkB;IAClE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,EAAE,CAAC;YAC5B,OAAO,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACP,OAAO,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACzC,CAAC;IACF,CAAC;IACD,OAAO,CAAC,CAAC,CAAC;AACX,CAAC","sourcesContent":["/* eslint-disable @typescript-eslint/no-explicit-any */\nimport { Populatable, Mixin } from \"../types\";\n\nexport enum FilterState {\n\tFiltered = 0,\n\tMatched = 1,\n\tChildMatched = 2,\n\tParentMatched = 3\n}\n\n/** Source object type for tree node */\nexport type TreeNodeSource = {\n\t/** node index (readonly) */\n\ti?: number,\n\t/** node level */\n\tl?: number,\n\t/** node level */\n\tlevel?: number,\n\t/** parent index */\n\tp?: number,\n\t/** children count */\n\tcount?: number,\n\t/** initital collapse state */\n\tcollapsed?: boolean,\n\t/** node visibility */\n\thidden?: boolean,\n\t/** false for excluding node from sorting, default = true */\n\tsortable?: boolean,\n\t/** false for excluding node from filtering, default = true */\n\tfilterable?: boolean,\n}\n\nclass TreeNodeBase implements Populatable {\n\tpopulate(_source: TreeNodeSource) { /* empty */ }\n\tgetSourceData(): TreeNodeSource { return {} }\n}\n\nexport type Constructor<A = Populatable> = new (...input: any[]) => A;\n\nexport function TreeNodeMixin<TBase extends Constructor>(Base: TBase = TreeNodeBase as TBase) {\n\treturn class TreeNode extends Base {\n\n\t\tindex: number;\n\t\tparentIndex: number;\n\t\tlevel: number;\n\t\tvisibleIndex: number;\n\n\t\t_children: TreeNode[] = [];\n\t\t_count: number;\n\t\t_parent: TreeNode;\n\t\t_collapsed: boolean;\n\t\t_hidden: boolean;\n\t\t_filterState: FilterState = FilterState.Matched;\n\t\t_filterable: boolean;\n\t\t_sortable: boolean;\n\n\t\tpopulate(source: TreeNodeSource) {\n\t\t\tsuper.populate(source);\n\t\t\tif (!isNaN(source.i)) this.index = source.i;\n\t\t\tthis.level = source.level || source.l || 0;\n\t\t\tthis.parentIndex = source.p;\n\t\t\tthis._count = source.count;\n\t\t\tthis._hidden = source.hidden;\n\t\t\tthis._filterable = source.filterable;\n\t\t\tthis._sortable = source.sortable;\n\t\t\tif (source.collapsed || source.count) this._collapsed = true;\n\t\t}\n\n\t\tgetSourceData() {\n\t\t\tconst data = super.getSourceData() as TreeNodeSource;\n\t\t\tif (this.level > 0) data.l = this.level;\n\t\t\tif (this.parentIndex != null) data.p = this.parentIndex;\n\t\t\tif (this._collapsed != null) data.collapsed = this._collapsed;\n\t\t\treturn data;\n\t\t}\n\n\t\tget filterable() { return this._filterable !== false }\n\t\tget sortable() { return this._sortable !== false }\n\t\tget filterState() { return this._filterState }\n\t\tset filterState(v : FilterState) { this._filterState = v }\n\t\tget hidden() { return this._hidden }\n\t\tset hidden(value: boolean) { this._hidden = value }\n\t\tget visible() { return !this.hidden && this.filterState > 0 }\n\t\tget collapsed() { return this._collapsed }\n\t\tset collapsed(value: boolean) { this._collapsed = value }\n\t\tset parent(parent: TreeNode) { this._parent = parent }\n\t\tget parent() { return this._parent }\n\t\tset children(value: TreeNode[]) { \n\t\t\tthis._children = value;\n\t\t\tthis._count = Math.max(this._count || 0, this._children.length);\n\t\t}\n\t\tget children() { return this._children }\n\t\tget hasChildren() { return this._children.length > 0 || this._count > 0 }\n\t\tset count (value: number) { this._count = value }\n\t\tget isLoaded() { return this._count == null || this._count <= this._children.length }\n\t\tget isPartialyLoaded() { return this._children.length > 0 && this._count > this._children.length }\n\t\tget hasParent() { return this.parent ? this.parent.level > -1 : false }\n\t\tget firstChild() { return this.children[0] }\n\t\tget lastChild() { return this.children[this.children.length - 1] }\n\n\t\taddChild(child: TreeNode) {\n\t\t\tthis._children.push(child);\n\t\t\tchild.parent = this;\n\t\t\tchild.level = this.level + 1;\n\t\t\tthis._count = Math.max(this._count || 0, this._children.length);\n\t\t}\n\n\t\tinsertChildren(children: TreeNode[], index: number) {\n\t\t\tthis._children.splice(index, 0, ...children);\n\t\t\tchildren.forEach(n => {\n\t\t\t\tn.parent = this;\n\t\t\t\tn.level = this.level + 1\n\t\t\t});\n\t\t\tthis._count = Math.max(this._count || 0, this._children.length);\n\t\t}\n\n\t\tdeleteChildren(index: number|TreeNode[], count?: number) {\n\t\t\tif (Array.isArray(index)) {\n\t\t\t\tconst stack = new Set<TreeNode>();\n\t\t\t\tindex.forEach(ch => {\n\t\t\t\t\tch.parent = null;\n\t\t\t\t\tstack.add(ch);\n\t\t\t\t});\n\t\t\t\tthis._children = this._children.filter(ch => !stack.has(ch));\n\t\t\t\tthis._count -= index.length;\n\t\t\t} else {\n\t\t\t\tcount = count || 1;\n\t\t\t\tthis._children.splice(index as number, count);\n\t\t\t\tthis._count -= count;\n\t\t\t}\n\t\t}\n\n\t\texpand(unhide?: boolean) {\n\t\t\tthis._collapsed = false;\n\t\t\tif (unhide && this.hasChildren) {\n\t\t\t\tthis.walk(ch => ch.hidden = false);\n\t\t\t}\n\t\t}\n\t\tcollapse() { this._collapsed = true }\n\n\t\ttoggleCollapse(recursive = false, unhide?: boolean) {\n\t\t\tconst expand = this._collapsed;\n\t\t\tif (expand) this.expand(unhide);\n\t\t\telse this.collapse();\n\n\t\t\tif (recursive) {\n\t\t\t\tif (expand) this.walk(ch => ch.expand(unhide));\n\t\t\t\telse this.walk(ch => ch.collapse());\n\t\t\t}\n\t\t}\n\n\t\tclearChildren() {\n\t\t\tthis._children.forEach(ch => ch.parent = null);\n\t\t\tthis._children = [];\n\t\t\tthis._count = null;\n\t\t}\n\n\t\twalk(cb: (m: TreeNode) => unknown|void) {\n\t\t\tthis._children.forEach(ch => {\n\t\t\t\tif (cb(ch) !== false) ch.walk(cb);\n\t\t\t});\n\t\t}\n\n\t\twalkVisible(cb: (m: TreeNode) => unknown|void) {\n\t\t\tthis._children.forEach(ch => {\n\t\t\t\tif (ch.visible) {\n\t\t\t\t\tif (cb(ch) !== false && !ch.collapsed) ch.walkVisible(cb);\n\t\t\t\t} else {\n\t\t\t\t\tch.walkVisible(cb);\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\n\t\twalkUp(cb: (m: TreeNode) => unknown|void) {\n\t\t\tif (this._parent) {\n\t\t\t\tif (cb(this._parent) !== false) this._parent.walkUp(cb);\n\t\t\t}\n\t\t}\n\n\t\t_sort(comparer: (a: TreeNode, b: TreeNode) => number) {\n\t\t\tif (this.hasChildren) {\n\t\t\t\tthis._children.sort(comparer);\n\t\t\t\tthis._children.forEach(ch => ch._sort(comparer));\n\t\t\t}\n\t\t}\n\n\t\tsort(comparer: (a: TreeNode, b: TreeNode) => number) {\n\t\t\t// use physical index for sorting if one or both nodes are not sortable\n\t\t\tthis._sort((a: TreeNode, b: TreeNode) => a.sortable && b.sortable ? comparer(a, b) : (a.index - b.index));\n\t\t}\n\n\t}\n}\n\nexport type TreeNodeType = Mixin<typeof TreeNodeMixin>;\n\nexport type LevelBasedTreeCreateOptions = {\n\treverse?: boolean,\n}\n\nexport function buildLevelBasedTree(\n\tnodes: TreeNodeType[],\n\troot: TreeNodeType,\n\toptions?: LevelBasedTreeCreateOptions\n): number {\n\ttype OriginalLevel = number;\n\t// [node, originalLevel]\n\t// levels are beeing normalized, so it is necessary to remember the original level during tree building\n\tconst parents: [TreeNodeType, OriginalLevel][] = [[root, -1]];\n\tlet prev: TreeNodeType;\n\tlet prevLevel = -1;\n\tlet maxLevel = -1;\n\tlet nodeLevel = 0;\n\n\tif (options?.reverse) nodes = [...nodes].reverse();\n\n\troot._children = [];\n\troot._parent = null;\n\tnodes.forEach(node => {\n\t\tnode._children = [];\n\t\tnode._parent = null;\n\n\t\tnodeLevel = node.level + root.level + 1;\n\t\tif (prev && prevLevel < nodeLevel) parents.push([prev, prevLevel]);\n\t\twhile (parents[parents.length - 1][1] >= nodeLevel) parents.pop();\n\t\tprevLevel = nodeLevel;\n\t\tparents[parents.length - 1][0].addChild(node);\n\t\tmaxLevel = Math.max(maxLevel, node.level + (node.hasChildren ? 1 : 0));\n\t\tprev = node;\n\t});\n\treturn maxLevel;\n}\n\nexport function buildParentBasedTree(nodes: TreeNodeType[], root: TreeNodeType): number {\n\tlet maxLevel = -1;\n\tnodes.forEach(node => {\n\t\t(node.parentIndex == null ? root : nodes[node.parentIndex]).addChild(node);\n\t});\n\troot.walk(node => {\n\t\tnode.level = node.parent ? node.parent.level + 1 : 0;\n\t\tmaxLevel = Math.max(maxLevel, node.level);\n\t});\n\treturn maxLevel;\n}\n\nexport function buildTree(nodes: TreeNodeType[], root: TreeNodeType): number {\n\tif (nodes.length > 0) {\n\t\tif (nodes[0].level == null) {\n\t\t\treturn buildParentBasedTree(nodes, root);\n\t\t} else {\n\t\t\treturn buildLevelBasedTree(nodes, root);\n\t\t}\n\t}\n\treturn -1;\n}\n"]}

package/dist/common/utils.d.ts

@@ -0,0 +1,30 @@
+import { Matrix, Rect } from "../types";
+export declare function isBool(value: unknown): value is boolean;
+export declare function isObject(value: unknown): boolean;
+export declare function isFunction(value: unknown): boolean;
+export declare function isString(value: unknown): value is string;
+export declare function isNumericString(value: string): boolean;
+export declare function strToNum(str: string): number;
+export declare function isNumber(value: unknown): value is number;
+export declare function isCharLetter(char: string): boolean;
+export declare function ifNull<T>(value: T | null, def: T): T;
+export declare function mergeDeep<T>(...sources: Partial<T>[]): T;
+export declare function cloneDeep<T>(obj: T): T;
+export declare function clone(obj: any): any;
+export declare function trim(value: string, char: string): string;
+export declare function minmax(values: number[]): [number, number];
+export declare function minmax2d(...values: Matrix<number>[]): [number, number];
+export declare function removeAccents(str: string): string;
+export declare function isControlCharacter(charCode: string): boolean;
+export declare function escapeRegExp(value: string): string;
+export declare function intersect<T>(arr1: T[], arr2: T[]): T[];
+export declare function rectIntersect(r1: Rect, r2: Rect): Rect;
+/**
+ * Binds a method to a context and optionally executes a callback with the result.
+ * @param {any} context - The context to bind the method to.
+ * @param {Function} method - The method to bind.
+ * @param {Function} [callback] - Optional callback to execute with the result of the method.
+ * @returns {Function} A new function that, when called, will execute the method with the bound context.
+ */
+export declare function bind<T extends (...args: any[]) => any>(context: any, method: T, callback?: (result: ReturnType<T>, ...args: Parameters<T>) => void): (...args: Parameters<T>) => ReturnType<T>;
+//# sourceMappingURL=utils.d.ts.map

package/dist/common/utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../src/common/utils.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AAExC,wBAAgB,MAAM,CAAC,KAAK,EAAE,OAAO,oBAEpC;AAED,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,WAEtC;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,WAExC;AAED,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,mBAEtC;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,WAW5C;AAED,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,UAEnC;AAED,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,mBAEtC;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,WAExC;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAC,IAAI,EAAE,GAAG,EAAE,CAAC,KAE9C;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAqBxD;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,KAElC;AAED,wBAAgB,KAAK,CAAC,GAAG,EAAE,GAAG,OAE7B;AAED,wBAAgB,IAAI,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,UAK/C;AAED,wBAAgB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,GAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAS1D;AAED,wBAAgB,QAAQ,CAAC,GAAG,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,EAAE,GAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CASvE;AAED,wBAAgB,aAAa,CAAC,GAAG,EAAE,MAAM,UAExC;AAKD,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,WAElD;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,UAEzC;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAEtD;AAED,wBAAgB,aAAa,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,GAAG,IAAI,CAWtD;AAED;;;;;;GAMG;AACH,wBAAgB,IAAI,CAAC,CAAC,SAAS,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,GAAG,EACrD,OAAO,EAAE,GAAG,EACZ,MAAM,EAAE,CAAC,EACT,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,IAAI,GAChE,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,KAAK,UAAU,CAAC,CAAC,CAAC,CAM3C"}