We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent e83eacd commit 0c75c08Copy full SHA for 0c75c08
compiler/rustc_type_ir/src/search_graph/mod.rs
@@ -118,6 +118,11 @@ impl UsageKind {
118
}
119
120
121
+enum StepResult<X: Cx> {
122
+ Done(StackEntry<X>, X::Result),
123
+ HasChanged,
124
+}
125
+
126
#[derive(Debug, Clone, Copy)]
127
struct AvailableDepth(usize);
128
impl AvailableDepth {
@@ -559,14 +564,7 @@ impl<D: Delegate<Cx = X>, X: Cx> SearchGraph<D> {
559
564
)
560
565
})
561
566
562
-}
563
567
-enum StepResult<X: Cx> {
- Done(StackEntry<X>, X::Result),
- HasChanged,
568
-
569
-impl<D: Delegate<Cx = X>, X: Cx> SearchGraph<D> {
570
/// When we encounter a coinductive cycle, we have to fetch the
571
/// result of that cycle while we are still computing it. Because
572
/// of this we continuously recompute the cycle until the result
0 commit comments