admin/C-Macro-Collections
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Updating linkedlist iterator

Browse Source
This commit is contained in:
Leonardo committed 2020-05-09 09:16:51 -03:00
1 parent 2f59d5fcaf
commit 8fc432b76c
3 files changed
+522 -103
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

src/cmc/linkedlist.h
+39 -56
View File
@@ -202,17 +202,15 @@ static const char *cmc_string_fmt_linkedlist = "struct %s<%s> "
struct SNAME##_node *PFX##_prev_node(struct SNAME##_node *_node_); \
\
/* Iterator Functions */ \
/* Iterator Allocation and Deallocation */ \
struct SNAME##_iter *PFX##_iter_new(struct SNAME *target); \
void PFX##_iter_free(struct SNAME##_iter *iter); \
/* Iterator Initialization */ \
void PFX##_iter_init(struct SNAME##_iter *iter, struct SNAME *target); \
struct SNAME##_iter PFX##_iter_start(struct SNAME *target); \
struct SNAME##_iter PFX##_iter_end(struct SNAME *target); \
/* Iterator State */ \
bool PFX##_iter_start(struct SNAME##_iter *iter); \
bool PFX##_iter_end(struct SNAME##_iter *iter); \
bool PFX##_iter_at_start(struct SNAME##_iter *iter); \
bool PFX##_iter_at_end(struct SNAME##_iter *iter); \
/* Iterator Movement */ \
void PFX##_iter_to_start(struct SNAME##_iter *iter); \
void PFX##_iter_to_end(struct SNAME##_iter *iter); \
bool PFX##_iter_to_start(struct SNAME##_iter *iter); \
bool PFX##_iter_to_end(struct SNAME##_iter *iter); \
bool PFX##_iter_next(struct SNAME##_iter *iter); \
bool PFX##_iter_prev(struct SNAME##_iter *iter); \
bool PFX##_iter_advance(struct SNAME##_iter *iter, size_t steps); \
@@ -230,8 +228,7 @@ static const char *cmc_string_fmt_linkedlist = "struct %s<%s> "
#define CMC_GENERATE_LINKEDLIST_SOURCE(PFX, SNAME, V) \
\
/* Implementation Detail Functions */ \
static struct SNAME##_iter PFX##_impl_it_start(struct SNAME *_list_); \
static struct SNAME##_iter PFX##_impl_it_end(struct SNAME *_list_); \
/* None */ \
\
struct SNAME *PFX##_new(struct SNAME##_fval *f_val) \
{ \
@@ -252,8 +249,6 @@ static const char *cmc_string_fmt_linkedlist = "struct %s<%s> "
_list_->f_val = f_val; \
_list_->alloc = alloc; \
_list_->callbacks = NULL; \
_list_->it_start = PFX##_impl_it_start; \
_list_->it_end = PFX##_impl_it_end; \
\
return _list_; \
} \
@@ -280,8 +275,6 @@ static const char *cmc_string_fmt_linkedlist = "struct %s<%s> "
_list_->f_val = f_val; \
_list_->alloc = alloc; \
_list_->callbacks = callbacks; \
_list_->it_start = PFX##_impl_it_start; \
_list_->it_end = PFX##_impl_it_end; \
\
return _list_; \
} \
@@ -935,44 +928,46 @@ static const char *cmc_string_fmt_linkedlist = "struct %s<%s> "
return _node_->prev; \
} \
\
struct SNAME##_iter *PFX##_iter_new(struct SNAME *target) \
struct SNAME##_iter PFX##_iter_start(struct SNAME *target) \
{ \
struct SNAME##_iter *iter = \
target->alloc->malloc(sizeof(struct SNAME##_iter)); \
struct SNAME##_iter iter; \
\
if (!iter) \
return NULL; \
\
PFX##_iter_init(iter, target); \
iter.target = target; \
iter.cursor = target->head; \
iter.index = 0; \
iter.start = true; \
iter.end = PFX##_empty(target); \
\
return iter; \
} \
\
void PFX##_iter_free(struct SNAME##_iter *iter) \
struct SNAME##_iter PFX##_iter_end(struct SNAME *target) \
{ \
iter->target->alloc->free(iter); \
struct SNAME##_iter iter; \
\
iter.target = target; \
iter.cursor = target->tail; \
iter.index = 0; \
iter.start = PFX##_empty(target); \
iter.end = true; \
\
if (!PFX##_empty(target)) \
iter.index = target->count - 1; \
\
return iter; \
} \
\
void PFX##_iter_init(struct SNAME##_iter *iter, struct SNAME *target) \
{ \
iter->target = target; \
iter->cursor = target->head; \
iter->index = 0; \
iter->start = true; \
iter->end = PFX##_empty(target); \
} \
\
bool PFX##_iter_start(struct SNAME##_iter *iter) \
bool PFX##_iter_at_start(struct SNAME##_iter *iter) \
{ \
return PFX##_empty(iter->target) || iter->start; \
} \
\
bool PFX##_iter_end(struct SNAME##_iter *iter) \
bool PFX##_iter_at_end(struct SNAME##_iter *iter) \
{ \
return PFX##_empty(iter->target) || iter->end; \
} \
\
void PFX##_iter_to_start(struct SNAME##_iter *iter) \
bool PFX##_iter_to_start(struct SNAME##_iter *iter) \
{ \
if (!PFX##_empty(iter->target)) \
{ \
@@ -980,10 +975,14 @@ static const char *cmc_string_fmt_linkedlist = "struct %s<%s> "
iter->index = 0; \
iter->start = true; \
iter->end = PFX##_empty(iter->target); \
\
return true; \
} \
\
return false; \
} \
\
void PFX##_iter_to_end(struct SNAME##_iter *iter) \
bool PFX##_iter_to_end(struct SNAME##_iter *iter) \
{ \
if (!PFX##_empty(iter->target)) \
{ \
@@ -991,7 +990,11 @@ static const char *cmc_string_fmt_linkedlist = "struct %s<%s> "
iter->index = iter->target->count - 1; \
iter->start = PFX##_empty(iter->target); \
iter->end = true; \
\
return true; \
} \
\
return false; \
} \
\
bool PFX##_iter_next(struct SNAME##_iter *iter) \
@@ -1121,26 +1124,6 @@ static const char *cmc_string_fmt_linkedlist = "struct %s<%s> "
struct SNAME##_node *PFX##_iter_node(struct SNAME##_iter *iter) \
{ \
return iter->cursor; \
} \
\
static struct SNAME##_iter PFX##_impl_it_start(struct SNAME *_list_) \
{ \
struct SNAME##_iter iter; \
\
PFX##_iter_init(&iter, _list_); \
PFX##_iter_to_start(&iter); \
\
return iter; \
} \
\
static struct SNAME##_iter PFX##_impl_it_end(struct SNAME *_list_) \
{ \
struct SNAME##_iter iter; \
\
PFX##_iter_init(&iter, _list_); \
PFX##_iter_to_end(&iter); \
\
return iter; \
}
#endif /* CMC_LINKEDLIST_H */
tests/main/src/linkedlist.c
+31 -47
View File
@@ -75,13 +75,12 @@ _Bool ll_del_curr(struct linkedlist *_owner_, struct linkedlist_node *_node_);
_Bool ll_del_prev(struct linkedlist *_owner_, struct linkedlist_node *_node_);
struct linkedlist_node *ll_next_node(struct linkedlist_node *_node_);
struct linkedlist_node *ll_prev_node(struct linkedlist_node *_node_);
struct linkedlist_iter *ll_iter_new(struct linkedlist *target);
void ll_iter_free(struct linkedlist_iter *iter);
void ll_iter_init(struct linkedlist_iter *iter, struct linkedlist *target);
_Bool ll_iter_start(struct linkedlist_iter *iter);
_Bool ll_iter_end(struct linkedlist_iter *iter);
void ll_iter_to_start(struct linkedlist_iter *iter);
void ll_iter_to_end(struct linkedlist_iter *iter);
struct linkedlist_iter ll_iter_start(struct linkedlist *target);
struct linkedlist_iter ll_iter_end(struct linkedlist *target);
_Bool ll_iter_at_start(struct linkedlist_iter *iter);
_Bool ll_iter_at_end(struct linkedlist_iter *iter);
_Bool ll_iter_to_start(struct linkedlist_iter *iter);
_Bool ll_iter_to_end(struct linkedlist_iter *iter);
_Bool ll_iter_next(struct linkedlist_iter *iter);
_Bool ll_iter_prev(struct linkedlist_iter *iter);
_Bool ll_iter_advance(struct linkedlist_iter *iter, size_t steps);
@@ -91,8 +90,6 @@ size_t ll_iter_value(struct linkedlist_iter *iter);
size_t *ll_iter_rvalue(struct linkedlist_iter *iter);
size_t ll_iter_index(struct linkedlist_iter *iter);
struct linkedlist_node *ll_iter_node(struct linkedlist_iter *iter);
static struct linkedlist_iter ll_impl_it_start(struct linkedlist *_list_);
static struct linkedlist_iter ll_impl_it_end(struct linkedlist *_list_);
struct linkedlist *ll_new(struct linkedlist_fval *f_val)
{
if (!f_val)
@@ -108,8 +105,6 @@ struct linkedlist *ll_new(struct linkedlist_fval *f_val)
_list_->f_val = f_val;
_list_->alloc = alloc;
_list_->callbacks = ((void *)0);
_list_->it_start = ll_impl_it_start;
_list_->it_end = ll_impl_it_end;
return _list_;
}
struct linkedlist *ll_new_custom(struct linkedlist_fval *f_val,
@@ -130,8 +125,6 @@ struct linkedlist *ll_new_custom(struct linkedlist_fval *f_val,
_list_->f_val = f_val;
_list_->alloc = alloc;
_list_->callbacks = callbacks;
_list_->it_start = ll_impl_it_start;
_list_->it_end = ll_impl_it_end;
return _list_;
}
void ll_clear(struct linkedlist *_list_)
@@ -623,36 +616,37 @@ struct linkedlist_node *ll_prev_node(struct linkedlist_node *_node_)
{
return _node_->prev;
}
struct linkedlist_iter *ll_iter_new(struct linkedlist *target)
struct linkedlist_iter ll_iter_start(struct linkedlist *target)
{
struct linkedlist_iter *iter =
target->alloc->malloc(sizeof(struct linkedlist_iter));
if (!iter)
return ((void *)0);
ll_iter_init(iter, target);
struct linkedlist_iter iter;
iter.target = target;
iter.cursor = target->head;
iter.index = 0;
iter.start = 1;
iter.end = ll_empty(target);
return iter;
}
void ll_iter_free(struct linkedlist_iter *iter)
struct linkedlist_iter ll_iter_end(struct linkedlist *target)
{
iter->target->alloc->free(iter);
struct linkedlist_iter iter;
iter.target = target;
iter.cursor = target->tail;
iter.index = 0;
iter.start = ll_empty(target);
iter.end = 1;
if (!ll_empty(target))
iter.index = target->count - 1;
return iter;
}
void ll_iter_init(struct linkedlist_iter *iter, struct linkedlist *target)
{
iter->target = target;
iter->cursor = target->head;
iter->index = 0;
iter->start = 1;
iter->end = ll_empty(target);
}
_Bool ll_iter_start(struct linkedlist_iter *iter)
_Bool ll_iter_at_start(struct linkedlist_iter *iter)
{
return ll_empty(iter->target) || iter->start;
}
_Bool ll_iter_end(struct linkedlist_iter *iter)
_Bool ll_iter_at_end(struct linkedlist_iter *iter)
{
return ll_empty(iter->target) || iter->end;
}
void ll_iter_to_start(struct linkedlist_iter *iter)
_Bool ll_iter_to_start(struct linkedlist_iter *iter)
{
if (!ll_empty(iter->target))
{
@@ -660,9 +654,11 @@ void ll_iter_to_start(struct linkedlist_iter *iter)
iter->index = 0;
iter->start = 1;
iter->end = ll_empty(iter->target);
return 1;
}
return 0;
}
void ll_iter_to_end(struct linkedlist_iter *iter)
_Bool ll_iter_to_end(struct linkedlist_iter *iter)
{
if (!ll_empty(iter->target))
{
@@ -670,7 +666,9 @@ void ll_iter_to_end(struct linkedlist_iter *iter)
iter->index = iter->target->count - 1;
iter->start = ll_empty(iter->target);
iter->end = 1;
return 1;
}
return 0;
}
_Bool ll_iter_next(struct linkedlist_iter *iter)
{
@@ -764,17 +762,3 @@ struct linkedlist_node *ll_iter_node(struct linkedlist_iter *iter)
{
return iter->cursor;
}
static struct linkedlist_iter ll_impl_it_start(struct linkedlist *_list_)
{
struct linkedlist_iter iter;
ll_iter_init(&iter, _list_);
ll_iter_to_start(&iter);
return iter;
}
static struct linkedlist_iter ll_impl_it_end(struct linkedlist *_list_)
{
struct linkedlist_iter iter;
ll_iter_init(&iter, _list_);
ll_iter_to_end(&iter);
return iter;
}
tests/main/unt/linkedlist.c
+452
View File
@@ -344,7 +344,459 @@ CMC_CREATE_UNIT(LinkedList, true, {
});
CMC_CREATE_UNIT(LinkedListIter, true, {
CMC_CREATE_TEST(PFX##_iter_start(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_start(ll);
cmc_assert_equals(ptr, ll, it.target);
cmc_assert_equals(ptr, NULL, it.cursor);
cmc_assert_equals(size_t, 0, it.index);
cmc_assert_equals(bool, true, it.start);
cmc_assert_equals(bool, true, it.end);
cmc_assert(ll_iter_at_start(&it));
cmc_assert(ll_iter_at_end(&it));
cmc_assert(ll_push_front(ll, 1));
cmc_assert(ll_push_front(ll, 2));
it = ll_iter_start(ll);
cmc_assert_equals(size_t, 0, it.index);
cmc_assert_equals(bool, false, it.end);
cmc_assert_equals(ptr, ll->head, it.cursor);
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_end(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_end(ll);
cmc_assert_equals(ptr, ll, it.target);
cmc_assert_equals(ptr, NULL, it.cursor);
cmc_assert_equals(size_t, 0, it.index);
cmc_assert_equals(bool, true, it.start);
cmc_assert_equals(bool, true, it.end);
cmc_assert(ll_iter_at_start(&it));
cmc_assert(ll_iter_at_end(&it));
cmc_assert(ll_push_back(ll, 1));
cmc_assert(ll_push_back(ll, 2));
cmc_assert(ll_push_back(ll, 3));
it = ll_iter_end(ll);
cmc_assert_equals(size_t, ll->count - 1, it.index);
cmc_assert_equals(ptr, ll->tail, it.cursor);
cmc_assert_equals(bool, false, it.start);
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_at_start(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_start(ll);
// Empty checks
cmc_assert(ll_iter_at_start(&it));
it = ll_iter_end(ll);
cmc_assert(ll_iter_at_start(&it));
// Non-empty checks
cmc_assert(ll_push_back(ll, 1));
it = ll_iter_end(ll);
cmc_assert(!ll_iter_at_start(&it));
it = ll_iter_start(ll);
cmc_assert(ll_iter_at_start(&it));
ll_clear(ll);
cmc_assert(ll_push_front(ll, 1));
it = ll_iter_end(ll);
cmc_assert(!ll_iter_at_start(&it));
it = ll_iter_start(ll);
cmc_assert(ll_iter_at_start(&it));
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_at_end(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_start(ll);
// Empty check
cmc_assert(ll_iter_at_end(&it));
it = ll_iter_end(ll);
cmc_assert(ll_iter_at_end(&it));
// Non-empty checks
cmc_assert(ll_push_back(ll, 1));
it = ll_iter_end(ll);
cmc_assert(ll_iter_at_end(&it));
it = ll_iter_start(ll);
cmc_assert(!ll_iter_at_end(&it));
ll_clear(ll);
cmc_assert(ll_push_front(ll, 1));
it = ll_iter_end(ll);
cmc_assert(ll_iter_at_end(&it));
it = ll_iter_start(ll);
cmc_assert(!ll_iter_at_end(&it));
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_to_start(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_start(ll);
cmc_assert(!ll_iter_to_start(&it));
for (size_t i = 1; i <= 100; i++)
{
if (i % 2 == 0)
ll_push_back(ll, i);
else
ll_push_front(ll, i);
}
cmc_assert_equals(size_t, 100, ll->count);
it = ll_iter_end(ll);
cmc_assert(!ll_iter_at_start(&it));
cmc_assert(ll_iter_at_end(&it));
cmc_assert_equals(size_t, 100, ll_iter_value(&it));
cmc_assert(ll_iter_to_start(&it));
cmc_assert(ll_iter_at_start(&it));
cmc_assert(!ll_iter_at_end(&it));
cmc_assert_equals(size_t, 99, ll_iter_value(&it));
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_to_end(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_end(ll);
cmc_assert(!ll_iter_to_end(&it));
for (size_t i = 1; i <= 100; i++)
{
if (i % 2 == 0)
ll_push_back(ll, i);
else
ll_push_front(ll, i);
}
it = ll_iter_start(ll);
cmc_assert(ll_iter_at_start(&it));
cmc_assert(!ll_iter_at_end(&it));
cmc_assert_equals(size_t, 99, ll_iter_value(&it));
cmc_assert(ll_iter_to_end(&it));
cmc_assert(!ll_iter_at_start(&it));
cmc_assert(ll_iter_at_end(&it));
cmc_assert_equals(size_t, 100, ll_iter_value(&it));
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_next(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_start(ll);
cmc_assert(!ll_iter_next(&it));
for (size_t i = 1; i <= 1000; i++)
{
if (i % 2 == 0)
ll_push_back(ll, i);
else
ll_push_front(ll, i);
}
size_t sum = 0;
for (it = ll_iter_start(ll); !ll_iter_at_end(&it); ll_iter_next(&it))
{
sum += ll_iter_value(&it);
}
cmc_assert_equals(size_t, 500500, sum);
sum = 0;
ll_iter_to_start(&it);
do
{
sum += ll_iter_value(&it);
} while (ll_iter_next(&it));
cmc_assert_equals(size_t, 500500, sum);
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_prev(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_end(ll);
cmc_assert(!ll_iter_prev(&it));
for (size_t i = 1; i <= 1000; i++)
{
if (i % 2 == 0)
ll_push_back(ll, i);
else
ll_push_front(ll, i);
}
size_t sum = 0;
for (it = ll_iter_end(ll); !ll_iter_at_start(&it); ll_iter_prev(&it))
{
sum += ll_iter_value(&it);
}
cmc_assert_equals(size_t, 500500, sum);
sum = 0;
ll_iter_to_end(&it);
do
{
sum += ll_iter_value(&it);
} while (ll_iter_prev(&it));
cmc_assert_equals(size_t, 500500, sum);
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_advance(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_start(ll);
cmc_assert(!ll_iter_advance(&it, 1));
for (size_t i = 0; i <= 1000; i++)
{
if (i % 2 == 0)
ll_push_back(ll, i); // will sum all even numbers
else
ll_push_back(ll, 0);
}
it = ll_iter_start(ll);
cmc_assert(!ll_iter_advance(&it, 0));
cmc_assert(!ll_iter_advance(&it, ll->count));
size_t sum = 0;
for (it = ll_iter_start(ll);;)
{
sum += ll_iter_value(&it);
if (!ll_iter_advance(&it, 2))
break;
}
cmc_assert_equals(size_t, 250500, sum);
ll_iter_to_start(&it);
cmc_assert(ll_iter_advance(&it, ll->count - 1));
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_rewind(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_end(ll);
cmc_assert(!ll_iter_rewind(&it, 1));
for (size_t i = 0; i <= 1000; i++)
{
if (i % 2 == 0)
ll_push_front(ll, i); // will sum all even numbers
else
ll_push_front(ll, 0);
}
it = ll_iter_end(ll);
cmc_assert(!ll_iter_rewind(&it, 0));
cmc_assert(!ll_iter_rewind(&it, ll->count));
size_t sum = 0;
for (it = ll_iter_end(ll);;)
{
sum += ll_iter_value(&it);
if (!ll_iter_rewind(&it, 2))
break;
}
cmc_assert_equals(size_t, 250500, sum);
ll_iter_to_end(&it);
cmc_assert(ll_iter_rewind(&it, ll->count - 1));
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_go_to(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_end(ll);
cmc_assert(!ll_iter_go_to(&it, 0));
it = ll_iter_start(ll);
cmc_assert(!ll_iter_go_to(&it, 0));
for (size_t i = 0; i <= 1000; i++)
ll_push_back(ll, i);
it = ll_iter_start(ll);
size_t sum = 0;
for (size_t i = 0; i < 1001; i++)
{
ll_iter_go_to(&it, i);
sum += ll_iter_value(&it);
}
cmc_assert_equals(size_t, 500500, sum);
sum = 0;
for (size_t i = 1001; i > 0; i--)
{
cmc_assert(ll_iter_go_to(&it, i - 1));
sum += ll_iter_value(&it);
}
cmc_assert_equals(size_t, 500500, sum);
sum = 0;
for (size_t i = 0; i < 1001; i += 100)
{
cmc_assert(ll_iter_go_to(&it, i));
cmc_assert_equals(size_t, i, ll_iter_index(&it));
sum += ll_iter_value(&it);
}
cmc_assert_equals(size_t, 5500, sum);
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_value(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_end(ll);
cmc_assert_equals(size_t, (size_t){ 0 }, ll_iter_value(&it));
cmc_assert(ll_push_back(ll, 10));
it = ll_iter_start(ll);
cmc_assert_equals(size_t, 10, ll_iter_value(&it));
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_rvalue(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
struct linkedlist_iter it = ll_iter_end(ll);
cmc_assert_equals(ptr, NULL, ll_iter_rvalue(&it));
cmc_assert(ll_push_back(ll, 10));
it = ll_iter_start(ll);
cmc_assert_not_equals(ptr, NULL, ll_iter_rvalue(&it));
cmc_assert_equals(size_t, 10, *ll_iter_rvalue(&it));
ll_free(ll);
});
CMC_CREATE_TEST(PFX##_iter_index(), {
struct linkedlist *ll = ll_new(ll_fval);
cmc_assert_not_equals(ptr, NULL, ll);
for (size_t i = 0; i <= 1000; i++)
ll_push_back(ll, i);
struct linkedlist_iter it = ll_iter_start(ll);
for (size_t i = 0; i < 1001; i++)
{
cmc_assert_equals(size_t, i, ll_iter_index(&it));
ll_iter_next(&it);
}
it = ll_iter_end(ll);
for (size_t i = 1001; i > 0; i--)
{
cmc_assert_equals(size_t, i - 1, ll_iter_index(&it));
ll_iter_prev(&it);
}
ll_free(ll);
});
});
#ifdef CMC_TEST_MAIN