Module unchanged

Find syntax nodes that are obviously unchanged, so we can run the main diff on smaller inputs.

Structs

• EqOnFirstItem 🔒
  A 2-tuple that only considers the first item in equality and sorting.

Enums

• ChangeState 🔒

Constants

• MOSTLY_UNCHANGED_MIN_COMMON_CHILDREN 🔒
• TINY_TREE_THRESHOLD 🔒

Functions

• as_singleton_list_children 🔒
• count_common_unique 🔒
  Count the nodes in lhs that are unique to the LHS input, but are also present in rhs.
• count_unique_subtrees 🔒
• find_all_unique_content_ids 🔒
• find_unique_content_ids 🔒
• is_mostly_unchanged_list 🔒
  Return true if both nodes are lists that share at least MOSTLY_UNCHANGED_MIN_COMMON_CHILDREN unique subtrees, regardless of whether their delimiters match.
• mark_unchanged 🔒
  Look for syntax nodes that are obviously the same, and set ChangeKind on them.
• shrink_unchanged_at_ends 🔒
  Skip syntax nodes at the beginning or end that are obviously unchanged.
• shrink_unchanged_delimiters 🔒
  If we’re comparing two lists that have the same delimiters, mark the delimiters as unchanged and return the children.
• split_mostly_unchanged_toplevel 🔒
  Split out top-level lists that are largely the same.
• split_unchanged 🔒
  Wraps split_unchanged_toplevel with a size threshold and updates change_map.
• split_unchanged_singleton_list 🔒
• split_unchanged_toplevel 🔒
  Walk lhs_nodes and rhs_nodes and run a longest-common-subsequence (traditional) diff on their toplevel content IDs.