1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
## std.lists: Dynamic arrays.
## This module is imported by default.
# reference: https://doc.rust-lang.org/nomicon/vec/vec.html
## The fundamental list type. Heap-allocated.
## Equivalent to Vec<T> in other languages.
@[opaque] # opaque on a struct tells us raw field access breaks invariants.
pub type list[T] = struct
data: ptr T
capacity: uint
length: uint
## A transparent, common alias for a list of bytes.
pub type bytes = list[byte]
## Initialize and return an empty list with inner type T.
pub func init[T]: list[T] =
{ data = nil, capacity = 0, length = 0 } # fixme: nil!!!!!
## Gets the length of a list.
@[inline] # idk what to do with attributes
pub func len[T](self: lent list[T]): uint =
self.length
pub func empty[T](self: lent list[T]): bool =
self.length == 0
## Gets the internal capacity of a list.
func cap[T](self: lent list[T]): uint =
self.capacity
## Expands the capacity of a list.
@[safe]
func grow[T](self: mut list[T]) =
self.capacity = max(self.length + 1, self.capacity * 2)
self.data = self.data.realloc(self.capacity * sizeof(T))
## Pushes a new element to the end of a list.
@[safe]
pub func push[T](self: mut list[T], val: T) =
if self.capacity == self.length then self.grow()
self.data.set(val, offset = self.length)
self.length += 1
## Takes ownership of and pushes all the values of a list into another list.
pub func push[T](self: mut list[T], values: list[T]) =
for val in values do
self.push(val)
## Removes & returns an element from the end of a list, if it exists.
@[safe]
pub func pop[T](self: mut list[T]): T? =
if self.length == 0 then
None
else
self.length -= 1
Some(self.data.get(offset = self.length))
## Returns a reference to an element of a list, if in range.
@[safe]
pub func get[T](self: lent list[T], i: uint): lent T? =
if i > self.length then
None
else # fixme: interior mutability
Some(lent self.data.get(offset = i))
## Returns a mutable reference to an element of a list, if in range.
@[safe]
pub func get[T](self: mut list[T], i: uint): mut T? =
if i > self.length then
None
else # fixme: interior mutability
Some(mut self.data.get(offset = i))
## Sets the element of a list to a value.
@[safe]
pub func set[T](self: mut list[T], i: uint, val: T) =
assert i <= self.length, "index out of bounds"
Okay(self.data.set(offset = i, val))
## Inserts a value at a location and shifts elements of the list accordingly.
@[safe]
pub func insert[T](self: mut list[T], i: uint, val: T) =
assert i <= self.length, "index out of bounds"
if self.capacity == self.length then self.grow()
self.data.offset(i).copy(self.data.offset(i + 1), self.length - i)
self.data.set(i, val)
self.length += 1
## Inserts a list of values at a location and shifts elements of the list accordingly.
pub func insert[T](self: mut list[T], i: uint, vals: list[T]) =
for val in vals.rev: # inserting backwards avoids counting
self.insert(val, i)
## Removes a value at a location and shifts elements of the list accordingly.
@[safe]
pub func remove[T](self: mut list[T], i: uint): T? =
if index < self.length then None
else
self.length -= 1
let res = self.data.get(i)
self.data.offset(i + 1).copy(self.data.offset(i), self.length - i)
res
## Gets the last element of a list, if it exists.
pub func last[T](self: lent list[T]): lent T? =
self.get(self.len - 1)
## Gets the last element of a list mutably, if it exists.
pub func last[T](self: mut list[T]): mut T? =
self.get(self.len - 1)
# todo: many questions. owned? how does it not free?
pub func iter[T](self: list[T]): ListIter[T] =
...
# todo: iteration...
# todo: destructors...
# todo: syntax for inlining + other pragmas... as a macro, perhaps?
# todo: slices
type slice[T] = struct
data: ptr[T] # hrm...
length: uint
|
