Refactoring and renaming

This commit is contained in:
Leonardo committed 2019-03-22 14:17:10 -03:00
1 parent e17e1ba240
commit 137e35d998
11 files changed
+325 -317

No files matched your search

+46 -46
View File
@@ -1,6 +1,6 @@
#include <stdio.h>
#include <assert.h>
#include "../src/macro_containers.h"
#include "../src/macro_collections.h"
CONTAINER_GENERATE(LIST, PUBLIC, l, list, /**/, /**/, int)
CONTAINER_GENERATE(STACK, PUBLIC, s, stack, /**/, /**/, int)
@@ -9,59 +9,59 @@ CONTAINER_GENERATE(DEQUE, PUBLIC, d, deque, /**/, /**/, int)
int main(int argc, char const *argv[])
{
list *l = l_new(1000);
stack *s = s_new(1000);
queue *q = q_new(1000);
deque *d = d_new(1000);
list *l = l_new(1000);
stack *s = s_new(1000);
queue *q = q_new(1000);
deque *d = d_new(1000);
for (int i = 1; i < 10001; i++)
{
if (i % 2 == 0)
{
d_push_front(d, i);
l_push_front(l, i);
}
else
{
d_push_back(d, i);
l_push_back(l, i);
}
for (int i = 1; i < 10001; i++)
{
if (i % 2 == 0)
{
d_push_front(d, i);
l_push_front(l, i);
}
else
{
d_push_back(d, i);
l_push_back(l, i);
}
s_push(s, i);
q_enqueue(q, i);
}
s_push(s, i);
q_enqueue(q, i);
}
int sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0;
int sum0 = 0, sum1 = 0, sum2 = 0, sum3 = 0;
FOR_EACH(l, list, , int, l, {
sum0 += var;
})
FOR_EACH(l, list, , int, l, {
sum0 += var;
})
FOR_EACH(s, stack, , int, s, {
sum1 += var;
})
FOR_EACH(s, stack, , int, s, {
sum1 += var;
})
FOR_EACH(q, queue, , int, q, {
sum2 += var;
})
FOR_EACH(q, queue, , int, q, {
sum2 += var;
})
FOR_EACH(d, deque, , int, d, {
sum3 += var;
})
FOR_EACH(d, deque, , int, d, {
sum3 += var;
})
if (sum0 == 50005000)
printf("%10s PASSED\n", "LIST");
if (sum1 == 50005000)
printf("%10s PASSED\n", "STACK");
if (sum2 == 50005000)
printf("%10s PASSED\n", "QUEUE");
if (sum3 == 50005000)
printf("%10s PASSED\n", "DEQUE");
if (sum0 == 50005000)
printf("%10s PASSED\n", "LIST");
if (sum1 == 50005000)
printf("%10s PASSED\n", "STACK");
if (sum2 == 50005000)
printf("%10s PASSED\n", "QUEUE");
if (sum3 == 50005000)
printf("%10s PASSED\n", "DEQUE");
l_free(l);
s_free(s);
q_free(q);
d_free(d);
l_free(l);
s_free(s);
q_free(q);
d_free(d);
return 0;
return 0;
}