Showing 207 of 537 total issues
Function linePoint
has 44 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function linePoint(lambda, phi) {
var p = cartesian([lambda * radians, phi * radians]);
if (p0) {
var normal = cartesianCross(p0, p),
equatorial = [normal[1], -normal[0], 0],
Function tree_cover
has 44 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function tree_cover(x, y) {
if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points
var x0 = this._x0,
y0 = this._y0,
Function histogram
has 44 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function histogram() {
var value = identity,
domain = extent,
threshold = sturges;
Function resampleLineTo
has 14 arguments (exceeds 4 allowed). Consider refactoring. Open
Open
function resampleLineTo(x0, y0, lambda0, a0, b0, c0, x1, y1, lambda1, a1, b1, c1, depth, stream) {
Function intersect
has 43 lines of code (exceeds 25 allowed). Consider refactoring. Open
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
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
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
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;
Function partition
has 41 lines of code (exceeds 25 allowed). Consider refactoring. Open
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
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
Open
function cluster() {
var separation = defaultSeparation,
dx = 1,
dy = 1,
nodeSize = false;
Function arcTo
has 39 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
arcTo: function(x1, y1, x2, y2, r) {
x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;
var x0 = this._x1,
y0 = this._y1,
x21 = x2 - x1,
Function index$3
has 39 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function index$3() {
var pointRadius = 4.5,
projection,
projectionStream,
context,
Function tree_remove
has 38 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function tree_remove(d) {
if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points
var parent,
node = this._root,
Function line
has 38 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function line() {
var x$$ = x,
y$$ = y,
defined = constant$1(true),
context = null,
Function brush
has 38 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function brush(group) {
var overlay = group
.property("__brush", initialize)
.selectAll(".overlay")
.data([type$1("overlay")]);
Function quantile
has 38 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function quantile() {
var domain = [],
range = [],
thresholds = [];
Function attachCircle
has 38 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function attachCircle(arc) {
var lArc = arc.P,
rArc = arc.N;
if (!lArc || !rArc) return;
Function force
has 38 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function force() {
var i, n = nodes.length,
tree,
node,
xi,
Function squarifyRatio
has 37 lines of code (exceeds 25 allowed). Consider refactoring. Open
Open
function squarifyRatio(ratio, parent, x0, y0, x1, y1) {
var rows = [],
nodes = parent.children,
row,
nodeValue,