Message from JavaScript discussions

September 2017

— Hmm... I figured it out by using a nifty behavior of my iddfs. Data parity can be established between the node stack and another stack, which can be a path stack (an ordered set of arrays of strings). By adding to the path stack when I add to the node stack, I get a list of all paths the algorithm went down! Problem defeated haha

Message permanent page


Now I can use those paths to backtrack and recreate a subgraph from the root node, even though I'm not using DFS to eliminate the subgraph

— This is also great for unit tests since now I have an explicit log of the paths that were taken, and they are deterministic so very easily expect able

Message permanent page

— Https://

— Here is the test object

— This rule means that i can speak russian?:
- Feel free to speak any language.

— Fuck this code

— Lel

— Hey guys, i dont understand why use prototype

— What an emotional rollercoaster this was to read

— I don't feel like the backtracking would be nearly AS inefficient though

— The same as Array.prototype.filter, but for nested objects