untypequicode/c-automates-giiiiive
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

shell_test.c

Browse Source 
Changement de quelques tests
This commit is contained in:
Ethan Facca
2024-12-15 17:28:52 +01:00
parent bf7ce45096
commit 92e67ec205
1 changed files with 16 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
Anna et Ethan/shell_test.c
View File

@@ -99,7 +99,7 @@ void test(void) {
assert(lefread_dequeue(dq, i) == i + 1);
printf("assert(lefread_dequeue(dq, %d) == %d) check\n", i, i + 1);
}
for (uint i = 0; i < 20; i++) {
for (uint i = 0; i < rand() % 100; i++) {
if (i % 2 == 0) {
uint tmp[i / 2];
for (uint j = 0; j < i / 2; j++) {
@@ -142,7 +142,7 @@ void test(void) {
"Test makeempty_dequeue et copy_dequeue_right in array [1, 20]\n"); // Test makeempty_dequeue et copy_dequeue_right
printf("--------------------\n");
dequeue *dq2 = create_dequeue();
for (uint i = 0; i < 10; i++) {
for (uint i = 0; i < rand() % 100; i++) {
makeempty_dequeue(dq2);
// printf_dequeue(dq2, "makeempty_dequeue", "dq2", -1, -1);
copy_dequeue_right(dq2, dq, i);
@@ -159,7 +159,7 @@ void test(void) {
printf("--------------------\n");
printf("Test mem_dequeue in array [1, 20]\n"); // Test mem_dequeue
printf("--------------------\n");
for (uint i = 0; i < 20; i++) {
for (uint i = 0; i < rand() % 100; i++) {
uint value = rand() % 100;
// printf_dequeue(dq, "mem_dequeue", "dq2", value,
// mem_dequeue(value, dq));
@@ -170,7 +170,7 @@ void test(void) {
if (dq == NULL) delete_dequeue(dq2);
for (uint k = 0; k < NB_TESTS_OCCUR; k++) {
dq2 = create_dequeue();
for (uint i = 0; i < 20; i++) {
for (uint i = 0; i < rand() % 100 + 1; i++) {
lefins_dequeue(rand() % 100, dq2);
}
// printf_dequeue(dq2, "random", "dq2", -1, -1);
@@ -196,7 +196,7 @@ void test(void) {
printf("--------------------\n");
printf("Test mem_dequeue_sorted\n"); // Test mem_dequeue_sorted
printf("--------------------\n");
for (uint i = 0; i < 20; i++) {
for (uint i = 0; i < size_dequeue(dq2); i++) {
assert(mem_dequeue_sorted(i, dq2) == mem_dequeue(i, dq2));
printf("assert(mem_dequeue_sorted(%d, dq2) == %d) check\n", i,
mem_dequeue(i, dq2));
@@ -210,8 +210,10 @@ void test(void) {
dq = create_dequeue();
dq2 = create_dequeue();
dequeue *dq3 = create_dequeue();
for (uint i = 0; i < 10; i++) {
for (uint i = 0; i < rand() % 100; i++) {
lefins_dequeue(rand() % 100, dq);
}
for (uint i = 0; i < rand() % 100; i++) {
lefins_dequeue(rand() % 100, dq2);
}
sort_dequeue_norepeat(dq);
@@ -261,8 +263,10 @@ void test(void) {
for (uint k = 0; k < NB_TESTS_OCCUR; k++) {
dq = create_dequeue();
dq2 = create_dequeue();
for (uint i = 0; i < 20; i++) {
for (uint i = 0; i < rand() % 100; i++) {
lefins_dequeue(rand() % 100, dq);
}
for (uint i = 0; i < rand() % 100; i++) {
lefins_dequeue(rand() % 100, dq2);
}
sort_dequeue_norepeat(dq);
@@ -287,8 +291,10 @@ void test(void) {
for (uint k = 0; k < NB_TESTS_OCCUR; k++) {
dq = create_dequeue();
dq2 = create_dequeue();
for (uint i = 0; i < 10; i++) {
for (uint i = 0; i < rand() % 100; i++) {
lefins_dequeue(rand() % 100, dq);
}
for (uint i = 0; i < rand() % 100; i++) {
lefins_dequeue(rand() % 100, dq2);
}
sort_dequeue_norepeat(dq);
@@ -304,7 +310,7 @@ void test(void) {
}
for (uint k = 0; k < NB_TESTS_OCCUR; k++) {
dq = create_dequeue();
for (uint i = 0; i < 10; i++) {
for (uint i = 0; i < rand() % 100; i++) {
lefins_dequeue(rand() % 100, dq);
}
sort_dequeue_norepeat(dq);
@@ -374,3 +380,4 @@ void test(void) {
delete_barray(ba);
}
}