recursion-ninja
recursion-ninja
This is probably a good time to review our `BUILD` command and refine the types, options, and functionality associated with each.
We should explore generalizing the postorder and preorder passes into a continuation-passing-style memoization so that multiple pass logic can be combined into a single "fold."
Removing a list item as it is a separate issue #60.
I think call catcher and similar static analysis for C sources are quite hard to get running. I think we will have to remove dead code manually, if at all....
Yeah, that does sound good. I know `gcc-7.*` has a lot more static analysis flags. Unsure if there's one for listing functions which are never called. No Idea about `clang`'s...
We can consider the the following flag invocations: gcc -fdata-sections -ffunction-sections -Wl,--gc-sections If `gcc` doesn't have the static analysis capabilities we need, Then I'm going to close out this issue....
Smoke test 3D DO using QuickCheck. If it doesn't SEGFAULT, we are good to go for now.
@ima-hima mentioned over on #42 > I know this is closed, but as a reminder, I've done the prep work for this. I believe it doesn't have a test suite,...
Graph operations: * Get leaf set: `DAGGraph -> NonEmpty Node` * Get root set: `DAGGraph -> NonEmpty Node` * Get node set: `DAGGraph -> NonEmpty Node` * Get edge set:...
Note that is if the leaf nodes are placed at vector indices `[0, n-1]` then we can reused the `BitVector` representations of the leafset of a sub tree between graph...