Skip to content

Commit c12b5b5

Browse files
committed
Fix broken book links
1 parent 735961e commit c12b5b5

File tree

2 files changed

+8
-8
lines changed

2 files changed

+8
-8
lines changed

book/src/recursive/search_graph.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -7,10 +7,10 @@ actually implement this? That's where the [`SearchGraph`] comes into play.
77
[cycles]: ./inductive_cycles.md
88
[coinduction]: ./coinduction.md
99
[stack]: ./stack.md
10-
[`SearchGraph`]: https://rust-lang.github.io/chalk/chalk_recursive/search_graph/struct.SearchGraph.html
11-
[`DepthFirstNumber`]: https://rust-lang.github.io/chalk/chalk_recursive/search_graph/struct.DepthFirstNumber.html
12-
[`Node`]: https://rust-lang.github.io/chalk/chalk_recursive/search_graph/struct.Node.html
13-
[`stack_depth`]: https://rust-lang.github.io/chalk/chalk_recursive/search_graph/struct.Node.html#structfield.stack_depth
10+
[`SearchGraph`]: https://rust-lang.github.io/chalk/chalk_recursive/fixed_point/search_graph/struct.SearchGraph.html
11+
[`DepthFirstNumber`]: https://rust-lang.github.io/chalk/chalk_recursive/fixed_point/search_graph/struct.DepthFirstNumber.html
12+
[`Node`]: https://rust-lang.github.io/chalk/chalk_recursive/fixed_point/search_graph/struct.Node.html
13+
[`stack_depth`]: https://rust-lang.github.io/chalk/chalk_recursive/fixed_point/search_graph/struct.Node.html#structfield.stack_depth
1414

1515
The role of the [`SearchGraph`] is to store information about each goal that we
1616
are currently solving. Typically, these are goals on the stack -- but other
@@ -183,7 +183,7 @@ recursively invoking some goal G2 that is in the search graph but *not* present
183183
on the stack, then we update the current [`Minimums`] with the values stored in
184184
the search graph.
185185

186-
[`Minimums`]: https://rust-lang.github.io/chalk/chalk_recursive/struct.Minimums.html
186+
[`Minimums`]: https://rust-lang.github.io/chalk/chalk_recursive/fixed_point/struct.Minimums.html
187187

188188
## Removing nodes from the graph
189189

book/src/recursive/stack.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -5,13 +5,13 @@ what it sounds like: a stack that stores each thing that the recursive solver is
55
solving. Initially, it contains only one item, the root goal that was given by
66
the user.
77

8-
[`Stack`]: https://rust-lang.github.io/chalk/chalk_recursive/stack/struct.Stack.html
8+
[`Stack`]: https://rust-lang.github.io/chalk/chalk_recursive/fixed_point/stack/struct.Stack.html
99

1010
Each frame on the stack has an associated [`StackDepth`], which is basically an
1111
index that increases (so 0 is the top of the stack, 1 is the next thing pushed,
1212
etc).
1313

14-
[`StackDepth`]: https://rust-lang.github.io/chalk/chalk_recursive/stack/struct.StackDepth.html
14+
[`StackDepth`]: https://rust-lang.github.io/chalk/chalk_recursive/fixed_point/stack/struct.StackDepth.html
1515

1616
## How the recursive solver works at the highest level
1717

@@ -74,4 +74,4 @@ detect a cycle by checking in the [search graph] to see whether G has an associa
7474
to learn more about that).
7575

7676
[search graph]: ./search_graph.md
77-
[`cycle`]: https://rust-lang.github.io/chalk/chalk_recursive/stack/struct.StackEntry.html#structfield.cycle
77+
[`cycle`]: https://rust-lang.github.io/chalk/chalk_recursive/fixed_point/stack/struct.StackEntry.html#structfield.cycle

0 commit comments

Comments
 (0)