d3-sankey - npm Package Compare versions

Comparing version 0.3.1 to 0.3.2

build/d3-sankey.js

@@ -1,2 +0,2 @@
-// https://github.com/d3/d3-sankey Version 0.3.1. Copyright 2016 Mike Bostock.
+// https://github.com/d3/d3-sankey Version 0.3.2. Copyright 2016 Mike Bostock.
 (function (global, factory) {
@@ -3,0 +3,0 @@ typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports, require('d3-array'), require('d3-collection'), require('d3-interpolate')) :

build/d3-sankey.min.js

@@ -1,2 +0,2 @@
-// https://github.com/d3/d3-sankey Version 0.3.1. Copyright 2016 Mike Bostock.
+// https://github.com/d3/d3-sankey Version 0.3.2. Copyright 2016 Mike Bostock.
 !function(n,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports,require("d3-array"),require("d3-collection"),require("d3-interpolate")):"function"==typeof define&&define.amd?define(["exports","d3-array","d3-collection","d3-interpolate"],t):t(n.d3=n.d3||{},n.d3,n.d3,n.d3)}(this,function(n,t,r,e){"use strict";function u(){function n(){k.forEach(function(n){n.sourceLinks=[],n.targetLinks=[]}),v.forEach(function(n){var t=n.source,r=n.target;"number"==typeof t&&(t=n.source=k[n.source]),"number"==typeof r&&(r=n.target=k[n.target]),t.sourceLinks.push(n),r.targetLinks.push(n)})}function u(){k.forEach(function(n){n.value=Math.max(t.sum(n.sourceLinks,y),t.sum(n.targetLinks,y))})}function o(){for(var n,t=k,r=0;t.length;)n=[],t.forEach(function(t){t.x=r,t.dx=h,t.sourceLinks.forEach(function(t){n.indexOf(t.target)<0&&n.push(t.target)})}),t=n,++r;c(r),i((g[0]-h)/(r-1))}function c(n){k.forEach(function(t){t.sourceLinks.length||(t.x=n-1)})}function i(n){k.forEach(function(t){t.x*=n})}function f(n){function e(){var n=t.min(f,function(n){return(g[1]-(n.length-1)*l)/t.sum(n,y)});f.forEach(function(t){t.forEach(function(t,r){t.y=r,t.dy=t.value*n})}),v.forEach(function(t){t.dy=t.value*n})}function u(n){function r(n){return s(n.source)*n.value}f.forEach(function(e){e.forEach(function(e){if(e.targetLinks.length){var u=t.sum(e.targetLinks,r)/t.sum(e.targetLinks,y);e.y+=(u-s(e))*n}})})}function o(n){function r(n){return s(n.target)*n.value}f.slice().reverse().forEach(function(e){e.forEach(function(e){if(e.sourceLinks.length){var u=t.sum(e.sourceLinks,r)/t.sum(e.sourceLinks,y);e.y+=(u-s(e))*n}})})}function c(){f.forEach(function(n){var t,r,e,u=0,o=n.length;for(n.sort(i),e=0;e<o;++e)t=n[e],r=u-t.y,r>0&&(t.y+=r),u=t.y+t.dy+l;if(r=u-l-g[1],r>0)for(u=t.y-=r,e=o-2;e>=0;--e)t=n[e],r=t.y+t.dy+l-u,r>0&&(t.y-=r),u=t.y})}function i(n,t){return n.y-t.y}var f=r.nest().key(function(n){return n.x}).sortKeys(t.ascending).entries(k).map(function(n){return n.values});e(),c();for(var a=1;n>0;--n)o(a*=.99),c(),u(a),c()}function a(){function n(n,t){return n.source.y-t.source.y}function t(n,t){return n.target.y-t.target.y}k.forEach(function(r){r.sourceLinks.sort(t),r.targetLinks.sort(n)}),k.forEach(function(n){var t=0,r=0;n.sourceLinks.forEach(function(n){n.sy=t,t+=n.dy}),n.targetLinks.forEach(function(n){n.ty=r,r+=n.dy})})}function s(n){return n.y+n.dy/2}function y(n){return n.value}var d={},h=24,l=8,g=[1,1],k=[],v=[];return d.nodeWidth=function(n){return arguments.length?(h=+n,d):h},d.nodePadding=function(n){return arguments.length?(l=+n,d):l},d.nodes=function(n){return arguments.length?(k=n,d):k},d.links=function(n){return arguments.length?(v=n,d):v},d.size=function(n){return arguments.length?(g=n,d):g},d.layout=function(t){return n(),u(),o(),f(t),a(),d},d.relayout=function(){return a(),d},d.link=function(){function n(n){var r=n.source.x+n.source.dx,u=n.target.x,o=e.number(r,u),c=o(t),i=o(1-t),f=n.source.y+n.sy+n.dy/2,a=n.target.y+n.ty+n.dy/2;return"M"+r+","+f+"C"+c+","+f+" "+i+","+a+" "+u+","+a}var t=.5;return n.curvature=function(r){return arguments.length?(t=+r,n):t},n},d}n.sankey=u,Object.defineProperty(n,"__esModule",{value:!0})});

package.json

 {
   "name": "d3-sankey",
-  "version": "0.3.1",
+  "version": "0.3.2",
   "description": "Visualize flow between nodes in a directed acyclic network.",
@@ -5,0 +5,0 @@ "keywords": [

No alert changes

No metric changes

No dependency changes