Expand description
Find nodes that are obviously unchanged, so we can run the main diff on smaller inputs.
StructsΒ§
- EqOn
First πItem
EnumsΒ§
- Change
State π
ConstantsΒ§
- TINY_
TREE_ πTHRESHOLD
FunctionsΒ§
- count_
common_ πunique Count the nodes inlhsthat are unique to the LHS input, but are also present inrhs. - Return true if both nodes are lists with same delimiters and have the same start and end children.
- mark_
unchanged πSetChangeKindon nodes that have exactly the same structure on both sides, and return a vec of pairs that need proper diffing. - Skip syntax nodes at the beginning or end that are obviously unchanged.
- If weβre comparing two lists that have the same delimiters, mark the delimiters as unchanged and return the children.
- Split out top-level lists that are largely the same.
- split_
unchanged π - Mark top-level nodes as unchanged if they have exactly the same content on both sides.