Say "hello" 40 times to the place where you have tried salt at least once. - personal-pages/mirror-world

diff options

author	Aoi Koizumi <novaburst@kalli.st>	2022-03-18 17:19:55 -0300
committer	Aoi Koizumi <novaburst@kalli.st>	2022-03-18 17:19:55 -0300
commit	2ffad537e7dc4e6d70a0873518d4c6a09a5c92fd (patch)
tree	3119664e914e2b31604d79a9cce3482fd3d71e69 /gmi/7faed643.gmi
parent	7b10faf7494f396be6fe4131e1b562cc384f7c12 (diff)
download	mirror-world-2ffad537e7dc4e6d70a0873518d4c6a09a5c92fd.tar.gz

Say "hello" 40 times to the place where you have tried salt at least once.

Signed-off-by: Aoi Koizumi <novaburst@kalli.st>

Diffstat (limited to 'gmi/7faed643.gmi')

-rw-r--r--

gmi/7faed643.gmi

1 files changed, 78 insertions, 0 deletions

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd"> <html> <head> <meta http-equiv="content-type" content="text/html; charset=UTF-8"> <title>Mu - 064list.mu</title> <meta name="Generator" content="Vim/7.4"> <meta name="plugin-version" content="vim7.4_v2"> <meta name="syntax" content="none"> <meta name="settings" content="use_css,pre_wrap,no_foldcolumn,expand_tabs,prevent_copy="> <meta name="colorscheme" content="minimal"> <style type="text/css">  </style> <script type='text/javascript'>  </script> </head> <body> <pre id='vimCodeElement'> # A list links up multiple objects together to make them easier to manage. # # The objects must be of the same type. If you want to store multiple types in # a single list, use an exclusive-container. container list:_elem [ value:_elem next:&:list:_elem ] def push x:_elem, in:&:list:_elem -> result:&:list:_elem [ local-scope load-ingredients result <- new {(list _elem): type} *result <- merge x, in ] def first in:&:list:_elem -> result:_elem [ local-scope load-ingredients result <- get *in, value:offset ] def rest in:&:list:_elem -> result:&:list:_elem/contained-in:in [ local-scope load-ingredients result <- get *in, next:offset ] scenario list-handling [ run [ local-scope x:&:list:num <- push 3, 0 x <- push 4, x x <- push 5, x 10:num/raw <- first x x <- rest x 11:num/raw <- first x x <- rest x 12:num/raw <- first x 20:&:list:num/raw <- rest x ] memory-should-contain [ 10 <- 5 11 <- 4 12 <- 3 20 <- 0 # nothing left ] ] def length l:&:list:_elem -> result:num [ local-scope load-ingredients return-unless l, 0 rest:&:list:_elem <- rest l length-of-rest:num <- length rest result <- add length-of-rest, 1 ] # insert 'x' after 'in' def insert x:_elem, in:&:list:_elem -> in:&:list:_elem [ local-scope load-ingredients new-node:&:list:_elem <- new {(list _elem): type} *new-node <- put *new-node, value:offset, x next-node:&:list:_elem <- get *in, next:offset *in <- put *in, next:offset, new-node *new-node <- put *new-node, next:offset, next-node ] scenario inserting-into-list [ run [ local-scope list:&:list:char <- push 3, 0 list <- push 4, list list <- push 5, list list2:&:list:char <- rest list # inside list list2 <- insert 6, list2 # check structure list2 <- copy list 10:char/raw <- first list2 list2 <- rest list2 11:char/raw <- first list2 list2 <- rest list2 12:char/raw <- first list2 list2 <- rest list2 13:char/raw <- first list2 ] memory-should-contain [ 10 <- 5 # scanning next 11 <- 4 12 <- 6 # inserted element 13 <- 3 ] ] scenario inserting-at-end-of-list [ run [ local-scope list:&:list:char <- push 3, 0 list <- push 4, list list <- push 5, list list2:&:list:char <- rest list # inside list list2 <- rest list2 # now at end of list list2 <- insert 6, list2 # check structure like before list2 <- copy list 10:char/raw <- first list2 list2 <- rest list2 11:char/raw <- first list2 list2 <- rest list2 12:char/raw <- first list2 list2 <- rest list2 13:char/raw <- first list2 ] memory-should-contain [ 10 <- 5 # scanning next 11 <- 4 12 <- 3 13 <- 6 # inserted element ] ] scenario inserting-after-start-of-list [ run [ local-scope list:&:list:char <- push 3, 0 list <- push 4, list list <- push 5, list list <- insert 6, list # check structure like before list2:&:list:char <- copy list 10:char/raw <- first list2 list2 <- rest list2 11:char/raw <- first list2 list2 <- rest list2 12:char/raw <- first list2 list2 <- rest list2 13:char/raw <- first list2 ] memory-should-contain [ 10 <- 5 # scanning next 11 <- 6 # inserted element 12 <- 4 13 <- 3 ] ] # remove 'x' from its surrounding list 'in' # # Returns null if and only if list is empty. Beware: in that case any other # pointers to the head are now invalid. def remove x:&:list:_elem/contained-in:in, in:&:list:_elem -> in:&:list:_elem [ local-scope load-ingredients # if 'x' is null, return return-unless x next-node:&:list:_elem <- rest x # clear next pointer of 'x' *x <- put *x, next:offset, 0 # if 'x' is at the head of 'in', return the new head at-head?:bool <- equal x, in return-if at-head?, next-node # compute prev-node prev-node:&:list:_elem <- copy in curr:&:list:_elem <- rest prev-node { return-unless curr found?:bool <- equal curr, x break-if found? prev-node <- copy curr curr <- rest curr } # set its next pointer to skip 'x' *prev-node <- put *prev-node, next:offset, next-node ] scenario removing-from-list [ run [ local-scope list:&:list:char <- push 3, 0 list <- push 4, list list <- push 5, list list2:&:list:char <- rest list # second element list <- remove list2, list 10:bool/raw <- equal list2, 0 # check structure like before list2 <- copy list 11:char/raw <- first list2 list2 <- rest list2 12:char/raw <- first list2 20:&:list:char/raw <- rest list2 ] memory-should-contain [ 10 <- 0 # remove returned non-null 11 <- 5 # scanning next, skipping deleted element 12 <- 3 20 <- 0 # no more elements ] ] scenario removing-from-start-of-list [ run [ local-scope list:&:list:char <- push 3, 0 list <- push 4, list list <- push 5, list list <- remove list, list # check structure like before list2:&:list:char <- copy list 10:char/raw <- first list2 list2 <- rest list2 11:char/raw <- first list2 20:&:list:char/raw <- rest list2 ] memory-should-contain [ 10 <- 4 # scanning next, skipping deleted element 11 <- 3 20 <- 0 # no more elements ] ] scenario removing-from-end-of-list [ run [ local-scope list:&:list:char <- push 3, 0 list <- push 4, list list <- push 5, list # delete last element list2:&:list:char <- rest list list2 <- rest list2 list <- remove list2, list 10:bool/raw <- equal list2, 0 # check structure like before list2 <- copy list 11:char/raw <- first list2 list2 <- rest list2 12:char/raw <- first list2 20:&:list:char/raw <- rest list2 ] memory-should-contain [ 10 <- 0 # remove returned non-null 11 <- 5 # scanning next, skipping deleted element 12 <- 4 20 <- 0 # no more elements ] ] scenario removing-from-singleton-list [ run [ local-scope list:&:list:char <- push 3, 0 list <- remove list, list 1:num/raw <- copy list ] memory-should-contain [ 1 <- 0 # back to an empty list ] ] # reverse the elements of a list # (contributed by Caleb Couch) def reverse list:&:list:_elem temp:&:list:_elem -> result:&:list:_elem [ local-scope load-ingredients reply-unless list, temp object:_elem <- first, list list <- rest list temp <- push object, temp result <- reverse list, temp ] scenario reverse-list [ run [ local-scope list:&:list:number <- push 1, 0 list <- push 2, list list <- push 3, list stash [list:], list list <- reverse list, 0 stash [reversed:], list ] trace-should-contain [ app: list: 3 -> 2 -> 1 app: reversed: 1 -> 2 -> 3 ] ] def to-text in:&:list:_elem -> result:text [ local-scope load-ingredients buf:&:buffer <- new-buffer 80 buf <- to-buffer in, buf result <- buffer-to-array buf ] # variant of 'to-text' which stops printing after a few elements (and so is robust to cycles) def to-text-line in:&:list:_elem -> result:text [ local-scope load-ingredients buf:&:buffer <- new-buffer 80 buf <- to-buffer in, buf, 6 # max elements to display result <- buffer-to-array buf ] def to-buffer in:&:list:_elem, buf:&:buffer -> buf:&:buffer [ local-scope load-ingredients { break-if in buf <- append buf, 48/0 return } # append in.value to buf val:_elem <- get *in, value:offset buf <- append buf, val # now prepare next next:&:list:_elem <- rest in nextn:num <- copy next return-unless next buf <- append buf, [ -> ] # and recurse remaining:num, optional-ingredient-found?:bool <- next-ingredient { break-if optional-ingredient-found? # unlimited recursion buf <- to-buffer next, buf return } { break-unless remaining # limited recursion remaining <- subtract remaining, 1 buf <- to-buffer next, buf, remaining return } # past recursion depth; insert ellipses and stop append buf, [...] ] </pre> </body> </html>


context:
space:
mode: