☰
In difft::diff::dijkstra
Structs
ExceededGraphLimit
Functions
edge_between
mark_syntax
node_count
shortest_path
shortest_path_with_edges
shortest_vertex_path
tree_count
?
Function
difft
::
diff
::
dijkstra
::
tree_count
source
·
[
−
]
fn tree_count(root:
Option
<&
Syntax
<'_>>) ->
u32
Expand description
How many top-level AST nodes do we have?