mu - Soul of a tiny new machine. More thorough tests → More comprehensible and rewrite-friendly software → More resilient society.

about summary refs log tree commit diff stats

path: root/html/archive/2.vm/tracing-test.png

diff options

Diffstat (limited to 'html/archive/2.vm/tracing-test.png')

0 files changed, 0 insertions, 0 deletions

ze Mu scenarios' href='/akkartik/mu/commit/070table.mu?h=main&id=6f65d5918f4b73de56e6cb6362c7cbc7dbbe5945'>6f65d591 ^

b17de7ba ^

ad8161f3 ^

48835572 ^

b17de7ba ^

48835572 ^

b17de7ba ^

4f3d9065 ^

6f65d591 ^

f017a508 ^

4f3d9065 ^

f017a508 ^

48835572 ^

4f3d9065 ^

ad8161f3 ^

48835572 ^

4f3d9065 ^

b17de7ba ^

7a84094a ^

7c3bbb77 ^

b17de7ba ^

7c3bbb77 ^

51b0936f ^

b17de7ba ^

760f683f ^

b17de7ba ^

4a48bedc ^

b17de7ba ^

7c3bbb77 ^

748b6865 ^

b17de7ba ^

8bd3f99f ^

760f683f ^

b17de7ba ^

4a48bedc ^

7a84094a ^

4f3d9065 ^

7a84094a ^

88b8d612 ^

9d9da2ad ^

7c3bbb77 ^

88b8d612 ^

51b0936f ^

b17de7ba ^

dd660682 ^

88b8d612 ^

b17de7ba ^

48835572 ^

b17de7ba ^

4a48bedc ^

7a84094a ^

4f3d9065 ^

7a84094a ^

88b8d612 ^

9d9da2ad ^

7c3bbb77 ^

88b8d612 ^

48835572 ^

aed29290 ^

b17de7ba ^

cdb9fbee ^

4a48bedc ^

cdb9fbee ^

1
2

4
5

7
8

12
13

14
15

16
17
18

25
26

41
42
43

45
46

48
49

62
63

64
65

76
77

81
82

102
103
104

# A table is like an array, except that you can index it with arbitrary types
# and not just non-negative whole numbers.

# incomplete; doesn't handle hash conflicts

scenario table-read-write [
  local-scope
  tab:&:table:num:num <- new-table 30
  run [
    put-index tab, 12, 34
    60:num/raw, 61:bool/raw <- index tab, 12
  ]
  memory-should-contain [
    60 <- 34
    61 <- 1  # found
  ]
]

scenario table-read-write-non-integer [
  local-scope
  tab:&:table:text:num <- new-table 30
  run [
    put-index tab, [abc def], 34
    1:num/raw, 2:bool/raw <- index tab, [abc def]
  ]
  memory-should-contain [
    1 <- 34
    2 <- 1  # found
  ]
]

scenario table-read-not-found [
  local-scope
  tab:&:table:text:num <- new-table 30
  run [
    1:num/raw, 2:bool/raw <- index tab, [abc def]
  ]
  memory-should-contain [
    1 <- 0
    2 <- 0  # not found
  ]
]

container table:_key:_value [
  length:num
  capacity:num
  data:&:@:table-row:_key:_value
]

container table-row:_key:_value [
  occupied?:bool
  key:_key
  value:_value
]

def new-table capacity:num -> result:&:table:_key:_value [
  local-scope
  load-inputs
  result <- new {(table _key _value): type}
  data:&:@:table-row:_key:_value <- new {(table-row _key _value): type}, capacity
  *result <- merge 0/length, capacity, data
]

# todo: tag results as /required so that call-sites are forbidden from ignoring them
# then we could handle conflicts simply by resizing the table
def put-index table:&:table:_key:_value, key:_key, value:_value -> table:&:table:_key:_value [
  local-scope
  load-inputs
  hash:num <- hash key
  hash <- abs hash
  capacity:num <- get *table, capacity:offset
  _, hash-key:num <- divide-with-remainder hash, capacity
  hash-key <- abs hash-key  # in case hash overflows from a double into a negative integer inside 'divide-with-remainder' above
  table-data:&:@:table-row:_key:_value <- get *table, data:offset
  x:table-row:_key:_value <- index *table-data, hash-key
  occupied?:bool <- get x, occupied?:offset
  not-occupied?:bool <- not occupied?:bool
  assert not-occupied?, [can't handle collisions yet]
  new-row:table-row:_key:_value <- merge true, key, value
  *table-data <- put-index *table-data, hash-key, new-row
]

def index table:&:table:_key:_value, key:_key -> result:_value, found?:bool [
  local-scope
  load-inputs
  hash:num <- hash key
  hash <- abs hash
  capacity:num <- get *table, capacity:offset
  _, hash-key:num <- divide-with-remainder hash, capacity
  hash-key <- abs hash-key  # in case hash overflows from a double into a negative integer inside 'divide-with-remainder' above
  table-data:&:@:table-row:_key:_value <- get *table, data:offset
  x:table-row:_key:_value <- index *table-data, hash-key
  empty:&:_value <- new _value:type
  result <- copy *empty
  found?:bool <- get x, occupied?:offset
  return-unless found?
  key2:_key <- get x, key:offset
  found?:bool <- equal key, key2
  return-unless found?
  result <- get x, value:offset
]

def abs n:num -> result:num [
  local-scope
  load-inputs
  positive?:bool <- greater-or-equal n, 0
  return-if positive?, n
  result <- multiply n, -1
]


context:
space:
mode: