Open Laeeth opened 5 years ago
Finding every type and declaration that another type/declaration "depends on" is not trivial.
You end up with the need for multiple passes at some point, in which case you need to make the printing the last stage and eg operate on the ast in earlier stages. But although that brings benefits it is quite a lot of work. I was thinking one might as well base the D version off dparser except that it seems to be closer to a parse tree.
Recursive for white list means pull in all things it depends on Blacklisting overrides whitelisting and aborts the recursive process at that level. Blacklist means it's just a blob