2015-05-19 17:36:46 +00:00
|
|
|
# A list links up multiple objects together to make them easier to manage.
|
|
|
|
#
|
2015-11-04 20:43:37 +00:00
|
|
|
# The objects must be of the same type. If you want to store multiple types in
|
|
|
|
# a single list, use an exclusive-container.
|
2015-05-19 17:36:46 +00:00
|
|
|
|
2015-11-04 20:43:37 +00:00
|
|
|
container list:_elem [
|
|
|
|
value:_elem
|
2016-09-17 19:55:10 +00:00
|
|
|
next:&:list:_elem
|
2015-05-16 06:00:16 +00:00
|
|
|
]
|
|
|
|
|
2017-09-26 04:20:49 +00:00
|
|
|
def push x:_elem, l:&:list:_elem -> result:&:list:_elem/contained-in:l [
|
2015-07-14 05:43:16 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2017-09-26 04:20:49 +00:00
|
|
|
result <- new {(list _elem): type}
|
2016-10-18 15:33:20 +00:00
|
|
|
*result <- merge x, l
|
2015-05-16 06:00:16 +00:00
|
|
|
]
|
|
|
|
|
2016-09-17 19:55:10 +00:00
|
|
|
def first in:&:list:_elem -> result:_elem [
|
2015-07-14 05:43:16 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2015-11-04 20:43:37 +00:00
|
|
|
result <- get *in, value:offset
|
2015-05-16 06:00:16 +00:00
|
|
|
]
|
|
|
|
|
2016-09-17 19:55:10 +00:00
|
|
|
def rest in:&:list:_elem -> result:&:list:_elem/contained-in:in [
|
2015-07-14 05:43:16 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2015-11-04 20:43:37 +00:00
|
|
|
result <- get *in, next:offset
|
|
|
|
]
|
|
|
|
|
2015-05-16 06:00:16 +00:00
|
|
|
scenario list-handling [
|
|
|
|
run [
|
2016-05-26 23:46:38 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
x:&:list:num <- push 3, null
|
2016-05-26 23:46:38 +00:00
|
|
|
x <- push 4, x
|
|
|
|
x <- push 5, x
|
2016-09-17 17:28:25 +00:00
|
|
|
10:num/raw <- first x
|
2016-05-26 23:46:38 +00:00
|
|
|
x <- rest x
|
2016-09-17 17:28:25 +00:00
|
|
|
11:num/raw <- first x
|
2016-05-26 23:46:38 +00:00
|
|
|
x <- rest x
|
2016-09-17 17:28:25 +00:00
|
|
|
12:num/raw <- first x
|
2016-09-17 19:55:10 +00:00
|
|
|
20:&:list:num/raw <- rest x
|
2015-05-16 06:00:16 +00:00
|
|
|
]
|
|
|
|
memory-should-contain [
|
2016-05-26 23:46:38 +00:00
|
|
|
10 <- 5
|
|
|
|
11 <- 4
|
|
|
|
12 <- 3
|
|
|
|
20 <- 0 # nothing left
|
2015-05-16 06:00:16 +00:00
|
|
|
]
|
|
|
|
]
|
2015-11-28 05:38:09 +00:00
|
|
|
|
2016-09-17 19:55:10 +00:00
|
|
|
def length l:&:list:_elem -> result:num [
|
2016-05-20 19:47:18 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2017-03-31 15:11:45 +00:00
|
|
|
result <- copy 0
|
|
|
|
{
|
|
|
|
break-unless l
|
|
|
|
result <- add result, 1
|
|
|
|
l <- rest l
|
|
|
|
loop
|
|
|
|
}
|
2016-05-20 19:47:18 +00:00
|
|
|
]
|
|
|
|
|
2016-06-16 23:51:54 +00:00
|
|
|
# insert 'x' after 'in'
|
2016-09-17 19:55:10 +00:00
|
|
|
def insert x:_elem, in:&:list:_elem -> in:&:list:_elem [
|
2016-06-16 23:51:54 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2016-09-17 19:55:10 +00:00
|
|
|
new-node:&:list:_elem <- new {(list _elem): type}
|
2016-06-16 23:51:54 +00:00
|
|
|
*new-node <- put *new-node, value:offset, x
|
2016-09-17 19:55:10 +00:00
|
|
|
next-node:&:list:_elem <- get *in, next:offset
|
2016-06-16 23:51:54 +00:00
|
|
|
*in <- put *in, next:offset, new-node
|
|
|
|
*new-node <- put *new-node, next:offset, next-node
|
|
|
|
]
|
|
|
|
|
|
|
|
scenario inserting-into-list [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 3, null
|
2016-09-29 02:48:56 +00:00
|
|
|
list <- push 4, list
|
|
|
|
list <- push 5, list
|
2016-06-16 23:51:54 +00:00
|
|
|
run [
|
2017-05-29 08:37:35 +00:00
|
|
|
list2:&:list:num <- rest list # inside list
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- insert 6, list2
|
|
|
|
# check structure
|
|
|
|
list2 <- copy list
|
2017-05-29 08:37:35 +00:00
|
|
|
10:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
11:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
12:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
13:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
]
|
|
|
|
memory-should-contain [
|
|
|
|
10 <- 5 # scanning next
|
|
|
|
11 <- 4
|
|
|
|
12 <- 6 # inserted element
|
|
|
|
13 <- 3
|
|
|
|
]
|
|
|
|
]
|
|
|
|
|
|
|
|
scenario inserting-at-end-of-list [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 3, null
|
2016-09-29 02:48:56 +00:00
|
|
|
list <- push 4, list
|
|
|
|
list <- push 5, list
|
2016-06-16 23:51:54 +00:00
|
|
|
run [
|
2017-05-29 08:37:35 +00:00
|
|
|
list2:&:list:num <- rest list # inside list
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2 # now at end of list
|
|
|
|
list2 <- insert 6, list2
|
|
|
|
# check structure like before
|
|
|
|
list2 <- copy list
|
2017-05-29 08:37:35 +00:00
|
|
|
10:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
11:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
12:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
13:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
]
|
|
|
|
memory-should-contain [
|
|
|
|
10 <- 5 # scanning next
|
|
|
|
11 <- 4
|
|
|
|
12 <- 3
|
|
|
|
13 <- 6 # inserted element
|
|
|
|
]
|
|
|
|
]
|
|
|
|
|
|
|
|
scenario inserting-after-start-of-list [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 3, null
|
2016-09-29 02:48:56 +00:00
|
|
|
list <- push 4, list
|
|
|
|
list <- push 5, list
|
2016-06-16 23:51:54 +00:00
|
|
|
run [
|
|
|
|
list <- insert 6, list
|
|
|
|
# check structure like before
|
2017-05-29 08:37:35 +00:00
|
|
|
list2:&:list:num <- copy list
|
|
|
|
10:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
11:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
12:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
13:num/raw <- first list2
|
2016-06-16 23:51:54 +00:00
|
|
|
]
|
|
|
|
memory-should-contain [
|
|
|
|
10 <- 5 # scanning next
|
|
|
|
11 <- 6 # inserted element
|
|
|
|
12 <- 4
|
|
|
|
13 <- 3
|
|
|
|
]
|
|
|
|
]
|
|
|
|
|
2016-06-17 00:02:08 +00:00
|
|
|
# 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.
|
2016-09-17 19:55:10 +00:00
|
|
|
def remove x:&:list:_elem/contained-in:in, in:&:list:_elem -> in:&:list:_elem [
|
2016-06-17 00:02:08 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2016-06-17 00:02:08 +00:00
|
|
|
# if 'x' is null, return
|
|
|
|
return-unless x
|
2016-09-17 19:55:10 +00:00
|
|
|
next-node:&:list:_elem <- rest x
|
2016-06-17 00:02:08 +00:00
|
|
|
# clear next pointer of 'x'
|
2018-06-17 18:20:53 +00:00
|
|
|
*x <- put *x, next:offset, null
|
2016-06-17 00:02:08 +00:00
|
|
|
# if 'x' is at the head of 'in', return the new head
|
2016-09-17 17:30:24 +00:00
|
|
|
at-head?:bool <- equal x, in
|
2016-06-17 00:02:08 +00:00
|
|
|
return-if at-head?, next-node
|
|
|
|
# compute prev-node
|
2016-09-17 19:55:10 +00:00
|
|
|
prev-node:&:list:_elem <- copy in
|
|
|
|
curr:&:list:_elem <- rest prev-node
|
2016-06-17 00:02:08 +00:00
|
|
|
{
|
|
|
|
return-unless curr
|
2016-09-17 17:30:24 +00:00
|
|
|
found?:bool <- equal curr, x
|
2016-06-17 00:02:08 +00:00
|
|
|
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 [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 3, null
|
2016-09-29 02:48:56 +00:00
|
|
|
list <- push 4, list
|
|
|
|
list <- push 5, list
|
2016-06-17 00:02:08 +00:00
|
|
|
run [
|
2017-05-29 08:37:35 +00:00
|
|
|
list2:&:list:num <- rest list # second element
|
2016-06-17 00:02:08 +00:00
|
|
|
list <- remove list2, list
|
2018-06-17 18:20:53 +00:00
|
|
|
10:bool/raw <- equal list2, null
|
2016-06-17 00:02:08 +00:00
|
|
|
# check structure like before
|
|
|
|
list2 <- copy list
|
2017-05-29 08:37:35 +00:00
|
|
|
11:num/raw <- first list2
|
2016-06-17 00:02:08 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
12:num/raw <- first list2
|
|
|
|
20:&:list:num/raw <- rest list2
|
2016-06-17 00:02:08 +00:00
|
|
|
]
|
|
|
|
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 [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 3, null
|
2016-09-29 02:48:56 +00:00
|
|
|
list <- push 4, list
|
|
|
|
list <- push 5, list
|
2016-06-17 00:02:08 +00:00
|
|
|
run [
|
|
|
|
list <- remove list, list
|
|
|
|
# check structure like before
|
2017-05-29 08:37:35 +00:00
|
|
|
list2:&:list:num <- copy list
|
|
|
|
10:num/raw <- first list2
|
2016-06-17 00:02:08 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
11:num/raw <- first list2
|
|
|
|
20:&:list:num/raw <- rest list2
|
2016-06-17 00:02:08 +00:00
|
|
|
]
|
|
|
|
memory-should-contain [
|
|
|
|
10 <- 4 # scanning next, skipping deleted element
|
|
|
|
11 <- 3
|
|
|
|
20 <- 0 # no more elements
|
|
|
|
]
|
|
|
|
]
|
|
|
|
|
|
|
|
scenario removing-from-end-of-list [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 3, null
|
2016-09-29 02:48:56 +00:00
|
|
|
list <- push 4, list
|
|
|
|
list <- push 5, list
|
2016-06-17 00:02:08 +00:00
|
|
|
run [
|
|
|
|
# delete last element
|
2017-05-29 08:37:35 +00:00
|
|
|
list2:&:list:num <- rest list
|
2016-06-17 00:02:08 +00:00
|
|
|
list2 <- rest list2
|
|
|
|
list <- remove list2, list
|
2018-06-17 18:20:53 +00:00
|
|
|
10:bool/raw <- equal list2, null
|
2016-06-17 00:02:08 +00:00
|
|
|
# check structure like before
|
|
|
|
list2 <- copy list
|
2017-05-29 08:37:35 +00:00
|
|
|
11:num/raw <- first list2
|
2016-06-17 00:02:08 +00:00
|
|
|
list2 <- rest list2
|
2017-05-29 08:37:35 +00:00
|
|
|
12:num/raw <- first list2
|
|
|
|
20:&:list:num/raw <- rest list2
|
2016-06-17 00:02:08 +00:00
|
|
|
]
|
|
|
|
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 [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 3, null
|
2016-06-17 00:02:08 +00:00
|
|
|
run [
|
|
|
|
list <- remove list, list
|
2018-06-17 06:19:59 +00:00
|
|
|
1:num/raw <- deaddress list
|
2016-06-17 00:02:08 +00:00
|
|
|
]
|
|
|
|
memory-should-contain [
|
|
|
|
1 <- 0 # back to an empty list
|
|
|
|
]
|
|
|
|
]
|
|
|
|
|
2016-09-27 16:07:49 +00:00
|
|
|
# reverse the elements of a list
|
|
|
|
# (contributed by Caleb Couch)
|
2016-10-18 15:33:20 +00:00
|
|
|
def reverse list:&:list:_elem temp:&:list:_elem/contained-in:result -> result:&:list:_elem [
|
2016-09-27 16:07:49 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2016-11-10 18:24:14 +00:00
|
|
|
return-unless list, temp
|
2016-09-27 16:07:49 +00:00
|
|
|
object:_elem <- first, list
|
|
|
|
list <- rest list
|
|
|
|
temp <- push object, temp
|
|
|
|
result <- reverse list, temp
|
|
|
|
]
|
|
|
|
|
|
|
|
scenario reverse-list [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 1, null
|
2016-09-29 02:48:56 +00:00
|
|
|
list <- push 2, list
|
|
|
|
list <- push 3, list
|
2016-09-27 16:07:49 +00:00
|
|
|
run [
|
|
|
|
stash [list:], list
|
2016-09-27 17:28:14 +00:00
|
|
|
list <- reverse list
|
2016-09-27 16:07:49 +00:00
|
|
|
stash [reversed:], list
|
|
|
|
]
|
|
|
|
trace-should-contain [
|
|
|
|
app: list: 3 -> 2 -> 1
|
|
|
|
app: reversed: 1 -> 2 -> 3
|
|
|
|
]
|
|
|
|
]
|
|
|
|
|
2017-05-27 07:52:28 +00:00
|
|
|
scenario stash-list [
|
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
list:&:list:num <- push 1, null
|
2017-05-27 07:52:28 +00:00
|
|
|
list <- push 2, list
|
|
|
|
list <- push 3, list
|
|
|
|
run [
|
|
|
|
stash [list:], list
|
|
|
|
]
|
|
|
|
trace-should-contain [
|
|
|
|
app: list: 3 -> 2 -> 1
|
|
|
|
]
|
|
|
|
]
|
|
|
|
|
2016-09-17 19:55:10 +00:00
|
|
|
def to-text in:&:list:_elem -> result:text [
|
2015-11-28 05:38:09 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2017-04-18 17:47:35 +00:00
|
|
|
buf:&:buffer:char <- new-buffer 80
|
2015-11-28 05:38:09 +00:00
|
|
|
buf <- to-buffer in, buf
|
|
|
|
result <- buffer-to-array buf
|
|
|
|
]
|
|
|
|
|
2015-11-29 09:00:30 +00:00
|
|
|
# variant of 'to-text' which stops printing after a few elements (and so is robust to cycles)
|
2016-09-17 19:55:10 +00:00
|
|
|
def to-text-line in:&:list:_elem -> result:text [
|
2015-11-29 09:00:30 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2017-04-18 17:47:35 +00:00
|
|
|
buf:&:buffer:char <- new-buffer 80
|
2015-11-29 09:00:30 +00:00
|
|
|
buf <- to-buffer in, buf, 6 # max elements to display
|
|
|
|
result <- buffer-to-array buf
|
|
|
|
]
|
|
|
|
|
2017-04-18 17:47:35 +00:00
|
|
|
def to-buffer in:&:list:_elem, buf:&:buffer:char -> buf:&:buffer:char [
|
2015-11-28 05:38:09 +00:00
|
|
|
local-scope
|
2017-12-04 07:25:40 +00:00
|
|
|
load-inputs
|
2015-11-28 05:38:09 +00:00
|
|
|
{
|
|
|
|
break-if in
|
2016-09-27 17:43:42 +00:00
|
|
|
buf <- append buf, [[]]
|
2016-03-08 09:30:14 +00:00
|
|
|
return
|
2015-11-28 05:38:09 +00:00
|
|
|
}
|
|
|
|
# append in.value to buf
|
|
|
|
val:_elem <- get *in, value:offset
|
|
|
|
buf <- append buf, val
|
|
|
|
# now prepare next
|
2016-09-17 19:55:10 +00:00
|
|
|
next:&:list:_elem <- rest in
|
2018-06-17 06:19:59 +00:00
|
|
|
nextn:num <- deaddress next
|
2016-03-08 09:30:14 +00:00
|
|
|
return-unless next
|
2016-03-14 20:00:21 +00:00
|
|
|
buf <- append buf, [ -> ]
|
2015-11-28 05:38:09 +00:00
|
|
|
# and recurse
|
2017-12-04 07:25:40 +00:00
|
|
|
remaining:num, optional-input-found?:bool <- next-input
|
2015-11-29 09:00:30 +00:00
|
|
|
{
|
2017-12-04 07:25:40 +00:00
|
|
|
break-if optional-input-found?
|
2015-11-29 09:00:30 +00:00
|
|
|
# unlimited recursion
|
|
|
|
buf <- to-buffer next, buf
|
2016-03-08 09:30:14 +00:00
|
|
|
return
|
2015-11-29 09:00:30 +00:00
|
|
|
}
|
|
|
|
{
|
|
|
|
break-unless remaining
|
|
|
|
# limited recursion
|
|
|
|
remaining <- subtract remaining, 1
|
|
|
|
buf <- to-buffer next, buf, remaining
|
2016-03-08 09:30:14 +00:00
|
|
|
return
|
2015-11-29 09:00:30 +00:00
|
|
|
}
|
|
|
|
# past recursion depth; insert ellipses and stop
|
2016-03-14 20:00:21 +00:00
|
|
|
append buf, [...]
|
2015-11-28 05:38:09 +00:00
|
|
|
]
|
2016-09-27 17:43:42 +00:00
|
|
|
|
|
|
|
scenario stash-empty-list [
|
2016-09-29 02:48:56 +00:00
|
|
|
local-scope
|
2018-06-17 18:20:53 +00:00
|
|
|
x:&:list:num <- copy null
|
2016-09-29 02:48:56 +00:00
|
|
|
run [
|
|
|
|
stash x
|
|
|
|
]
|
2016-09-27 17:43:42 +00:00
|
|
|
trace-should-contain [
|
|
|
|
app: []
|
|
|
|
]
|
|
|
|
]
|