62 lines
1.4 KiB
Plaintext
62 lines
1.4 KiB
Plaintext
module Std::Array {
|
|
|
|
extern func bux_alloc(size: uint) -> *void;
|
|
extern func bux_realloc(ptr: *void, size: uint) -> *void;
|
|
extern func bux_free(ptr: *void);
|
|
extern func bux_bounds_check(index: uint, len: uint);
|
|
|
|
struct Array<T> {
|
|
data: *T,
|
|
len: uint,
|
|
cap: uint,
|
|
}
|
|
|
|
func Array_New<T>(cap: uint) -> Array<T> {
|
|
let data = bux_alloc(cap * sizeof(T)) as *T;
|
|
return Array<T> { data: data, len: 0, cap: cap };
|
|
}
|
|
|
|
func Array_Push<T>(self: *Array<T>, value: T) {
|
|
if self.len >= self.cap {
|
|
self.cap = self.cap * 2;
|
|
self.data = bux_realloc(self.data as *void, self.cap * sizeof(T)) as *T;
|
|
}
|
|
self.data[self.len] = value;
|
|
self.len = self.len + 1;
|
|
}
|
|
|
|
func Array_Get<T>(self: *Array<T>, index: uint) -> T {
|
|
bux_bounds_check(index, self.len);
|
|
return self.data[index];
|
|
}
|
|
|
|
func Array_Set<T>(self: *Array<T>, index: uint, value: T) {
|
|
bux_bounds_check(index, self.len);
|
|
self.data[index] = value;
|
|
}
|
|
|
|
func Array_Len<T>(self: *Array<T>) -> uint {
|
|
return self.len;
|
|
}
|
|
|
|
func Array_Free<T>(self: *Array<T>) {
|
|
bux_free(self.data as *void);
|
|
self.data = null as *T;
|
|
self.len = 0;
|
|
self.cap = 0;
|
|
}
|
|
|
|
func Array_Drop<T>(self: *Array<T>) {
|
|
Array_Free<T>(self);
|
|
}
|
|
|
|
func Array_operator_index_get<T>(self: *Array<T>, idx: uint) -> T {
|
|
return Array_Get<T>(self, idx);
|
|
}
|
|
|
|
func Array_operator_index_set<T>(self: *Array<T>, idx: uint, value: T) {
|
|
Array_Set<T>(self, idx, value);
|
|
}
|
|
|
|
}
|