Hash :
fadc8073
Author :
Thomas de Grivel
Date :
2023-01-25T10:24:29
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59
/* c3
* Copyright 2022,2023 kmx.io <contact@kmx.io>
*
* Permission is hereby granted to use this software excepted
* on Apple computers granted the above copyright notice and
* this permission paragraph are included in all copies and
* substantial portions of this software.
*
* THIS SOFTWARE IS PROVIDED "AS-IS" WITHOUT ANY GUARANTEE OF
* PURPOSE AND PERFORMANCE. IN NO EVENT WHATSOEVER SHALL THE
* AUTHOR BE CONSIDERED LIABLE FOR THE USE AND PERFORMANCE OF
* THIS SOFTWARE.
*/
/* Gen from set_cursor.c.in NAME=_NAME$ TYPE=_TYPE$ */
#include <assert.h>
#include <stdlib.h>
#include "types.h"
void
set_cursor_init___NAME$ (s_set___NAME$ *set, s_set_cursor___NAME$ *c)
{
assert(set);
assert(c);
c->set = set;
c->i = 0;
c->item = NULL;
c->count = 0;
}
static s_set_item___NAME$ *
set_cursor_next_index___NAME$ (s_set_cursor___NAME$ *c)
{
assert(c);
assert(c->set);
while (c->i < c->set->max &&
! c->item) {
c->item = c->set->items[c->i];
c->i++;
}
if (c->item) {
c->count++;
return c->item;
}
return NULL;
}
s_set_item___NAME$ *
set_cursor_next___NAME$ (s_set_cursor___NAME$ *c)
{
assert(c);
if (c->count == c->set->count)
return NULL;
if (c->item)
c->item = c->item->next;
if (!c->item)
return set_cursor_next_index___NAME$(c);
c->count++;
return c->item;
}