@xiping/react-components 1.0.18 → 1.0.20

package/dist/es/node_modules/.pnpm/ngraph.forcelayout@3.3.1/node_modules/ngraph.forcelayout/lib/codeGenerators/generateBounds.js

@@ -0,0 +1,74 @@
+import { __module as e } from "../../../../../../../_virtual/generateBounds.js";
+import { __require as d } from "./createPatternBuilder.js";
+var i;
+function v() {
+  if (i) return e.exports;
+  i = 1, e.exports = a, e.exports.generateFunctionBody = o;
+  const t = d();
+  function a(r) {
+    let n = o(r);
+    return new Function("bodies", "settings", "random", n);
+  }
+  function o(r) {
+    let n = t(r);
+    return `
+  var boundingBox = {
+    ${n("min_{var}: 0, max_{var}: 0,", { indent: 4 })}
+  };
+
+  return {
+    box: boundingBox,
+
+    update: updateBoundingBox,
+
+    reset: resetBoundingBox,
+
+    getBestNewPosition: function (neighbors) {
+      var ${n("base_{var} = 0", { join: ", " })};
+
+      if (neighbors.length) {
+        for (var i = 0; i < neighbors.length; ++i) {
+          let neighborPos = neighbors[i].pos;
+          ${n("base_{var} += neighborPos.{var};", { indent: 10 })}
+        }
+
+        ${n("base_{var} /= neighbors.length;", { indent: 8 })}
+      } else {
+        ${n("base_{var} = (boundingBox.min_{var} + boundingBox.max_{var}) / 2;", { indent: 8 })}
+      }
+
+      var springLength = settings.springLength;
+      return {
+        ${n("{var}: base_{var} + (random.nextDouble() - 0.5) * springLength,", { indent: 8 })}
+      };
+    }
+  };
+
+  function updateBoundingBox() {
+    var i = bodies.length;
+    if (i === 0) return; // No bodies - no borders.
+
+    ${n("var max_{var} = -Infinity;", { indent: 4 })}
+    ${n("var min_{var} = Infinity;", { indent: 4 })}
+
+    while(i--) {
+      // this is O(n), it could be done faster with quadtree, if we check the root node bounds
+      var bodyPos = bodies[i].pos;
+      ${n("if (bodyPos.{var} < min_{var}) min_{var} = bodyPos.{var};", { indent: 6 })}
+      ${n("if (bodyPos.{var} > max_{var}) max_{var} = bodyPos.{var};", { indent: 6 })}
+    }
+
+    ${n("boundingBox.min_{var} = min_{var};", { indent: 4 })}
+    ${n("boundingBox.max_{var} = max_{var};", { indent: 4 })}
+  }
+
+  function resetBoundingBox() {
+    ${n("boundingBox.min_{var} = boundingBox.max_{var} = 0;", { indent: 4 })}
+  }
+`;
+  }
+  return e.exports;
+}
+export {
+  v as __require
+};

package/dist/es/node_modules/.pnpm/ngraph.forcelayout@3.3.1/node_modules/ngraph.forcelayout/lib/codeGenerators/generateCreateBody.js

@@ -0,0 +1,74 @@
+import { __module as n } from "../../../../../../../_virtual/generateCreateBody.js";
+import { __require as v } from "./createPatternBuilder.js";
+var c;
+function h() {
+  if (c) return n.exports;
+  c = 1;
+  const i = v();
+  n.exports = d, n.exports.generateCreateBodyFunctionBody = a, n.exports.getVectorCode = u, n.exports.getBodyCode = s;
+  function d(t, r) {
+    let e = a(t, r), { Body: o } = new Function(e)();
+    return o;
+  }
+  function a(t, r) {
+    return `
+${u(t, r)}
+${s(t)}
+return {Body: Body, Vector: Vector};
+`;
+  }
+  function s(t) {
+    let r = i(t), e = r("{var}", { join: ", " });
+    return `
+function Body(${e}) {
+  this.isPinned = false;
+  this.pos = new Vector(${e});
+  this.force = new Vector();
+  this.velocity = new Vector();
+  this.mass = 1;
+
+  this.springCount = 0;
+  this.springLength = 0;
+}
+
+Body.prototype.reset = function() {
+  this.force.reset();
+  this.springCount = 0;
+  this.springLength = 0;
+}
+
+Body.prototype.setPosition = function (${e}) {
+  ${r("this.pos.{var} = {var} || 0;", { indent: 2 })}
+};`;
+  }
+  function u(t, r) {
+    let e = i(t), o = "";
+    return r && (o = `${e(`
+	   var v{var};
+	Object.defineProperty(this, '{var}', {
+	  set: function(v) { 
+	    if (!Number.isFinite(v)) throw new Error('Cannot set non-numbers to {var}');
+	    v{var} = v; 
+	  },
+	  get: function() { return v{var}; }
+	});`)}`), `function Vector(${e("{var}", { join: ", " })}) {
+  ${o}
+    if (typeof arguments[0] === 'object') {
+      // could be another vector
+      let v = arguments[0];
+      ${e('if (!Number.isFinite(v.{var})) throw new Error("Expected value is not a finite number at Vector constructor ({var})");', { indent: 4 })}
+      ${e("this.{var} = v.{var};", { indent: 4 })}
+    } else {
+      ${e('this.{var} = typeof {var} === "number" ? {var} : 0;', { indent: 4 })}
+    }
+  }
+  
+  Vector.prototype.reset = function () {
+    ${e("this.{var} = ", { join: "" })}0;
+  };`;
+  }
+  return n.exports;
+}
+export {
+  h as __require
+};

package/dist/es/node_modules/.pnpm/ngraph.forcelayout@3.3.1/node_modules/ngraph.forcelayout/lib/codeGenerators/generateCreateDragForce.js

@@ -0,0 +1,28 @@
+import { __module as e } from "../../../../../../../_virtual/generateCreateDragForce.js";
+import { __require as c } from "./createPatternBuilder.js";
+var n;
+function s() {
+  if (n) return e.exports;
+  n = 1;
+  const a = c();
+  e.exports = i, e.exports.generateCreateDragForceFunctionBody = t;
+  function i(r) {
+    let o = t(r);
+    return new Function("options", o);
+  }
+  function t(r) {
+    return `
+  if (!Number.isFinite(options.dragCoefficient)) throw new Error('dragCoefficient is not a finite number');
+
+  return {
+    update: function(body) {
+      ${a(r)("body.force.{var} -= options.dragCoefficient * body.velocity.{var};", { indent: 6 })}
+    }
+  };
+`;
+  }
+  return e.exports;
+}
+export {
+  s as __require
+};

package/dist/es/node_modules/.pnpm/ngraph.forcelayout@3.3.1/node_modules/ngraph.forcelayout/lib/codeGenerators/generateCreateSpringForce.js

@@ -0,0 +1,53 @@
+import { __module as e } from "../../../../../../../_virtual/generateCreateSpringForce.js";
+import { __require as p } from "./createPatternBuilder.js";
+var i;
+function d() {
+  if (i) return e.exports;
+  i = 1;
+  const o = p();
+  e.exports = a, e.exports.generateCreateSpringForceFunctionBody = t;
+  function a(n) {
+    let r = t(n);
+    return new Function("options", "random", r);
+  }
+  function t(n) {
+    let r = o(n);
+    return `
+  if (!Number.isFinite(options.springCoefficient)) throw new Error('Spring coefficient is not a number');
+  if (!Number.isFinite(options.springLength)) throw new Error('Spring length is not a number');
+
+  return {
+    /**
+     * Updates forces acting on a spring
+     */
+    update: function (spring) {
+      var body1 = spring.from;
+      var body2 = spring.to;
+      var length = spring.length < 0 ? options.springLength : spring.length;
+      ${r("var d{var} = body2.pos.{var} - body1.pos.{var};", { indent: 6 })}
+      var r = Math.sqrt(${r("d{var} * d{var}", { join: " + " })});
+
+      if (r === 0) {
+        ${r("d{var} = (random.nextDouble() - 0.5) / 50;", { indent: 8 })}
+        r = Math.sqrt(${r("d{var} * d{var}", { join: " + " })});
+      }
+
+      var d = r - length;
+      var coefficient = ((spring.coefficient > 0) ? spring.coefficient : options.springCoefficient) * d / r;
+
+      ${r("body1.force.{var} += coefficient * d{var}", { indent: 6 })};
+      body1.springCount += 1;
+      body1.springLength += r;
+
+      ${r("body2.force.{var} -= coefficient * d{var}", { indent: 6 })};
+      body2.springCount += 1;
+      body2.springLength += r;
+    }
+  };
+`;
+  }
+  return e.exports;
+}
+export {
+  d as __require
+};

package/dist/es/node_modules/.pnpm/ngraph.forcelayout@3.3.1/node_modules/ngraph.forcelayout/lib/codeGenerators/generateIntegrator.js

@@ -0,0 +1,55 @@
+import { __module as t } from "../../../../../../../_virtual/generateIntegrator.js";
+import { __require as v } from "./createPatternBuilder.js";
+var i;
+function p() {
+  if (i) return t.exports;
+  i = 1;
+  const o = v();
+  t.exports = a, t.exports.generateIntegratorFunctionBody = n;
+  function a(r) {
+    let e = n(r);
+    return new Function("bodies", "timeStep", "adaptiveTimeStepWeight", e);
+  }
+  function n(r) {
+    let e = o(r);
+    return `
+  var length = bodies.length;
+  if (length === 0) return 0;
+
+  ${e("var d{var} = 0, t{var} = 0;", { indent: 2 })}
+
+  for (var i = 0; i < length; ++i) {
+    var body = bodies[i];
+    if (body.isPinned) continue;
+
+    if (adaptiveTimeStepWeight && body.springCount) {
+      timeStep = (adaptiveTimeStepWeight * body.springLength/body.springCount);
+    }
+
+    var coeff = timeStep / body.mass;
+
+    ${e("body.velocity.{var} += coeff * body.force.{var};", { indent: 4 })}
+    ${e("var v{var} = body.velocity.{var};", { indent: 4 })}
+    var v = Math.sqrt(${e("v{var} * v{var}", { join: " + " })});
+
+    if (v > 1) {
+      // We normalize it so that we move within timeStep range. 
+      // for the case when v <= 1 - we let velocity to fade out.
+      ${e("body.velocity.{var} = v{var} / v;", { indent: 6 })}
+    }
+
+    ${e("d{var} = timeStep * body.velocity.{var};", { indent: 4 })}
+
+    ${e("body.pos.{var} += d{var};", { indent: 4 })}
+
+    ${e("t{var} += Math.abs(d{var});", { indent: 4 })}
+  }
+
+  return (${e("t{var} * t{var}", { join: " + " })})/length;
+`;
+  }
+  return t.exports;
+}
+export {
+  p as __require
+};

package/dist/es/node_modules/.pnpm/ngraph.forcelayout@3.3.1/node_modules/ngraph.forcelayout/lib/codeGenerators/generateQuadTree.js

@@ -0,0 +1,403 @@
+import { __module as s } from "../../../../../../../_virtual/generateQuadTree.js";
+import { __require as w } from "./createPatternBuilder.js";
+import { __require as q } from "./getVariableName.js";
+var $;
+function B() {
+  if ($) return s.exports;
+  $ = 1;
+  const p = w(), u = q();
+  s.exports = g, s.exports.generateQuadTreeFunctionBody = l, s.exports.getInsertStackCode = x, s.exports.getQuadNodeCode = b, s.exports.isSamePosition = f, s.exports.getChildBodyCode = m, s.exports.setChildBodyCode = y;
+  function g(t) {
+    let e = l(t);
+    return new Function(e)();
+  }
+  function l(t) {
+    let e = p(t), a = Math.pow(2, t);
+    return `
+${x()}
+${b(t)}
+${f(t)}
+${m(t)}
+${y(t)}
+
+function createQuadTree(options, random) {
+  options = options || {};
+  options.gravity = typeof options.gravity === 'number' ? options.gravity : -1;
+  options.theta = typeof options.theta === 'number' ? options.theta : 0.8;
+
+  var gravity = options.gravity;
+  var updateQueue = [];
+  var insertStack = new InsertStack();
+  var theta = options.theta;
+
+  var nodesCache = [];
+  var currentInCache = 0;
+  var root = newNode();
+
+  return {
+    insertBodies: insertBodies,
+
+    /**
+     * Gets root node if it is present
+     */
+    getRoot: function() {
+      return root;
+    },
+
+    updateBodyForce: update,
+
+    options: function(newOptions) {
+      if (newOptions) {
+        if (typeof newOptions.gravity === 'number') {
+          gravity = newOptions.gravity;
+        }
+        if (typeof newOptions.theta === 'number') {
+          theta = newOptions.theta;
+        }
+
+        return this;
+      }
+
+      return {
+        gravity: gravity,
+        theta: theta
+      };
+    }
+  };
+
+  function newNode() {
+    // To avoid pressure on GC we reuse nodes.
+    var node = nodesCache[currentInCache];
+    if (node) {
+${v("      node.")}
+      node.body = null;
+      node.mass = ${e("node.mass_{var} = ", { join: "" })}0;
+      ${e("node.min_{var} = node.max_{var} = ", { join: "" })}0;
+    } else {
+      node = new QuadNode();
+      nodesCache[currentInCache] = node;
+    }
+
+    ++currentInCache;
+    return node;
+  }
+
+  function update(sourceBody) {
+    var queue = updateQueue;
+    var v;
+    ${e("var d{var};", { indent: 4 })}
+    var r; 
+    ${e("var f{var} = 0;", { indent: 4 })}
+    var queueLength = 1;
+    var shiftIdx = 0;
+    var pushIdx = 1;
+
+    queue[0] = root;
+
+    while (queueLength) {
+      var node = queue[shiftIdx];
+      var body = node.body;
+
+      queueLength -= 1;
+      shiftIdx += 1;
+      var differentBody = (body !== sourceBody);
+      if (body && differentBody) {
+        // If the current node is a leaf node (and it is not source body),
+        // calculate the force exerted by the current node on body, and add this
+        // amount to body's net force.
+        ${e("d{var} = body.pos.{var} - sourceBody.pos.{var};", { indent: 8 })}
+        r = Math.sqrt(${e("d{var} * d{var}", { join: " + " })});
+
+        if (r === 0) {
+          // Poor man's protection against zero distance.
+          ${e("d{var} = (random.nextDouble() - 0.5) / 50;", { indent: 10 })}
+          r = Math.sqrt(${e("d{var} * d{var}", { join: " + " })});
+        }
+
+        // This is standard gravitation force calculation but we divide
+        // by r^3 to save two operations when normalizing force vector.
+        v = gravity * body.mass * sourceBody.mass / (r * r * r);
+        ${e("f{var} += v * d{var};", { indent: 8 })}
+      } else if (differentBody) {
+        // Otherwise, calculate the ratio s / r,  where s is the width of the region
+        // represented by the internal node, and r is the distance between the body
+        // and the node's center-of-mass
+        ${e("d{var} = node.mass_{var} / node.mass - sourceBody.pos.{var};", { indent: 8 })}
+        r = Math.sqrt(${e("d{var} * d{var}", { join: " + " })});
+
+        if (r === 0) {
+          // Sorry about code duplication. I don't want to create many functions
+          // right away. Just want to see performance first.
+          ${e("d{var} = (random.nextDouble() - 0.5) / 50;", { indent: 10 })}
+          r = Math.sqrt(${e("d{var} * d{var}", { join: " + " })});
+        }
+        // If s / r < θ, treat this internal node as a single body, and calculate the
+        // force it exerts on sourceBody, and add this amount to sourceBody's net force.
+        if ((node.max_${u(0)} - node.min_${u(0)}) / r < theta) {
+          // in the if statement above we consider node's width only
+          // because the region was made into square during tree creation.
+          // Thus there is no difference between using width or height.
+          v = gravity * node.mass * sourceBody.mass / (r * r * r);
+          ${e("f{var} += v * d{var};", { indent: 10 })}
+        } else {
+          // Otherwise, run the procedure recursively on each of the current node's children.
+
+          // I intentionally unfolded this loop, to save several CPU cycles.
+${c()}
+        }
+      }
+    }
+
+    ${e("sourceBody.force.{var} += f{var};", { indent: 4 })}
+  }
+
+  function insertBodies(bodies) {
+    ${e("var {var}min = Number.MAX_VALUE;", { indent: 4 })}
+    ${e("var {var}max = Number.MIN_VALUE;", { indent: 4 })}
+    var i = bodies.length;
+
+    // To reduce quad tree depth we are looking for exact bounding box of all particles.
+    while (i--) {
+      var pos = bodies[i].pos;
+      ${e("if (pos.{var} < {var}min) {var}min = pos.{var};", { indent: 6 })}
+      ${e("if (pos.{var} > {var}max) {var}max = pos.{var};", { indent: 6 })}
+    }
+
+    // Makes the bounds square.
+    var maxSideLength = -Infinity;
+    ${e("if ({var}max - {var}min > maxSideLength) maxSideLength = {var}max - {var}min ;", { indent: 4 })}
+
+    currentInCache = 0;
+    root = newNode();
+    ${e("root.min_{var} = {var}min;", { indent: 4 })}
+    ${e("root.max_{var} = {var}min + maxSideLength;", { indent: 4 })}
+
+    i = bodies.length - 1;
+    if (i >= 0) {
+      root.body = bodies[i];
+    }
+    while (i--) {
+      insert(bodies[i], root);
+    }
+  }
+
+  function insert(newBody) {
+    insertStack.reset();
+    insertStack.push(root, newBody);
+
+    while (!insertStack.isEmpty()) {
+      var stackItem = insertStack.pop();
+      var node = stackItem.node;
+      var body = stackItem.body;
+
+      if (!node.body) {
+        // This is internal node. Update the total mass of the node and center-of-mass.
+        ${e("var {var} = body.pos.{var};", { indent: 8 })}
+        node.mass += body.mass;
+        ${e("node.mass_{var} += body.mass * {var};", { indent: 8 })}
+
+        // Recursively insert the body in the appropriate quadrant.
+        // But first find the appropriate quadrant.
+        var quadIdx = 0; // Assume we are in the 0's quad.
+        ${e("var min_{var} = node.min_{var};", { indent: 8 })}
+        ${e("var max_{var} = (min_{var} + node.max_{var}) / 2;", { indent: 8 })}
+
+${o(8)}
+
+        var child = getChild(node, quadIdx);
+
+        if (!child) {
+          // The node is internal but this quadrant is not taken. Add
+          // subnode to it.
+          child = newNode();
+          ${e("child.min_{var} = min_{var};", { indent: 10 })}
+          ${e("child.max_{var} = max_{var};", { indent: 10 })}
+          child.body = body;
+
+          setChild(node, quadIdx, child);
+        } else {
+          // continue searching in this quadrant.
+          insertStack.push(child, body);
+        }
+      } else {
+        // We are trying to add to the leaf node.
+        // We have to convert current leaf into internal node
+        // and continue adding two nodes.
+        var oldBody = node.body;
+        node.body = null; // internal nodes do not cary bodies
+
+        if (isSamePosition(oldBody.pos, body.pos)) {
+          // Prevent infinite subdivision by bumping one node
+          // anywhere in this quadrant
+          var retriesCount = 3;
+          do {
+            var offset = random.nextDouble();
+            ${e("var d{var} = (node.max_{var} - node.min_{var}) * offset;", { indent: 12 })}
+
+            ${e("oldBody.pos.{var} = node.min_{var} + d{var};", { indent: 12 })}
+            retriesCount -= 1;
+            // Make sure we don't bump it out of the box. If we do, next iteration should fix it
+          } while (retriesCount > 0 && isSamePosition(oldBody.pos, body.pos));
+
+          if (retriesCount === 0 && isSamePosition(oldBody.pos, body.pos)) {
+            // This is very bad, we ran out of precision.
+            // if we do not return from the method we'll get into
+            // infinite loop here. So we sacrifice correctness of layout, and keep the app running
+            // Next layout iteration should get larger bounding box in the first step and fix this
+            return;
+          }
+        }
+        // Next iteration should subdivide node further.
+        insertStack.push(node, oldBody);
+        insertStack.push(node, body);
+      }
+    }
+  }
+}
+return createQuadTree;
+
+`;
+    function o(i) {
+      let n = [], r = Array(i + 1).join(" ");
+      for (let d = 0; d < t; ++d)
+        n.push(r + `if (${u(d)} > max_${u(d)}) {`), n.push(r + `  quadIdx = quadIdx + ${Math.pow(2, d)};`), n.push(r + `  min_${u(d)} = max_${u(d)};`), n.push(r + `  max_${u(d)} = node.max_${u(d)};`), n.push(r + "}");
+      return n.join(`
+`);
+    }
+    function c() {
+      let i = Array(11).join(" "), n = [];
+      for (let r = 0; r < a; ++r)
+        n.push(i + `if (node.quad${r}) {`), n.push(i + `  queue[pushIdx] = node.quad${r};`), n.push(i + "  queueLength += 1;"), n.push(i + "  pushIdx += 1;"), n.push(i + "}");
+      return n.join(`
+`);
+    }
+    function v(i) {
+      let n = [];
+      for (let r = 0; r < a; ++r)
+        n.push(`${i}quad${r} = null;`);
+      return n.join(`
+`);
+    }
+  }
+  function f(t) {
+    let e = p(t);
+    return `
+  function isSamePosition(point1, point2) {
+    ${e("var d{var} = Math.abs(point1.{var} - point2.{var});", { indent: 2 })}
+  
+    return ${e("d{var} < 1e-8", { join: " && " })};
+  }  
+`;
+  }
+  function y(t) {
+    var e = Math.pow(2, t);
+    return `
+function setChild(node, idx, child) {
+  ${a()}
+}`;
+    function a() {
+      let h = [];
+      for (let o = 0; o < e; ++o) {
+        let c = o === 0 ? "  " : "  else ";
+        h.push(`${c}if (idx === ${o}) node.quad${o} = child;`);
+      }
+      return h.join(`
+`);
+    }
+  }
+  function m(t) {
+    return `function getChild(node, idx) {
+${e()}
+  return null;
+}`;
+    function e() {
+      let a = [], h = Math.pow(2, t);
+      for (let o = 0; o < h; ++o)
+        a.push(`  if (idx === ${o}) return node.quad${o};`);
+      return a.join(`
+`);
+    }
+  }
+  function b(t) {
+    let e = p(t), a = Math.pow(2, t);
+    var h = `
+function QuadNode() {
+  // body stored inside this node. In quad tree only leaf nodes (by construction)
+  // contain bodies:
+  this.body = null;
+
+  // Child nodes are stored in quads. Each quad is presented by number:
+  // 0 | 1
+  // -----
+  // 2 | 3
+${o("  this.")}
+
+  // Total mass of current node
+  this.mass = 0;
+
+  // Center of mass coordinates
+  ${e("this.mass_{var} = 0;", { indent: 2 })}
+
+  // bounding box coordinates
+  ${e("this.min_{var} = 0;", { indent: 2 })}
+  ${e("this.max_{var} = 0;", { indent: 2 })}
+}
+`;
+    return h;
+    function o(c) {
+      let v = [];
+      for (let i = 0; i < a; ++i)
+        v.push(`${c}quad${i} = null;`);
+      return v.join(`
+`);
+    }
+  }
+  function x() {
+    return `
+/**
+ * Our implementation of QuadTree is non-recursive to avoid GC hit
+ * This data structure represent stack of elements
+ * which we are trying to insert into quad tree.
+ */
+function InsertStack () {
+    this.stack = [];
+    this.popIdx = 0;
+}
+
+InsertStack.prototype = {
+    isEmpty: function() {
+        return this.popIdx === 0;
+    },
+    push: function (node, body) {
+        var item = this.stack[this.popIdx];
+        if (!item) {
+            // we are trying to avoid memory pressure: create new element
+            // only when absolutely necessary
+            this.stack[this.popIdx] = new InsertStackElement(node, body);
+        } else {
+            item.node = node;
+            item.body = body;
+        }
+        ++this.popIdx;
+    },
+    pop: function () {
+        if (this.popIdx > 0) {
+            return this.stack[--this.popIdx];
+        }
+    },
+    reset: function () {
+        this.popIdx = 0;
+    }
+};
+
+function InsertStackElement(node, body) {
+    this.node = node; // QuadTree node
+    this.body = body; // physical body which needs to be inserted to node
+}
+`;
+  }
+  return s.exports;
+}
+export {
+  B as __require
+};

package/dist/es/node_modules/.pnpm/ngraph.forcelayout@3.3.1/node_modules/ngraph.forcelayout/lib/codeGenerators/getVariableName.js

@@ -0,0 +1,9 @@
+var e, a;
+function u() {
+  return a || (a = 1, e = function(r) {
+    return r === 0 ? "x" : r === 1 ? "y" : r === 2 ? "z" : "c" + (r + 1);
+  }), e;
+}
+export {
+  u as __require
+};