We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent d87db8e commit f33936cCopy full SHA for f33936c
compiler/rustc_trait_selection/src/traits/vtable.rs
@@ -92,7 +92,7 @@ fn prepare_vtable_segments_inner<'tcx, T>(
92
93
// the main traversal loop:
94
// basically we want to cut the inheritance directed graph into a few non-overlapping slices of nodes
95
- // that each node is emitted after all its descendents have been emitted.
+ // such that each node is emitted after all its descendants have been emitted.
96
// so we convert the directed graph into a tree by skipping all previously visited nodes using a visited set.
97
// this is done on the fly.
98
// Each loop run emits a slice - it starts by find a "childless" unvisited node, backtracking upwards, and it
0 commit comments