@magicbe/design/dist/utils/clipboard.js

React + Antd Drag Drop Visual design

var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
    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) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
        step((generator = generator.apply(thisArg, _arguments || [])).next());
    });
};
var __generator = (this && this.__generator) || function (thisArg, body) {
    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
    function verb(n) { return function (v) { return step([n, v]); }; }
    function step(op) {
        if (f) throw new TypeError("Generator is already executing.");
        while (g && (g = 0, op[0] && (_ = 0)), _) try {
            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
            if (y = 0, t) op = [op[0] & 2, t.value];
            switch (op[0]) {
                case 0: case 1: t = op; break;
                case 4: _.label++; return { value: op[1], done: false };
                case 5: _.label++; y = op[1]; op = [0]; continue;
                case 7: op = _.ops.pop(); _.trys.pop(); continue;
                default:
                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
                    if (t[2]) _.ops.pop();
                    _.trys.pop(); continue;
            }
            op = body.call(thisArg, _);
        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
    }
};
import { find, flattenDeep } from "lodash";
import { SchemaUtil } from "./schema";
/**将数据结构复制到剪切板 */
export var writeText = function (schema) { return navigator.clipboard.writeText(JSON.stringify(schema)); };
/**将剪切板内容转换成 CopySchema 数据 */
export var readJson = function () { return __awaiter(void 0, void 0, void 0, function () {
    var text, schema_json;
    return __generator(this, function (_a) {
        switch (_a.label) {
            case 0: return [4 /*yield*/, navigator.clipboard.readText()];
            case 1:
                text = _a.sent();
                if (!text)
                    return [2 /*return*/, Promise.reject("剪切板内容为空")];
                try {
                    schema_json = JSON.parse(text);
                    return [2 /*return*/, Promise.resolve(schema_json)];
                }
                catch (error) {
                    return [2 /*return*/, Promise.reject("剪切板内容解析失败")];
                }
                return [2 /*return*/];
        }
    });
}); };
/**将数据包装成树结构 */
export var wrappSchemaTree = function (schemas, uuid) {
    var schema = find(schemas, { uuid: uuid });
    var children = schemas.filter(function (_a) {
        var parent = _a.parent;
        return parent === schema.uuid;
    });
    if (children === null || children === void 0 ? void 0 : children.length) {
        schema.children = children.map(function (_a) {
            var uuid = _a.uuid;
            return wrappSchemaTree(schemas, uuid);
        });
    }
    return schema;
};
/**将树结构数据解构成扁平数据并创建成新的 Schema 数据 */
export var flattSchemaTree = function (schema, next_parent, reset) {
    var _a;
    if (reset === void 0) { reset = true; }
    var widget = schema.widget, group = schema.group, properties = schema.properties, title = schema.title, uuid = schema.uuid, parent = schema.parent;
    var next = { widget: widget, group: group, properties: properties, title: title, parent: parent, uuid: uuid };
    if (reset) {
        next.uuid = SchemaUtil.generatorId();
        next.parent = next_parent;
    }
    var children = (_a = schema.children) === null || _a === void 0 ? void 0 : _a.map(function (item) { return flattSchemaTree(item, next.uuid, reset); });
    return [next].concat(flattenDeep(children));
};
/**复制数据生成新的uuid */
export var cloneSchemas = function (schemas, parent, first) {
    if (!schemas.length)
        throw new Error("schemas length is 0");
    if (!first)
        first = schemas[0].uuid;
    return flattSchemaTree(wrappSchemaTree(schemas, first), parent);
};
/**找到相关子节点id */
export var findSchemaUuidList = function (schemas, uuid) {
    var current = find(schemas, { uuid: uuid });
    var children = schemas
        .filter(function (_a) {
        var parent = _a.parent;
        return parent === (current === null || current === void 0 ? void 0 : current.uuid);
    })
        .map(function (schema) { return findSchemaUuidList(schemas, schema.uuid); });
    return [current.uuid].concat(flattenDeep(children));
};