4 commits

Author	SHA1	Message	Date
David Lattimore	757f755c29	SSR: Match paths based on what they resolve to ... Also render template paths appropriately for their context.	2020-07-24 21:34:00 +10:00
David Lattimore	02fc3d50ee	SSR: Refactor to not rely on recursive search for nesting of matches ... Previously, submatches were handled simply by searching in placeholders for more matches. That only works if we search all nodes in the tree recursively. In a subsequent commit, I intend to make search not always be recursive recursive. This commit prepares for that by finding all matches, even if they overlap, then nesting them and removing overlapping matches.	2020-07-24 21:34:00 +10:00
David Lattimore	a45682ed96	Move iteration over all files into the SSR crate ... The methods `edits_for_file` and `find_matches_in_file` are replaced with just `edits` and `matches`. This simplifies the API a bit, but more importantly it makes it possible in a subsequent commit for SSR to decide to not search all files.	2020-07-24 21:34:00 +10:00
David Lattimore	13f901f636	SSR: Move search code into a submodule ... Also renamed find_matches to slow_scan_node to reflect that it's a slow way to do things. Actually the name came from a later commit and probably makes more sense once there's an alternative.	2020-07-24 21:34:00 +10:00