@wcardinal/wcardinal-ui 0.376.2 → 0.377.0

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@wcardinal/wcardinal-ui",
-	"version": "0.376.2",
+	"version": "0.377.0",
 	"license": "Apache-2.0",
 	"description": "A WebGL-based UI library",
 	"homepage": "https://github.com/winter-cardinal/winter-cardinal-ui",

package/dist/types/wcardinal/ui/shape/e-shape-deleter.d.ts

@@ -1,7 +0,0 @@
-import { EShape } from "./e-shape";
-import { EShapeContainer } from "./e-shape-container";
-export declare class EShapeDeleter {
-    private static EXCEPTIONS?;
-    private static addAll;
-    static delete(parent: EShape | EShapeContainer, shapes?: EShape[], generateListOfDetachedShapes?: boolean): EShape[] | null;
-}

package/dist/types/wcardinal/ui/shape/e-shape-search.d.ts

@@ -1,71 +0,0 @@
-import { EShape } from "./e-shape";
-import { EShapeContainer } from "./e-shape-container";
-import { EShapeType } from "./e-shape-type";
-/**
- * {@link EShape} search utility.
- */
-export declare class EShapeSearch {
-    static COMPARATOR_INDEX: (a: EShape, b: EShape) => number;
-    /**
-     * Returns indices of the given shapes.
-     *
-     * @param shapes shapes
-     * @return indices
-     */
-    static toIndices(shapes: EShape[]): number[];
-    /**
-     * Returns a depth of the given shape.
-     *
-     * @param shape a shape
-     * @return a depth
-     */
-    static toDepth(shape: EShape): number;
-    /**
-     * Returns a deepest shape on the path to the given shapes.
-     *
-     * @param shapeA a shape
-     * @param shapeB a shape
-     * @return a found shape
-     */
-    static toSharedParent(shapeA: EShape, shapeB: EShape): EShape | EShapeContainer;
-    /**
-     * Returns a shape on the path to the given shape whose parent is equals to the given parent.
-     * If there is no such shape, returns a root shape on the path.
-     *
-     * @param shape a shape
-     * @param parent a parent
-     * @returns a found shape
-     */
-    static toOfParent(shape: EShape, parent: EShape | EShapeContainer): EShape;
-    /**
-     * Returns true if the given target is on the path to the given shape.
-     *
-     * @param shape a shape
-     * @param target a check target
-     * @return true if the given target is on the path to the given shape
-     */
-    static isParent(shape: EShape, target: EShape | null): boolean;
-    /**
-     * Returns a selected shape on the path to the given shape.
-     * If there are more than one selected shapes, returns a deepest selected shape.
-     *
-     * @param shape a shape
-     * @return a found selected shape or null
-     */
-    static toSelected(shape: EShape): EShape | null;
-    static findChildById(shape: {
-        children: EShape[];
-    }, id: string, recursively?: boolean): EShape | null;
-    static findChildByType(shape: {
-        children: EShape[];
-    }, type: EShapeType, recursively?: boolean): EShape | null;
-    static findChild(shape: {
-        children: EShape[];
-    }, matcher: (shape: EShape) => boolean, recursively?: boolean): EShape | null;
-    static findChildrenByType(shape: {
-        children: EShape[];
-    }, type: EShapeType, recursively?: boolean, result?: EShape[]): EShape[];
-    static findChildren(shape: {
-        children: EShape[];
-    }, matcher: (shape: EShape) => boolean, recursively?: boolean, result?: EShape[]): EShape[];
-}

package/dist/wcardinal/ui/shape/e-shape-deleter.js

@@ -1,124 +0,0 @@
-/*
- * Copyright (C) 2019 Toshiba Corporation
- * SPDX-License-Identifier: Apache-2.0
- */
-import { EShapeSearch } from "./e-shape-search";
-var EShapeDeleter = /** @class */ (function () {
-    function EShapeDeleter() {
-    }
-    EShapeDeleter.addAll = function (shapes, result) {
-        for (var i = 0, imax = shapes.length; i < imax; ++i) {
-            var shape = shapes[i];
-            result.add(shape);
-            this.addAll(shape.children, result);
-        }
-        return result;
-    };
-    EShapeDeleter.delete = function (parent, shapes, generateListOfDetachedShapes) {
-        var _a;
-        var children = parent.children;
-        var length = children.length;
-        // Update indices
-        var exceptions = ((_a = EShapeDeleter.EXCEPTIONS) !== null && _a !== void 0 ? _a : (EShapeDeleter.EXCEPTIONS = new Set()));
-        for (var i = 0; i < length; ++i) {
-            var child = children[i];
-            if (child.selected) {
-                child.index = length + i;
-                exceptions.add(child);
-                this.addAll(child.children, exceptions);
-            }
-            else {
-                child.index = i;
-            }
-        }
-        // Sort
-        children.sort(EShapeSearch.COMPARATOR_INDEX);
-        // Detach
-        if (generateListOfDetachedShapes === true) {
-            for (var i = length - 1; 0 <= i; --i) {
-                var child = children[i];
-                if (child.selected) {
-                    child.index -= length;
-                    child.parent = null;
-                    child.selected = false;
-                    child.uploaded = undefined;
-                    child.onDetach(exceptions);
-                }
-                else {
-                    exceptions.clear();
-                    var size = children.length - (i + 1);
-                    if (0 < size) {
-                        var result = children.splice(i + 1, size);
-                        if (shapes != null) {
-                            shapes.length = 0;
-                        }
-                        parent.onChildTransformChange();
-                        parent.toDirty();
-                        return result;
-                    }
-                    else {
-                        if (shapes != null) {
-                            shapes.length = 0;
-                        }
-                        return null;
-                    }
-                }
-            }
-            exceptions.clear();
-            if (0 < children.length) {
-                var result = children.splice(0, children.length);
-                if (shapes != null) {
-                    shapes.length = 0;
-                }
-                parent.onChildTransformChange();
-                parent.toDirty();
-                return result;
-            }
-            else {
-                if (shapes != null) {
-                    shapes.length = 0;
-                }
-                return null;
-            }
-        }
-        else {
-            for (var i = length - 1; 0 <= i; --i) {
-                var child = children[i];
-                if (child.selected) {
-                    child.parent = null;
-                    child.selected = false;
-                    child.uploaded = undefined;
-                    child.onDetach(exceptions);
-                }
-                else {
-                    exceptions.clear();
-                    children.length = i + 1;
-                    if (shapes != null) {
-                        shapes.length = 0;
-                    }
-                    parent.onChildTransformChange();
-                    parent.toDirty();
-                    return null;
-                }
-            }
-            exceptions.clear();
-            if (0 < children.length) {
-                children.length = 0;
-                if (shapes != null) {
-                    shapes.length = 0;
-                }
-                parent.onChildTransformChange();
-                parent.toDirty();
-            }
-            else {
-                if (shapes != null) {
-                    shapes.length = 0;
-                }
-            }
-            return null;
-        }
-    };
-    return EShapeDeleter;
-}());
-export { EShapeDeleter };
-//# sourceMappingURL=e-shape-deleter.js.map

package/dist/wcardinal/ui/shape/e-shape-deleter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"e-shape-deleter.js","sourceRoot":"","sources":["../../../../src/main/typescript/wcardinal/ui/shape/e-shape-deleter.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAEhD;IAAA;IAmHA,CAAC;IAhHe,oBAAM,GAArB,UAAsB,MAAgB,EAAE,MAAmB;QAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACpD,IAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAClB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;SACpC;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAEM,oBAAM,GAAb,UACC,MAAgC,EAChC,MAAiB,EACjB,4BAAsC;;QAEtC,IAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,CAAC;QACjC,IAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC;QAE/B,iBAAiB;QACjB,IAAM,UAAU,GAAG,OAAC,aAAa,CAAC,UAAU,oCAAxB,aAAa,CAAC,UAAU,GAAK,IAAI,GAAG,EAAU,EAAC,CAAC;QACpE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,EAAE,CAAC,EAAE;YAChC,IAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,CAAC,QAAQ,EAAE;gBACnB,KAAK,CAAC,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;gBACzB,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACtB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;aACxC;iBAAM;gBACN,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;aAChB;SACD;QAED,OAAO;QACP,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,gBAAgB,CAAC,CAAC;QAE7C,SAAS;QACT,IAAI,4BAA4B,KAAK,IAAI,EAAE;YAC1C,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;gBACrC,IAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,KAAK,CAAC,QAAQ,EAAE;oBACnB,KAAK,CAAC,KAAK,IAAI,MAAM,CAAC;oBACtB,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;oBACpB,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC;oBACvB,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;oBAC3B,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;iBAC3B;qBAAM;oBACN,UAAU,CAAC,KAAK,EAAE,CAAC;oBACnB,IAAM,IAAI,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACvC,IAAI,CAAC,GAAG,IAAI,EAAE;wBACb,IAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;wBAC5C,IAAI,MAAM,IAAI,IAAI,EAAE;4BACnB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;yBAClB;wBACD,MAAM,CAAC,sBAAsB,EAAE,CAAC;wBAChC,MAAM,CAAC,OAAO,EAAE,CAAC;wBACjB,OAAO,MAAM,CAAC;qBACd;yBAAM;wBACN,IAAI,MAAM,IAAI,IAAI,EAAE;4BACnB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;yBAClB;wBACD,OAAO,IAAI,CAAC;qBACZ;iBACD;aACD;YACD,UAAU,CAAC,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE;gBACxB,IAAM,MAAM,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC;gBACnD,IAAI,MAAM,IAAI,IAAI,EAAE;oBACnB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;iBAClB;gBACD,MAAM,CAAC,sBAAsB,EAAE,CAAC;gBAChC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACjB,OAAO,MAAM,CAAC;aACd;iBAAM;gBACN,IAAI,MAAM,IAAI,IAAI,EAAE;oBACnB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;iBAClB;gBACD,OAAO,IAAI,CAAC;aACZ;SACD;aAAM;YACN,KAAK,IAAI,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;gBACrC,IAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAC1B,IAAI,KAAK,CAAC,QAAQ,EAAE;oBACnB,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;oBACpB,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC;oBACvB,KAAK,CAAC,QAAQ,GAAG,SAAS,CAAC;oBAC3B,KAAK,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;iBAC3B;qBAAM;oBACN,UAAU,CAAC,KAAK,EAAE,CAAC;oBACnB,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;oBACxB,IAAI,MAAM,IAAI,IAAI,EAAE;wBACnB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;qBAClB;oBACD,MAAM,CAAC,sBAAsB,EAAE,CAAC;oBAChC,MAAM,CAAC,OAAO,EAAE,CAAC;oBACjB,OAAO,IAAI,CAAC;iBACZ;aACD;YACD,UAAU,CAAC,KAAK,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE;gBACxB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;gBACpB,IAAI,MAAM,IAAI,IAAI,EAAE;oBACnB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;iBAClB;gBACD,MAAM,CAAC,sBAAsB,EAAE,CAAC;gBAChC,MAAM,CAAC,OAAO,EAAE,CAAC;aACjB;iBAAM;gBACN,IAAI,MAAM,IAAI,IAAI,EAAE;oBACnB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;iBAClB;aACD;YACD,OAAO,IAAI,CAAC;SACZ;IACF,CAAC;IACF,oBAAC;AAAD,CAAC,AAnHD,IAmHC","sourcesContent":["/*\n * Copyright (C) 2019 Toshiba Corporation\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport { EShape } from \"./e-shape\";\nimport { EShapeContainer } from \"./e-shape-container\";\nimport { EShapeSearch } from \"./e-shape-search\";\n\nexport class EShapeDeleter {\n\tprivate static EXCEPTIONS?: Set<EShape>;\n\n\tprivate static addAll(shapes: EShape[], result: Set<EShape>): Set<EShape> {\n\t\tfor (let i = 0, imax = shapes.length; i < imax; ++i) {\n\t\t\tconst shape = shapes[i];\n\t\t\tresult.add(shape);\n\t\t\tthis.addAll(shape.children, result);\n\t\t}\n\t\treturn result;\n\t}\n\n\tstatic delete(\n\t\tparent: EShape | EShapeContainer,\n\t\tshapes?: EShape[],\n\t\tgenerateListOfDetachedShapes?: boolean\n\t): EShape[] | null {\n\t\tconst children = parent.children;\n\t\tconst length = children.length;\n\n\t\t// Update indices\n\t\tconst exceptions = (EShapeDeleter.EXCEPTIONS ??= new Set<EShape>());\n\t\tfor (let i = 0; i < length; ++i) {\n\t\t\tconst child = children[i];\n\t\t\tif (child.selected) {\n\t\t\t\tchild.index = length + i;\n\t\t\t\texceptions.add(child);\n\t\t\t\tthis.addAll(child.children, exceptions);\n\t\t\t} else {\n\t\t\t\tchild.index = i;\n\t\t\t}\n\t\t}\n\n\t\t// Sort\n\t\tchildren.sort(EShapeSearch.COMPARATOR_INDEX);\n\n\t\t// Detach\n\t\tif (generateListOfDetachedShapes === true) {\n\t\t\tfor (let i = length - 1; 0 <= i; --i) {\n\t\t\t\tconst child = children[i];\n\t\t\t\tif (child.selected) {\n\t\t\t\t\tchild.index -= length;\n\t\t\t\t\tchild.parent = null;\n\t\t\t\t\tchild.selected = false;\n\t\t\t\t\tchild.uploaded = undefined;\n\t\t\t\t\tchild.onDetach(exceptions);\n\t\t\t\t} else {\n\t\t\t\t\texceptions.clear();\n\t\t\t\t\tconst size = children.length - (i + 1);\n\t\t\t\t\tif (0 < size) {\n\t\t\t\t\t\tconst result = children.splice(i + 1, size);\n\t\t\t\t\t\tif (shapes != null) {\n\t\t\t\t\t\t\tshapes.length = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tparent.onChildTransformChange();\n\t\t\t\t\t\tparent.toDirty();\n\t\t\t\t\t\treturn result;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (shapes != null) {\n\t\t\t\t\t\t\tshapes.length = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\treturn null;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\texceptions.clear();\n\t\t\tif (0 < children.length) {\n\t\t\t\tconst result = children.splice(0, children.length);\n\t\t\t\tif (shapes != null) {\n\t\t\t\t\tshapes.length = 0;\n\t\t\t\t}\n\t\t\t\tparent.onChildTransformChange();\n\t\t\t\tparent.toDirty();\n\t\t\t\treturn result;\n\t\t\t} else {\n\t\t\t\tif (shapes != null) {\n\t\t\t\t\tshapes.length = 0;\n\t\t\t\t}\n\t\t\t\treturn null;\n\t\t\t}\n\t\t} else {\n\t\t\tfor (let i = length - 1; 0 <= i; --i) {\n\t\t\t\tconst child = children[i];\n\t\t\t\tif (child.selected) {\n\t\t\t\t\tchild.parent = null;\n\t\t\t\t\tchild.selected = false;\n\t\t\t\t\tchild.uploaded = undefined;\n\t\t\t\t\tchild.onDetach(exceptions);\n\t\t\t\t} else {\n\t\t\t\t\texceptions.clear();\n\t\t\t\t\tchildren.length = i + 1;\n\t\t\t\t\tif (shapes != null) {\n\t\t\t\t\t\tshapes.length = 0;\n\t\t\t\t\t}\n\t\t\t\t\tparent.onChildTransformChange();\n\t\t\t\t\tparent.toDirty();\n\t\t\t\t\treturn null;\n\t\t\t\t}\n\t\t\t}\n\t\t\texceptions.clear();\n\t\t\tif (0 < children.length) {\n\t\t\t\tchildren.length = 0;\n\t\t\t\tif (shapes != null) {\n\t\t\t\t\tshapes.length = 0;\n\t\t\t\t}\n\t\t\t\tparent.onChildTransformChange();\n\t\t\t\tparent.toDirty();\n\t\t\t} else {\n\t\t\t\tif (shapes != null) {\n\t\t\t\t\tshapes.length = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn null;\n\t\t}\n\t}\n}\n"]}

package/dist/wcardinal/ui/shape/e-shape-search.js

@@ -1,203 +0,0 @@
-/*
- * Copyright (C) 2019 Toshiba Corporation
- * SPDX-License-Identifier: Apache-2.0
- */
-import { EShapeBase } from "./variant/e-shape-base";
-/**
- * {@link EShape} search utility.
- */
-var EShapeSearch = /** @class */ (function () {
-    function EShapeSearch() {
-    }
-    /**
-     * Returns indices of the given shapes.
-     *
-     * @param shapes shapes
-     * @return indices
-     */
-    EShapeSearch.toIndices = function (shapes) {
-        var result = [];
-        for (var i = 0, imax = shapes.length; i < imax; ++i) {
-            result.push(shapes[i].index);
-        }
-        return result;
-    };
-    /**
-     * Returns a depth of the given shape.
-     *
-     * @param shape a shape
-     * @return a depth
-     */
-    EShapeSearch.toDepth = function (shape) {
-        var result = 0;
-        var parent = shape.parent;
-        while (parent instanceof EShapeBase) {
-            result += 1;
-            parent = parent.parent;
-        }
-        return result;
-    };
-    /**
-     * Returns a deepest shape on the path to the given shapes.
-     *
-     * @param shapeA a shape
-     * @param shapeB a shape
-     * @return a found shape
-     */
-    EShapeSearch.toSharedParent = function (shapeA, shapeB) {
-        var depthA = this.toDepth(shapeA);
-        var depthB = this.toDepth(shapeB);
-        if (depthA < depthB) {
-            var parent_1 = shapeA.parent;
-            while (parent_1 instanceof EShapeBase) {
-                if (this.isParent(shapeB, parent_1)) {
-                    return parent_1;
-                }
-                parent_1 = parent_1.parent;
-            }
-            return parent_1;
-        }
-        else {
-            var parent_2 = shapeB.parent;
-            while (parent_2 instanceof EShapeBase) {
-                if (this.isParent(shapeA, parent_2)) {
-                    return parent_2;
-                }
-                parent_2 = parent_2.parent;
-            }
-            return parent_2;
-        }
-    };
-    /**
-     * Returns a shape on the path to the given shape whose parent is equals to the given parent.
-     * If there is no such shape, returns a root shape on the path.
-     *
-     * @param shape a shape
-     * @param parent a parent
-     * @returns a found shape
-     */
-    EShapeSearch.toOfParent = function (shape, parent) {
-        var shapeParent = shape.parent;
-        while (shapeParent !== parent && shapeParent instanceof EShapeBase) {
-            shape = shapeParent;
-            shapeParent = shapeParent.parent;
-        }
-        return shape;
-    };
-    /**
-     * Returns true if the given target is on the path to the given shape.
-     *
-     * @param shape a shape
-     * @param target a check target
-     * @return true if the given target is on the path to the given shape
-     */
-    EShapeSearch.isParent = function (shape, target) {
-        var parent = shape.parent;
-        while (parent instanceof EShapeBase) {
-            if (parent === target) {
-                return true;
-            }
-            parent = parent.parent;
-        }
-        return false;
-    };
-    /**
-     * Returns a selected shape on the path to the given shape.
-     * If there are more than one selected shapes, returns a deepest selected shape.
-     *
-     * @param shape a shape
-     * @return a found selected shape or null
-     */
-    EShapeSearch.toSelected = function (shape) {
-        var target = shape;
-        while (target instanceof EShapeBase) {
-            if (target.selected) {
-                return target;
-            }
-            target = target.parent;
-        }
-        return null;
-    };
-    EShapeSearch.findChildById = function (shape, id, recursively) {
-        var children = shape.children;
-        for (var i = 0, imax = children.length; i < imax; ++i) {
-            var child = children[i];
-            if (child.id === id) {
-                return child;
-            }
-            if (recursively === true) {
-                var result = EShapeSearch.findChildById(child, id, recursively);
-                if (result != null) {
-                    return result;
-                }
-            }
-        }
-        return null;
-    };
-    EShapeSearch.findChildByType = function (shape, type, recursively) {
-        var children = shape.children;
-        for (var i = 0, imax = children.length; i < imax; ++i) {
-            var child = children[i];
-            if (child.type === type) {
-                return child;
-            }
-            if (recursively === true) {
-                var result = EShapeSearch.findChildByType(child, type, recursively);
-                if (result != null) {
-                    return result;
-                }
-            }
-        }
-        return null;
-    };
-    EShapeSearch.findChild = function (shape, matcher, recursively) {
-        var children = shape.children;
-        for (var i = 0, imax = children.length; i < imax; ++i) {
-            var child = children[i];
-            if (matcher(child)) {
-                return child;
-            }
-            if (recursively === true) {
-                var result = EShapeSearch.findChild(child, matcher, recursively);
-                if (result != null) {
-                    return result;
-                }
-            }
-        }
-        return null;
-    };
-    EShapeSearch.findChildrenByType = function (shape, type, recursively, result) {
-        result = result || [];
-        var children = shape.children;
-        for (var i = 0, imax = children.length; i < imax; ++i) {
-            var child = children[i];
-            if (child.type === type) {
-                result.push(child);
-            }
-            if (recursively === true) {
-                EShapeSearch.findChildrenByType(child, type, recursively, result);
-            }
-        }
-        return result;
-    };
-    EShapeSearch.findChildren = function (shape, matcher, recursively, result) {
-        result = result || [];
-        var children = shape.children;
-        for (var i = 0, imax = children.length; i < imax; ++i) {
-            var child = children[i];
-            if (matcher(child)) {
-                result.push(child);
-            }
-            if (recursively === true) {
-                EShapeSearch.findChildren(child, matcher, recursively, result);
-            }
-        }
-        return result;
-    };
-    EShapeSearch.COMPARATOR_INDEX = function (a, b) {
-        return a.index - b.index;
-    };
-    return EShapeSearch;
-}());
-export { EShapeSearch };
-//# sourceMappingURL=e-shape-search.js.map

package/dist/wcardinal/ui/shape/e-shape-search.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"e-shape-search.js","sourceRoot":"","sources":["../../../../src/main/typescript/wcardinal/ui/shape/e-shape-search.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AAEpD;;GAEG;AACH;IAAA;IA6NA,CAAC;IAxNA;;;;;OAKG;IACI,sBAAS,GAAhB,UAAiB,MAAgB;QAChC,IAAM,MAAM,GAAG,EAAE,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACpD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;SAC7B;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;;OAKG;IACI,oBAAO,GAAd,UAAe,KAAa;QAC3B,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,OAAO,MAAM,YAAY,UAAU,EAAE;YACpC,MAAM,IAAI,CAAC,CAAC;YACZ,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;SACvB;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACI,2BAAc,GAArB,UAAsB,MAAc,EAAE,MAAc;QACnD,IAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACpC,IAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,MAAM,GAAG,MAAM,EAAE;YACpB,IAAI,QAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YAC3B,OAAO,QAAM,YAAY,UAAU,EAAE;gBACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAM,CAAC,EAAE;oBAClC,OAAO,QAAM,CAAC;iBACd;gBACD,QAAM,GAAG,QAAM,CAAC,MAAM,CAAC;aACvB;YACD,OAAO,QAAO,CAAC;SACf;aAAM;YACN,IAAI,QAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YAC3B,OAAO,QAAM,YAAY,UAAU,EAAE;gBACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAM,CAAC,EAAE;oBAClC,OAAO,QAAM,CAAC;iBACd;gBACD,QAAM,GAAG,QAAM,CAAC,MAAM,CAAC;aACvB;YACD,OAAO,QAAO,CAAC;SACf;IACF,CAAC;IAED;;;;;;;OAOG;IACI,uBAAU,GAAjB,UAAkB,KAAa,EAAE,MAAgC;QAChE,IAAI,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC;QAC/B,OAAO,WAAW,KAAK,MAAM,IAAI,WAAW,YAAY,UAAU,EAAE;YACnE,KAAK,GAAG,WAAW,CAAC;YACpB,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC;SACjC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACI,qBAAQ,GAAf,UAAgB,KAAa,EAAE,MAAqB;QACnD,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,OAAO,MAAM,YAAY,UAAU,EAAE;YACpC,IAAI,MAAM,KAAK,MAAM,EAAE;gBACtB,OAAO,IAAI,CAAC;aACZ;YACD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;SACvB;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACI,uBAAU,GAAjB,UAAkB,KAAa;QAC9B,IAAI,MAAM,GAAoC,KAAK,CAAC;QACpD,OAAO,MAAM,YAAY,UAAU,EAAE;YACpC,IAAI,MAAM,CAAC,QAAQ,EAAE;gBACpB,OAAO,MAAM,CAAC;aACd;YACD,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;SACvB;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,0BAAa,GAApB,UACC,KAA6B,EAC7B,EAAU,EACV,WAAqB;QAErB,IAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACtD,IAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,CAAC,EAAE,KAAK,EAAE,EAAE;gBACpB,OAAO,KAAK,CAAC;aACb;YACD,IAAI,WAAW,KAAK,IAAI,EAAE;gBACzB,IAAM,MAAM,GAAG,YAAY,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,EAAE,WAAW,CAAC,CAAC;gBAClE,IAAI,MAAM,IAAI,IAAI,EAAE;oBACnB,OAAO,MAAM,CAAC;iBACd;aACD;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,4BAAe,GAAtB,UACC,KAA6B,EAC7B,IAAgB,EAChB,WAAqB;QAErB,IAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACtD,IAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE;gBACxB,OAAO,KAAK,CAAC;aACb;YACD,IAAI,WAAW,KAAK,IAAI,EAAE;gBACzB,IAAM,MAAM,GAAG,YAAY,CAAC,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;gBACtE,IAAI,MAAM,IAAI,IAAI,EAAE;oBACnB,OAAO,MAAM,CAAC;iBACd;aACD;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,sBAAS,GAAhB,UACC,KAA6B,EAC7B,OAAmC,EACnC,WAAqB;QAErB,IAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACtD,IAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;gBACnB,OAAO,KAAK,CAAC;aACb;YACD,IAAI,WAAW,KAAK,IAAI,EAAE;gBACzB,IAAM,MAAM,GAAG,YAAY,CAAC,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;gBACnE,IAAI,MAAM,IAAI,IAAI,EAAE;oBACnB,OAAO,MAAM,CAAC;iBACd;aACD;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAEM,+BAAkB,GAAzB,UACC,KAA6B,EAC7B,IAAgB,EAChB,WAAqB,EACrB,MAAiB;QAEjB,MAAM,GAAG,MAAM,IAAI,EAAE,CAAC;QACtB,IAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACtD,IAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE;gBACxB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACnB;YACD,IAAI,WAAW,KAAK,IAAI,EAAE;gBACzB,YAAY,CAAC,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;aAClE;SACD;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAEM,yBAAY,GAAnB,UACC,KAA6B,EAC7B,OAAmC,EACnC,WAAqB,EACrB,MAAiB;QAEjB,MAAM,GAAG,MAAM,IAAI,EAAE,CAAC;QACtB,IAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,EAAE,CAAC,EAAE;YACtD,IAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;gBACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACnB;YACD,IAAI,WAAW,KAAK,IAAI,EAAE;gBACzB,YAAY,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;aAC/D;SACD;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IA3NM,6BAAgB,GAAG,UAAC,CAAS,EAAE,CAAS;QAC9C,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC1B,CAAC,CAAC;IA0NH,mBAAC;CAAA,AA7ND,IA6NC;SA7NY,YAAY","sourcesContent":["/*\n * Copyright (C) 2019 Toshiba Corporation\n * SPDX-License-Identifier: Apache-2.0\n */\n\nimport { EShape } from \"./e-shape\";\nimport { EShapeContainer } from \"./e-shape-container\";\nimport { EShapeType } from \"./e-shape-type\";\nimport { EShapeBase } from \"./variant/e-shape-base\";\n\n/**\n * {@link EShape} search utility.\n */\nexport class EShapeSearch {\n\tstatic COMPARATOR_INDEX = (a: EShape, b: EShape): number => {\n\t\treturn a.index - b.index;\n\t};\n\n\t/**\n\t * Returns indices of the given shapes.\n\t *\n\t * @param shapes shapes\n\t * @return indices\n\t */\n\tstatic toIndices(shapes: EShape[]): number[] {\n\t\tconst result = [];\n\t\tfor (let i = 0, imax = shapes.length; i < imax; ++i) {\n\t\t\tresult.push(shapes[i].index);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * Returns a depth of the given shape.\n\t *\n\t * @param shape a shape\n\t * @return a depth\n\t */\n\tstatic toDepth(shape: EShape): number {\n\t\tlet result = 0;\n\t\tlet parent = shape.parent;\n\t\twhile (parent instanceof EShapeBase) {\n\t\t\tresult += 1;\n\t\t\tparent = parent.parent;\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * Returns a deepest shape on the path to the given shapes.\n\t *\n\t * @param shapeA a shape\n\t * @param shapeB a shape\n\t * @return a found shape\n\t */\n\tstatic toSharedParent(shapeA: EShape, shapeB: EShape): EShape | EShapeContainer {\n\t\tconst depthA = this.toDepth(shapeA);\n\t\tconst depthB = this.toDepth(shapeB);\n\t\tif (depthA < depthB) {\n\t\t\tlet parent = shapeA.parent;\n\t\t\twhile (parent instanceof EShapeBase) {\n\t\t\t\tif (this.isParent(shapeB, parent)) {\n\t\t\t\t\treturn parent;\n\t\t\t\t}\n\t\t\t\tparent = parent.parent;\n\t\t\t}\n\t\t\treturn parent!;\n\t\t} else {\n\t\t\tlet parent = shapeB.parent;\n\t\t\twhile (parent instanceof EShapeBase) {\n\t\t\t\tif (this.isParent(shapeA, parent)) {\n\t\t\t\t\treturn parent;\n\t\t\t\t}\n\t\t\t\tparent = parent.parent;\n\t\t\t}\n\t\t\treturn parent!;\n\t\t}\n\t}\n\n\t/**\n\t * Returns a shape on the path to the given shape whose parent is equals to the given parent.\n\t * If there is no such shape, returns a root shape on the path.\n\t *\n\t * @param shape a shape\n\t * @param parent a parent\n\t * @returns a found shape\n\t */\n\tstatic toOfParent(shape: EShape, parent: EShape | EShapeContainer): EShape {\n\t\tlet shapeParent = shape.parent;\n\t\twhile (shapeParent !== parent && shapeParent instanceof EShapeBase) {\n\t\t\tshape = shapeParent;\n\t\t\tshapeParent = shapeParent.parent;\n\t\t}\n\t\treturn shape;\n\t}\n\n\t/**\n\t * Returns true if the given target is on the path to the given shape.\n\t *\n\t * @param shape a shape\n\t * @param target a check target\n\t * @return true if the given target is on the path to the given shape\n\t */\n\tstatic isParent(shape: EShape, target: EShape | null): boolean {\n\t\tlet parent = shape.parent;\n\t\twhile (parent instanceof EShapeBase) {\n\t\t\tif (parent === target) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tparent = parent.parent;\n\t\t}\n\t\treturn false;\n\t}\n\n\t/**\n\t * Returns a selected shape on the path to the given shape.\n\t * If there are more than one selected shapes, returns a deepest selected shape.\n\t *\n\t * @param shape a shape\n\t * @return a found selected shape or null\n\t */\n\tstatic toSelected(shape: EShape): EShape | null {\n\t\tlet target: EShape | EShapeContainer | null = shape;\n\t\twhile (target instanceof EShapeBase) {\n\t\t\tif (target.selected) {\n\t\t\t\treturn target;\n\t\t\t}\n\t\t\ttarget = target.parent;\n\t\t}\n\t\treturn null;\n\t}\n\n\tstatic findChildById(\n\t\tshape: { children: EShape[] },\n\t\tid: string,\n\t\trecursively?: boolean\n\t): EShape | null {\n\t\tconst children = shape.children;\n\t\tfor (let i = 0, imax = children.length; i < imax; ++i) {\n\t\t\tconst child = children[i];\n\t\t\tif (child.id === id) {\n\t\t\t\treturn child;\n\t\t\t}\n\t\t\tif (recursively === true) {\n\t\t\t\tconst result = EShapeSearch.findChildById(child, id, recursively);\n\t\t\t\tif (result != null) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}\n\n\tstatic findChildByType(\n\t\tshape: { children: EShape[] },\n\t\ttype: EShapeType,\n\t\trecursively?: boolean\n\t): EShape | null {\n\t\tconst children = shape.children;\n\t\tfor (let i = 0, imax = children.length; i < imax; ++i) {\n\t\t\tconst child = children[i];\n\t\t\tif (child.type === type) {\n\t\t\t\treturn child;\n\t\t\t}\n\t\t\tif (recursively === true) {\n\t\t\t\tconst result = EShapeSearch.findChildByType(child, type, recursively);\n\t\t\t\tif (result != null) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}\n\n\tstatic findChild(\n\t\tshape: { children: EShape[] },\n\t\tmatcher: (shape: EShape) => boolean,\n\t\trecursively?: boolean\n\t): EShape | null {\n\t\tconst children = shape.children;\n\t\tfor (let i = 0, imax = children.length; i < imax; ++i) {\n\t\t\tconst child = children[i];\n\t\t\tif (matcher(child)) {\n\t\t\t\treturn child;\n\t\t\t}\n\t\t\tif (recursively === true) {\n\t\t\t\tconst result = EShapeSearch.findChild(child, matcher, recursively);\n\t\t\t\tif (result != null) {\n\t\t\t\t\treturn result;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}\n\n\tstatic findChildrenByType(\n\t\tshape: { children: EShape[] },\n\t\ttype: EShapeType,\n\t\trecursively?: boolean,\n\t\tresult?: EShape[]\n\t): EShape[] {\n\t\tresult = result || [];\n\t\tconst children = shape.children;\n\t\tfor (let i = 0, imax = children.length; i < imax; ++i) {\n\t\t\tconst child = children[i];\n\t\t\tif (child.type === type) {\n\t\t\t\tresult.push(child);\n\t\t\t}\n\t\t\tif (recursively === true) {\n\t\t\t\tEShapeSearch.findChildrenByType(child, type, recursively, result);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\n\tstatic findChildren(\n\t\tshape: { children: EShape[] },\n\t\tmatcher: (shape: EShape) => boolean,\n\t\trecursively?: boolean,\n\t\tresult?: EShape[]\n\t): EShape[] {\n\t\tresult = result || [];\n\t\tconst children = shape.children;\n\t\tfor (let i = 0, imax = children.length; i < imax; ++i) {\n\t\t\tconst child = children[i];\n\t\t\tif (matcher(child)) {\n\t\t\t\tresult.push(child);\n\t\t\t}\n\t\t\tif (recursively === true) {\n\t\t\t\tEShapeSearch.findChildren(child, matcher, recursively, result);\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n}\n"]}