eiriksm/msg2svg

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    function initializeStrength() {
      if (!nodes) return;

      for (var i = 0, n = links.length; i < n; ++i) {
        strengths[i] = +strength(links[i], i, links);

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

          if ((da0 -= p0 * 2) > epsilon$1) p0 *= (cw ? 1 : -1), a00 += p0, a10 -= p0;
          else da0 = 0, a00 = a10 = (a0 + a1) / 2;

• Read up
  Read up

Function intersect has 43 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    function intersect(a, b, two) {
      var pa = cartesian(a),
          pb = cartesian(b);

      // We have two planes, n1.p = d1 and n2.p = d2.

Function removeBeach has 42 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function removeBeach(beach) {
    var circle = beach.circle,
        x = circle.x,
        y = circle.cy,
        vertex = [x, y],

Function polygonContains has 42 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function polygonContains(polygon, point) {
    var lambda = point[0],
        phi = point[1],
        normal = [sin$1(lambda), -cos$1(lambda), 0],
        angle = 0,

Consider simplifying this complex logical expression.

Open

    if ((node = parent[0] || parent[1] || parent[2] || parent[3])
        && node === (parent[3] || parent[2] || parent[1] || parent[0])
        && !node.length) {
      if (retainer) retainer[j] = node;
      else this._root = node;

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    cluster.size = function(x) {
      return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? null : [dx, dy]);
    };

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    tree.nodeSize = function(x) {
      return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], tree) : (nodeSize ? [dx, dy] : null);
    };

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    tree.size = function(x) {
      return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], tree) : (nodeSize ? null : [dx, dy]);
    };

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

      if (antimeridian) {
        if (lambda < lambda2) {
          if (angle(lambda0$1, lambda) > angle(lambda0$1, lambda1)) lambda1 = lambda;
        } else {
          if (angle(lambda, lambda1) > angle(lambda0$1, lambda1)) lambda0$1 = lambda;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

    cluster.nodeSize = function(x) {
      return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], cluster) : (nodeSize ? [dx, dy] : null);
    };

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  function graticuleY(x0, x1, dx) {
    var x = range(x0, x1 - epsilon$4, dx).concat(x1);
    return function(y) { return x.map(function(x) { return [x, y]; }); };
  }

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

        } else {
          if (lambda > lambda2) {
            if (angle(lambda0$1, lambda) > angle(lambda0$1, lambda1)) lambda1 = lambda;
          } else {
            if (angle(lambda, lambda1) > angle(lambda0$1, lambda1)) lambda0$1 = lambda;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

  function graticuleX(y0, y1, dy) {
    var y = range(y0, y1 - epsilon$4, dy).concat(y1);
    return function(x) { return y.map(function(y) { return [x, y]; }); };
  }

• Read up
  Read up

Function partition has 41 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function partition() {
    var dx = 1,
        dy = 1,
        padding = 0,
        round = false;

Function clipAntimeridianLine has 41 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function clipAntimeridianLine(stream) {
    var lambda0 = NaN,
        phi0 = NaN,
        sign0 = NaN,
        clean; // no intersections

Function cluster has 40 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function cluster() {
    var separation = defaultSeparation,
        dx = 1,
        dy = 1,
        nodeSize = false;

Similar blocks of code found in 4 locations. Consider refactoring.

Open

    darker: function(k) {
      k = k == null ? darker : Math.pow(darker, k);
      return new Hsl(this.h, this.s, this.l * k, this.opacity);
    },

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

          dy = Math.min(0, transform.invertY(extent[0][1]) - y0) || Math.max(0, transform.invertY(extent[1][1]) - y1);

• Read up
  Read up

Similar blocks of code found in 4 locations. Consider refactoring.

Open

    darker: function(k) {
      k = k == null ? darker : Math.pow(darker, k);
      return new Cubehelix(this.h, this.s, this.l * k, this.opacity);
    },

• Read up
  Read up