From d840bc21258a7e22b7d66cd4ae08ef603b9ab903 Mon Sep 17 00:00:00 2001 From: Nathan Whitaker Date: Thu, 9 Jul 2020 12:54:51 -0400 Subject: [PATCH] Fix links in chalk book --- book/src/engine/major_concepts.md | 2 +- book/src/recursive/search_graph.md | 10 +++++----- book/src/recursive/stack.md | 6 +++--- 3 files changed, 9 insertions(+), 9 deletions(-) diff --git a/book/src/engine/major_concepts.md b/book/src/engine/major_concepts.md index 4a6ca2b2b34..4a4ea0895cf 100644 --- a/book/src/engine/major_concepts.md +++ b/book/src/engine/major_concepts.md @@ -80,7 +80,7 @@ goal. Instead, the may want a *unique* solution to this goal. Indeed, when we solve for a given root [`Goal`], we return a since [`Solution`]. It is up to the implementation of [`Context`] to decide how a `Solution` is made, given a possibly infinite set of answers. One of example of this is the -[`AntiUnifier`](https://rust-lang.github.io/chalk/chalk_solve/solve/slg/aggregate/struct.AntiUnifier.html) +[`AntiUnifier`](https://rust-lang.github.io/chalk/chalk_engine/slg/aggregate/struct.AntiUnifier.html) from `chalk-solve`, which finds a minimal generalization of answers which don't unify. (For the example above, it would return only `Ambiguous`, since `A` and `B` can't unify.) diff --git a/book/src/recursive/search_graph.md b/book/src/recursive/search_graph.md index 6e8fd8cd108..6d48032ccda 100644 --- a/book/src/recursive/search_graph.md +++ b/book/src/recursive/search_graph.md @@ -7,10 +7,10 @@ actually implement this? That's where the [`SearchGraph`] comes into play. [cycles]: ./inductive_cycles.md [coinduction]: ./coinduction.md [stack]: ./stack.md -[`SearchGraph`]: http://rust-lang.github.io/chalk/chalk_solve/recursive/search_graph/struct.SearchGraph.html -[`DepthFirstNumber`]: http://rust-lang.github.io/chalk/chalk_solve/recursive/search_graph/struct.DepthFirstNumber.html -[`Node`]: http://rust-lang.github.io/chalk/chalk_solve/recursive/search_graph/struct.Node.html -[`stack_depth`]: http://rust-lang.github.io/chalk/chalk_solve/recursive/search_graph/struct.Node.html#structfield.stack_depth +[`SearchGraph`]: http://rust-lang.github.io/chalk/chalk_recursive/search_graph/struct.SearchGraph.html +[`DepthFirstNumber`]: http://rust-lang.github.io/chalk/chalk_recursive/search_graph/struct.DepthFirstNumber.html +[`Node`]: http://rust-lang.github.io/chalk/chalk_recursive/search_graph/struct.Node.html +[`stack_depth`]: http://rust-lang.github.io/chalk/chalk_recursive/search_graph/struct.Node.html#structfield.stack_depth The role of the [`SearchGraph`] is to store information about each goal that we 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 on the stack, then we update the current [`Minimums`] with the values stored in the search graph. -[`Minimums`]: http://rust-lang.github.io/chalk/chalk_solve/recursive/lib/struct.Minimums.html +[`Minimums`]: http://rust-lang.github.io/chalk/chalk_recursive/struct.Minimums.html ## Removing nodes from the graph diff --git a/book/src/recursive/stack.md b/book/src/recursive/stack.md index 46f8f134615..6d9ad950000 100644 --- a/book/src/recursive/stack.md +++ b/book/src/recursive/stack.md @@ -5,13 +5,13 @@ what it sounds like: a stack that stores each thing that the recursive solver is solving. Initially, it contains only one item, the root goal that was given by the user. -[`Stack`]: http://rust-lang.github.io/chalk/chalk_engine/stack/struct.Stack.html +[`Stack`]: http://rust-lang.github.io/chalk/chalk_recursive/stack/struct.Stack.html Each frame on the stack has an associated [`StackDepth`], which is basically an index that increases (so 0 is the top of the stack, 1 is the next thing pushed, etc). -[`StackDepth`]: http://rust-lang.github.io/chalk/chalk_solve/recursive/stack/struct.StackDepth.html +[`StackDepth`]: http://rust-lang.github.io/chalk/chalk_recursive/stack/struct.StackDepth.html ## How the recursive solver works at the highest level @@ -74,4 +74,4 @@ detect a cycle by checking in the [search graph] to see whether G has an associa to learn more about that). [search graph]: ./search_graph.md -[`cycle`]: http://rust-lang.github.io/chalk/chalk_solve/recursive/stack/struct.StackEntry.html#structfield.cycle \ No newline at end of file +[`cycle`]: http://rust-lang.github.io/chalk/chalk_recursive/stack/struct.StackEntry.html#structfield.cycle \ No newline at end of file