— I also plan on adding blacklist parameters so you can ignore specific properties
— Other than that you can use a search parameter which ignores any properties not specified
— Also find/replace would be cool if you didnt know where something was
— You could make it extendable
— Run a user-defined function per node, and / or a function that returns a boolean to know to traverse a subtree or not
Message permanent page
— Maybe implement something similar to map and filter
— Definitely! Thats the goal is extensibility
— The traversal algorithm just uses the iterator protocol, too