@digipair/skill-web-chatbot 0.3.0

package/index-d0b453e2.esm.js

@@ -0,0 +1,607 @@
+import { x as x$1, y as y$1, A, d as dn, z as zs } from './layout-c5a37d74.esm.js';
+import { K as Kt, a as ar, e as er, r as rr, i as ir, s as sr, G as Gt, v as v$1, P as Pt, t as tr, R as R$1, b as vt } from './edges-558884ee.esm.js';
+import { S as S$1, i as ia, U as Ut, a as At } from './index.esm2.js';
+import { R as Rr } from './createText-94e3ebbf.esm.js';
+
+function _array_like_to_array(arr, len) {
+    if (len == null || len > arr.length) len = arr.length;
+    for(var i = 0, arr2 = new Array(len); i < len; i++)arr2[i] = arr[i];
+    return arr2;
+}
+function _array_without_holes(arr) {
+    if (Array.isArray(arr)) return _array_like_to_array(arr);
+}
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) {
+    try {
+        var info = gen[key](arg);
+        var value = info.value;
+    } catch (error) {
+        reject(error);
+        return;
+    }
+    if (info.done) {
+        resolve(value);
+    } else {
+        Promise.resolve(value).then(_next, _throw);
+    }
+}
+function _async_to_generator(fn) {
+    return function() {
+        var self = this, args = arguments;
+        return new Promise(function(resolve, reject) {
+            var gen = fn.apply(self, args);
+            function _next(value) {
+                asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value);
+            }
+            function _throw(err) {
+                asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err);
+            }
+            _next(undefined);
+        });
+    };
+}
+function _iterable_to_array(iter) {
+    if (typeof Symbol !== "undefined" && iter[Symbol.iterator] != null || iter["@@iterator"] != null) return Array.from(iter);
+}
+function _non_iterable_spread() {
+    throw new TypeError("Invalid attempt to spread non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.");
+}
+function _to_consumable_array(arr) {
+    return _array_without_holes(arr) || _iterable_to_array(arr) || _unsupported_iterable_to_array(arr) || _non_iterable_spread();
+}
+function _unsupported_iterable_to_array(o, minLen) {
+    if (!o) return;
+    if (typeof o === "string") return _array_like_to_array(o, minLen);
+    var n = Object.prototype.toString.call(o).slice(8, -1);
+    if (n === "Object" && o.constructor) n = o.constructor.name;
+    if (n === "Map" || n === "Set") return Array.from(n);
+    if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _array_like_to_array(o, minLen);
+}
+function _ts_generator(thisArg, body) {
+    var f, y, t, g, _ = {
+        label: 0,
+        sent: function() {
+            if (t[0] & 1) throw t[1];
+            return t[1];
+        },
+        trys: [],
+        ops: []
+    };
+    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(_)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
+        };
+    }
+}
+var K = 4;
+function Q(e) {
+    return dn(e, K);
+}
+function y(e) {
+    var t = {
+        options: {
+            directed: e.isDirected(),
+            multigraph: e.isMultigraph(),
+            compound: e.isCompound()
+        },
+        nodes: Z(e),
+        edges: I(e)
+    };
+    return x$1(e.graph()) || (t.value = Q(e.graph())), t;
+}
+function Z(e) {
+    return y$1(e.nodes(), function(t) {
+        var n = e.node(t), r = e.parent(t), s = {
+            v: t
+        };
+        return x$1(n) || (s.value = n), x$1(r) || (s.parent = r), s;
+    });
+}
+function I(e) {
+    return y$1(e.edges(), function(t) {
+        var n = e.edge(t), r = {
+            v: t.v,
+            w: t.w
+        };
+        return x$1(t.name) || (r.name = t.name), x$1(n) || (r.value = n), r;
+    });
+}
+var f = {}, x = {}, T = {};
+var tt = function() {
+    x = {}, T = {}, f = {};
+}, S = function(e, t) {
+    return S$1.trace("In isDecendant", t, " ", e, " = ", x[t].includes(e)), !!x[t].includes(e);
+}, et = function(e, t) {
+    return S$1.info("Decendants of ", t, " is ", x[t]), S$1.info("Edge is ", e), e.v === t || e.w === t ? !1 : x[t] ? x[t].includes(e.v) || S(e.v, t) || S(e.w, t) || x[t].includes(e.w) : (S$1.debug("Tilt, ", t, ",not in decendants"), !1);
+}, J = function(e, t, n, r) {
+    S$1.warn("Copying children of ", e, "root", r, "data", t.node(e), r);
+    var s = t.children(e) || [];
+    e !== r && s.push(e), S$1.warn("Copying (nodes) clusterId", e, "nodes", s), s.forEach(function(a) {
+        if (t.children(a).length > 0) J(a, t, n, r);
+        else {
+            var u = t.node(a);
+            S$1.info("cp ", a, " to ", r, " with parent ", e), n.setNode(a, u), r !== t.parent(a) && (S$1.warn("Setting parent", a, t.parent(a)), n.setParent(a, t.parent(a))), e !== r && a !== e ? (S$1.debug("Setting parent", a, e), n.setParent(a, e)) : (S$1.info("In copy ", e, "root", r, "data", t.node(e), r), S$1.debug("Not Setting parent for node=", a, "cluster!==rootId", e !== r, "node!==clusterId", a !== e));
+            var l = t.edges(a);
+            S$1.debug("Copying Edges", l), l.forEach(function(d) {
+                S$1.info("Edge", d);
+                var w = t.edge(d.v, d.w, d.name);
+                S$1.info("Edge data", w, r);
+                try {
+                    et(d, r) ? (S$1.info("Copying as ", d.v, d.w, w, d.name), n.setEdge(d.v, d.w, w, d.name), S$1.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : S$1.info("Skipping copy of edge ", d.v, "-->", d.w, " rootId: ", r, " clusterId:", e);
+                } catch (g) {
+                    S$1.error(g);
+                }
+            });
+        }
+        S$1.debug("Removing node", a), t.removeNode(a);
+    });
+}, p = function(e, t) {
+    var n = t.children(e);
+    var r = _to_consumable_array(n);
+    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+    try {
+        for(var _iterator = n[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            var s = _step.value;
+            T[s] = e, r = _to_consumable_array(r).concat(_to_consumable_array(p(s, t)));
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
+            }
+        }
+    }
+    return r;
+}, b = function(e, t) {
+    S$1.trace("Searching", e);
+    var n = t.children(e);
+    if (S$1.trace("Searching children of id ", e, n), n.length < 1) return S$1.trace("This is a valid node", e), e;
+    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+    try {
+        for(var _iterator = n[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            var r = _step.value;
+            var s = b(r, t);
+            if (s) return S$1.trace("Found replacement for", e, " => ", s), s;
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
+            }
+        }
+    }
+}, v = function(e) {
+    return !f[e] || !f[e].externalConnections ? e : f[e] ? f[e].id : e;
+}, nt = function(e, t) {
+    if (!e || t > 10) {
+        S$1.debug("Opting out, no graph ");
+        return;
+    } else S$1.debug("Opting in, graph ");
+    e.nodes().forEach(function(n) {
+        e.children(n).length > 0 && (S$1.warn("Cluster identified", n, " Replacement id in edges: ", b(n, e)), x[n] = p(n, e), f[n] = {
+            id: b(n, e),
+            clusterData: e.node(n)
+        });
+    }), e.nodes().forEach(function(n) {
+        var r = e.children(n), s = e.edges();
+        r.length > 0 ? (S$1.debug("Cluster identified", n, x), s.forEach(function(a) {
+            if (a.v !== n && a.w !== n) {
+                var u = S(a.v, n), l = S(a.w, n);
+                u ^ l && (S$1.warn("Edge: ", a, " leaves cluster ", n), S$1.warn("Decendants of XXX ", n, ": ", x[n]), f[n].externalConnections = !0);
+            }
+        })) : S$1.debug("Not a cluster ", n, x);
+    }), e.edges().forEach(function(n) {
+        var r = e.edge(n);
+        S$1.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), S$1.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
+        var s = n.v, a = n.w;
+        if (S$1.warn("Fix XXX", f, "ids:", n.v, n.w, "Translating: ", f[n.v], " --- ", f[n.w]), f[n.v] && f[n.w] && f[n.v] === f[n.w]) {
+            S$1.warn("Fixing and trixing link to self - removing XXX", n.v, n.w, n.name), S$1.warn("Fixing and trixing - removing XXX", n.v, n.w, n.name), s = v(n.v), a = v(n.w), e.removeEdge(n.v, n.w, n.name);
+            var u = n.w + "---" + n.v;
+            e.setNode(u, {
+                domId: u,
+                id: u,
+                labelStyle: "",
+                labelText: r.label,
+                padding: 0,
+                shape: "labelRect",
+                style: ""
+            });
+            var l = JSON.parse(JSON.stringify(r)), d = JSON.parse(JSON.stringify(r));
+            l.label = "", l.arrowTypeEnd = "none", d.label = "", l.fromCluster = n.v, d.toCluster = n.v, e.setEdge(s, u, l, n.name + "-cyclic-special"), e.setEdge(u, a, d, n.name + "-cyclic-special");
+        } else (f[n.v] || f[n.w]) && (S$1.warn("Fixing and trixing - removing XXX", n.v, n.w, n.name), s = v(n.v), a = v(n.w), e.removeEdge(n.v, n.w, n.name), s !== n.v && (r.fromCluster = n.v), a !== n.w && (r.toCluster = n.w), S$1.warn("Fix Replacing with XXX", s, a, n.name), e.setEdge(s, a, r, n.name));
+    }), S$1.warn("Adjusted Graph", y(e)), R(e, 0), S$1.trace(f);
+}, R = function(e, t) {
+    if (S$1.warn("extractor - ", t, y(e), e.children("D")), t > 10) {
+        S$1.error("Bailing out");
+        return;
+    }
+    var n = e.nodes(), r = !1;
+    var _iteratorNormalCompletion = true, _didIteratorError = false, _iteratorError = undefined;
+    try {
+        for(var _iterator = n[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true){
+            var s = _step.value;
+            var a = e.children(s);
+            r = r || a.length > 0;
+        }
+    } catch (err) {
+        _didIteratorError = true;
+        _iteratorError = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion && _iterator.return != null) {
+                _iterator.return();
+            }
+        } finally{
+            if (_didIteratorError) {
+                throw _iteratorError;
+            }
+        }
+    }
+    if (!r) {
+        S$1.debug("Done, no node has children", e.nodes());
+        return;
+    }
+    S$1.debug("Nodes = ", n, t);
+    var _iteratorNormalCompletion1 = true, _didIteratorError1 = false, _iteratorError1 = undefined;
+    try {
+        for(var _iterator1 = n[Symbol.iterator](), _step1; !(_iteratorNormalCompletion1 = (_step1 = _iterator1.next()).done); _iteratorNormalCompletion1 = true){
+            var s1 = _step1.value;
+            if (S$1.debug("Extracting node", s1, f, f[s1] && !f[s1].externalConnections, !e.parent(s1), e.node(s1), e.children("D"), " Depth ", t), !f[s1]) S$1.debug("Not a cluster", s1, t);
+            else if (!f[s1].externalConnections && // !graph.parent(node) &&
+            e.children(s1) && e.children(s1).length > 0) {
+                S$1.warn("Cluster without external connections, without a parent and with children", s1, t);
+                var u = e.graph().rankdir === "TB" ? "LR" : "TB";
+                f[s1] && f[s1].clusterData && f[s1].clusterData.dir && (u = f[s1].clusterData.dir, S$1.warn("Fixing dir", f[s1].clusterData.dir, u));
+                var l = new A({
+                    multigraph: !0,
+                    compound: !0
+                }).setGraph({
+                    rankdir: u,
+                    // Todo: set proper spacing
+                    nodesep: 50,
+                    ranksep: 50,
+                    marginx: 8,
+                    marginy: 8
+                }).setDefaultEdgeLabel(function() {
+                    return {};
+                });
+                S$1.warn("Old graph before copy", y(e)), J(s1, e, l, s1), e.setNode(s1, {
+                    clusterNode: !0,
+                    id: s1,
+                    clusterData: f[s1].clusterData,
+                    labelText: f[s1].labelText,
+                    graph: l
+                }), S$1.warn("New graph after copy node: (", s1, ")", y(l)), S$1.debug("Old graph after copy", y(e));
+            } else S$1.warn("Cluster ** ", s1, " **not meeting the criteria !externalConnections:", !f[s1].externalConnections, " no parent: ", !e.parent(s1), " children ", e.children(s1) && e.children(s1).length > 0, e.children("D"), t), S$1.debug(f);
+        }
+    } catch (err) {
+        _didIteratorError1 = true;
+        _iteratorError1 = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion1 && _iterator1.return != null) {
+                _iterator1.return();
+            }
+        } finally{
+            if (_didIteratorError1) {
+                throw _iteratorError1;
+            }
+        }
+    }
+    n = e.nodes(), S$1.warn("New list of nodes", n);
+    var _iteratorNormalCompletion2 = true, _didIteratorError2 = false, _iteratorError2 = undefined;
+    try {
+        for(var _iterator2 = n[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true){
+            var s2 = _step2.value;
+            var a1 = e.node(s2);
+            S$1.warn(" Now next level", s2, a1), a1.clusterNode && R(a1.graph, t + 1);
+        }
+    } catch (err) {
+        _didIteratorError2 = true;
+        _iteratorError2 = err;
+    } finally{
+        try {
+            if (!_iteratorNormalCompletion2 && _iterator2.return != null) {
+                _iterator2.return();
+            }
+        } finally{
+            if (_didIteratorError2) {
+                throw _iteratorError2;
+            }
+        }
+    }
+}, P = function(e, t) {
+    if (t.length === 0) return [];
+    var n = Object.assign(t);
+    return t.forEach(function(r) {
+        var s = e.children(r), a = P(e, s);
+        n = _to_consumable_array(n).concat(_to_consumable_array(a));
+    }), n;
+}, it = function(e) {
+    return P(e, e.children());
+}, st = function(e, t) {
+    S$1.info("Creating subgraph rect for ", t.id, t);
+    var n = e.insert("g").attr("class", "cluster" + (t.class ? " " + t.class : "")).attr("id", t.id), r = n.insert("rect", ":first-child"), s = ia(Ut().flowchart.htmlLabels), a = n.insert("g").attr("class", "cluster-label"), u = t.labelType === "markdown" ? Rr(a, t.labelText, {
+        style: t.labelStyle,
+        useHtmlLabels: s
+    }) : a.node().appendChild(R$1(t.labelText, t.labelStyle, void 0, !0));
+    var l = u.getBBox();
+    if (ia(Ut().flowchart.htmlLabels)) {
+        var o = u.children[0], h = At(u);
+        l = o.getBoundingClientRect(), h.attr("width", l.width), h.attr("height", l.height);
+    }
+    var d = 0 * t.padding, w = d / 2, g = t.width <= l.width + d ? l.width + d : t.width;
+    t.width <= l.width + d ? t.diff = (l.width - t.width) / 2 - t.padding / 2 : t.diff = -t.padding / 2, S$1.trace("Data ", t, JSON.stringify(t)), r.attr("style", t.style).attr("rx", t.rx).attr("ry", t.ry).attr("x", t.x - g / 2).attr("y", t.y - t.height / 2 - w).attr("width", g).attr("height", t.height + d), s ? a.attr("transform", // This puts the labal on top of the box instead of inside it
+    "translate(" + (t.x - l.width / 2) + ", " + (t.y - t.height / 2) + ")") : a.attr("transform", // This puts the labal on top of the box instead of inside it
+    "translate(" + t.x + ", " + (t.y - t.height / 2) + ")");
+    var c = r.node().getBBox();
+    return t.width = c.width, t.height = c.height, t.intersect = function st(o) {
+        return vt(t, o);
+    }, n;
+}, rt = function(e, t) {
+    var n = e.insert("g").attr("class", "note-cluster").attr("id", t.id), r = n.insert("rect", ":first-child"), s = 0 * t.padding, a = s / 2;
+    r.attr("rx", t.rx).attr("ry", t.ry).attr("x", t.x - t.width / 2 - a).attr("y", t.y - t.height / 2 - a).attr("width", t.width + s).attr("height", t.height + s).attr("fill", "none");
+    var u = r.node().getBBox();
+    return t.width = u.width, t.height = u.height, t.intersect = function rt(l) {
+        return vt(t, l);
+    }, n;
+}, at = function(e, t) {
+    var n = e.insert("g").attr("class", t.classes).attr("id", t.id), r = n.insert("rect", ":first-child"), s = n.insert("g").attr("class", "cluster-label"), a = n.append("rect"), u = s.node().appendChild(R$1(t.labelText, t.labelStyle, void 0, !0));
+    var l = u.getBBox();
+    if (ia(Ut().flowchart.htmlLabels)) {
+        var o = u.children[0], h = At(u);
+        l = o.getBoundingClientRect(), h.attr("width", l.width), h.attr("height", l.height);
+    }
+    l = u.getBBox();
+    var d = 0 * t.padding, w = d / 2, g = t.width <= l.width + t.padding ? l.width + t.padding : t.width;
+    t.width <= l.width + t.padding ? t.diff = (l.width + t.padding * 0 - t.width) / 2 : t.diff = -t.padding / 2, r.attr("class", "outer").attr("x", t.x - g / 2 - w).attr("y", t.y - t.height / 2 - w).attr("width", g + d).attr("height", t.height + d), a.attr("class", "inner").attr("x", t.x - g / 2 - w).attr("y", t.y - t.height / 2 - w + l.height - 1).attr("width", g + d).attr("height", t.height + d - l.height - 3), s.attr("transform", "translate(" + (t.x - l.width / 2) + ", " + (t.y - t.height / 2 - t.padding / 3 + (ia(Ut().flowchart.htmlLabels) ? 5 : 3)) + ")");
+    var c = r.node().getBBox();
+    return t.height = c.height, t.intersect = function at(o) {
+        return vt(t, o);
+    }, n;
+}, ct = function(e, t) {
+    var n = e.insert("g").attr("class", t.classes).attr("id", t.id), r = n.insert("rect", ":first-child"), s = 0 * t.padding, a = s / 2;
+    r.attr("class", "divider").attr("x", t.x - t.width / 2 - a).attr("y", t.y - t.height / 2).attr("width", t.width + s).attr("height", t.height + s);
+    var u = r.node().getBBox();
+    return t.width = u.width, t.height = u.height, t.diff = -t.padding / 2, t.intersect = function ct(l) {
+        return vt(t, l);
+    }, n;
+}, ot = {
+    rect: st,
+    roundedWithTitle: at,
+    noteGroup: rt,
+    divider: ct
+};
+var F = {};
+var lt = function(e, t) {
+    S$1.trace("Inserting cluster");
+    var n = t.shape || "rect";
+    F[t.id] = ot[n](e, t);
+}, ft = function() {
+    F = {};
+}, k = function() {
+    var _ref = _async_to_generator(function(e, t, n, r) {
+        var s, a, u, l, d, w, g;
+        return _ts_generator(this, function(_state) {
+            switch(_state.label){
+                case 0:
+                    S$1.info("Graph in recursive render: XXX", y(t), r);
+                    s = t.graph().rankdir;
+                    S$1.trace("Dir in recursive render - dir:", s);
+                    a = e.insert("g").attr("class", "root");
+                    t.nodes() ? S$1.info("Recursive render XXX", t.nodes()) : S$1.info("No nodes found for", t), t.edges().length > 0 && S$1.trace("Recursive edges", t.edge(t.edges()[0]));
+                    u = a.insert("g").attr("class", "clusters"), l = a.insert("g").attr("class", "edgePaths"), d = a.insert("g").attr("class", "edgeLabels"), w = a.insert("g").attr("class", "nodes");
+                    return [
+                        4,
+                        Promise.all(t.nodes().map(function() {
+                            var _ref = _async_to_generator(function(c) {
+                                var o, h, h1, C;
+                                return _ts_generator(this, function(_state) {
+                                    switch(_state.label){
+                                        case 0:
+                                            o = t.node(c);
+                                            if (r !== void 0) {
+                                                h = JSON.parse(JSON.stringify(r.clusterData));
+                                                S$1.info("Setting data for cluster XXX (", c, ") ", h, r), t.setNode(r.id, h), t.parent(c) || (S$1.trace("Setting parent", c, r.id), t.setParent(c, r.id, h));
+                                            }
+                                            if (!(S$1.info("(Insert) Node XXX" + c + ": " + JSON.stringify(t.node(c))), o && o.clusterNode)) return [
+                                                3,
+                                                2
+                                            ];
+                                            S$1.info("Cluster identified", c, o.width, t.node(c));
+                                            return [
+                                                4,
+                                                k(w, o.graph, n, t.node(c))
+                                            ];
+                                        case 1:
+                                            h1 = _state.sent(), C = h1.elem;
+                                            v$1(o, C), o.diff = h1.diff || 0, S$1.info("Node bounds (abc123)", c, o, o.width, o.x, o.y), Pt(C, o), S$1.warn("Recursive render complete ", C, o);
+                                            return [
+                                                3,
+                                                6
+                                            ];
+                                        case 2:
+                                            if (!(t.children(c).length > 0)) return [
+                                                3,
+                                                3
+                                            ];
+                                            (S$1.info("Cluster - the non recursive path XXX", c, o.id, o, t), S$1.info(b(o.id, t)), f[o.id] = {
+                                                id: b(o.id, t),
+                                                node: o
+                                            });
+                                            return [
+                                                3,
+                                                5
+                                            ];
+                                        case 3:
+                                            S$1.info("Node - the non recursive path", c, o.id, o);
+                                            return [
+                                                4,
+                                                Gt(w, t.node(c), s)
+                                            ];
+                                        case 4:
+                                            _state.sent();
+                                            _state.label = 5;
+                                        case 5:
+                                            _state.label = 6;
+                                        case 6:
+                                            return [
+                                                2
+                                            ];
+                                    }
+                                });
+                            });
+                            return function(c) {
+                                return _ref.apply(this, arguments);
+                            };
+                        }()))
+                    ];
+                case 1:
+                    _state.sent(), t.edges().forEach(function(c) {
+                        var o = t.edge(c.v, c.w, c.name);
+                        S$1.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(c)), S$1.info("Edge " + c.v + " -> " + c.w + ": ", c, " ", JSON.stringify(t.edge(c))), S$1.info("Fix", f, "ids:", c.v, c.w, "Translateing: ", f[c.v], f[c.w]), er(d, o);
+                    }), t.edges().forEach(function(c) {
+                        S$1.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(c));
+                    }), S$1.info("#############################################"), S$1.info("###                Layout                 ###"), S$1.info("#############################################"), S$1.info(t), zs(t), S$1.info("Graph after layout:", y(t));
+                    g = 0;
+                    return [
+                        2,
+                        (it(t).forEach(function(c) {
+                            var o = t.node(c);
+                            S$1.info("Position " + c + ": " + JSON.stringify(t.node(c))), S$1.info("Position " + c + ": (" + o.x, "," + o.y, ") width: ", o.width, " height: ", o.height), o && o.clusterNode ? rr(o) : t.children(c).length > 0 ? (lt(u, o), f[o.id].node = o) : rr(o);
+                        }), t.edges().forEach(function(c) {
+                            var o = t.edge(c);
+                            S$1.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(o), o);
+                            var h = ir(l, c, o, f, n, t);
+                            sr(o, h);
+                        }), t.nodes().forEach(function(c) {
+                            var o = t.node(c);
+                            S$1.info(c, o.type, o.diff), o.type === "group" && (g = o.diff);
+                        }), {
+                            elem: a,
+                            diff: g
+                        })
+                    ];
+            }
+        });
+    });
+    return function k(e, t, n, r) {
+        return _ref.apply(this, arguments);
+    };
+}(), gt = function() {
+    var _ref = _async_to_generator(function(e, t, n, r, s) {
+        return _ts_generator(this, function(_state) {
+            switch(_state.label){
+                case 0:
+                    Kt(e, n, r, s), tr(), ar(), ft(), tt(), S$1.warn("Graph at first:", y(t)), nt(t), S$1.warn("Graph after:", y(t));
+                    return [
+                        4,
+                        k(e, t, r)
+                    ];
+                case 1:
+                    _state.sent();
+                    return [
+                        2
+                    ];
+            }
+        });
+    });
+    return function gt(e, t, n, r, s) {
+        return _ref.apply(this, arguments);
+    };
+}();
+
+export { gt as g };

package/index.cjs.d.ts

@@ -0,0 +1 @@
+export * from "./src/index";

package/index.cjs.js

@@ -0,0 +1,17 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var index = require('./index.cjs2.js');
+
+
+
+Object.defineProperty(exports, 'ChatbotElement', {
+	enumerable: true,
+	get: function () { return index.ChatbotElement; }
+});
+Object.defineProperty(exports, 'DigipairFullElement', {
+	enumerable: true,
+	get: function () { return index.DigipairFullElement; }
+});
+exports.config = index.config;