diff options
| author | Maybe Waffle <waffle.lapkin@gmail.com> | 2023-07-19 11:40:51 +0000 |
|---|---|---|
| committer | Maybe Waffle <waffle.lapkin@gmail.com> | 2023-07-19 11:53:41 +0000 |
| commit | f33936c567829d024a829f25c40b1e6dca9c75c6 (patch) | |
| tree | 0afb07f25a69f39a41007c6c9c76c4b34aed1b03 /compiler/rustc_trait_selection/src/traits/vtable.rs | |
| parent | d87db8eb3f470d5cc8901dd74f6a25685511161a (diff) | |
| download | rust-f33936c567829d024a829f25c40b1e6dca9c75c6.tar.gz rust-f33936c567829d024a829f25c40b1e6dca9c75c6.zip | |
Fix comment
Diffstat (limited to 'compiler/rustc_trait_selection/src/traits/vtable.rs')
| -rw-r--r-- | compiler/rustc_trait_selection/src/traits/vtable.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/rustc_trait_selection/src/traits/vtable.rs b/compiler/rustc_trait_selection/src/traits/vtable.rs index 3a647b784cc..13ece4ccebb 100644 --- a/compiler/rustc_trait_selection/src/traits/vtable.rs +++ b/compiler/rustc_trait_selection/src/traits/vtable.rs @@ -92,7 +92,7 @@ fn prepare_vtable_segments_inner<'tcx, T>( // the main traversal loop: // basically we want to cut the inheritance directed graph into a few non-overlapping slices of nodes - // 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. // so we convert the directed graph into a tree by skipping all previously visited nodes using a visited set. // this is done on the fly. // Each loop run emits a slice - it starts by find a "childless" unvisited node, backtracking upwards, and it |