Links and editing for reshape doc

1 files changed, 16 insertions, 12 deletions

diff --git a/doc/reshape.md b/doc/reshape.md
index 4be0c608..f0bddc50 100644
--- a/doc/reshape.md
+++ b/doc/reshape.md
@@ -38,7 +38,7 @@ bp ← ⥊⌽(20×1.5‿¯1) (+⌾⊑ ≍ -⊸≍∘⊣)˘ 29‿21-⊸≍⊸+⍉
 
 The glyph `⥊` indicates BQN's facilities to reflow the data in an array, giving it a different shape. Its monadic form, Deshape, simply removes all shape information, returning a list of all the elements from the array in reading order. With a left argument, `⥊` is called Reshape and is a more versatile tool for rearranging the data in an array into the desired shape.
 
-Because of its dependence on the reading order of an array, Reshape is less fundamental than other array operations. Using Reshape in the central computations of a program can be a sign of imperfect usage of arrays. For example, it may be useful to use Reshape to create a constant array or repeat a sequence of values several times, but the same task might also be accomplished more simply with Table `⌜`, or by taking advantage of leading axis agreement in arithmetic primitives.
+Because of its dependence on the reading order of an array, Reshape is less fundamental than other array operations. Using Reshape in the central computations of a program can be a sign of imperfect usage of arrays. For example, it may be useful to use Reshape to create a constant array or repeat a sequence of values several times, but the same task might also be accomplished more simply with [Table](map.md#table) `⌜`, or by taking advantage of [leading axis agreement](leading.md#leading-axis-agreement) in arithmetic primitives.
 
 ## Deshape
 
@@ -48,7 +48,7 @@ The result of Deshape is a list containing the same elements as the argument.
 
         ⥊ a
 
-The elements are ordered in reading order—left to right, then top to bottom. This means that leading axes "matter more" for ordering: if one element comes earlier in the first axis but later in the second than some other element, it will come first in the result. In another view, elements are ordered according to their [indices](indices.md). In other words, deshaping the array of indices for an array will always give a sorted array.
+The elements are ordered in reading order—left to right, then top to bottom. This means that leading axes "matter more" for ordering: if one element comes earlier in the first axis but later in the second than some other element, it will come first in the result. In another view, elements are ordered according to their [indices](indices.md). In other words, deshaping the array of indices for an array will always give a [sorted](order.md) array.
 
         ↕≢a
 
@@ -56,7 +56,7 @@ The elements are ordered in reading order—left to right, then top to bottom. T
 
 This ordering is also known as *row-major* order.
 
-Deshape turns a unit argument into a single-element list, automatically enclosing it if it's an atom. However, if you know the argument is a unit, a more principled way to turn it into a list is to apply [Solo](couple.md) (`≍`), which adds a length-1 axis before any other axes. If you ever add axes to the data format, Solo is more likely to continue working after this transition, unless there's a reason the result should always be a list.
+Deshape turns a unit argument into a single-element list, automatically [enclosing](enclose.md) it if it's an atom. However, if you know `𝕩` is a unit, a more principled way to turn it into a list is to apply [Solo](couple.md) (`≍`), which adds a length-1 axis before any other axes. If you ever add axes to the data format, Solo is more likely to continue working after this transition, unless there's a reason the result should always be a list.
 
         ⥊ 2
         ≍ 2
@@ -69,7 +69,7 @@ The left argument of Reshape gives the shape of the result, except that one entr
 
 ### Matching lengths
 
-If the number of elements implied by this shape—that is, `×´𝕨`—is equal to the number of elements in the argument, then the argument is simply rearranged to match that shape. The element list is kept the same, so that the deshaped result matches the deshaped argument.
+If the number of elements implied by the given shape—that is, `×´𝕨`—is equal to the number of elements in `𝕩`, then `𝕩` is simply rearranged to match that shape. The element list is kept the same, so that the deshaped result matches the deshaped right argument.
 
         a
 
@@ -77,24 +77,24 @@ If the number of elements implied by this shape—that is, `×´𝕨`—is equal
 
         (⥊a) ≡ ⥊ 6‿2⥊a
 
-One common usage is to generate an array with a specified shape that counts up from 0 in reading order. The idiomatic phrase to do this is `⥊⟜(↕×´)`, since it doesn't require writing the shape and its product separately.
+One common use is to generate an array with a specified shape that counts up from 0 in reading order, a reshaped [Range](range.md). The idiomatic phrase to do this is `⥊⟜(↕×´)`, since it doesn't require writing the shape and its product separately.
 
         2‿7 ⥊ ↕14
         ⥊⟜(↕×´) 2‿7
 
 ### Non-matching lengths
 
-If the left argument implies a smaller number of elements, then only the initial elements of the argument are used. Here the result stops at `237`, three-quarters of the way through `a`, because at that point the result is filled up.
+If `𝕨` implies a smaller number of elements than are present initially, then only the initial elements of `𝕩` are used. Here the result stops at `237`, three-quarters of the way through `a`, because at that point the result is filled up.
 
         3‿3 ⥊ a
 
-If the left argument implies a larger number of elements, then the argument elements are reused cyclically. Below, we reach the last element `247` and start over at `135`. If the array doesn't have any elements to start with, you'll get an error as there aren't any elements available.
+If `𝕨` implies a larger number of elements, then elements of `𝕩` are reused cyclically. Below, we reach the last element `247` and start over at `135`. If `𝕩` doesn't have any elements to start with, you'll get an error as there aren't any elements available.
 
         15 ⥊ a
 
         4 ⥊ ↕0
 
-Reshape is the idiomatic way to make an array filled with a constant value (that is, where all elements are the same). For an atom element, just reshape it directly; for an arbitrary element, first enclose it to create a unit, and then reshape it.
+Reshape is the idiomatic way to make an array filled with a constant value (that is, where all elements are the same) when you know what shape it should have. For an atom element, reshape it directly; for an arbitrary element, first [enclose](enclose.md) it to create a unit, and then reshape it.
 
         3‿4 ⥊ 0
 
@@ -102,11 +102,11 @@ Reshape is the idiomatic way to make an array filled with a constant value (that
 
 ### Computed lengths
 
-What if you want to reshape an array into, say, rows of length 2, but don't want to have to write out the number of rows?
+What if you want to reshape an array into, say, rows of length 2, but don't want to write out the number of rows?
 
         ∘‿2 ⥊ "aAeEiIoOuU"
 
-Above, the length given is `∘`, a special value that indicates that a length that fits the argument should be computed. In fact, BQN has four different special values that can be used. Every one works the same for a case like the above, where the rest of the shape divides the argument length evenly. They differ in how they handle uneven cases, where the required length would fall between two whole numbers.
+Above, the length given is `∘`, a special value that indicates that a length that fits the argument should be computed. In fact, Reshape has four different special values that can be used. Every one works the same for a case like the one above, where the rest of the shape divides the argument length evenly. They differ in how they handle uneven cases, where the required length would fall between two whole numbers.
 
 - `∘` says the length must be an exact fit, and gives an error in such a case.
 - `⌊` rounds the length down, so that some elements are discarded.
@@ -115,11 +115,14 @@ Above, the length given is `∘`, a special value that indicates that a length t
 
 These values are just BQN primitives of course. They're not called by Reshape or anything like that; the primitives are just chosen to suggest the corresponding functionality.
 
-Here's an example. If we try to turn five elements into two rows, `∘` gives an error, `⌊` drops the last element, `⌽` uses the first element again, and `↑` uses a fill element (like `5↑"abcde"` would).
+Here's an example of the four cases. If we try to turn five elements into two rows, `∘` gives an error, `⌊` drops the last element, `⌽` uses the first element again, and `↑` uses a fill element (like `6↑"abcde"` would).
 
         2‿∘ ⥊ "abcde"
+
         2‿⌊ ⥊ "abcde"
+
         2‿⌽ ⥊ "abcde"
+
         2‿↑ ⥊ "abcde"
 
 A computed length can be useful to input an array without using nested notation: for example, if you have a table with rows of three elements, you might write it as one long list, using `∘‿3⥊⟨…⟩` to get it back to the appropriate shape. `∘` is definitely the value to use here, as it will check that you haven't missed an element or something like that.
@@ -128,7 +131,8 @@ Computed Reshape might also be used in actual data processing: for example, to s
 
         +´˘ ↑‿4 ⥊ ⟨0,2,1,1, 5,9,6,4, 3,3,3,3, 9,7⟩
 
-Computed Reshape can even be used with structural Under. Only the `∘` case really makes sense, although `⌊`, which leaves trailing elements unchanged, could conceivably be useful. Below, we either split the argument into three groups and reverse their order or reverse it in groups of three.
+Computed Reshape can even be used with structural Under. Only the `∘` case really makes sense, although `⌊`, which leaves trailing elements unchanged, could conceivably be useful. Below, we split one argument into three groups and [reverse](reverse.md) their order, and reverse groups of three in another.
 
         ⌽⌾(3‿∘⊸⥊) ↕15
+
         ⌽⌾(∘‿3⊸⥊) "nolyricshere"