authorgravatar for marc@tiehu.isMarc Tiehuis <marc@tiehu.is> 2018-02-09 05:22:31+13:00
committergravatar for andrew@ziglang.orgAndrew Kelley <andrew@ziglang.org> 2018-02-08 11:22:31-05:00
log1c236b0766bbc68f1b04e32a95683e273b26714c
tree2bd1a6945df3aac741937ba00d39ecf4f8c43703
parentdd20f558f0b3740a37c1d16a306e35f8cbe6a38f

Add ArrayList functions (#755)

at - Get the item at the n-th index. insert - Insert and item into the middle of the list, resizing and copying existing elements if needed. insertSlice - Insert a slice into the middle of the list, resizing and copying existing elements if needed.

1 files changed, 39 insertions(+), 0 deletions(-)

std/array_list.zig+39
......@@ -40,6 +40,10 @@ pub fn AlignedArrayList(comptime T: type, comptime A: u29) type{
4040 return l.items[0..l.len];
4141 }
4242
43 pub fn at(l: &const Self, n: usize) T {
44 return l.toSliceConst()[n];
45 }
46
4347 /// ArrayList takes ownership of the passed in slice. The slice must have been
4448 /// allocated with `allocator`.
4549 /// Deinitialize with `deinit` or use `toOwnedSlice`.
......@@ -59,6 +63,22 @@ pub fn AlignedArrayList(comptime T: type, comptime A: u29) type{
5963 return result;
6064 }
6165
66 pub fn insert(l: &Self, n: usize, item: &const T) %void {
67 try l.ensureCapacity(l.len + 1);
68 l.len += 1;
69
70 mem.copy(T, l.items[n+1..l.len], l.items[n..l.len-1]);
71 l.items[n] = *item;
72 }
73
74 pub fn insertSlice(l: &Self, n: usize, items: []align(A) const T) %void {
75 try l.ensureCapacity(l.len + items.len);
76 l.len += items.len;
77
78 mem.copy(T, l.items[n+items.len..l.len], l.items[n..l.len-items.len]);
79 mem.copy(T, l.items[n..n+items.len], items);
80 }
81
6282 pub fn append(l: &Self, item: &const T) %void {
6383 const new_item_ptr = try l.addOne();
6484 *new_item_ptr = *item;
......@@ -136,3 +156,22 @@ test "basic ArrayList test" {
136156 list.appendSlice([]const i32 {}) catch unreachable;
137157 assert(list.len == 9);
138158}
159
160test "insert ArrayList test" {
161 var list = ArrayList(i32).init(debug.global_allocator);
162 defer list.deinit();
163
164 try list.append(1);
165 try list.insert(0, 5);
166 assert(list.items[0] == 5);
167 assert(list.items[1] == 1);
168
169 try list.insertSlice(1, []const i32 { 9, 8 });
170 assert(list.items[0] == 5);
171 assert(list.items[1] == 9);
172 assert(list.items[2] == 8);
173
174 const items = []const i32 { 1 };
175 try list.insertSlice(0, items[0..0]);
176 assert(list.items[0] == 5);
177}