belisarius222

up 1: forward %ford, toward 0k

up: 1
authors: [~rovnys-ricfer(ted@tlon.io), ~pittyp-datfun(anton@tlon.io)]

overview

%ford is urbit's build system. It's one of the seven kernel modules (vanes)

belisarius222

::
::::  it's a trap!
  ::
!=
=/  a  3
|.
?:  =(a 5)
  a
$(a +(a))
::

belisarius222

UP3: Hoon Docs

author: Ted Blackman  ~rovnys-ricfer  ted@tlon.io

Overview

As anyone who's worked with the language can tell you, the overall levels of sanity and practicality in hoon are actually quite high. So why is it so hard to learn?

belisarius222

::   :-  :*  title+"urbit-flavored markdown docs"
::           author+"ted blackman"
::           date+~2017.8.25
::       ==
::  
;>

# udon: urbit-flavored markdown

## overview

belisarius222

set nocompatible

set encoding=utf-8
let mapleader = " "

" Vundle stuff
filetype off
set rtp+=~/.vim/bundle/Vundle.vim
call vundle#begin()
Plugin 'gmarik/Vundle.vim'

belisarius222

Title: Urbit Fleet Tests Author: Ted Blackman ~rovnys-ricfer ted@tlon.io Created: ~2017.12.14

Overview

After a month of labor, Tlon gave birth to a new continuity era, which came out kicking and screaming, covered in amniotic fluid. A slew of issues rapidly appeared in the wild. We'd tested the functionality of the new features, but we hadn't stress-tested them. Some bugs, like herpes, only manifest when the system is under stress.

We need a way to perform automated testing on a fleet of Urbits. We'll want to crank up the load to arbitrary severity while retaining the ability to measure results -- crucially, we want to improve our sleep quality by testing loads much worse than the live network.

belisarius222

/?  310
::
::  models
::
|%
+=  move  (pair bone card)
+=  card  [%wait wire p=@da]
--
::
::  main app door

belisarius222

/?  310
::
|_  [delta=@dr message=@t]
++  grab
  |%
  +=  noun  [delta=@dr message=@t]
  --
--

belisarius222

Ford rebuild algorithm

Steps

1. Ford receives a ++sign from Clay containing the ++care of new revisions of some files we subscribed to on a ++path.
2. Ford does a bi-jug lookup of the changed dependencies in its state's deps, which will return a set of ++build-indices whose builds they refer to may need to get rebuilt.
3. For each of those build indices, Ford calls ++build-up.

belisarius222

A noun is an atom or a cell.  An atom is a natural number.  A cell is an ordered pair of nouns.

Reduce by the first matching pattern; variables match any noun.

nock(a)             *a
[a b c]             [a [b c]]

?[a b]              0
?a                  1
+[a b]              +[a b]