@visactor/vrender-core 0.16.0-alpha.0

package/es/graphic/node-tree.js

@@ -0,0 +1,351 @@
+var __awaiter = this && this.__awaiter || function(thisArg, _arguments, P, generator) {
+    return new (P || (P = Promise))((function(resolve, reject) {
+        function fulfilled(value) {
+            try {
+                step(generator.next(value));
+            } catch (e) {
+                reject(e);
+            }
+        }
+        function rejected(value) {
+            try {
+                step(generator.throw(value));
+            } catch (e) {
+                reject(e);
+            }
+        }
+        function step(result) {
+            var value;
+            result.done ? resolve(result.value) : (value = result.value, value instanceof P ? value : new P((function(resolve) {
+                resolve(value);
+            }))).then(fulfilled, rejected);
+        }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    }));
+};
+
+import { EventEmitter, isBoolean, isFunction, isObject } from "@visactor/vutils";
+
+import { Generator } from "../common/generator";
+
+export class Node extends EventEmitter {
+    get previousSibling() {
+        return this._prev;
+    }
+    get nextSibling() {
+        return this._next;
+    }
+    get children() {
+        return this.getChildren();
+    }
+    get firstChild() {
+        return this._firstChild;
+    }
+    get lastChild() {
+        return this._lastChild;
+    }
+    get count() {
+        return this._count;
+    }
+    get childrenCount() {
+        return this._idMap ? this._idMap.size : 0;
+    }
+    constructor() {
+        super(), this._uid = Generator.GenAutoIncrementId(), this._firstChild = null, this._lastChild = null, 
+        this.parent = null, this._count = 1;
+    }
+    forEachChildren(cb, reverse = !1) {
+        if (reverse) {
+            let child = this._lastChild, i = 0;
+            for (;child; ) {
+                if (cb(child, i++)) return;
+                child = child._prev;
+            }
+        } else {
+            let child = this._firstChild, i = 0;
+            for (;child; ) {
+                if (cb(child, i++)) return;
+                child = child._next;
+            }
+        }
+    }
+    forEachChildrenAsync(cb, reverse = !1) {
+        return __awaiter(this, void 0, void 0, (function*() {
+            if (reverse) {
+                let child = this._lastChild, i = 0;
+                for (;child; ) {
+                    let breakTag = cb(child, i++);
+                    if (breakTag.then && (breakTag = yield breakTag), breakTag) return;
+                    child = child._prev;
+                }
+            } else {
+                let child = this._firstChild, i = 0;
+                for (;child; ) {
+                    let breakTag = cb(child, i++);
+                    if (breakTag.then && (breakTag = yield breakTag), breakTag) return;
+                    child = child._next;
+                }
+            }
+        }));
+    }
+    forEach(cb) {
+        return this.forEachChildren(cb);
+    }
+    appendChild(node) {
+        if (this._uid === node._uid) return null;
+        if (node.isAncestorsOf(this)) throw new Error("【Node::appendChild】不能将父辈元素append为子元素");
+        return node.parent && node.parent.removeChild(node), node.parent = this, this._lastChild ? (this._lastChild._next = node, 
+        node._prev = this._lastChild, this._lastChild = node) : (this._firstChild = this._lastChild = node, 
+        node._prev = node._next = null), this._idMap || (this._idMap = new Map), this._idMap.set(node._uid, node), 
+        this.setCount(node.count), this._structEdit = !0, node;
+    }
+    appendChildArrHighPerformance(nodes, replace = !1) {
+        return console.error("暂不支持该函数"), nodes;
+    }
+    insertBefore(newNode, referenceNode) {
+        if (!referenceNode) return this.appendChild(newNode);
+        if (this._uid === newNode._uid) return null;
+        if (newNode.isAncestorsOf(this)) throw new Error("【Node::insertBefore】不能将父辈元素insert为子元素");
+        return referenceNode.parent !== this ? null : (newNode.parent && newNode.parent.removeChild(newNode), 
+        newNode.parent = this, newNode._prev = referenceNode._prev, referenceNode._prev ? referenceNode._prev._next = newNode : this._firstChild = newNode, 
+        referenceNode._prev = newNode, newNode._next = referenceNode, this._idMap || (this._idMap = new Map), 
+        this._idMap.set(newNode._uid, newNode), this._structEdit = !0, this.setCount(newNode.count), 
+        newNode);
+    }
+    insertAfter(newNode, referenceNode) {
+        if (!referenceNode) return this.appendChild(newNode);
+        if (this._uid === newNode._uid) return null;
+        if (newNode.isAncestorsOf(this)) throw new Error("【Node::insertAfter】不能将父辈元素insert为子元素");
+        return referenceNode.parent !== this ? null : (newNode.parent && newNode.parent.removeChild(newNode), 
+        newNode.parent = this, referenceNode._next ? (referenceNode._next._prev = newNode, 
+        newNode._next = referenceNode._next) : this._lastChild = newNode, referenceNode._next = newNode, 
+        newNode._prev = referenceNode, this._idMap || (this._idMap = new Map), this._idMap.set(newNode._uid, newNode), 
+        this._structEdit = !0, this.setCount(newNode.count), newNode);
+    }
+    insertInto(newNode, idx) {
+        if (!this._ignoreWarn && this._nodeList && console.warn("insertIntoKeepIdx和insertInto混用可能会存在错误"), 
+        idx >= this.childrenCount) return this.appendChild(newNode);
+        if (this._uid === newNode._uid) return null;
+        if (newNode.isAncestorsOf(this)) throw new Error("【Node::insertBefore】不能将父辈元素insert为子元素");
+        if (newNode.parent && newNode.parent.removeChild(newNode), newNode.parent = this, 
+        0 === idx) newNode._next = this._firstChild, this._firstChild && (this._firstChild._prev = newNode), 
+        newNode._prev = null, this._firstChild = newNode; else {
+            let child = this._firstChild;
+            for (let i = 0; i < idx; i++) {
+                if (!child) return null;
+                i > 0 && (child = child._next);
+            }
+            if (!child) return null;
+            newNode._next = child._next, newNode._prev = child, child._next = newNode, newNode._next && (newNode._next._prev = newNode);
+        }
+        return this._idMap || (this._idMap = new Map), this._idMap.set(newNode._uid, newNode), 
+        this._structEdit = !0, this.setCount(newNode.count), newNode;
+    }
+    insertIntoKeepIdx(newNode, idx) {
+        if (this._nodeList || (this._nodeList = this.children), this._nodeList[idx]) {
+            const node = this._nodeList[idx];
+            return this._nodeList.splice(idx, 0, newNode), this.insertBefore(newNode, node);
+        }
+        let node;
+        this._nodeList[idx] = newNode;
+        for (let i = idx - 1; i >= 0 && (node = this._nodeList[i], !node); i--) ;
+        if (node) return node._next ? this.insertBefore(newNode, node._next) : this.appendChild(newNode);
+        this._ignoreWarn = !0;
+        const data = this.insertInto(newNode, 0);
+        return this._ignoreWarn = !1, data;
+    }
+    removeChild(child) {
+        if (!this._idMap) return null;
+        if (!this._idMap.has(child._uid)) return null;
+        if (this._idMap.delete(child._uid), this._nodeList) {
+            const idx = this._nodeList.findIndex((n => n === child));
+            idx > 0 && this._nodeList.splice(idx, 1);
+        }
+        return child._prev ? child._prev._next = child._next : this._firstChild = child._next, 
+        child._next ? child._next._prev = child._prev : this._lastChild = child._prev, child.parent = null, 
+        child._prev = null, child._next = null, this._structEdit = !0, this.setCount(-child.count), 
+        child;
+    }
+    delete() {
+        this.parent && this.parent.removeChild(this);
+    }
+    removeAllChild() {
+        if (!this._idMap) return;
+        let child = this._firstChild;
+        for (;child; ) child.parent = null, child._prev = null, child._next = null, child = child._next;
+        this._firstChild = null, this._lastChild = null, this._idMap.clear(), this._structEdit = !0, 
+        this.setCount(1 - this._count);
+    }
+    replaceChild(newChild, oldChild) {
+        throw new Error("暂不支持");
+    }
+    find(callback, deep = !1) {
+        let target = null;
+        return this.forEachChildren(((node, index) => !(node === this || !callback(node, index)) && (target = node, 
+        !0))), deep && this.forEachChildren((child => {
+            if (child.isContainer) {
+                const node = child.find(callback, !0);
+                if (node) return target = node, !0;
+            }
+            return !1;
+        })), target;
+    }
+    findAll(callback, deep = !1) {
+        let nodes = [];
+        return this.forEachChildren(((node, index) => {
+            node !== this && callback(node, index) && nodes.push(node);
+        })), deep && this.forEachChildren((child => {
+            if (child.isContainer) {
+                const targets = child.findAll(callback, !0);
+                targets.length && (nodes = nodes.concat(targets));
+            }
+        })), nodes;
+    }
+    getElementById(id) {
+        return this.find((node => node.id === id), !0);
+    }
+    findChildById(id) {
+        return this.getElementById(id);
+    }
+    findChildByUid(uid) {
+        return this._idMap && this._idMap.get(uid) || null;
+    }
+    getElementsByName(name) {
+        return this.findAll((node => node.name === name), !0);
+    }
+    findChildrenByName(name) {
+        return this.getElementsByName(name);
+    }
+    getElementsByType(type) {
+        return this.findAll((node => node.type === type), !0);
+    }
+    getChildByName(name, deep = !1) {
+        return this.find((node => node.name === name), deep);
+    }
+    getChildAt(idx) {
+        let c = this._firstChild;
+        if (!c) return null;
+        for (let i = 0; i < idx; i++) {
+            if (!c._next) return null;
+            c = c._next;
+        }
+        return c;
+    }
+    at(idx) {
+        return this.getChildAt(idx);
+    }
+    containNode(node) {
+        if (!this._idMap) return !1;
+        if (this._idMap.has(node._uid)) return !0;
+        let child = this._firstChild;
+        for (;child; ) {
+            if (child.containNode(node)) return !0;
+            child = child._next;
+        }
+        return !1;
+    }
+    getRootNode() {
+        let parent = this.parent;
+        for (;null == parent ? void 0 : parent.parent; ) parent = parent.parent;
+        return parent || this;
+    }
+    hasChildNodes() {
+        return null !== this._firstChild;
+    }
+    addChild(node) {
+        return this.appendChild(node);
+    }
+    add(node) {
+        return this.appendChild(node);
+    }
+    getChildren() {
+        const nodes = [];
+        let child = this._firstChild;
+        for (;child; ) nodes.push(child), child = child._next;
+        return nodes;
+    }
+    isChildOf(node) {
+        return !!this.parent && this.parent._uid === node._uid;
+    }
+    isParentOf(node) {
+        return node.isChildOf(this);
+    }
+    isDescendantsOf(node) {
+        let parent = this.parent;
+        if (!parent) return !1;
+        do {
+            if (parent._uid === node._uid) return !0;
+            parent = parent.parent;
+        } while (null !== parent);
+        return !1;
+    }
+    isAncestorsOf(node) {
+        return node.isDescendantsOf(this);
+    }
+    getAncestor(idx) {
+        throw new Error("暂不支持");
+    }
+    setAllDescendantsProps(propsName, propsValue) {
+        let child = this._firstChild;
+        for (;child; ) child[propsName] = propsValue, child.setAllDescendantsProps(propsName, propsValue), 
+        child = child._next;
+    }
+    setCount(deltaCount) {
+        this._count += deltaCount;
+        let parent = this.parent;
+        if (parent) do {
+            parent._count += deltaCount, parent = parent.parent;
+        } while (null !== parent);
+    }
+    clone() {
+        throw new Error("暂不支持");
+    }
+    cloneTo(node) {
+        throw new Error("暂不支持");
+    }
+    getParent() {
+        return this.parent;
+    }
+    del(child) {
+        return this.removeChild(child);
+    }
+    addEventListener(type, listener, options) {
+        const capture = isBoolean(options, !0) && options || isObject(options) && options.capture, once = isObject(options) && options.once, context = isFunction(listener) ? void 0 : listener;
+        return type = capture ? `${type}capture` : type, listener = isFunction(listener) ? listener : listener.handleEvent, 
+        once ? super.once(type, listener, context) : super.on(type, listener, context), 
+        this;
+    }
+    on(type, listener, options) {
+        return this.addEventListener(type, listener, options);
+    }
+    removeEventListener(type, listener, options) {
+        const capture = isBoolean(options, !0) && options || isObject(options) && options.capture, context = isFunction(listener) ? void 0 : listener;
+        type = capture ? `${type}capture` : type, listener = isFunction(listener) ? listener : listener.handleEvent;
+        const once = isObject(options) && options.once;
+        return super.off(type, listener, context, once), this;
+    }
+    off(type, listener, options) {
+        return this.removeEventListener(type, listener, options);
+    }
+    once(type, listener, options) {
+        return isObject(options) ? (options.once = !0, this.addEventListener(type, listener, options)) : this.addEventListener(type, listener, {
+            once: !0
+        });
+    }
+    removeAllEventListeners() {
+        return super.removeAllListeners(), this;
+    }
+    removeAllListeners() {
+        return this.removeAllEventListeners();
+    }
+    dispatchEvent(event, ...args) {
+        return super.emit(event.type, event, ...args), !event.defaultPrevented;
+    }
+    emit(event, data) {
+        return this.dispatchEvent(event, data);
+    }
+    release() {
+        this.removeAllListeners();
+    }
+}
+//# sourceMappingURL=node-tree.js.map

package/es/graphic/node-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graphic/node-tree.ts"],"names":[],"mappings":";;;;;;;;;AACA,OAAO,EAAE,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AACjF,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAGhD,MAAM,OAAO,IAAK,SAAQ,YAAsB;IAkB9C,IAAI,eAAe;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAC5B,CAAC;IACD,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IACD,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IACD,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD,IAAI,aAAa;QACf,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,CAAC,CAAC;SACV;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAKD;QACE,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC,kBAAkB,EAAE,CAAC;QAC3C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,eAAe,CAA0B,EAA8C,EAAE,UAAmB,KAAK;QAC/G,IAAI,OAAO,EAAE;YACX,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;YAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,KAAK,EAAE;gBACZ,MAAM,QAAQ,GAAG,EAAE,CAAC,KAAU,EAAE,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE;oBACZ,OAAO;iBACR;gBACD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;aACrB;SACF;aAAM;YACL,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,KAAK,EAAE;gBACZ,MAAM,QAAQ,GAAG,EAAE,CAAC,KAAU,EAAE,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,QAAQ,EAAE;oBACZ,OAAO;iBACR;gBACD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;aACrB;SACF;IACH,CAAC;IAEK,oBAAoB,CACxB,EAAwE,EACxE,UAAmB,KAAK;;YAExB,IAAI,OAAO,EAAE;gBACX,IAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;gBAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,OAAO,KAAK,EAAE;oBACZ,IAAI,QAAQ,GAAG,EAAE,CAAC,KAAU,EAAE,CAAC,EAAE,CAAC,CAAC;oBACnC,IAAK,QAAgB,CAAC,IAAI,EAAE;wBAC1B,QAAQ,GAAG,MAAM,QAAQ,CAAC;qBAC3B;oBACD,IAAI,QAAQ,EAAE;wBACZ,OAAO;qBACR;oBACD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;iBACrB;aACF;iBAAM;gBACL,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;gBAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;gBACV,OAAO,KAAK,EAAE;oBACZ,IAAI,QAAQ,GAAG,EAAE,CAAC,KAAU,EAAE,CAAC,EAAE,CAAC,CAAC;oBACnC,IAAK,QAAgB,CAAC,IAAI,EAAE;wBAC1B,QAAQ,GAAG,MAAM,QAAQ,CAAC;qBAC3B;oBACD,IAAI,QAAQ,EAAE;wBACZ,OAAO;qBACR;oBACD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;iBACrB;aACF;QACH,CAAC;KAAA;IAED,OAAO,CAA0B,EAAoC;QACnE,OAAO,IAAI,CAAC,eAAe,CAAI,EAAE,CAAC,CAAC;IACrC,CAAC;IAQD,WAAW,CAAC,IAAW;QACrB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;YAC3B,OAAO,IAAI,CAAC;SACb;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;SACzD;QAGD,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,CAAC,MAAM,GAAG,IAAuB,CAAC;QAEtC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE;YACpB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YAC1C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;SAChC;aAAM;YACL,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,IAAI,CAAC;YAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC;YAC7B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SACxB;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;SACzB;QACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAEjC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,OAAO,IAAI,CAAC;IACd,CAAC;IAOD,6BAA6B,CAAC,KAAc,EAAE,UAAmB,KAAK;QACpE,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAEzB,OAAO,KAAK,CAAC;IACf,CAAC;IAUD,YAAY,CAAC,OAAc,EAAE,aAAgC;QAC3D,IAAI,CAAC,aAAa,EAAE;YAClB,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;SAClC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,EAAE;YAC9B,OAAO,IAAI,CAAC;SACb;QACD,IAAI,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;YAC/B,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;SAC1D;QACD,IAAI,aAAa,CAAC,MAAM,KAAM,IAAwB,EAAE;YACtD,OAAO,IAAI,CAAC;SACb;QAED,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACtD,OAAO,CAAC,MAAM,GAAG,IAAuB,CAAC;QAEzC,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC;QACpC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE;YACxB,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC;SAC5B;aAAM;YACL,aAAa,CAAC,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC;SACrC;QACD,aAAa,CAAC,KAAK,GAAG,OAAO,CAAC;QAC9B,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;SACzB;QACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAEvC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE7B,OAAO,OAAO,CAAC;IACjB,CAAC;IAUD,WAAW,CAAC,OAAc,EAAE,aAAgC;QAC1D,IAAI,CAAC,aAAa,EAAE;YAClB,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;SAClC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,EAAE;YAC9B,OAAO,IAAI,CAAC;SACb;QACD,IAAI,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;YAC/B,MAAM,IAAI,KAAK,CAAC,sCAAsC,CAAC,CAAC;SACzD;QACD,IAAI,aAAa,CAAC,MAAM,KAAM,IAAwB,EAAE;YACtD,OAAO,IAAI,CAAC;SACb;QAED,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACtD,OAAO,CAAC,MAAM,GAAG,IAAuB,CAAC;QAEzC,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE;YACxB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC;SAC3B;aAAM;YACL,aAAa,CAAC,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC;YACpC,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC;SACrC;QACD,aAAa,CAAC,KAAK,GAAG,OAAO,CAAC;QAC9B,OAAO,CAAC,KAAK,GAAG,aAAa,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;SACzB;QACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAEvC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE7B,OAAO,OAAO,CAAC;IACjB,CAAC;IAUD,UAAU,CAAC,OAAc,EAAE,GAAW;QACpC,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,SAAS,EAAE;YACvC,OAAO,CAAC,IAAI,CAAC,uCAAuC,CAAC,CAAC;SACvD;QACD,IAAI,GAAG,IAAI,IAAI,CAAC,aAAa,EAAE;YAC7B,OAAO,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;SAClC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,EAAE;YAC9B,OAAO,IAAI,CAAC;SACb;QACD,IAAI,OAAO,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;YAC/B,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;SAC1D;QAED,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACtD,OAAO,CAAC,MAAM,GAAG,IAAuB,CAAC;QAEzC,IAAI,GAAG,KAAK,CAAC,EAAE;YACb,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;YACjC,IAAI,CAAC,WAAW,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,GAAG,OAAO,CAAC,CAAC;YACvD,OAAO,CAAC,KAAK,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC;SAC5B;aAAM;YACL,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;gBAC5B,IAAI,CAAC,KAAK,EAAE;oBACV,OAAO,IAAI,CAAC;iBACb;gBACD,IAAI,CAAC,GAAG,CAAC,EAAE;oBACT,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;iBACrB;aACF;YACD,IAAI,CAAC,KAAK,EAAE;gBACV,OAAO,IAAI,CAAC;aACb;YACD,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;YAC5B,OAAO,CAAC,KAAK,GAAG,KAAK,CAAC;YACtB,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC;YACtB,IAAI,OAAO,CAAC,KAAK,EAAE;gBACjB,OAAO,CAAC,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC;aAC/B;SACF;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;SACzB;QACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAMvC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE7B,OAAO,OAAO,CAAC;IACjB,CAAC;IAMD,iBAAiB,CAAC,OAAc,EAAE,GAAW;QAC3C,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;YACnB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC;SAChC;QAED,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE;YACvB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;SACzC;QAED,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;QAC9B,IAAI,IAAuB,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACjC,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,IAAI,EAAE;gBACR,MAAM;aACP;SACF;QACD,IAAI,IAAI,EAAE;YACR,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;SACxF;QACD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IAMD,WAAW,CAAC,KAAY;QACtB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,IAAI,CAAC;SACb;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;YAChC,OAAO,IAAI,CAAC;SACb;QACD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,IAAI,CAAC,SAAS,EAAE;YAElB,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC;YACvD,IAAI,GAAG,GAAG,CAAC,EAAE;gBACX,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;aAC/B;SACF;QAED,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,KAAK,CAAC;SAChC;aAAM;YACL,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACjC;QACD,IAAI,KAAK,CAAC,KAAK,EAAE;YACf,KAAK,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACjC;aAAM;YACL,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC;SAC/B;QAGD,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;QACpB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;QACnB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;QAEnB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAE5B,OAAO,KAAK,CAAC;IACf,CAAC;IAKD,MAAM;QACJ,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;SAC/B;IACH,CAAC;IAKD,cAAc;QACZ,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO;SACR;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,OAAO,KAAK,EAAE;YACZ,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;YAEpB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;YACnB,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC;YACnB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACrB;QAED,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAEpB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClC,CAAC;IASD,YAAY,CAAC,QAAe,EAAE,QAAe;QAC3C,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAQD,IAAI,CAA0B,QAA6C,EAAE,OAAgB,KAAK;QAChG,IAAI,MAAM,GAAa,IAAI,CAAC;QAC5B,IAAI,CAAC,eAAe,CAAC,CAAC,IAAO,EAAE,KAAa,EAAE,EAAE;YAC9C,IAAI,IAAI,KAAM,IAAyB,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;gBAChE,MAAM,GAAG,IAAI,CAAC;gBACd,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC,CAAC;QAEH,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE;gBAC3B,IAAK,KAAgB,CAAC,WAAW,EAAE;oBACjC,MAAM,IAAI,GAAI,KAAgB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAM,CAAC;oBACzD,IAAI,IAAI,EAAE;wBACR,MAAM,GAAG,IAAI,CAAC;wBACd,OAAO,IAAI,CAAC;qBACb;iBACF;gBACD,OAAO,KAAK,CAAC;YACf,CAAC,CAAC,CAAC;SACJ;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAQD,OAAO,CAA0B,QAA6C,EAAE,OAAgB,KAAK;QACnG,IAAI,KAAK,GAAQ,EAAE,CAAC;QACpB,IAAI,CAAC,eAAe,CAAC,CAAC,IAAO,EAAE,KAAK,EAAE,EAAE;YACtC,IAAI,IAAI,KAAM,IAAyB,IAAI,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;gBAChE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAClB;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE;gBAC3B,IAAK,KAAgB,CAAC,WAAW,EAAE;oBACjC,MAAM,OAAO,GAAI,KAAgB,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAQ,CAAC;oBACjE,IAAI,OAAO,CAAC,MAAM,EAAE;wBAClB,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;qBAC/B;iBACF;YACH,CAAC,CAAC,CAAC;SACJ;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAMD,cAAc,CAAC,EAAmB;QAChC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IAOD,aAAa,CAAC,EAAmB;QAC/B,OAAO,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;IACjC,CAAC;IAMD,cAAc,CAAC,GAAW;QACxB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,IAAI,CAAC;SACb;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC;IACtC,CAAC;IAOD,iBAAiB,CAAC,IAAY;QAC5B,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,CAAC;IACxD,CAAC;IAQD,kBAAkB,CAAC,IAAY;QAC7B,OAAO,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IAMD,iBAAiB,CAAC,IAAY;QAC5B,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,CAAC;IACxD,CAAC;IASD,cAAc,CAAC,IAAY,EAAE,OAAgB,KAAK;QAChD,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,CAAC,CAAC;IACrD,CAAC;IAED,UAAU,CAAC,GAAW;QACpB,IAAI,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC;QACzB,IAAI,CAAC,CAAC,EAAE;YACN,OAAO,IAAI,CAAC;SACb;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;YAC5B,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE;gBACZ,OAAO,IAAI,CAAC;aACb;YACD,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;SACb;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED,EAAE,CAAC,GAAW;QACZ,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAMD,WAAW,CAAC,IAAW;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;SACd;QACD,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;YAC9B,OAAO,IAAI,CAAC;SACb;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,OAAO,KAAK,EAAE;YACZ,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;gBAC3B,OAAO,IAAI,CAAC;aACb;YACD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACrB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAKD,WAAW;QACT,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,OAAO,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,MAAM,EAAE;YACrB,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;SACxB;QACD,OAAO,MAAM,IAAI,IAAI,CAAC;IACxB,CAAC;IAKD,aAAa;QACX,OAAO,IAAI,CAAC,WAAW,KAAK,IAAI,CAAC;IACnC,CAAC;IAGD,QAAQ,CAAC,IAAW;QAClB,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,GAAG,CAAC,IAAW;QACb,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IACD,WAAW;QACT,MAAM,KAAK,GAAY,EAAE,CAAC;QAC1B,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,OAAO,KAAK,EAAE;YACZ,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACrB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAMD,SAAS,CAAC,IAAW;QACnB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,OAAO,KAAK,CAAC;SACd;QACD,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;IACxC,CAAC;IAMD,UAAU,CAAC,IAAW;QACpB,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAMD,eAAe,CAAC,IAAW;QACzB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,MAAM,EAAE;YACX,OAAO,KAAK,CAAC;SACd;QACD,GAAG;YACD,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;gBAC7B,OAAO,IAAI,CAAC;aACb;YACD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;SACxB,QAAQ,MAAM,KAAK,IAAI,EAAE;QAE1B,OAAO,KAAK,CAAC;IACf,CAAC;IAMD,aAAa,CAAC,IAAW;QACvB,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,WAAW,CAAC,GAAW;QACrB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAOD,sBAAsB,CAAC,SAAiB,EAAE,UAAe;QACvD,IAAI,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,OAAO,KAAK,EAAE;YACZ,KAAK,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC;YAC9B,KAAK,CAAC,sBAAsB,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;YACpD,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;SACrB;IACH,CAAC;IAKO,QAAQ,CAAC,UAAkB;QACjC,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC;QAC1B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QACzB,IAAI,CAAC,MAAM,EAAE;YACX,OAAO;SACR;QACD,GAAG;YACD,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC;YAC5B,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;SACxB,QAAQ,MAAM,KAAK,IAAI,EAAE;IAC5B,CAAC;IAED,KAAK;QACH,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAMD,OAAO,CAAC,IAAW;QACjB,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAGD,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED,GAAG,CAAC,KAAY;QACd,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IASD,gBAAgB,CACd,IAAY,EACZ,QAA4D,EAC5D,OAA2C;QAE3C,MAAM,OAAO,GACX,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAK,OAAmC,CAAC,OAAO,CAAC,CAAC;QAC/G,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAK,OAAmC,CAAC,IAAI,CAAC;QAC5E,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;QAE5D,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;QACzC,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,QAA0B,CAAC,CAAC,CAAE,QAAgC,CAAC,WAAW,CAAC;QAE9G,IAAI,IAAI,EAAE;YACR,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SACrC;aAAM;YACL,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SACnC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,EAAE,CACA,IAAY,EACZ,QAA4D,EAC5D,OAA2C;QAE3C,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IACxD,CAAC;IASD,mBAAmB,CACjB,IAAY,EACZ,QAA4D,EAC5D,OAA2C;QAE3C,MAAM,OAAO,GACX,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAK,OAAmC,CAAC,OAAO,CAAC,CAAC;QAC/G,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;QAE5D,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC;QACzC,QAAQ,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAE,QAA0B,CAAC,CAAC,CAAE,QAAgC,CAAC,WAAW,CAAC;QAE9G,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAK,OAAmC,CAAC,IAAI,CAAC;QAC5E,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;QAEzC,OAAO,IAAI,CAAC;IACd,CAAC;IASD,GAAG,CACD,IAAY,EACZ,QAA4D,EAC5D,OAA2C;QAE3C,OAAO,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC3D,CAAC;IAED,IAAI,CACF,IAAY,EACZ,QAA4D,EAC5D,OAA2C;QAE3C,IAAI,QAAQ,CAAC,OAAO,CAAC,EAAE;YACrB,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;YACpB,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;SACvD;QACD,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;IAC/D,CAAC;IAED,uBAAuB;QACrB,KAAK,CAAC,kBAAkB,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC;IACd,CAAC;IAED,kBAAkB;QAChB,OAAO,IAAI,CAAC,uBAAuB,EAAE,CAAC;IACxC,CAAC;IAED,aAAa,CAAC,KAAU,EAAE,GAAG,IAAS;QACpC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,CAAC;QACvC,OAAO,CAAC,KAAK,CAAC,gBAAgB,CAAC;IACjC,CAAC;IAED,IAAI,CAAC,KAAU,EAAE,IAAgB;QAC/B,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACzC,CAAC;IAED,OAAO;QAEL,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5B,CAAC;CACF","file":"node-tree.js","sourcesContent":["import type { Dict, LooseFunction } from '@visactor/vutils';\nimport { EventEmitter, isBoolean, isFunction, isObject } from '@visactor/vutils';\nimport { Generator } from '../common/generator';\nimport type { INode, IGroup } from '../interface';\n\nexport class Node extends EventEmitter<any, any> implements INode {\n  parent: any;\n  declare name: string;\n  declare id: string | number;\n\n  declare _uid: number;\n  _prev?: INode;\n  _next?: INode;\n  protected _firstChild: INode | null;\n  protected _lastChild: INode | null;\n  protected _idMap?: Map<number, INode>;\n  protected _count: number;\n  // protected _dirty?: boolean; // dirty表示属性是否有修改\n  protected _structEdit?: boolean; // 树的结构是否发生修改\n  protected _nodeList?: INode[]; // 用于有顺序的插入（正常情况用不到）\n\n  declare _ignoreWarn?: boolean;\n\n  get previousSibling(): INode | null {\n    return this._prev;\n  }\n\n  get nextSibling(): INode | null {\n    return this._next;\n  }\n\n  get children(): INode[] {\n    return this.getChildren();\n  }\n  get firstChild(): INode | null {\n    return this._firstChild;\n  }\n  get lastChild(): INode | null {\n    return this._lastChild;\n  }\n  get count(): number {\n    return this._count;\n  }\n  get childrenCount(): number {\n    if (!this._idMap) {\n      return 0;\n    }\n    return this._idMap.size;\n  }\n  // get dirty(): boolean {\n  //   return !!this._dirty;\n  // }\n\n  constructor() {\n    super();\n    this._uid = Generator.GenAutoIncrementId();\n    this._firstChild = null;\n    this._lastChild = null;\n    this.parent = null;\n    this._count = 1;\n  }\n\n  forEachChildren<T extends INode = INode>(cb: (item: T, index: number) => void | boolean, reverse: boolean = false) {\n    if (reverse) {\n      let child = this._lastChild;\n      let i = 0;\n      while (child) {\n        const breakTag = cb(child as T, i++);\n        if (breakTag) {\n          return;\n        }\n        child = child._prev;\n      }\n    } else {\n      let child = this._firstChild;\n      let i = 0;\n      while (child) {\n        const breakTag = cb(child as T, i++);\n        if (breakTag) {\n          return;\n        }\n        child = child._next;\n      }\n    }\n  }\n\n  async forEachChildrenAsync<T extends INode = INode>(\n    cb: (item: T, index: number) => Promise<void | boolean> | void | boolean,\n    reverse: boolean = false\n  ) {\n    if (reverse) {\n      let child = this._lastChild;\n      let i = 0;\n      while (child) {\n        let breakTag = cb(child as T, i++);\n        if ((breakTag as any).then) {\n          breakTag = await breakTag;\n        }\n        if (breakTag) {\n          return;\n        }\n        child = child._prev;\n      }\n    } else {\n      let child = this._firstChild;\n      let i = 0;\n      while (child) {\n        let breakTag = cb(child as T, i++);\n        if ((breakTag as any).then) {\n          breakTag = await breakTag;\n        }\n        if (breakTag) {\n          return;\n        }\n        child = child._next;\n      }\n    }\n  }\n\n  forEach<T extends INode = INode>(cb: (item: T, index: number) => void): void {\n    return this.forEachChildren<T>(cb);\n  }\n\n  /**\n   * 方法将一个节点附加到指定父节点的子节点列表的末尾处。\n   * 如果将被插入的节点已经存在于当前文档的文档树中，那么 appendChild() 只会将它从原先的位置移动到新的位置（不需要事先移除要移动的节点）。\n   * 不能append父级元素\n   * @param node 要插入的节点\n   */\n  appendChild(node: INode): INode | null {\n    if (this._uid === node._uid) {\n      return null;\n    }\n    if (node.isAncestorsOf(this)) {\n      throw new Error('【Node::appendChild】不能将父辈元素append为子元素');\n    }\n\n    // 清理该节点的上次关系\n    node.parent && node.parent.removeChild(node);\n    node.parent = this as unknown as Node;\n\n    if (!this._lastChild) {\n      this._firstChild = this._lastChild = node;\n      node._prev = node._next = null;\n    } else {\n      this._lastChild._next = node;\n      node._prev = this._lastChild;\n      this._lastChild = node;\n    }\n    if (!this._idMap) {\n      this._idMap = new Map();\n    }\n    this._idMap.set(node._uid, node);\n\n    this.setCount(node.count);\n\n    this._structEdit = true;\n    return node;\n  }\n\n  /**\n   * 方法将一个节点数组附加到指定父节点的子节点列表的末尾处。\n   * 不会判断元素是否是自身以及是否是父元素或者是否是其他节点的子元素\n   * @param nodes 要插入的节点数组\n   */\n  appendChildArrHighPerformance(nodes: INode[], replace: boolean = false): INode[] | null {\n    console.error('暂不支持该函数');\n\n    return nodes;\n  }\n\n  /**\n   * 方法在参考节点之前插入一个拥有指定父节点的子节点。\n   * 如果给定的子节点是对文档中现有节点的引用，\n   * insertBefore() 会将其从当前位置移动到新位置（在将节点附加到其他节点之前，不需要从其父节点删除该节点）。\n   * 不能insert父级元素\n   * @param newNode 要插入的节点\n   * @param referenceNode 插入到referenceNode之前\n   */\n  insertBefore(newNode: INode, referenceNode: INode | undefined): INode | null {\n    if (!referenceNode) {\n      return this.appendChild(newNode);\n    }\n    if (this._uid === newNode._uid) {\n      return null;\n    }\n    if (newNode.isAncestorsOf(this)) {\n      throw new Error('【Node::insertBefore】不能将父辈元素insert为子元素');\n    }\n    if (referenceNode.parent !== (this as unknown as Node)) {\n      return null;\n    }\n\n    newNode.parent && newNode.parent.removeChild(newNode);\n    newNode.parent = this as unknown as Node;\n\n    newNode._prev = referenceNode._prev;\n    if (!referenceNode._prev) {\n      this._firstChild = newNode;\n    } else {\n      referenceNode._prev._next = newNode;\n    }\n    referenceNode._prev = newNode;\n    newNode._next = referenceNode;\n    if (!this._idMap) {\n      this._idMap = new Map();\n    }\n    this._idMap.set(newNode._uid, newNode);\n\n    this._structEdit = true;\n    this.setCount(newNode.count);\n\n    return newNode;\n  }\n\n  /**\n   * 方法在参考节点之后插入一个拥有指定父节点的子节点。\n   * 如果给定的子节点是对文档中现有节点的引用，\n   * insertAfter() 会将其从当前位置移动到新位置（在将节点附加到其他节点之前，不需要从其父节点删除该节点）。\n   * 不能insert父级元素\n   * @param newNode 要插入的节点\n   * @param referenceNode 插入到referenceNode之后\n   */\n  insertAfter(newNode: INode, referenceNode: INode | undefined): INode | null {\n    if (!referenceNode) {\n      return this.appendChild(newNode);\n    }\n    if (this._uid === newNode._uid) {\n      return null;\n    }\n    if (newNode.isAncestorsOf(this)) {\n      throw new Error('【Node::insertAfter】不能将父辈元素insert为子元素');\n    }\n    if (referenceNode.parent !== (this as unknown as Node)) {\n      return null;\n    }\n\n    newNode.parent && newNode.parent.removeChild(newNode);\n    newNode.parent = this as unknown as Node;\n\n    if (!referenceNode._next) {\n      this._lastChild = newNode;\n    } else {\n      referenceNode._next._prev = newNode;\n      newNode._next = referenceNode._next;\n    }\n    referenceNode._next = newNode;\n    newNode._prev = referenceNode;\n    if (!this._idMap) {\n      this._idMap = new Map();\n    }\n    this._idMap.set(newNode._uid, newNode);\n\n    this._structEdit = true;\n    this.setCount(newNode.count);\n\n    return newNode;\n  }\n\n  /**\n   * 方法在参考节点之前插入一个拥有指定父节点的子节点。\n   * 如果给定的子节点是对文档中现有节点的引用，\n   * insertBefore() 会将其从当前位置移动到新位置（在将节点附加到其他节点之前，不需要从其父节点删除该节点）。\n   * 不能insert父级元素\n   * @param newNode 要插入的节点\n   * @param referenceNode 插入到referenceNode之前\n   */\n  insertInto(newNode: INode, idx: number): INode | null {\n    if (!this._ignoreWarn && this._nodeList) {\n      console.warn('insertIntoKeepIdx和insertInto混用可能会存在错误');\n    }\n    if (idx >= this.childrenCount) {\n      return this.appendChild(newNode);\n    }\n    if (this._uid === newNode._uid) {\n      return null;\n    }\n    if (newNode.isAncestorsOf(this)) {\n      throw new Error('【Node::insertBefore】不能将父辈元素insert为子元素');\n    }\n\n    newNode.parent && newNode.parent.removeChild(newNode);\n    newNode.parent = this as unknown as Node;\n\n    if (idx === 0) {\n      newNode._next = this._firstChild;\n      this._firstChild && (this._firstChild._prev = newNode);\n      newNode._prev = null;\n      this._firstChild = newNode;\n    } else {\n      let child = this._firstChild;\n      for (let i = 0; i < idx; i++) {\n        if (!child) {\n          return null;\n        }\n        if (i > 0) {\n          child = child._next;\n        }\n      }\n      if (!child) {\n        return null;\n      }\n      newNode._next = child._next;\n      newNode._prev = child;\n      child._next = newNode;\n      if (newNode._next) {\n        newNode._next._prev = newNode;\n      }\n    }\n    if (!this._idMap) {\n      this._idMap = new Map();\n    }\n    this._idMap.set(newNode._uid, newNode);\n\n    // // 预期不会执行\n    // if (idx === this.childrenCount) {\n    //   this._lastChild = newNode;\n    // }\n    this._structEdit = true;\n    this.setCount(newNode.count);\n\n    return newNode;\n  }\n\n  /**\n   * 相比于insertInto，会保持idx顺序，举例：\n   * 先插入idx：6的元素，再插入idx：2的元素，此时idx：2的元素会放置在idx为6的元素之前\n   */\n  insertIntoKeepIdx(newNode: INode, idx: number): INode | null {\n    if (!this._nodeList) {\n      this._nodeList = this.children;\n    }\n    // 如果这个位置有了，那就将这个位置之前的元素向后移动\n    if (this._nodeList[idx]) {\n      const node = this._nodeList[idx];\n      this._nodeList.splice(idx, 0, newNode);\n      return this.insertBefore(newNode, node);\n    }\n    // 查找idx之前的元素，插入到其后面\n    this._nodeList[idx] = newNode;\n    let node: INode | undefined;\n    for (let i = idx - 1; i >= 0; i--) {\n      node = this._nodeList[i];\n      if (node) {\n        break;\n      }\n    }\n    if (node) {\n      return node._next ? this.insertBefore(newNode, node._next) : this.appendChild(newNode);\n    }\n    this._ignoreWarn = true;\n    const data = this.insertInto(newNode, 0);\n    this._ignoreWarn = false;\n    return data;\n  }\n\n  /**\n   * 方法从DOM中删除一个子节点。返回删除的节点。\n   * @param child 要删除的子节点\n   */\n  removeChild(child: INode): INode | null {\n    if (!this._idMap) {\n      return null;\n    }\n    if (!this._idMap.has(child._uid)) {\n      return null;\n    }\n    this._idMap.delete(child._uid);\n    if (this._nodeList) {\n      // 找到idx\n      const idx = this._nodeList.findIndex(n => n === child);\n      if (idx > 0) {\n        this._nodeList.splice(idx, 1);\n      }\n    }\n\n    if (!child._prev) {\n      this._firstChild = child._next;\n    } else {\n      child._prev._next = child._next;\n    }\n    if (child._next) {\n      child._next._prev = child._prev;\n    } else {\n      this._lastChild = child._prev;\n    }\n\n    // 重置属性\n    child.parent = null;\n    child._prev = null;\n    child._next = null;\n\n    this._structEdit = true;\n    this.setCount(-child.count);\n\n    return child;\n  }\n\n  /**\n   * 从当前节点的父节点删除当前节点\n   */\n  delete() {\n    if (this.parent) {\n      this.parent.removeChild(this);\n    }\n  }\n\n  /**\n   * 删除所有的孩子节点\n   */\n  removeAllChild() {\n    if (!this._idMap) {\n      return;\n    }\n    let child = this._firstChild;\n    while (child) {\n      child.parent = null;\n      //   child._rootNode = child;\n      child._prev = null;\n      child._next = null;\n      child = child._next;\n    }\n\n    this._firstChild = null;\n    this._lastChild = null;\n    this._idMap.clear();\n\n    this._structEdit = true;\n    this.setCount(-this._count + 1);\n  }\n\n  /**\n   * 方法用指定的节点替换当前节点的一个子节点，并返回被替换掉的节点。\n   * 如果该节点已经存在于DOM树中，则它首先会被从原始位置删除。\n   * 不能replace父级元素\n   * @param newChild 新节点\n   * @param oldChild 旧节点\n   */\n  replaceChild(newChild: INode, oldChild: INode): INode | null {\n    throw new Error('暂不支持');\n  }\n\n  /**\n   * 根据自定义逻辑查找元素，返回单一图形元素\n   * @param callback 自定义查找过滤器\n   * @param deep 是否进行深度查找，默认为 false\n   * @returns 返回匹配的图形元素\n   */\n  find<T extends INode = INode>(callback: (node: T, index: number) => boolean, deep: boolean = false): T | null {\n    let target: T | null = null;\n    this.forEachChildren((node: T, index: number) => {\n      if (node !== (this as unknown as INode) && callback(node, index)) {\n        target = node;\n        return true; // 提前退出循环\n      }\n      return false;\n    });\n\n    if (deep) {\n      this.forEachChildren(child => {\n        if ((child as IGroup).isContainer) {\n          const node = (child as IGroup).find(callback, true) as T;\n          if (node) {\n            target = node;\n            return true; // 提前退出循环\n          }\n        }\n        return false;\n      });\n    }\n\n    return target;\n  }\n\n  /**\n   * 根据自定义逻辑查找元素，返回匹配的元素集合\n   * @param callback 自定义查找过滤器\n   * @param deep 是否进行深度查找，默认为 false\n   * @returns 返回匹配的图形元素集合\n   */\n  findAll<T extends INode = INode>(callback: (node: T, index: number) => boolean, deep: boolean = false): T[] {\n    let nodes: T[] = [];\n    this.forEachChildren((node: T, index) => {\n      if (node !== (this as unknown as INode) && callback(node, index)) {\n        nodes.push(node);\n      }\n    });\n\n    if (deep) {\n      this.forEachChildren(child => {\n        if ((child as IGroup).isContainer) {\n          const targets = (child as IGroup).findAll(callback, true) as T[];\n          if (targets.length) {\n            nodes = nodes.concat(targets);\n          }\n        }\n      });\n    }\n    return nodes;\n  }\n\n  /**\n   * 通过用户设置的 id 查找对应的图形元素\n   * @param id 子节点的 id\n   */\n  getElementById(id: string | number): INode | null {\n    return this.find(node => node.id === id, true);\n  }\n\n  /**\n   * @alias getElementById\n   * 通过用户设置的 id 查找对应的图形元素\n   * @param id 子节点的 id\n   */\n  findChildById(id: string | number): INode | null {\n    return this.getElementById(id);\n  }\n\n  /**\n   * 通过内部生成的节点 id：_uid 查找对应的图形元素\n   * @param id 子节点的key\n   */\n  findChildByUid(uid: number): INode | null {\n    if (!this._idMap) {\n      return null;\n    }\n    return this._idMap.get(uid) || null;\n  }\n\n  /**\n   * 根据用户传入的 name 查找元素，返回匹配的元素集合\n   * @param name 用户设置的图形名称\n   * @returns 匹配 name 的元素集合\n   */\n  getElementsByName(name: string) {\n    return this.findAll(node => node.name === name, true);\n  }\n\n  /**\n   * @alias getElementsByName\n   * 根据用户传入的 name 查找元素，返回匹配的元素集合\n   * @param name 用户设置的图形名称\n   * @returns 匹配 name 的元素集合\n   */\n  findChildrenByName(name: string) {\n    return this.getElementsByName(name);\n  }\n  /**\n   * 根据用户传入的 type 查找元素，返回匹配的元素集合\n   * @param type 用户设置的图形类型\n   * @returns 匹配 type 的元素集合\n   */\n  getElementsByType(type: string) {\n    return this.findAll(node => node.type === type, true);\n  }\n\n  /**\n   * 根据名字查找元素，只返回第一个查找到的元素\n   * @deprecated 待 vis-component & chartspace 修改之后删除\n   * @param name\n   * @param deep\n   * @returns\n   */\n  getChildByName(name: string, deep: boolean = false) {\n    return this.find(node => node.name === name, deep);\n  }\n\n  getChildAt(idx: number): INode | null {\n    let c = this._firstChild;\n    if (!c) {\n      return null;\n    }\n    for (let i = 0; i < idx; i++) {\n      if (!c._next) {\n        return null;\n      }\n      c = c._next;\n    }\n    return c;\n  }\n\n  at(idx: number): INode | null {\n    return this.getChildAt(idx);\n  }\n\n  /**\n   * 返回的是一个布尔值，来表示传入的节点是否为该节点的后代节点。\n   * @param node 判断是否包含的节点\n   */\n  containNode(node: INode): boolean {\n    if (!this._idMap) {\n      return false;\n    }\n    if (this._idMap.has(node._uid)) {\n      return true;\n    }\n    let child = this._firstChild;\n    while (child) {\n      if (child.containNode(node)) {\n        return true;\n      }\n      child = child._next;\n    }\n    return false;\n  }\n\n  /**\n   * 方法返回上下文中的根节点，不常用\n   */\n  getRootNode(): INode {\n    let parent = this.parent;\n    while (parent?.parent) {\n      parent = parent.parent;\n    }\n    return parent || this;\n  }\n\n  /**\n   * 方法返回一个布尔值,表明当前节点是否包含有子节点.\n   */\n  hasChildNodes(): boolean {\n    return this._firstChild !== null;\n  }\n\n  /* 语法糖 */\n  addChild(node: INode): INode | null {\n    return this.appendChild(node);\n  }\n  add(node: INode): INode | null {\n    return this.appendChild(node);\n  }\n  getChildren(): INode[] {\n    const nodes: INode[] = [];\n    let child = this._firstChild;\n    while (child) {\n      nodes.push(child);\n      child = child._next;\n    }\n    return nodes;\n  }\n\n  /**\n   * 判断该节点是否是node的子节点\n   * @param node\n   */\n  isChildOf(node: INode): boolean {\n    if (!this.parent) {\n      return false;\n    }\n    return this.parent._uid === node._uid;\n  }\n\n  /**\n   * 判断该节点是否是node的父节点\n   * @param node\n   */\n  isParentOf(node: INode): boolean {\n    return node.isChildOf(this);\n  }\n\n  /**\n   * 判断节点是否是node的后代节点\n   * @param node\n   */\n  isDescendantsOf(node: INode): boolean {\n    let parent = this.parent;\n    if (!parent) {\n      return false;\n    }\n    do {\n      if (parent._uid === node._uid) {\n        return true;\n      }\n      parent = parent.parent;\n    } while (parent !== null);\n\n    return false;\n  }\n\n  /**\n   * 判断节点是否是node的祖先节点\n   * @param node\n   */\n  isAncestorsOf(node: INode): boolean {\n    return node.isDescendantsOf(this);\n  }\n\n  getAncestor(idx: number): INode {\n    throw new Error('暂不支持');\n  }\n\n  /**\n   * 设置该节点的所有后代节点某个属性\n   * @param propsName 属性名\n   * @param propsValue 属性值\n   */\n  setAllDescendantsProps(propsName: string, propsValue: any) {\n    let child = this._firstChild;\n    while (child) {\n      child[propsName] = propsValue;\n      child.setAllDescendantsProps(propsName, propsValue);\n      child = child._next;\n    }\n  }\n  /**\n   * 设置当前节点的count属性，会更改父节点的count属性\n   * @param deltaCount delta count\n   */\n  private setCount(deltaCount: number): void {\n    this._count += deltaCount;\n    let parent = this.parent;\n    if (!parent) {\n      return;\n    }\n    do {\n      parent._count += deltaCount;\n      parent = parent.parent;\n    } while (parent !== null);\n  }\n\n  clone(): INode {\n    throw new Error('暂不支持');\n  }\n\n  /**\n   * clone to node\n   * @param node\n   */\n  cloneTo(node: INode): void {\n    throw new Error('暂不支持');\n  }\n\n  /***************语法糖***************/\n  getParent(): INode | null {\n    return this.parent;\n  }\n\n  del(child: INode): INode | null {\n    return this.removeChild(child);\n  }\n\n  // 事件相关别名\n  /**\n   *  @alias on\n   * @param type\n   * @param listener\n   * @param options\n   */\n  addEventListener(\n    type: string,\n    listener: EventListenerOrEventListenerObject | LooseFunction,\n    options?: AddEventListenerOptions | boolean\n  ) {\n    const capture =\n      (isBoolean(options, true) && options) || (isObject(options) && (options as AddEventListenerOptions).capture);\n    const once = isObject(options) && (options as AddEventListenerOptions).once;\n    const context = isFunction(listener) ? undefined : listener;\n\n    type = capture ? `${type}capture` : type;\n    listener = isFunction(listener) ? (listener as LooseFunction) : (listener as EventListenerObject).handleEvent;\n\n    if (once) {\n      super.once(type, listener, context);\n    } else {\n      super.on(type, listener, context);\n    }\n    return this;\n  }\n\n  on(\n    type: string,\n    listener: EventListenerOrEventListenerObject | LooseFunction,\n    options?: AddEventListenerOptions | boolean\n  ) {\n    return this.addEventListener(type, listener, options);\n  }\n\n  /**\n   * @alias off\n   * @param type\n   * @param listener\n   * @param options\n   * @returns\n   */\n  removeEventListener(\n    type: string,\n    listener: EventListenerOrEventListenerObject | LooseFunction,\n    options?: AddEventListenerOptions | boolean\n  ) {\n    const capture =\n      (isBoolean(options, true) && options) || (isObject(options) && (options as AddEventListenerOptions).capture);\n    const context = isFunction(listener) ? undefined : listener;\n\n    type = capture ? `${type}capture` : type;\n    listener = isFunction(listener) ? (listener as LooseFunction) : (listener as EventListenerObject).handleEvent;\n\n    const once = isObject(options) && (options as AddEventListenerOptions).once;\n    super.off(type, listener, context, once);\n\n    return this;\n  }\n\n  /**\n   * @alias off\n   * @param type\n   * @param listener\n   * @param options\n   * @returns\n   */\n  off(\n    type: string,\n    listener: EventListenerOrEventListenerObject | LooseFunction,\n    options?: AddEventListenerOptions | boolean\n  ) {\n    return this.removeEventListener(type, listener, options);\n  }\n\n  once(\n    type: string,\n    listener: EventListenerOrEventListenerObject | LooseFunction,\n    options?: AddEventListenerOptions | boolean\n  ) {\n    if (isObject(options)) {\n      options.once = true;\n      return this.addEventListener(type, listener, options);\n    }\n    return this.addEventListener(type, listener, { once: true });\n  }\n\n  removeAllEventListeners() {\n    super.removeAllListeners();\n    return this;\n  }\n\n  removeAllListeners(): this {\n    return this.removeAllEventListeners();\n  }\n\n  dispatchEvent(event: any, ...args: any) {\n    super.emit(event.type, event, ...args);\n    return !event.defaultPrevented;\n  }\n\n  emit(event: any, data?: Dict<any>) {\n    return this.dispatchEvent(event, data);\n  }\n\n  release() {\n    // 卸载事件\n    this.removeAllListeners();\n  }\n}\n"]}

package/es/graphic/path.d.ts

@@ -0,0 +1,53 @@
+import type { AABBBounds, OBBBounds } from '@visactor/vutils';
+import { Graphic } from './graphic';
+import type { ICustomPath2D, IPath, IPathGraphicAttribute } from '../interface';
+import { CustomPath2D } from '../common/custom-path2d';
+export declare class Path extends Graphic<IPathGraphicAttribute> implements IPath {
+    type: 'path';
+    cache?: ICustomPath2D;
+    static NOWORK_ANIMATE_ATTR: {
+        strokeSeg: number;
+        boundsPadding: number;
+        pickMode: number;
+        boundsMode: number;
+        customPickShape: number;
+        pickable: number;
+        childrenPickable: number;
+        visible: number;
+        zIndex: number;
+        layout: number;
+        keepDirIn3d: number;
+        outerBorder: number;
+        innerBorder: number;
+        lineDash: number;
+        lineCap: number;
+        lineJoin: number;
+        miterLimit: number;
+        strokeBoundsBuffer: number;
+        scaleCenter: number;
+        anchor: number;
+        anchor3d: number;
+        postMatrix: number;
+        backgroundMode: number;
+        background: number;
+        texture: number;
+        cursor: number;
+        html: number;
+        path: number;
+        customPath: number;
+    };
+    constructor(params: IPathGraphicAttribute);
+    get pathShape(): ICustomPath2D;
+    isValid(): boolean;
+    private _isValid;
+    getParsedPathShape(): CustomPath2D;
+    protected doUpdateAABBBounds(): AABBBounds;
+    protected doUpdatePathShape(): void;
+    protected tryUpdateOBBBounds(): OBBBounds;
+    getDefaultAttribute(name: string): any;
+    protected needUpdateTags(keys: string[]): boolean;
+    protected needUpdateTag(key: string): boolean;
+    toCustomPath(): CustomPath2D;
+    clone(): Path;
+    getNoWorkAnimateAttr(): Record<string, number>;
+}

package/es/graphic/path.js

@@ -0,0 +1,77 @@
+import { isString, isNil } from "@visactor/vutils";
+
+import { Graphic, GRAPHIC_UPDATE_TAG_KEY, NOWORK_ANIMATE_ATTR } from "./graphic";
+
+import { parsePadding } from "../common/utils";
+
+import { CustomPath2D } from "../common/custom-path2d";
+
+import { getTheme } from "./theme";
+
+import { application } from "../application";
+
+import { PATH_NUMBER_TYPE } from "./constants";
+
+const PATH_UPDATE_TAG_KEY = [ "path", "customPath", ...GRAPHIC_UPDATE_TAG_KEY ];
+
+export class Path extends Graphic {
+    constructor(params) {
+        super(params), this.type = "path", this.numberType = PATH_NUMBER_TYPE;
+    }
+    get pathShape() {
+        return this.tryUpdateAABBBounds(), this.getParsedPathShape();
+    }
+    isValid() {
+        return super.isValid() && this._isValid();
+    }
+    _isValid() {
+        const {path: path} = this.attribute;
+        return null != path && "" !== path;
+    }
+    getParsedPathShape() {
+        const pathTheme = getTheme(this).path;
+        if (!this.valid) return pathTheme.path;
+        const attribute = this.attribute;
+        return attribute.path instanceof CustomPath2D ? attribute.path : (isNil(this.cache) && this.doUpdatePathShape(), 
+        this.cache instanceof CustomPath2D ? this.cache : pathTheme.path);
+    }
+    doUpdateAABBBounds() {
+        const pathTheme = getTheme(this).path;
+        this.doUpdatePathShape(), this._AABBBounds.setValue(1 / 0, 1 / 0, -1 / 0, -1 / 0);
+        const attribute = this.attribute, bounds = application.graphicService.updatePathAABBBounds(attribute, getTheme(this).path, this._AABBBounds, this), {boundsPadding: boundsPadding = pathTheme.boundsPadding} = attribute, paddingArray = parsePadding(boundsPadding);
+        return paddingArray && bounds.expand(paddingArray), this.clearUpdateBoundTag(), 
+        bounds;
+    }
+    doUpdatePathShape() {
+        const attribute = this.attribute;
+        isString(attribute.path, !0) ? this.cache = (new CustomPath2D).fromString(attribute.path) : attribute.customPath && (this.cache = new CustomPath2D, 
+        attribute.customPath(this.cache, this));
+    }
+    tryUpdateOBBBounds() {
+        throw new Error("暂不支持");
+    }
+    getDefaultAttribute(name) {
+        return getTheme(this).path[name];
+    }
+    needUpdateTags(keys) {
+        return super.needUpdateTags(keys, PATH_UPDATE_TAG_KEY);
+    }
+    needUpdateTag(key) {
+        return super.needUpdateTag(key, PATH_UPDATE_TAG_KEY);
+    }
+    toCustomPath() {
+        return (new CustomPath2D).fromCustomPath2D(this.getParsedPathShape(), 0, 0);
+    }
+    clone() {
+        return new Path(Object.assign({}, this.attribute));
+    }
+    getNoWorkAnimateAttr() {
+        return Path.NOWORK_ANIMATE_ATTR;
+    }
+}
+
+Path.NOWORK_ANIMATE_ATTR = Object.assign({
+    path: 1,
+    customPath: 1
+}, NOWORK_ANIMATE_ATTR);
+//# sourceMappingURL=path.js.map

package/es/graphic/path.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/graphic/path.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAEjF,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACnC,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC7C,OAAO,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAE/C,MAAM,mBAAmB,GAAG,CAAC,MAAM,EAAE,YAAY,EAAE,GAAG,sBAAsB,CAAC,CAAC;AAE9E,MAAM,OAAO,IAAK,SAAQ,OAA8B;IAUtD,YAAY,MAA6B;QACvC,KAAK,CAAC,MAAM,CAAC,CAAC;QAVhB,SAAI,GAAW,MAAM,CAAC;QAWpB,IAAI,CAAC,UAAU,GAAG,gBAAgB,CAAC;IACrC,CAAC;IAED,IAAI,SAAS;QACX,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,OAAO,IAAI,CAAC,kBAAkB,EAAE,CAAC;IACnC,CAAC;IAED,OAAO;QACL,OAAO,KAAK,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC5C,CAAC;IACO,QAAQ;QACd,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;IACrC,CAAC;IAED,kBAAkB;QAChB,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;YACf,OAAO,SAAS,CAAC,IAAoB,CAAC;SACvC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,IAAI,SAAS,CAAC,IAAI,YAAY,YAAY,EAAE;YAC1C,OAAO,SAAS,CAAC,IAAI,CAAC;SACvB;QAED,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;YACrB,IAAI,CAAC,iBAAiB,EAAE,CAAC;SAC1B;QAED,IAAI,IAAI,CAAC,KAAK,YAAY,YAAY,EAAE;YACtC,OAAO,IAAI,CAAC,KAAK,CAAC;SACnB;QACD,OAAO,SAAS,CAAC,IAAoB,CAAC;IACxC,CAAC;IAES,kBAAkB;QAC1B,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;QACtC,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,EAAE,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC;QACpE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,MAAM,MAAM,GAAG,WAAW,CAAC,cAAc,CAAC,oBAAoB,CAC5D,SAAS,EACT,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,EACnB,IAAI,CAAC,WAAW,EAChB,IAAI,CACS,CAAC;QAEhB,MAAM,EAAE,aAAa,GAAG,SAAS,CAAC,aAAa,EAAE,GAAG,SAAS,CAAC;QAC9D,MAAM,YAAY,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;QACjD,IAAI,YAAY,EAAE;YAChB,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;SAC7B;QAED,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC3B,OAAO,MAAM,CAAC;IAChB,CAAC;IAES,iBAAiB;QACzB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACjC,IAAI,QAAQ,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE;YAClC,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,IAAc,CAAC,CAAC;SACtE;aAAM,IAAI,SAAS,CAAC,UAAU,EAAE;YAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC;YAChC,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;SACxC;IACH,CAAC;IAES,kBAAkB;QAC1B,MAAM,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IAC1B,CAAC;IAED,mBAAmB,CAAC,IAAY;QAC9B,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;QACtC,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAES,cAAc,CAAC,IAAc;QACrC,OAAO,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,mBAAmB,CAAC,CAAC;IACzD,CAAC;IACS,aAAa,CAAC,GAAW;QACjC,OAAO,KAAK,CAAC,aAAa,CAAC,GAAG,EAAE,mBAAmB,CAAC,CAAC;IACvD,CAAC;IAED,YAAY;QACV,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,MAAM,CAAC,GAAG,CAAC,CAAC;QAEZ,OAAO,IAAI,YAAY,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,kBAAkB,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9E,CAAC;IAED,KAAK;QACH,OAAO,IAAI,IAAI,mBAAM,IAAI,CAAC,SAAS,EAAG,CAAC;IACzC,CAAC;IAED,oBAAoB;QAClB,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;;AAzGM,wBAAmB,mBACxB,IAAI,EAAE,CAAC,EACP,UAAU,EAAE,CAAC,IACV,mBAAmB,EACtB","file":"path.js","sourcesContent":["import type { AABBBounds, OBBBounds } from '@visactor/vutils';\nimport { isString, isNil } from '@visactor/vutils';\nimport { Graphic, GRAPHIC_UPDATE_TAG_KEY, NOWORK_ANIMATE_ATTR } from './graphic';\nimport type { ICustomPath2D, IPath, IPathGraphicAttribute } from '../interface';\nimport { parsePadding } from '../common/utils';\nimport { CustomPath2D } from '../common/custom-path2d';\nimport { getTheme } from './theme';\nimport { application } from '../application';\nimport { PATH_NUMBER_TYPE } from './constants';\n\nconst PATH_UPDATE_TAG_KEY = ['path', 'customPath', ...GRAPHIC_UPDATE_TAG_KEY];\n\nexport class Path extends Graphic<IPathGraphicAttribute> implements IPath {\n  type: 'path' = 'path';\n  cache?: ICustomPath2D;\n\n  static NOWORK_ANIMATE_ATTR = {\n    path: 1,\n    customPath: 1,\n    ...NOWORK_ANIMATE_ATTR\n  };\n\n  constructor(params: IPathGraphicAttribute) {\n    super(params);\n    this.numberType = PATH_NUMBER_TYPE;\n  }\n\n  get pathShape(): ICustomPath2D {\n    this.tryUpdateAABBBounds();\n    return this.getParsedPathShape();\n  }\n\n  isValid(): boolean {\n    return super.isValid() && this._isValid();\n  }\n  private _isValid(): boolean {\n    const { path } = this.attribute;\n    return path != null && path !== '';\n  }\n\n  getParsedPathShape(): CustomPath2D {\n    const pathTheme = getTheme(this).path;\n    if (!this.valid) {\n      return pathTheme.path as CustomPath2D;\n    }\n    const attribute = this.attribute;\n    if (attribute.path instanceof CustomPath2D) {\n      return attribute.path;\n    }\n\n    if (isNil(this.cache)) {\n      this.doUpdatePathShape();\n    }\n\n    if (this.cache instanceof CustomPath2D) {\n      return this.cache;\n    }\n    return pathTheme.path as CustomPath2D;\n  }\n\n  protected doUpdateAABBBounds(): AABBBounds {\n    const pathTheme = getTheme(this).path;\n    this.doUpdatePathShape();\n    this._AABBBounds.setValue(Infinity, Infinity, -Infinity, -Infinity);\n    const attribute = this.attribute;\n    const bounds = application.graphicService.updatePathAABBBounds(\n      attribute,\n      getTheme(this).path,\n      this._AABBBounds,\n      this\n    ) as AABBBounds;\n\n    const { boundsPadding = pathTheme.boundsPadding } = attribute;\n    const paddingArray = parsePadding(boundsPadding);\n    if (paddingArray) {\n      bounds.expand(paddingArray);\n    }\n\n    this.clearUpdateBoundTag();\n    return bounds;\n  }\n\n  protected doUpdatePathShape() {\n    const attribute = this.attribute;\n    if (isString(attribute.path, true)) {\n      this.cache = new CustomPath2D().fromString(attribute.path as string);\n    } else if (attribute.customPath) {\n      this.cache = new CustomPath2D();\n      attribute.customPath(this.cache, this);\n    }\n  }\n\n  protected tryUpdateOBBBounds(): OBBBounds {\n    throw new Error('暂不支持');\n  }\n\n  getDefaultAttribute(name: string) {\n    const pathTheme = getTheme(this).path;\n    return pathTheme[name];\n  }\n\n  protected needUpdateTags(keys: string[]): boolean {\n    return super.needUpdateTags(keys, PATH_UPDATE_TAG_KEY);\n  }\n  protected needUpdateTag(key: string): boolean {\n    return super.needUpdateTag(key, PATH_UPDATE_TAG_KEY);\n  }\n\n  toCustomPath() {\n    const x = 0;\n    const y = 0;\n\n    return new CustomPath2D().fromCustomPath2D(this.getParsedPathShape(), x, y);\n  }\n\n  clone() {\n    return new Path({ ...this.attribute });\n  }\n\n  getNoWorkAnimateAttr(): Record<string, number> {\n    return Path.NOWORK_ANIMATE_ATTR;\n  }\n}\n"]}

package/es/graphic/polygon.d.ts

@@ -0,0 +1,49 @@
+import type { AABBBounds, OBBBounds } from '@visactor/vutils';
+import { Graphic } from './graphic';
+import type { IPolygon, IPolygonGraphicAttribute } from '../interface/graphic/polygon';
+import { CustomPath2D } from '../common/custom-path2d';
+import type { GraphicType } from '../interface';
+export declare class Polygon extends Graphic<IPolygonGraphicAttribute> implements IPolygon {
+    type: GraphicType;
+    static NOWORK_ANIMATE_ATTR: {
+        strokeSeg: number;
+        boundsPadding: number;
+        pickMode: number;
+        boundsMode: number;
+        customPickShape: number;
+        pickable: number;
+        childrenPickable: number;
+        visible: number;
+        zIndex: number;
+        layout: number;
+        keepDirIn3d: number;
+        outerBorder: number;
+        innerBorder: number;
+        lineDash: number;
+        lineCap: number;
+        lineJoin: number;
+        miterLimit: number;
+        strokeBoundsBuffer: number;
+        scaleCenter: number;
+        anchor: number;
+        anchor3d: number;
+        postMatrix: number;
+        backgroundMode: number;
+        background: number;
+        texture: number;
+        cursor: number;
+        html: number;
+    };
+    constructor(params: IPolygonGraphicAttribute);
+    isValid(): boolean;
+    protected _isValid(): boolean;
+    protected doUpdateAABBBounds(): AABBBounds;
+    protected tryUpdateOBBBounds(): OBBBounds;
+    protected _interpolate(key: string, ratio: number, lastStepVal: any, nextStepVal: any, nextAttributes: any): void;
+    getDefaultAttribute(name: string): any;
+    protected needUpdateTags(keys: string[]): boolean;
+    protected needUpdateTag(key: string): boolean;
+    toCustomPath(): CustomPath2D;
+    clone(): Polygon;
+    getNoWorkAnimateAttr(): Record<string, number>;
+}