shishantbiswas/c3c
1
1
Fork 0
mirror of https://github.com/c3lang/c3c.git synced 2026-02-27 12:01:16 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add array::zip and Related Macros (#2370)

Browse Source 
* zip / zip_into
* Deprecate `add_array` in favour of `push_all` on lists.
* Add support for generic lists for zip.

---------

Co-authored-by: Christoffer Lerno <christoffer@aegik.com>
This commit is contained in:
Zack Puhl
2025-08-16 07:30:24 -04:00
committed by GitHub
parent e35dbd29fb
commit 702b63ddb7
16 changed files with 567 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
test/unit/stdlib/collections/elastic_array.c3
View File

@@ -7,7 +7,7 @@ alias PtrList = ElasticArray{void*, 10};
fn void delete_contains_index()
{
IntList test;
test.add_array({ 1, 2 });
test.push_all({ 1, 2 });
assert(test.contains(1));
assert(test.contains(2));
assert(!test.contains(0));
@@ -36,7 +36,7 @@ fn void delete_contains_index()
fn void compact()
{
PtrList test;
test.add_array({ null, &test });
test.push_all({ null, &test });
assert(test.compact_count() == 1);
test.push(null);
assert(test.compact_count() == 1);
@@ -50,7 +50,7 @@ fn void reverse()
{
IntList test;
test.reverse();
test.add_array({ 1, 2 });
test.push_all({ 1, 2 });
test.push(3);
assert(test.array_view() == (int[]) { 1, 2, 3});
test.reverse();
@@ -66,13 +66,13 @@ fn void remove_if()
IntList test;
usz removed;
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_if(&filter);
assert(removed == 3);
assert(test.array_view() == (int[]){1, 2});
test.clear();
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_if(&select);
assert(removed == 2);
assert(test.array_view() == (int[]){11, 10, 20});
@@ -84,13 +84,13 @@ fn void remove_using_test()
IntList test;
usz removed;
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_using_test(fn bool(i, ctx) => *i >= *(int*)ctx, &&10);
assert(removed == 3);
assert(test.array_view() == (int[]){1, 2});
test.clear();
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_using_test(fn bool(i, ctx) => *i < *(int*)ctx, &&10);
assert(removed == 2);
assert(test.array_view() == (int[]){11, 10, 20});
@@ -101,13 +101,13 @@ fn void retain_if()
IntList test;
usz removed;
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.retain_if(&select);
assert(removed == 3);
assert(test.array_view() == (int[]){1, 2});
test.clear();
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.retain_if(&filter);
assert(removed == 2);
assert(test.array_view() == (int[]){11, 10, 20});
@@ -118,13 +118,13 @@ fn void retain_using_test()
IntList test;
usz removed;
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_using_test(fn bool(i, ctx) => *i >= *(int*)ctx, &&10);
assert(removed == 3);
assert(test.array_view() == (int[]){1, 2});
test.clear();
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_using_test(fn bool(i, ctx) => *i < *(int*)ctx, &&10);
assert(removed == 2);
assert(test.array_view() == (int[]){11, 10, 20});

24
test/unit/stdlib/collections/list.c3
View File

@@ -25,7 +25,7 @@ fn void remove_at()
IntList test;
test.init(mem);
defer test.free();
test.add_array({ 1, 2, 3, 4 });
test.push_all({ 1, 2, 3, 4 });
test::eq(test.array_view(), (int[]){ 1, 2, 3, 4 });
test.remove_at(0);
test::eq(test.array_view(), (int[]){ 2, 3, 4 });
@@ -41,7 +41,7 @@ fn void delete_contains_index()
{
IntList test;
test.add_array({ 1, 2 });
test.push_all({ 1, 2 });
assert(test.contains(1));
assert(test.contains(2));
assert(!test.contains(0));
@@ -70,7 +70,7 @@ fn void delete_contains_index()
fn void compact()
{
PtrList test;
test.add_array({ null, &test });
test.push_all({ null, &test });
assert(test.compact_count() == 1);
test.push(null);
assert(test.compact_count() == 1);
@@ -85,7 +85,7 @@ fn void reverse()
IntList test;
test.reverse();
test.add_array({ 1, 2 });
test.push_all({ 1, 2 });
test.push(3);
assert(test.array_view() == { 1, 2, 3});
test.reverse();
@@ -101,13 +101,13 @@ fn void remove_if()
IntList test;
usz removed;
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_if(&filter);
assert(removed == 3);
assert(test.array_view() == {1, 2});
test.clear();
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_if(&select);
assert(removed == 2);
assert(test.array_view() == {11, 10, 20});
@@ -135,13 +135,13 @@ fn void remove_using_test()
IntList test;
usz removed;
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_using_test(fn bool(i, ctx) => *i >= *(int*)ctx, &&10);
assert(removed == 3);
assert(test.array_view() == {1, 2});
test.clear();
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_using_test(fn bool(i, ctx) => *i < *(int*)ctx, &&10);
assert(removed == 2);
assert(test.array_view() == {11, 10, 20});
@@ -152,13 +152,13 @@ fn void retain_if()
IntList test;
usz removed;
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.retain_if(&select);
assert(removed == 3);
assert(test.array_view() == {1, 2});
test.clear();
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.retain_if(&filter);
assert(removed == 2);
assert(test.array_view() == {11, 10, 20});
@@ -169,13 +169,13 @@ fn void retain_using_test()
IntList test;
usz removed;
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_using_test(fn bool(i, ctx) => *i >= *(int*)ctx, &&10);
assert(removed == 3);
assert(test.array_view() == {1, 2});
test.clear();
test.add_array({ 1, 11, 2, 10, 20 });
test.push_all({ 1, 11, 2, 10, 20 });
removed = test.remove_using_test(fn bool(i, ctx) => *i < *(int*)ctx, &&10);
assert(removed == 2);
assert(test.array_view() == {11, 10, 20});