MCPcopy Create free account
hub / github.com/idank/explainshell / secondWalk

Function secondWalk

explainshell/web/static/js/d3.v3.js:5811–5821  ·  view source on GitHub ↗
(node, x)

Source from the content-addressed store, hash-verified

5809 }
5810 }
5811 function secondWalk(node, x) {
5812 node.x = node._tree.prelim + x;
5813 var children = node.children;
5814 if (children && (n = children.length)) {
5815 var i = -1, n;
5816 x += node._tree.mod;
5817 while (++i < n) {
5818 secondWalk(children[i], x);
5819 }
5820 }
5821 }
5822 function apportion(node, previousSibling, ancestor) {
5823 if (previousSibling) {
5824 var vip = node, vop = node, vim = previousSibling, vom = node.parent.children[0], sip = vip._tree.mod, sop = vop._tree.mod, sim = vim._tree.mod, som = vom._tree.mod, shift;

Callers 1

treeFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected