Module diff

Modules

• changes 🔒
  Data types that track the change state for syntax nodes.
• dijkstra 🔒
  Implements Dijkstra’s algorithm for shortest path, to find an optimal and readable diff between two ASTs.
• graph 🔒
  A graph representation for computing tree diffs.
• lcs_diff 🔒
  A fast diff for linear content, particularly lines of text.
• sliders 🔒
  Prefer contiguous novel nodes on the same line.
• stack 🔒
• unchanged 🔒
  Find nodes that are obviously unchanged, so we can run the main diff on smaller inputs.