|
| 1 | +"use strict"; |
| 2 | +var __spreadArrays = (this && this.__spreadArrays) || function () { |
| 3 | + for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length; |
| 4 | + for (var r = Array(s), k = 0, i = 0; i < il; i++) |
| 5 | + for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++) |
| 6 | + r[k] = a[j]; |
| 7 | + return r; |
| 8 | +}; |
| 9 | +exports.__esModule = true; |
| 10 | +exports.convertForCascade = void 0; |
| 11 | +// Some globals |
| 12 | +var myMap; |
| 13 | +var final = []; |
| 14 | +var calledAlready = []; // to keep track of what has been called; prevent reculsion! |
| 15 | +/** |
| 16 | + * Take a parent function and return all children in proper format |
| 17 | + * @param parent |
| 18 | + */ |
| 19 | +function generateFromOneParent(parent) { |
| 20 | + var newElements = []; |
| 21 | + if (myMap.has(parent)) { |
| 22 | + var children = myMap.get(parent); |
| 23 | + children.forEach(function (element) { |
| 24 | + if (!calledAlready.includes(element)) { // PREVENT RECURSION ! |
| 25 | + newElements.push({ id: element, parents: [parent] }); |
| 26 | + } |
| 27 | + }); |
| 28 | + } |
| 29 | + return newElements; |
| 30 | +} |
| 31 | +/** |
| 32 | + * Recursive function to generate each subsequent level |
| 33 | + * @param parents |
| 34 | + * @param stackDepth - maximum depth of calls to trace |
| 35 | + */ |
| 36 | +function generateNextLevel(parents, stackDepth) { |
| 37 | + calledAlready.push.apply(calledAlready, parents); |
| 38 | + if (stackDepth === 0) { |
| 39 | + return; |
| 40 | + } |
| 41 | + // Generate the NodeForGraphing[] for this 'level' |
| 42 | + var thisLevel = []; |
| 43 | + parents.forEach(function (parent) { |
| 44 | + thisLevel.push.apply(thisLevel, generateFromOneParent(parent)); |
| 45 | + }); |
| 46 | + if (thisLevel.length) { |
| 47 | + final.push(__spreadArrays(thisLevel)); |
| 48 | + } |
| 49 | + // start building the next `level` |
| 50 | + var nextLevel = []; |
| 51 | + parents.forEach(function (parent) { |
| 52 | + if (myMap.has(parent)) { |
| 53 | + nextLevel.push.apply(nextLevel, myMap.get(parent)); |
| 54 | + } |
| 55 | + }); |
| 56 | + if (nextLevel.length) { |
| 57 | + generateNextLevel(nextLevel, stackDepth - 1); |
| 58 | + } |
| 59 | +} |
| 60 | +/** |
| 61 | + * Convert the call map to format D3 wants |
| 62 | + * @param calledFunctions |
| 63 | + */ |
| 64 | +function convertForCascade(calledFunctions) { |
| 65 | + myMap = calledFunctions; |
| 66 | + final = []; |
| 67 | + calledAlready = []; |
| 68 | + // 1st case -- handle manually |
| 69 | + final.push([{ id: 'proceed' }]); |
| 70 | + // all next cases generate automatically |
| 71 | + generateNextLevel(['proceed'], 10); |
| 72 | + console.log('======================================'); |
| 73 | + console.log(final); |
| 74 | + console.log('--------------------------------------'); |
| 75 | + console.log(JSON.stringify(final)); |
| 76 | + console.log(''); |
| 77 | + return final; |
| 78 | +} |
| 79 | +exports.convertForCascade = convertForCascade; |
0 commit comments