Module ra_ap_syntax::algo

Collection of assorted algorithms for syntax trees.

Structs

• TreeDiff

Functions

• ancestors_at_offset
  Returns ancestors of the node at the offset, sorted by length. This should do the right thing at an edge, e.g. when searching for expressions at { $0foo } we will get the name reference instead of the whole block, which we would get if we just did find_token_at_offset(...).flat_map(|t| t.parent().ancestors()).
• diff
  Finds a (potentially minimal) diff, which, applied to from, will result in to.
• find_node_at_offset
  Finds a node of specific Ast type at offset. Note that this is slightly imprecise: if the cursor is strictly between two nodes of the desired type, as in
• find_node_at_range
• has_errors
• least_common_ancestor
• neighbor
• non_trivia_sibling
  Finds the first sibling in the given direction which is not trivia
• skip_trivia_token
  Skip to next non trivia token
• skip_whitespace_token
  Skip to next non whitespace token