SethTrowbridge/pivot-editor
1
1
Fork 0
Code Issues 1 Pull Requests Projects 1 Releases Wiki Activity

modify method added

Browse Source
This commit is contained in:
TreetopFlyer 2021-05-08 07:03:41 -04:00
parent 9cc8c3825d
commit 0fad43c6dc
1 changed files with 33 additions and 50 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

79
index.html
View File

@ -9,16 +9,22 @@ var N = {
Parents:[], Parents:[],
WalkID:0, WalkID:0,
edited:[], RecieveAddition:[],
editing:[] RecieveMultiplication:[],
GiveAddition:[],
GiveMultiplication:[]
}; };
inChildren.forEach( inChild => N.ConnectChild(output, inChild) ); inChildren.forEach( inChild => N.Connect(output, "Children", inChild, "Parents") );
return output; return output;
}, },
ConnectChild:(inParent, inChild)=> Connect:(inParent, inParentRefs, inChild, inChildRefs) =>
{ {
inParent.Children.push(inChild); inParent[inParentRefs].push(inChild);
inChild.Parents.push(inParent); inChild[inChildRefs].push(inParent);
},
Disconnect:(inParent, inParentRefs, inChild, inChildRefs) =>
{
//inParent[inParentRefs]
}, },
Walk:(inNode, inKey, inIterator, inWalkID) => Walk:(inNode, inKey, inIterator, inWalkID) =>
{ {
@ -37,8 +43,22 @@ var N = {
} }
} }
}, },
WalkChildren:(inNode, inIterator, inWalkID) => N.Walk(inNode, "Children", inIterator, inWalkID), Modify(inNode, inAmount)
WalkParents :(inNode, inIterator, inWalkID) => N.Walk(inNode, "Parents", inIterator, inWalkID) {
inNode.WalkID = "tweak-"+Math.random();
let leaves = [];
let gatherAddition = n => N.Connect(inNode, "GiveAddition", n, "RecieveAddition");
let gatherMultiply = n =>
{
N.Connect(inNode, "GiveMultiplication", n, "RecieveMultiplication");
n.Children.length == 0 ? leaves.push(n) : null;
};
N.Walk(inNode, "Parents", gatherAddition, inNode.WalkID);
N.Walk(inNode, "Children", gatherMultiply, inNode.WalkID);
leaves.forEach(leaf=>N.Walk(leaf, "Parents", gatherAddition, inNode.WalkID));
}
}; };
</script> </script>
<script> <script>
@ -62,7 +82,7 @@ let leavesCollect = n=>
leaves.push(n); leaves.push(n);
} }
}; };
N.WalkChildren(tree1, leavesCollect, 1); N.Walk(tree1, "Children", leavesCollect, 1);
let tree2 = N.Create("root2", let tree2 = N.Create("root2",
N.Create("branch3", N.Create("branch3",
@ -77,44 +97,7 @@ let orchard = N.Create("orchard", tree1, tree2);
/*************************************************************/ /*************************************************************/
// phase 0, start node N.Modify(tree1);
let modified = tree1; console.log(tree1);
// phase 1, walk up and flag additions
let additionNodes = [];
let additionGather = n =>
{
additionNodes.push(n);
};
// phase 2 walk down and flag multiply, also collect leaves
let multiplyNodes = [];
let multiplyLeaves = [];
let multiplyGather = n =>
{
multiplyNodes.push(n)
n.Children.length == 0 ? multiplyLeaves.push(n) : null;
};
// phase 3 walk up from leaves and flag additions
// (re-uses phase 1)
///////////////////////
// phase 0
modified.WalkID = "add-1";
//phase 1
N.Walk(modified, "Parents", additionGather, modified.WalkID);
//phase 2
N.Walk(modified, "Children", multiplyGather, modified.WalkID);
//phase 3
multiplyLeaves.forEach(leaf=>{
N.Walk(leaf, "Parents", additionGather, modified.WalkID);
});
console.log(additionNodes);
console.log(multiplyNodes);
</script> </script>