Skip to content

Commit

Permalink
Consistently spell "n-D" as "nD".
Browse files Browse the repository at this point in the history
  • Loading branch information
dan-zheng committed Jan 9, 2021
1 parent f521e30 commit 1288790
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions examples/tutorial.dx
Original file line number Diff line number Diff line change
Expand Up @@ -126,7 +126,7 @@ x4 = for i:(Fin 5). for j:(Fin 10). (ordinal i) + (ordinal j)

' Many algorithms in Dex come down to being able to pack and unpack these
indices. For example, we have seen that it is easy to sum over one dimension
of a 2-D array. However, if we have a 1D array indexed by a pair, we can
of a 2D array. However, if we have a 1D array indexed by a pair, we can
easily turn it into a 2D array using two `for` constructors.

x3 = for i. for j. x2.(i, j)
Expand Down Expand Up @@ -483,4 +483,4 @@ prob1 = for i : (Fin 1000).
-- Nothing -> mempty

-- def remMaybe (x: n => Maybe a) : List a =
-- concat $ for i. maybeList x.i
-- concat $ for i. maybeList x.i

0 comments on commit 1288790

Please sign in to comment.