Dockerfile.tumbleweed - profani-tty - Profanity fork with TTY improvements

blob: 217476f3dfc4f6c71cef7d69800afd33b270c889 (plain) (tree)

9cd5dfbd ^

bec71892 ^

9cd5dfbd ^

0857b5ee ^

9cd5dfbd ^

9cd5dfbd ^

9cd5dfbd ^

3700c80a ^

9cd5dfbd ^

3700c80a ^

9cd5dfbd ^

3700c80a ^

9cd5dfbd ^

3700c80a ^

9cd5dfbd ^

0211ab0e ^

3700c80a ^

9cd5dfbd ^

3700c80a ^

9cd5dfbd ^

3700c80a ^

9cd5dfbd ^

generated by cgit-pink 1.4.1-2-gfad0 (git 2.36.2.497.gbbea4dcf42) at 2024-12-01 10:55:36 +0000

lass="muRecipe">def push x:_elem, in:address:list:_elem -> result:address:list:_elem [ local-scope load-ingredients result <- new {(list _elem): type} *result <- merge x, in ] def first in:address:list:_elem -> result:_elem [ local-scope load-ingredients result <- get *in, value:offset ] def rest in:address:list:_elem -> result:address:list:_elem/contained-in:in [ local-scope load-ingredients result <- get *in, next:offset ] scenario list-handling [ run [ local-scope x:address:list:number <- push 3, 0 x <- push 4, x x <- push 5, x 10:number/raw <- first x x <- rest x 11:number/raw <- first x x <- rest x 12:number/raw <- first x 20:address:list:number/raw <- rest x ] memory-should-contain [ 10 <- 5 11 <- 4 12 <- 3 20 <- 0 # nothing left ] ] def length l:address:list:_elem -> result:number [ local-scope load-ingredients return-unless l, 0 rest:address:list:_elem <- rest l length-of-rest:number <- length rest result <- add length-of-rest, 1 ] # insert 'x' after 'in' def insert x:_elem, in:address:list:_elem -> in:address:list:_elem [ local-scope load-ingredients new-node:address:list:_elem <- new {(list _elem): type} *new-node <- put *new-node, value:offset, x next-node:address: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:address:list:character <- push 3, 0 list <- push 4, list list <- push 5, list list2:address:list:character <- rest list # inside list list2 <- insert 6, list2 # check structure list2 <- copy list 10:character/raw <- first list2 list2 <- rest list2 11:character/raw <- first list2 list2 <- rest list2 12:character/raw <- first list2 list2 <- rest list2 13:character/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:address:list:character <- push 3, 0 list <- push 4, list list <- push 5, list list2:address:list:character <- rest list # inside list list2 <- rest list2 # now at end of list list2 <- insert 6, list2 # check structure like before list2 <- copy list 10:character/raw <- first list2 list2 <- rest list2 11:character/raw <- first list2 list2 <- rest list2 12:character/raw <- first list2 list2 <- rest list2 13:character/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:address:list:character <- push 3, 0 list <- push 4, list list <- push 5, list list <- insert 6, list # check structure like before list2:address:list:character <- copy list 10:character/raw <- first list2 list2 <- rest list2 11:character/raw <- first list2 list2 <- rest list2 12:character/raw <- first list2 list2 <- rest list2 13:character/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:address:list:_elem/contained-in:in, in:address:list:_elem -> in:address:list:_elem [ local-scope load-ingredients # if 'x' is null, return return-unless x next-node:address: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?:boolean <- equal x, in return-if at-head?, next-node # compute prev-node prev-node:address:list:_elem <- copy in curr:address:list:_elem <- rest prev-node { return-unless curr found?:boolean <- 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:address:list:character <- push 3, 0 list <- push 4, list list <- push 5, list list2:address:list:character <- rest list # second element list <- remove list2, list 10:boolean/raw <- equal list2, 0 # check structure like before list2 <- copy list 11:character/raw <- first list2 list2 <- rest list2 12:character/raw <- first list2 20:address:list:character/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:address:list:character <- push 3, 0 list <- push 4, list list <- push 5, list list <- remove list, list # check structure like before list2:address:list:character <- copy list 10:character/raw <- first list2 list2 <- rest list2 11:character/raw <- first list2 20:address:list:character/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:address:list:character <- push 3, 0 list <- push 4, list list <- push 5, list # delete last element list2:address:list:character <- rest list list2 <- rest list2 list <- remove list2, list 10:boolean/raw <- equal list2, 0 # check structure like before list2 <- copy list 11:character/raw <- first list2 list2 <- rest list2 12:character/raw <- first list2 20:address:list:character/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:address:list:character <- push 3, 0 list <- remove list, list 1:number/raw <- copy list ] memory-should-contain [ 1 <- 0 # back to an empty list ] ] def to-text in:address:list:_elem -> result:address:array:character [ local-scope load-ingredients buf:address: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:address:list:_elem -> result:address:array:character [ local-scope load-ingredients buf:address:buffer <- new-buffer 80 buf <- to-buffer in, buf, 6 # max elements to display result <- buffer-to-array buf ] def to-buffer in:address:list:_elem, buf:address:buffer -> buf:address: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:address:list:_elem <- rest in nextn:number <- copy next return-unless next buf <- append buf, [ -> ] # and recurse remaining:number, optional-ingredient-found?:boolean <- 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>