mirror of
https://github.com/c3lang/c3c.git
synced 2026-02-27 12:01:16 +00:00
Add LinkedList Operators and Update Tests (#2438)
* Add LinkedList Operators and Update Tests * add linkedlist printing and `@new` macros (single-line init and pool-capable) * add linkedlist node and reg iterator; comparisons w/ == * Fix benchmarks. Drop random access to the linked list using []. Only return a direct array view. --------- Co-authored-by: Christoffer Lerno <christoffer@aegik.com>
This commit is contained in:
Zack Puhl
@@ -5,243 +5,252 @@ alias IntList = LinkedList{int};
|
||||
|
||||
fn void test_is_initialized()
|
||||
{
|
||||
IntList test;
|
||||
|
||||
assert(!test.is_initialized());
|
||||
IntList test;
|
||||
test::@check(!test.is_initialized());
|
||||
test.init(mem);
|
||||
assert(test.is_initialized());
|
||||
test::@check(test.is_initialized());
|
||||
test.free();
|
||||
}
|
||||
|
||||
fn void test_push_front()
|
||||
fn void test_push_front() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
IntList list = linkedlist::@tnew{int}();
|
||||
list.push_front(23);
|
||||
assert(list.len() == 1);
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == 23);
|
||||
test::eq(list.len(), 1);
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, 23);
|
||||
list.push_front(55);
|
||||
assert(list.len() == 2);
|
||||
assert(list.last()!! == 23);
|
||||
assert(list.first()!! == 55);
|
||||
test::eq(list.len(), 2);
|
||||
test::eq(list.last()!!, 23);
|
||||
test::eq(list.first()!!, 55);
|
||||
|
||||
}
|
||||
|
||||
fn void test_push()
|
||||
fn void test_push() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
IntList list = linkedlist::@tnew{int}();
|
||||
list.push(23);
|
||||
assert(list.len() == 1);
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == 23);
|
||||
test::eq(list.len(), 1);
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, 23);
|
||||
list.push(55);
|
||||
assert(list.len() == 2);
|
||||
assert(list.last()!! == 55);
|
||||
assert(list.first()!! == 23);
|
||||
test::eq(list.len(), 2);
|
||||
test::eq(list.last()!!, 55);
|
||||
test::eq(list.first()!!, 23);
|
||||
}
|
||||
|
||||
fn void test_get()
|
||||
fn void test_get() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
list.push(23);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.get(2) == -3);
|
||||
assert(list.get(1) == 55);
|
||||
assert(list.get(0) == 23);
|
||||
IntList list = linkedlist::@tnew{int}({ 23, 55, -3 });
|
||||
test::eq(list.get(2), -3);
|
||||
test::eq(list.get(1), 55);
|
||||
test::eq(list.get(0), 23);
|
||||
test::eq(list.array_view()[0], 23);
|
||||
}
|
||||
|
||||
fn void test_insert()
|
||||
fn void test_insert() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
list.push(-3);
|
||||
list.push(55);
|
||||
list.push(23);
|
||||
IntList list = linkedlist::@tnew{int}({ -3, 55, 23 });
|
||||
list.insert_at(0, 1);
|
||||
list.insert_at(2, 11);
|
||||
list.insert_at(4, 111);
|
||||
list.insert_at(6, 1111);
|
||||
assert(list.get(0) == 1);
|
||||
assert(list.get(1) == -3);
|
||||
assert(list.get(2) == 11);
|
||||
assert(list.get(3) == 55);
|
||||
assert(list.get(4) == 111);
|
||||
assert(list.get(5) == 23);
|
||||
assert(list.get(6) == 1111);
|
||||
test::eq(list.get(0), 1);
|
||||
test::eq(list.get(1), -3);
|
||||
test::eq(list.get(2), 11);
|
||||
test::eq(list.get(3), 55);
|
||||
test::eq(list.get(4), 111);
|
||||
test::eq(list.get(5), 23);
|
||||
test::eq(list.get(6), 1111);
|
||||
}
|
||||
|
||||
fn void test_set()
|
||||
fn void test_set() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
list.push(-3);
|
||||
list.push(55);
|
||||
list.push(23);
|
||||
IntList list = linkedlist::@tnew{int}({ -3, 55, 23 });
|
||||
for (int i = 0; i < 3; i++) list.set(i, list.get(i) + 1);
|
||||
assert(list.get(0) == -2);
|
||||
assert(list.get(1) == 56);
|
||||
assert(list.get(2) == 24);
|
||||
test::eq(list.get(0), -2);
|
||||
test::eq(list.get(1), 56);
|
||||
test::eq(list.get(2), 24);
|
||||
}
|
||||
|
||||
fn void test_remove_at()
|
||||
fn void test_remove_at() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
IntList list = linkedlist::@tnew{int}();
|
||||
for (int i = 0; i < 10; i++) list.push(i);
|
||||
list.remove_at(0);
|
||||
list.remove_at(1);
|
||||
list.remove_at(7);
|
||||
list.remove_at(5);
|
||||
assert(list.get(0) == 1);
|
||||
assert(list.get(1) == 3);
|
||||
assert(list.get(5) == 8);
|
||||
assert(list.get(4) == 6);
|
||||
test::eq(list.get(0), 1);
|
||||
test::eq(list.get(1), 3);
|
||||
test::eq(list.get(5), 8);
|
||||
test::eq(list.get(4), 6);
|
||||
}
|
||||
|
||||
fn void test_remove()
|
||||
fn void test_remove() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
IntList list = linkedlist::@tnew{int}();
|
||||
list.push(2);
|
||||
for (int i = 0; i < 10; i++) list.push(5);
|
||||
list.push(2);
|
||||
list.remove(5);
|
||||
assert(list.len() == 2);
|
||||
test::eq(list.len(), 2);
|
||||
}
|
||||
|
||||
fn void test_remove_first_match()
|
||||
fn void test_remove_first_match() // no @pool
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
list.push(23);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.remove_first_match(23));
|
||||
assert(list.pop()!! == -3);
|
||||
assert(list.pop()!! == 55);
|
||||
assert(!list.len());
|
||||
defer list.free(); // left this to ensure .free() remains valid and functional
|
||||
list.push_all({ 23, 55, -3 });
|
||||
test::@check(list.remove_first_match(23));
|
||||
test::eq(list.pop()!!, -3);
|
||||
test::eq(list.pop()!!, 55);
|
||||
test::@check(!list.len());
|
||||
|
||||
list.push(23);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.remove_first_match(55));
|
||||
assert(list.pop()!! == -3);
|
||||
assert(list.pop()!! == 23);
|
||||
assert(!list.len());
|
||||
list.push_all({ 23, 55, -3 });
|
||||
test::@check(list.remove_first_match(55));
|
||||
test::eq(list.pop()!!, -3);
|
||||
test::eq(list.pop()!!, 23);
|
||||
test::@check(!list.len());
|
||||
|
||||
list.push(23);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.remove_first_match(-3));
|
||||
assert(list.pop()!! == 55);
|
||||
assert(list.pop()!! == 23);
|
||||
assert(!list.len());
|
||||
list.push_all({ 23, 55, -3 });
|
||||
test::@check(list.remove_first_match(-3));
|
||||
test::eq(list.pop()!!, 55);
|
||||
test::eq(list.pop()!!, 23);
|
||||
test::@check(!list.len());
|
||||
}
|
||||
|
||||
fn void test_remove_last_match()
|
||||
fn void test_remove_last_match() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
list.push(23);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.remove_last_match(23));
|
||||
assert(list.pop()!! == -3);
|
||||
assert(list.pop()!! == 55);
|
||||
assert(!list.len());
|
||||
IntList list = linkedlist::@tnew{int}({ 23, 55, -3 });
|
||||
test::@check(list.remove_last_match(23));
|
||||
test::eq(list.pop()!!, -3);
|
||||
test::eq(list.pop()!!, 55);
|
||||
test::@check(!list.len());
|
||||
|
||||
list.push(23);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.remove_last_match(55));
|
||||
assert(list.pop()!! == -3);
|
||||
assert(list.pop()!! == 23);
|
||||
assert(!list.len());
|
||||
list.push_all({ 23, 55, -3 });
|
||||
test::@check(list.remove_last_match(55));
|
||||
test::eq(list.pop()!!, -3);
|
||||
test::eq(list.pop()!!, 23);
|
||||
test::@check(!list.len());
|
||||
|
||||
list.push(23);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.remove_last_match(-3));
|
||||
assert(list.pop()!! == 55);
|
||||
assert(list.pop()!! == 23);
|
||||
assert(!list.len());
|
||||
list.push_all({ 23, 55, -3 });
|
||||
test::@check(list.remove_last_match(-3));
|
||||
test::eq(list.pop()!!, 55);
|
||||
test::eq(list.pop()!!, 23);
|
||||
test::@check(!list.len());
|
||||
}
|
||||
|
||||
fn void test_pop()
|
||||
fn void test_pop() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
list.push(23);
|
||||
IntList list = linkedlist::@tnew{int}({ 23, 55, -3 });
|
||||
test::eq(list.len(), 3);
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, -3);
|
||||
test::eq(list.pop()!!, -3);
|
||||
test::eq(list.len(), 2);
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, 55);
|
||||
test::eq(list.pop()!!, 55);
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, 23);
|
||||
test::eq(list.pop()!!, 23);
|
||||
test::eq(list.len(), 0);
|
||||
test::@check(@catch(list.pop()));
|
||||
test::eq(list.len(), 0);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.len() == 3);
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == -3);
|
||||
assert(list.pop()!! == -3);
|
||||
assert(list.len() == 2);
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == 55);
|
||||
assert(list.pop()!! == 55);
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == 23);
|
||||
assert(list.pop()!! == 23);
|
||||
assert(list.len() == 0);
|
||||
assert(@catch(list.pop()));
|
||||
assert(list.len() == 0);
|
||||
list.push(55);
|
||||
assert(list.len() == 1);
|
||||
test::eq(list.len(), 1);
|
||||
}
|
||||
|
||||
fn void test_remove_last()
|
||||
fn void test_remove_last() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
list.push(23);
|
||||
IntList list = linkedlist::@tnew{int}({ 23, 55, -3 });
|
||||
test::eq(list.len(), 3);
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, -3);
|
||||
test::@check(@ok(list.remove_last()));
|
||||
test::eq(list.len(), 2);
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, 55);
|
||||
test::@check(@ok(list.remove_last()));
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, 23);
|
||||
test::@check(@ok(list.remove_last()));
|
||||
test::eq(list.len(), 0);
|
||||
test::@check(@catch(list.pop()));
|
||||
test::eq(list.len(), 0);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.len() == 3);
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == -3);
|
||||
assert(@ok(list.remove_last()));
|
||||
assert(list.len() == 2);
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == 55);
|
||||
assert(@ok(list.remove_last()));
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == 23);
|
||||
assert(@ok(list.remove_last()));
|
||||
assert(list.len() == 0);
|
||||
assert(@catch(list.pop()));
|
||||
assert(list.len() == 0);
|
||||
list.push(55);
|
||||
assert(list.len() == 1);
|
||||
test::eq(list.len(), 1);
|
||||
}
|
||||
|
||||
fn void test_remove_first()
|
||||
fn void test_remove_first() => @pool()
|
||||
{
|
||||
IntList list;
|
||||
defer list.free();
|
||||
list.push(23);
|
||||
IntList list = linkedlist::@tnew{int}({ 23, 55, -3 });
|
||||
test::eq(list.len(), 3);
|
||||
test::eq(list.first()!!, 23);
|
||||
test::eq(list.last()!!, -3);
|
||||
test::@check(@ok(list.remove_first()));
|
||||
test::eq(list.len(), 2);
|
||||
test::eq(list.last()!!, -3);
|
||||
test::eq(list.first()!!, 55);
|
||||
test::@check(@ok(list.remove_first()));
|
||||
test::eq(list.last()!!, -3);
|
||||
test::eq(list.first()!!, -3);
|
||||
test::@check(@ok(list.remove_first()));
|
||||
test::eq(list.len(), 0);
|
||||
test::@check(@catch(list.remove_first()));
|
||||
test::eq(list.len(), 0);
|
||||
list.push(55);
|
||||
list.push(-3);
|
||||
assert(list.len() == 3);
|
||||
assert(list.first()!! == 23);
|
||||
assert(list.last()!! == -3);
|
||||
assert(@ok(list.remove_first()));
|
||||
assert(list.len() == 2);
|
||||
assert(list.last()!! == -3);
|
||||
assert(list.first()!! == 55);
|
||||
assert(@ok(list.remove_first()));
|
||||
assert(list.last()!! == -3);
|
||||
assert(list.first()!! == -3);
|
||||
assert(@ok(list.remove_first()));
|
||||
assert(list.len() == 0);
|
||||
assert(@catch(list.remove_first()));
|
||||
assert(list.len() == 0);
|
||||
list.push(55);
|
||||
assert(list.len() == 1);
|
||||
}
|
||||
test::eq(list.len(), 1);
|
||||
}
|
||||
|
||||
fn void test_push_all_ordering() => @pool()
|
||||
{
|
||||
IntList l = linkedlist::@tnew{int}({ 23, 45, 66 });
|
||||
test::eq(l.array_view()[0], 23);
|
||||
test::eq(l.array_view()[1], 45);
|
||||
test::eq(l.array_view()[2], 66);
|
||||
|
||||
IntList l2 = linkedlist::@tnew{int}({ 23, 45, 66 });
|
||||
l2.push_front_all({ 3, 6 });
|
||||
test::eq(l2.array_view()[0], 3);
|
||||
test::eq(l2.array_view()[1], 6);
|
||||
test::eq(l2.array_view()[2], 23);
|
||||
test::eq(l2.array_view()[3], 45);
|
||||
test::eq(l2.array_view()[4], 66);
|
||||
}
|
||||
|
||||
fn void test_index_of() => @pool()
|
||||
{
|
||||
IntList list = linkedlist::@tnew{int}({ 23, 55, 55, -3 });
|
||||
test::@error(list.index_of(20), NOT_FOUND);
|
||||
test::eq(list.index_of(55)!!, 1);
|
||||
test::eq(list.rindex_of(55)!!, 2);
|
||||
}
|
||||
|
||||
fn void test_operators() => @pool()
|
||||
{
|
||||
IntList list = linkedlist::@tnew{int}({ 17, 109, 2, 8 });
|
||||
foreach (i, &e : list.array_view()) *e += 2;
|
||||
test::eq(list.array_view()[0], 19);
|
||||
test::eq(list.array_view()[1], 111);
|
||||
test::eq(list.array_view()[2], 4);
|
||||
test::eq(list.array_view()[3], 10);
|
||||
}
|
||||
|
||||
fn void test_iterator_set() => @pool()
|
||||
{
|
||||
IntList list = linkedlist::@tnew{int}({ 17, 109, 2, 8 });
|
||||
IntList expected = linkedlist::@tnew{int}({1, 2, 3, 4});
|
||||
foreach (int i, &v : list.array_view()) *v = i + 1;
|
||||
test::eq(list, expected);
|
||||
}
|
||||
|
||||
fn void test_iterator_reverse_set() => @pool()
|
||||
{
|
||||
IntList list = linkedlist::@tnew{int}({ 17, 109, 2, 8 });
|
||||
IntList pushed = linkedlist::@tnew{int}();
|
||||
IntList expected = linkedlist::@tnew{int}({8, 2, 109, 17});
|
||||
foreach_r (int i, v : list.array_view()) pushed.push(v);
|
||||
test::eq(pushed, expected);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user