zkoss/zk

File d3.layout.js has 1549 lines of code (exceeds 250 allowed). Consider refactoring.

Open

(function(){d3.layout = {};
// Implements hierarchical edge bundling using Holten's algorithm. For each
// input link, a path is computed that travels through the tree, up the parent
// hierarchy to the least common ancestor, and then back down to the destination
// node. Each path is simply an array of nodes.

Function force has 234 lines of code (exceeds 25 allowed). Consider refactoring.

Open

d3.layout.force = function() {
  var force = {},
      event = d3.dispatch("tick"),
      size = [1, 1],
      drag,

Function treemap has 178 lines of code (exceeds 25 allowed). Consider refactoring.

Open

d3.layout.treemap = function() {
  var hierarchy = d3.layout.hierarchy(),
      round = Math.round,
      size = [1, 1], // width, height
      padding = null,

Function tree has 122 lines of code (exceeds 25 allowed). Consider refactoring.

Open

d3.layout.tree = function() {
  var hierarchy = d3.layout.hierarchy().sort(null).value(null),
      separation = d3_layout_treeSeparation,
      size = [1, 1]; // width, height

Function chord has 120 lines of code (exceeds 25 allowed). Consider refactoring.

Open

d3.layout.chord = function() {
  var chord = {},
      chords,
      groups,
      matrix,

Function tree has 106 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function tree(d, i) {
    var nodes = hierarchy.call(this, d, i),
        root = nodes[0];

    function firstWalk(node, previousSibling) {

Function d3_layout_packCircle has 77 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function d3_layout_packCircle(nodes) {
  var xMin = Infinity,
      xMax = -Infinity,
      yMin = Infinity,
      yMax = -Infinity,

Function hierarchy has 66 lines of code (exceeds 25 allowed). Consider refactoring.

Open

d3.layout.hierarchy = function() {
  var sort = d3_layout_hierarchySort,
      children = d3_layout_hierarchyChildren,
      value = d3_layout_hierarchyValue;

Function relayout has 65 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function relayout() {
    var subgroups = {},
        groupSums = [],
        groupIndex = d3.range(n),
        subgroupIndex = [],

Function start has 63 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  force.start = function() {
    var i,
        j,
        n = nodes.length,
        m = links.length,

Function stack has 63 lines of code (exceeds 25 allowed). Consider refactoring.

Open

d3.layout.stack = function() {
  var values = Object,
      order = d3_layout_stackOrders["default"],
      offset = d3_layout_stackOffsets["zero"],
      out = d3_layout_stackOut,

Function tick has 56 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function tick() {
    var n = nodes.length,
        m = links.length,
        q,
        i, // current index

Function histogram has 53 lines of code (exceeds 25 allowed). Consider refactoring.

Open

d3.layout.histogram = function() {
  var frequency = true,
      valuer = Number,
      ranger = d3_layout_histogramRange,
      binner = d3_layout_histogramBinSturges;

Function pie has 50 lines of code (exceeds 25 allowed). Consider refactoring.

Open

d3.layout.pie = function() {
  var value = Number,
      sort = null,
      startAngle = 0,
      endAngle = 2 * Math.PI;

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

Open

d3.layout.cluster = function() {
  var hierarchy = d3.layout.hierarchy().sort(null).value(null),
      separation = d3_layout_treeSeparation,
      size = [1, 1]; // width, height

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

Open

d3.layout.partition = function() {
  var hierarchy = d3.layout.hierarchy(),
      size = [1, 1]; // width, height

  function position(node, x, dx, dy) {

Function apportion has 36 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    function apportion(node, previousSibling, ancestor) {
      if (previousSibling) {
        var vip = node,
            vop = node,
            vim = previousSibling,

Function position has 33 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function position(row, u, rect, flush) {
    var i = -1,
        n = row.length,
        x = rect.x,
        y = rect.y,

Function squarify has 32 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  function squarify(node) {
    var children = node.children;
    if (children && children.length) {
      var rect = pad(node),
          row = [],

Function d3_layout_forceAccumulate has 29 lines of code (exceeds 25 allowed). Consider refactoring.

Open

function d3_layout_forceAccumulate(quad, alpha, charges) {
  var cx = 0,
      cy = 0;
  quad.charge = 0;
  if (!quad.leaf) {

Function firstWalk has 28 lines of code (exceeds 25 allowed). Consider refactoring.

Open

    function firstWalk(node, previousSibling) {
      var children = node.children,
          layout = node._tree;
      if (children && (n = children.length)) {
        var n,

Function wiggle has 28 lines of code (exceeds 25 allowed). Consider refactoring.

Open

  "wiggle": function(data) {
    var n = data.length,
        x = data[0],
        m = x.length,
        max = 0,

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

Open

  function cluster(d, i) {
    var nodes = hierarchy.call(this, d, i),
        root = nodes[0],
        previousNode,
        x = 0,

Avoid deeply nested control flow statements.

Open

          for (k = a._pack_prev; k !== j._pack_prev; k = k._pack_prev, s2++) {
            if (d3_layout_packIntersects(k, c)) {
              if (s2 < s1) {
                isect = -1;
                j = k;

Avoid deeply nested control flow statements.

Open

          if (d3_layout_packIntersects(j, c)) {
            isect = 1;
            break;
          }

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

Open

    } else { // vertical subdivision
      if (flush || v > rect.dx) v = v ? rect.dx : 0; // over+underflow
      while (++i < n) {
        o = row[i];
        o.x = x;

• Read up
  Read up

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

Open

    if (u == rect.dx) { // horizontal subdivision
      if (flush || v > rect.dy) v = v ? rect.dy : 0; // over+underflow
      while (++i < n) {
        o = row[i];
        o.x = x;

• Read up
  Read up

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

Open

  stack.order = function(x) {
    if (!arguments.length) return order;
    order = typeof x === "function" ? x : d3_layout_stackOrders[x];
    return stack;
  };

• Read up
  Read up

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

Open

  stack.offset = function(x) {
    if (!arguments.length) return offset;
    offset = typeof x === "function" ? x : d3_layout_stackOffsets[x];
    return stack;
  };

• Read up
  Read up

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

Open

  var dx = b.x - a.x,
      dy = b.y - a.y,
      dr = a.r + b.r;

• Read up
  Read up

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

Open

  var db = a.r + c.r,
      dx = b.x - a.x,
      dy = b.y - a.y;

• Read up
  Read up

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

Open

  chord.padding = function(x) {
    if (!arguments.length) return padding;
    padding = x;
    chords = groups = null;
    return chord;

• Read up
  Read up

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

Open

  chord.sortGroups = function(x) {
    if (!arguments.length) return sortGroups;
    sortGroups = x;
    chords = groups = null;
    return chord;

• Read up
  Read up

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

Open

  force.linkDistance = function(x) {
    if (!arguments.length) return linkDistance;
    linkDistance = d3.functor(x);
    return force;
  };

• Read up
  Read up

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

Open

  var hierarchy = d3.layout.hierarchy().sort(null).value(null),
      separation = d3_layout_treeSeparation,
      size = [1, 1]; // width, height

• Read up
  Read up

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

Open

  var hierarchy = d3.layout.hierarchy().sort(null).value(null),
      separation = d3_layout_treeSeparation,
      size = [1, 1]; // width, height

• Read up
  Read up

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

Open

  force.linkStrength = function(x) {
    if (!arguments.length) return linkStrength;
    linkStrength = d3.functor(x);
    return force;
  };

• Read up
  Read up

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

Open

  chord.sortSubgroups = function(x) {
    if (!arguments.length) return sortSubgroups;
    sortSubgroups = x;
    chords = null;
    return chord;

• Read up
  Read up

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

Open

  treemap.sticky = function(x) {
    if (!arguments.length) return sticky;
    sticky = x;
    stickies = null;
    return treemap;

• Read up
  Read up

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

Open

      subgroupIndex.forEach(function(d, i) {
        d.sort(function(a, b) {
          return sortSubgroups(matrix[i][a], matrix[i][b]);
        });
      });

• Read up
  Read up

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

Open

  function resort() {
    chords.sort(function(a, b) {
      return sortChords(a.target.value, b.target.value);
    });
  }

• Read up
  Read up