git.iko.soy/urbit.org
on master help sign in
Set anchors to appear to the right for all tutorials

- except _index.md files

commit3bce308821cb1c1af3236b949cfe529d0efc5482 authorYaseen <yaseen.nvt@gmail.com> dateThu 21 Jan 2021, 15:10 (6 years ago) parent40a5e4a
62 files changed+62−62
compare with master
unifiedsplit
tutorials/arvo/ames.md+1−1 tutorials/arvo/arvo.md+1−1 tutorials/arvo/behn.md+1−1 tutorials/arvo/clay.md+1−1 tutorials/arvo/dill.md+1−1 tutorials/arvo/eyre.md+1−1 tutorials/arvo/ford.md+1−1 tutorials/arvo/gall.md+1−1 tutorials/arvo/move-trace.md+1−1 tutorials/concepts/arch.md+1−1 tutorials/concepts/azimuth.md+1−1 tutorials/concepts/technical-overview.md+1−1 tutorials/creating-an-invite-pool.md+1−1 tutorials/guide-to-breaches.md+1−1 tutorials/hoon/cli-tutorial.md+1−1 tutorials/hoon/graph.md+1−1 tutorials/hoon/hoon-errors.md+1−1 tutorials/hoon/hoon-school/ackermann.md+1−1 tutorials/hoon/hoon-school/aqua.md+1−1 tutorials/hoon/hoon-school/arms-and-cores.md+1−1 tutorials/hoon/hoon-school/atoms-auras-and-simple-cell-types.md+1−1 tutorials/hoon/hoon-school/bank-account.md+1−1 tutorials/hoon/hoon-school/behn.md+1−1 tutorials/hoon/hoon-school/caesar.md+1−1 tutorials/hoon/hoon-school/conditionals.md+1−1 tutorials/hoon/hoon-school/doors.md+1−1 tutorials/hoon/hoon-school/egg-timer.md+1−1 tutorials/hoon/hoon-school/fibonacci.md+1−1 tutorials/hoon/hoon-school/gall.md+1−1 tutorials/hoon/hoon-school/gates.md+1−1 tutorials/hoon/hoon-school/generators.md+1−1 tutorials/hoon/hoon-school/hoon-syntax.md+1−1 tutorials/hoon/hoon-school/iron-polymorphism.md+1−1 tutorials/hoon/hoon-school/lead-polymorphism.md+1−1 tutorials/hoon/hoon-school/libraries.md+1−1 tutorials/hoon/hoon-school/list-of-numbers.md+1−1 tutorials/hoon/hoon-school/lists.md+1−1 tutorials/hoon/hoon-school/molds.md+1−1 tutorials/hoon/hoon-school/nouns.md+1−1 tutorials/hoon/hoon-school/recursion.md+1−1 tutorials/hoon/hoon-school/setup.md+1−1 tutorials/hoon/hoon-school/structures-and-complex-types.md+1−1 tutorials/hoon/hoon-school/style.md+1−1 tutorials/hoon/hoon-school/the-subject-and-its-legs.md+1−1 tutorials/hoon/hoon-school/trees-sets-and-maps.md+1−1 tutorials/hoon/hoon-school/type-checking-and-type-inference.md+1−1 tutorials/hoon/hoon-school/type-polymorphism.md+1−1 tutorials/hoon/parsing.md+1−1 tutorials/hoon/workbook/bomb.md+1−1 tutorials/hoon/workbook/digits.md+1−1 tutorials/hoon/workbook/eightball.md+1−1 tutorials/hoon/workbook/traffic-light.md+1−1 tutorials/nock/definition.md+1−1 tutorials/nock/example.md+1−1 tutorials/nock/explanation.md+1−1 tutorials/nock/implementations.md+1−1 tutorials/ship-troubleshooting.md+1−1 tutorials/vere/api.md+1−1 tutorials/vere/c.md+1−1 tutorials/vere/jetting.md+1−1 tutorials/vere/nouns.md+1−1 tutorials/vere/runtime.md+1−1
tutorials/arvo/ames.md+1−1
@@ -3,7 +3,7 @@ title = "Ames"
33weight = 2
44template = "doc.html"
55aliases = ["/docs/learn/arvo/ames/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Our networking protocol.
99
tutorials/arvo/arvo.md+1−1
@@ -3,7 +3,7 @@ title = "Arvo"
33weight = 1
44template = "doc.html"
55aliases = ["/docs/learn/arvo/arvo/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Arvo, also called Urbit OS, is our operating system.
tutorials/arvo/behn.md+1−1
@@ -2,7 +2,7 @@
22title = "Behn"
33weight = 3
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77Our simple timer.
88
tutorials/arvo/clay.md+1−1
@@ -3,7 +3,7 @@ title = "Clay"
33weight = 4
44template = "doc.html"
55aliases = ["/docs/learn/arvo/clay/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99
tutorials/arvo/dill.md+1−1
@@ -3,7 +3,7 @@ title = "Dill"
33weight = 5
44template = "doc.html"
55aliases = ["/docs/learn/arvo/dill/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Our terminal driver.
99
tutorials/arvo/eyre.md+1−1
@@ -3,7 +3,7 @@ title = "Eyre"
33weight = 6
44template = "doc.html"
55aliases = ["/docs/learn/arvo/eyre/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99*Current docs on Eyre are out of date. Until they are updated this doc remains for historical purposes*
tutorials/arvo/ford.md+1−1
@@ -3,7 +3,7 @@ title = "Ford Fusion"
33weight = 7
44template = "doc.html"
55aliases = ["/docs/learn/arvo/ford/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99> This document is out of date as of 2020.07.20. In the meantime, see the [blog
tutorials/arvo/gall.md+1−1
@@ -3,7 +3,7 @@ title = "Gall Apps"
33weight = 8
44template = "doc.html"
55aliases = ["/docs/learn/arvo/gall/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99This document describes Gall, the Arvo userspace vane. It is split into two main
tutorials/arvo/move-trace.md+1−1
@@ -2,7 +2,7 @@
22title = "Move trace"
33weight = 12
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88In this tutorial we will run a simple "move trace" and use the output to get a
tutorials/concepts/arch.md+1−1
@@ -2,7 +2,7 @@
22title = "Landscape Architecture"
33weight = 4
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88# Landscape Architecture
tutorials/concepts/azimuth.md+1−1
@@ -3,7 +3,7 @@ title = "Azimuth"
33weight = 4
44template = "doc.html"
55aliases = ["/docs/learn/azimuth"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Azimuth is a general-purpose public-key infrastructure (PKI) on the Ethereum blockchain, used as a platform for _Urbit identities_. You need such an identity to use the Arvo network.
99
tutorials/concepts/technical-overview.md+1−1
@@ -3,7 +3,7 @@ title = "Technical overview"
33weight = 1
44template = "doc.html"
55aliases = ["/understanding-urbit/technical-overview"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Urbit is a clean-slate software stack designed to implement an encrypted P2P
tutorials/creating-an-invite-pool.md+1−1
@@ -2,7 +2,7 @@
22title = "Creating an Invite Pool"
33weight = 9
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88If you're a star owner, you have the ability to create **invite pools**. These invite pools let you give your friends a piece of the network in the form of planets. This document will give you an explanation of how to create an invite pool and how to share it with your friends using our tool [Bridge](https://bridge.urbit.org).
tutorials/guide-to-breaches.md+1−1
@@ -2,7 +2,7 @@
22title = "Guide to Breaches"
33weight = 10
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88An important concept on the [Ames](@/docs/tutorials/arvo/ames.md) network is that of continuity. Continuity refers to how ships remember the order of their own network messages and the network messages of others -- these messages are numbered, starting from zero. A _breach_ is when ships on the network agree to forget about this sequence and treat one or more ships like they are brand new.
tutorials/hoon/cli-tutorial.md+1−1
@@ -2,7 +2,7 @@
22title = "CLI apps"
33weight = 2
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88## Introduction
tutorials/hoon/graph.md+1−1
@@ -2,7 +2,7 @@
22title = "Graph Store"
33weight = 3
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88# What is Graph Store?
tutorials/hoon/hoon-errors.md+1−1
@@ -2,7 +2,7 @@
22title = "Hoon Errors"
33weight = 12
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88In this section we explore strategies for debugging and understanding what your
tutorials/hoon/hoon-school/ackermann.md+1−1
@@ -3,7 +3,7 @@ title = "1.6.1 Walkthrough: Ackermann Function"
33weight = 14
44template = "doc.html"
55aliases = ["docs/learn/hoon/hoon-tutorial/ackermann/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99The Ackermann function is one of the earliest examples of a function that is both totally computable -- meaning that it can be solved -- and not primitively recursive -- meaning it can not be rewritten in an iterative fashion.
tutorials/hoon/hoon-school/aqua.md+1−1
@@ -2,7 +2,7 @@
22title = "Writing Aqua Tests"
33weight = 37
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88# Concepts
tutorials/hoon/hoon-school/arms-and-cores.md+1−1
@@ -3,7 +3,7 @@ title = "1.7 Arms and Cores"
33weight = 15
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/arms-and-cores/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88The Hoon subject is a [noun](/docs/glossary/noun/). Each fragment of this [noun](/docs/glossary/noun/) is either an [arm](/docs/glossary/arm/) or a leg. In the previous lesson you learned what a leg is, and how to return legs of the subject by various means. In this lesson you'll learn what an [arm](/docs/glossary/arm/) is. Arms are a bit more complex than legs -- a full understanding of them requires a bit more background knowledge. Accordingly, in this lesson we must also introduce an important Hoon data structure: a '[core](/docs/glossary/core/)'.
99
tutorials/hoon/hoon-school/atoms-auras-and-simple-cell-types.md+1−1
@@ -3,7 +3,7 @@ title = "2.1 Atoms, Auras, and Simple Cell Types"
33weight = 24
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/atoms-auras-and-simple-cell-types/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Like most modern high-level programming languages, Hoon has a type system. Because Hoon is a functional programming language, its type system differs somewhat from those of non-functional languages. In the next few lessons we'll go over Hoon's type system and point out some of its distinctive features. Certain advanced topics (e.g. type [polymorphism](https://en.wikipedia.org/wiki/Polymorphism_%28computer_science%29)) won't be addressed until a later chapter.
99
tutorials/hoon/hoon-school/bank-account.md+1−1
@@ -3,7 +3,7 @@ title = "1.8.1 Bank Account"
33weight = 17
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/bank-account/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99In this lesson, we will write a [door](/docs/glossary/door/) that can act as a bank account with the ability to withdraw, deposit, and check the account's balance.
tutorials/hoon/hoon-school/behn.md+1−1
@@ -2,7 +2,7 @@
22title = "2.6 Behn"
33weight = 34
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88In this lesson we introduce the notion of a vane, which should be thought of as a kernel module for Arvo (if you don't know what that means yet, just keep reading). We first present a primer on what vanes are and how they communicate, followed by an examination of the simplest vane, known as Behn (pronounced like "bane"), which is Arvo's timekeeper.
tutorials/hoon/hoon-school/caesar.md+1−1
@@ -3,7 +3,7 @@ title = "1.7.1 Walkthrough: Caesar Cipher"
33weight = 16
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/caesar/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99A Caesar cipher is a very simple way to obfuscate a message. The technique
tutorials/hoon/hoon-school/conditionals.md+1−1
@@ -3,7 +3,7 @@ title = "1.3.1 Walkthrough: Conditionals"
33weight = 5
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/conditionals/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99In this lesson, we will write a generator that takes an integer and checks if it is an even number between `1` and `100`. This will help demonstrate how boolean (`true` or `false`) conditional expressions work in Hoon.
tutorials/hoon/hoon-school/doors.md+1−1
@@ -3,7 +3,7 @@ title = "1.8 Doors"
33weight = 16
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/doors/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99It's useful to have [cores](/docs/glossary/core/) whose [arms](/docs/glossary/arm/) evaluate to make [gates](/docs/glossary/gate/). The use of such cores is common in Hoon; that's how the functions of the Hoon standard library are stored in the subject. Learning about such cores will also deepen the reader's understanding of Hoon semantics, and for that reason alone is worthwhile.
tutorials/hoon/hoon-school/egg-timer.md+1−1
@@ -3,7 +3,7 @@ title = "2.7.1 Gall Walkthrough: Egg Timer"
33weight = 36
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/egg-timer/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99The Arvo operating system is divided up into modules called vanes. Gall is the vane responsible for providing an API for building stateful applications in Urbit. Gall is a complex system that takes a lot of getting used to, so let's dip our toes in with a simple egg-timer app.
tutorials/hoon/hoon-school/fibonacci.md+1−1
@@ -3,7 +3,7 @@ title = "1.5.1 Walkthrough: Fibonacci Sequence"
33weight = 9
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/fibonacci/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99In this example, we will write a generator that produces a list of [Fibonacci numbers](https://en.wikipedia.org/wiki/Fibonacci_number) up to `n`.
tutorials/hoon/hoon-school/gall.md+1−1
@@ -3,7 +3,7 @@ title = "2.7 Gall"
33weight = 35
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/gall/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Gall is the Arvo vane responsible for handling user space applications. When writing a Gall application there are several things you will need to understand.
tutorials/hoon/hoon-school/gates.md+1−1
@@ -3,7 +3,7 @@ title = "1.4 Gates (Hoon Functions)"
33weight = 6
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/gates/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99In this lesson you're going to learn about Hoon functions.
tutorials/hoon/hoon-school/generators.md+1−1
@@ -3,7 +3,7 @@ title = "1.9 Generators"
33weight = 19
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/generators/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Generators are the most straightforward way to write programs for Urbit. They
tutorials/hoon/hoon-school/hoon-syntax.md+1−1
@@ -3,7 +3,7 @@ title = "1.3 Hoon Syntax"
33weight = 4
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/hoon-syntax/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99The study of Hoon can be divided into two parts: syntax and semantics.
tutorials/hoon/hoon-school/iron-polymorphism.md+1−1
@@ -3,7 +3,7 @@ title = "2.5.1 Walkthrough: Iron Polymorphism and Wet Polymorphism"
33weight = 32
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/iron-polymorphism/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Polymorphism is a programming concept that allows a a piece of code to use different types at different times. It's a common technique in most languages to make code that can be reused for many different situations, and Hoon is no exception. Let's take a look at a [gate](/docs/glossary/gate/) from the Hoon standard library as an example; we'll be passing a few different types in. The code below is an excerpt from `hoon.hoon` and, as such, will not run as-is by itself.
tutorials/hoon/hoon-school/lead-polymorphism.md+1−1
@@ -3,7 +3,7 @@ title = "2.5.2 Walkthrough: Lead Polymorphism"
33weight = 33
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/lead-polymorphism/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99There are four kinds of [cores](/docs/glossary/core/): gold, iron, zinc, and lead. You are able to use core-variance rules to create programs which take other programs as arguments. Which particular rules depends on which kind of core your program needs to complete.
tutorials/hoon/hoon-school/libraries.md+1−1
@@ -3,7 +3,7 @@ title = "2.3.1 Walkthrough: Libraries"
33weight = 28
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/libraries/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99In Hoon, like in other languages, it's often useful to create a library for other code to access. In this example, we look at one example of a library that can be used to represent a deck of 52 playing cards. The [core](/docs/glossary/core/) below builds such a library, and can be accessed by programs.
tutorials/hoon/hoon-school/list-of-numbers.md+1−1
@@ -3,7 +3,7 @@ title = "1.1.1 Walkthrough: List of Numbers"
33weight = 2
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/list-of-numbers/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99This code-example is intended to familiarize you with the basics of Hoon syntax. It's okay if you don't understand everything immediately; some concepts may be beyond your grasp for now. What's important is that you become accustomed to the elements of the code and their look once combined into a valid program.
tutorials/hoon/hoon-school/lists.md+1−1
@@ -3,7 +3,7 @@ title = "1.5 Lists"
33weight = 8
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/lists/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99A **list** is a type of [noun](/docs/glossary/noun/) that you'll frequently encounter when reading and writing Hoon. A list can be thought of as an ordered arrangement of zero or more elements terminated by a `~` (null).
tutorials/hoon/hoon-school/molds.md+1−1
@@ -3,7 +3,7 @@ title = "2.3.2 Molds"
33weight = 28
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/molds/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99A mold is an idempotent function that coerces a [noun](/docs/glossary/noun/) to
tutorials/hoon/hoon-school/nouns.md+1−1
@@ -3,7 +3,7 @@ title = "1.2 Nouns"
33weight = 3
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/nouns/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99In Urbit, every piece of data is a [noun](/docs/glossary/noun/). In order to understand Hoon, one must first understand nouns.
tutorials/hoon/hoon-school/recursion.md+1−1
@@ -3,7 +3,7 @@ title = "1.4.1 Walkthrough: Recursion"
33weight = 7
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/recursion/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99[Recursion](.) is a common pattern for solving certain problems in most programming
tutorials/hoon/hoon-school/setup.md+1−1
@@ -3,7 +3,7 @@ title = "1.1 Setup"
33weight = 1
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/setup/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Before we begin working on Hoon, you should first (1) have Urbit installed and (2) boot a ship that you can use for trying out Hoon examples. Interactive learning is far superior to passive reading.
tutorials/hoon/hoon-school/structures-and-complex-types.md+1−1
@@ -3,7 +3,7 @@ title = "2.3 Structures and Complex Types"
33weight = 27
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/structures-and-complex-types/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99In this lesson we'll talk a little about how type expressions become structures, and how these structures manifest in different ways in different parts of your Hoon code. We'll also talk about how to create your own custom-defined complex types from simpler ones.
tutorials/hoon/hoon-school/style.md+1−1
@@ -3,7 +3,7 @@ title = "Appendix: Hoon Style Guide"
33weight = 100
44template = "doc.html"
55aliases = ["docs/learn/hoon/style/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Welcome to the Hoon style guide. It’s important to familiarize yourself with our way of writing Hoon code.
tutorials/hoon/hoon-school/the-subject-and-its-legs.md+1−1
@@ -3,7 +3,7 @@ title = "1.6 The Subject and Its Legs"
33weight = 13
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/the-subject-and-its-legs/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Hoon isn't an object-oriented programming language; it's a "subject-oriented" programming language. But what's this "subject"?
tutorials/hoon/hoon-school/trees-sets-and-maps.md+1−1
@@ -3,7 +3,7 @@ title = "2.4 Standard Library: Trees, Sets, and Maps"
33weight = 30
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/trees-sets-and-maps/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Along with lists, the Hoon standard library also supports trees, sets, and maps as data structures. A Hoon `tree` is the data structure for a binary tree. A Hoon `set` is the data structure for a set of values. A Hoon `map` is the data structure for a set of `[key value]` pairs.
tutorials/hoon/hoon-school/type-checking-and-type-inference.md+1−1
@@ -3,7 +3,7 @@ title = "2.2 Type Checking and Type Inference"
33weight = 25
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/type-checking-and-type-inference/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99As the Hoon compiler compiles your Hoon code, it does a **type check** on certain expressions to make sure they are guaranteed to produce a value of the correct type. If it cannot be proved that the output value is correctly typed, the compile will fail with a `nest-fail` crash. In order to figure out what type of value is produced by a given expression, the compiler uses **type inference** on that code. In this lesson we'll cover various cases in which a type check is performed, and also how the compiler does type inference on an expression.
tutorials/hoon/hoon-school/type-polymorphism.md+1−1
@@ -3,7 +3,7 @@ title = "2.5 Type Polymorphism"
33weight = 31
44template = "doc.html"
55aliases = ["/docs/learn/hoon/hoon-tutorial/type-polymorphism/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99There are many cases in which one may want to write a function that accepts as input various different types of data. Such a function is said to be [polymorphic](https://en.wikipedia.org/wiki/Polymorphism_%28computer_science%29). ("Polymorphism" = "many forms"; so polymorphic functions accept many forms of data as input.)
tutorials/hoon/parsing.md+1−1
@@ -2,7 +2,7 @@
22title = "Parsing"
33weight = 3
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88# Parsing Tutorial
tutorials/hoon/workbook/bomb.md+1−1
@@ -3,7 +3,7 @@ title = "Bomb Defusing"
33weight = 7
44template = "doc.html"
55aliases = ["docs/learn/hoon/workbook/bomb"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88In this exercise, we will build a generator that takes a list of wires to be cut
99in order to defuse a bomb. The bomb is defused according to the following rules.
tutorials/hoon/workbook/digits.md+1−1
@@ -3,7 +3,7 @@ title = "Digits"
33weight = 4
44template = "doc.html"
55aliases = ["docs/learn/hoon/workbook/digits/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Let's write a generator that takes a `@ud` (unsigned decimal) and returns a list
99of its digits.
tutorials/hoon/workbook/eightball.md+1−1
@@ -3,7 +3,7 @@ title = "Magic 8-Ball"
33weight = 5
44template = "doc.html"
55aliases = ["docs/learn/hoon/workbook/eightball"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88In this lesson we'll write a generator that mimics the functionality of a
99Magic 8-Ball, producing a randomized response with each run.
tutorials/hoon/workbook/traffic-light.md+1−1
@@ -3,7 +3,7 @@ title = "Traffic Light"
33weight = 6
44template = "doc.html"
55aliases = ["docs/learn/hoon/workbook/traffic-light/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Let's create a state machine in Hoon that models the functionality of a traffic
99light. Save the code below as `traffic.hoon` in your `/gen` directory.
tutorials/nock/definition.md+1−1
@@ -3,7 +3,7 @@ title = "Nock Definition"
33weight = 1
44template = "doc.html"
55aliases = ["docs/learn/nock/definition/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Nock is a Turing-complete function that maps a cell
tutorials/nock/example.md+1−1
@@ -3,7 +3,7 @@ title = "Example"
33weight = 3
44template = "doc.html"
55aliases = ["docs/learn/nock/example"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Some people write assembly language by hand. Some of them have a
99good reason to do so. But there's no good reason to write Nock by
tutorials/nock/explanation.md+1−1
@@ -3,7 +3,7 @@ title = "Explanation"
33weight = 2
44template = "doc.html"
55aliases = ["docs/learn/nock/explanation"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99To make Nock make sense, let's work through the spec line by line.
tutorials/nock/implementations.md+1−1
@@ -2,7 +2,7 @@
22title = "Implementations"
33weight = 4
44template = "doc.html"
5−insert_anchor_links = "none"
5+insert_anchor_links = "right"
66+++
77
88We use a C implementation for our Nock interpreter. But building a Nock interpreter in another language is a fun exercise. Check out our community Nock implementations, shown below our official C implementation. (Note: the community implementations were written for a slightly older version of Nock, Nock 5K. The current version is Nock 4K.):
tutorials/ship-troubleshooting.md+1−1
@@ -3,7 +3,7 @@ title = "Ship Troubleshooting"
33weight = 8
44template = "doc.html"
55aliases = ["docs/using/ship-troubleshooting/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99Urbit is still in the development stage, so there's a chance that your ship won't start properly, or will stop working properly when you're running it. That's ok! This document is intended to help you in such an event.
tutorials/vere/api.md+1−1
@@ -3,7 +3,7 @@ title = "API overview by prefix"
33weight = 4
44template = "doc.html"
55aliases = ["/docs/learn/vere/api"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Let's run through the `u3` modules one by one. All public
99functions are commented, but the comments may be cryptic.
tutorials/vere/c.md+1−1
@@ -3,7 +3,7 @@ title = "C in Urbit"
33weight = 4
44template = "doc.html"
55aliases = ["/docs/learn/vere/c"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88Under `u3` is the simple `c3` layer, which is just how we write C
99in Urbit.
tutorials/vere/jetting.md+1−1
@@ -3,7 +3,7 @@ title = "Writing Jets"
33weight = 5
44template = "doc.html"
55aliases = ["/docs/learn/vere/jetting/"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88A guide for new Urbit developers.
99
tutorials/vere/nouns.md+1−1
@@ -3,7 +3,7 @@ title = "Land of Nouns"
33weight = 3
44template = "doc.html"
55aliases = ["/docs/learn/vere/nouns"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88The division between `c3` and `u3` is that you could theoretically
99imagine using `c3` as just a generic C environment. Anything to do
tutorials/vere/runtime.md+1−1
@@ -3,7 +3,7 @@ title = "C Runtime System"
33weight = 1
44template = "doc.html"
55aliases = ["docs/about/runtime/", "/docs/learn/vere/runtime"]
6−insert_anchor_links = "none"
6+insert_anchor_links = "right"
77+++
88
99The Urbit interpreter is built on a Nock runtime system written