28:null 29:["$","title",null,{"children":"Recursive Algorithm for Decision Tables | joesquito | Observable"}] 2f:T13be,root = { let data = mockData const parsedData = [] function addCondition(i) { const node = {} node.condition = i node.name = 'condition ' + i node.children = [] return node } //get max condition let conditions = data.filter((e) => e.name === 'condition') let result = conditions.map((e) => { return parseInt(e.number) }) const maxCondition = Math.max(...result) //get max rule result = data.columns .filter((e) => e.slice(0, 4) === 'rule') .map((e) => e.slice(5, 8)) const maxRule = Math.max(...result) function createHierarchy(i, node, table, parent = '') { if (i > maxCondition) { console.log("I'm on condition " + i + " but this is greater than the max condtion of " + maxCondition + " so I'm backing up to " + parent) return } //console.log('* ', table) node.statement = table[i-1]['statement'] console.log("I'm starting a new recursion at condition " + i ) //select columns for condition i (indexed at i - 1) except rule coulmns where === '' const activeRules = [] table.forEach((e, j, a) => { const ent = Object.entries(e) const filt = ent.filter((f) => { return a[i-1][f[0]] !== '' }) activeRules.push(Object.fromEntries(filt)) }) const rules = Object.keys(activeRules[0]).filter( e => e.slice(0, 4) === 'rule' ) let noneBelow = true for (let rule of rules) { noneBelow = true let ynValue = activeRules[i - 1][rule] condtionLoop: for (let condition = i; condition < maxCondition; condition++) { console.log('I\'m on condition ' + i + ' ' + rule + ' and I\'m going to check for condition ' + (condition + 1)) console.log('I found that condition ' + (condition + 1) + ' ' + rule + ' = ' + ( activeRules[condition][rule] ? activeRules[condition][rule] : "''" )) console.log(activeRules[condition][rule]) if (activeRules[condition][rule] !== '') { noneBelow = false const ynIdx = ynValue === 'Y' ? 0 : ynValue === 'N' ? 1 : undefined if (node.children[ynIdx] === undefined) { console.log("So I'm going to create " + ynValue + " node as condition " + (condition + 1) + "\n\n") const newRules = [] if(ynValue === 'Y'){ //use activeRules to exclude columns where parent has 'N' activeRules.forEach((e, j, a) => { const ent = Object.entries(e) const filt = ent.filter((f) => { return a[i-1][f[0]] !== 'N' }) newRules.push(Object.fromEntries(filt)) }) } else if(ynValue === 'N'){ //use table to get every column except where parent has 'Y' table.forEach((e, j, a) => { const ent = Object.entries(e) const filt = ent.filter((f) => { return a[i-1][f[0]] !== 'Y' }) newRules.push(Object.fromEntries(filt)) }) } node.children[ynIdx] = addCondition(condition + 1) node.children[ynIdx].ynFromParent = ynValue node.children[ynIdx] = createHierarchy(condition + 1, node.children[ynIdx], newRules, 'condtion ' + i + ' ' + rule ) } else {console.log('I found a ' + ynValue + " child is already here so I'm moving on...")} break condtionLoop } } if(noneBelow){ console.log('I didn\'t find anything else on this rule so I\'m adding actions for ' + rule + ':') let actions = table .filter((e) => e.name === "action" && e[rule] !== '' ) .map((e) => { const row = (({ name, number, statement }) => ({name,number,statement}))(e) //row[rule] = e[rule] return row }) const ynIdx = ynValue === 'Y' ? 0 : ynValue === 'N' ? 1 : undefined node.children[ynIdx] = {} node.children[ynIdx].rule = rule node.children[ynIdx].name = rule node.children[ynIdx].actions = actions } } console.log('I finished checking condition ' + i + " so I'm " + (parent ? 'returning to ' + parent + ' who sent me here\n\n' : 'finished.') ) return node } const starts = [1] for(let rule = 4; rule < data.columns.length; rule++){ for(let condition = 0; condition < maxCondition; condition++){ if(data[condition]['rule ' + (rule - 2)] !== ''){ console.log('outer' + 'rule ' + rule) if(data[condition]['rule ' + (rule - 3)] === '' ){ console.log('inner' + 'rule ' + rule) starts.push(condition + 1) } break } } } const root = {} root.children = [] for(let i of starts){ root.children.push(createHierarchy(i, addCondition(i), data )) } root.maxCondition = maxCondition root.maxRule = maxRule return root }30:[{"id":"83803c4e16bf78be61384c6d1da1c20cb337fa2a422883643e67f8df13065ea99bccd40531440f6752227fa71fe4d78352f5145ed241e093163f0b740542e7b1","href":"https://static.observableusercontent.com/files/83803c4e16bf78be61384c6d1da1c20cb337fa2a422883643e67f8df13065ea99bccd40531440f6752227fa71fe4d78352f5145ed241e093163f0b740542e7b1","name":"mock_data1.csv","type":"text/csv","lastModified":1668205371019.686,"size":340}] 2c:{"id":"e6a9ff72a3261016","slug":null,"title":"Recursive Algorithm for Decision Tables","thumbnail":"d7d0c6faaca551c5f2433fc0daa70eef4f10c388f492e48e6ddc044b64d7a9a3","access_level":"public","create_time":"$D2022-11-11T22:18:07.623Z","update_time":"$D2022-11-23T04:27:55.573Z","view_time":null,"first_public_time":"$D2022-11-13T18:14:35.783Z","fork":false,"stars":2,"starred":false,"owner":{"type":"team","id":"0060d7e6ab876335","login":"joesquito","name":"","avatar_url":"https://avatars-next.observableusercontent.com/da831b9cdea0bbd7b05f416ce528d6c9398e104259fdd1f2458721f21264327e","tier":"starter_2024"},"version":70,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"02ab589dd66f3f2f","login":"joesquito","name":"","avatar_url":"https://avatars-next.observableusercontent.com/da831b9cdea0bbd7b05f416ce528d6c9398e104259fdd1f2458721f21264327e","tier":null}],"members":[{"type":"individual","id":"02ab589dd66f3f2f","login":"joesquito","name":"","avatar_url":"https://avatars-next.observableusercontent.com/da831b9cdea0bbd7b05f416ce528d6c9398e104259fdd1f2458721f21264327e","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"subscribed":null,"forks":0,"collection":{"id":"f5fb8e7e4adc9b7e","slug":"decision-tables","title":"Decision Tables","owner":{"id":"0060d7e6ab876335","login":"joesquito","name":""}},"type":"notebook","body":{"title":"Recursive Algorithm for Decision Tables","cells":[{"id":0,"value":"# Recursive Algorithm for Decision Tables","pinned":false,"hidden":false,"mode":"md"},{"id":66,"value":"My first attempt to create trees from decision tables is this recursive function. It creates the tree hierarchy in one pass. I thought might be more efficient, but creating paths and letting D3's algorithm create the hierarchy is plenty quick.","pinned":false,"hidden":false,"mode":"md"},{"id":47,"value":"\n \n \n ${Object.keys(mockData[0]).map( e => htl.html``)}\n \n \n \n ${mockData.map( (e,i,a) => {\n let html = htl.html.fragment``\n \n for(let f in e){\n html = htl.html.fragment`${html}`\n } \n \n if(e.name === 'condition' && a[i+1]?.name === 'action'){\n html = htl.html.fragment`${html}`\n } else {\n html = htl.html.fragment`${html}`\n }\n return html\n })\n }\n \n

${e}
${e[f]}

","pinned":false,"hidden":false,"mode":"html"},{"id":53,"value":"chart = Tree(root.children[0], {\n label: d => d.name,\n title: (d, n) => `${n.ancestors().reverse().map(d => d.data.name).join(\".\")}`, // hover text\n link: (d, n) => `https://github.com/prefuse/Flare/${n.children ? \"tree\" : \"blob\"}/master/flare/src/${n.ancestors().reverse().map(d => d.data.name).join(\"/\")}${n.children ? \"\" : \".as\"}`,\n width: 1152\n})","pinned":true,"hidden":false,"mode":"ojs"},{"id":62,"value":"import {Tree} from \"@d3/tree\"","pinned":true,"hidden":false,"mode":"ojs"},{"id":5,"value":"$2f","pinned":true,"hidden":false,"mode":"ojs"},{"id":40,"value":"mockData = FileAttachment(\"mock_data1.csv\").csv()\n","pinned":true,"hidden":false,"mode":"ojs"}],"files":"$W30","stdlib":"1","titling":"auto"}} 2d:"$2c:body"