7db69b0 · urbit.org · git.iko.soy

tutorials/arvo/ford.md+1−1

compare with master

unifiedsplit

@@ -393,7 +393,7 @@ Example:

393

394produces a value of type `(map term cord)`, where each key is the basename (the

395filename without the prefix), and each value is the result of running the

396−contents of the file through the `%hoon` mark, which validates that it's valid

396+contents of the file through the `%hoon` mark, which validates the

397hoon code and returns it unmodified. So, the resulting map associates basenames

398with file contents.

399

tutorials/hoon/bank-account.md+1−1

@@ -67,7 +67,7 @@ In this code above, we're going to compose two runes using `=<`, which has inver

67--

68```

69

70−We've chosen here to wrap our door in it's own core to emulate the style of programming that is used when creating libraries. `new-account` is the name of our door. Recall that a door is a core with one or more arms that has a sample. Here, our door has a sample of one `@ud` with the face `balance` and two arms, `deposit` and `withdraw`.

70+We've chosen here to wrap our door in its own core to emulate the style of programming that is used when creating libraries. `new-account` is the name of our door. Recall that a door is a core with one or more arms that has a sample. Here, our door has a sample of one `@ud` with the face `balance` and two arms, `deposit` and `withdraw`.

71

72Each of these arms produces a gate which takes an `@ud` argument. Each of these gates has a similar bit of code inside:

73

tutorials/hoon/molds.md+1−1

@@ -32,7 +32,7 @@ Here is a very simple mold builder. It takes two molds and produces a mold that

32 |$ [item]

33 $@(~ [i=item t=(list item)])

34```

35−Here is a mold builder you've used previously. `$@` is a rune that will match the first thing if it's sample is an atom and the second if the sample is a cell. You should be familiar at this point that a `list` is either `~` or a pair of an item and a list of item.

35+Here is a mold builder you've used previously. `$@` is a rune that will match the first thing if its sample is an atom and the second if the sample is a cell. You should be familiar at this point that a `list` is either `~` or a pair of an item and a list of item.

36

37

38```hoon

tutorials/hoon/recursion.md+1−1

@@ -137,7 +137,7 @@ $(n (dec n), t (mul t n))

137

138The above code should look familiar. We are still building a gate that

139takes one argument `n`. This time, however, we are also putting a face on a

140−`@ud` and setting it's initial value to 1. The `|-` here is used to create a new

140+`@ud` and setting its initial value to 1. The `|-` here is used to create a new

141gate with one arm `$` and immediately call it. Think of `|-` as the recursion

142point.

143

tutorials/hoon/workbook/traffic-light.md+1−1

@@ -129,7 +129,7 @@ a new core in the gate, so we have to then assign that back to the face `a`.

129```

130

131Here we simply are creating a new cell that has the `current-state` from `a` as

132−it's head and the `current-state` from `b` as it's tail.

132+its head and the `current-state` from `b` as its tail.

133

134Let's run it in the Dojo to get our product:

135

tutorials/nock/implementations.md+1−1

@@ -1379,7 +1379,7 @@ From [Joe Bryan](https://github.com/joemfb/nock.js/blob/master/nock.js):

1379 }

1380

1381 /**

1382− * invoke (9): construct a core and evaluate one of it's arms against it

1382+ * invoke (9): construct a core and evaluate one of its arms against it

1383 *

1384 * *[a 9 b c] *[a 7 c 2 [0 1] 0 b]

1385 */