3
/* http://stackoverflow.com/a/3348142 */
4
static int rand_int(int n)
6
int limit = RAND_MAX - RAND_MAX % n;
11
} while (rnd >= limit);
16
void xbt_dynar_shuffle_in_place(xbt_dynar_t indices_list)
20
for (i = xbt_dynar_length(indices_list) - 1; i > 0; i--) {
22
xbt_dynar_swap_elements(indices_list, int, i, j);
25
/**************************************/
27
/* Allocates and initializes a new xbt_dynar iterator for list, using criteria_fn as iteration criteria
28
criteria_fn: given an array size, it must generate a list containing the indices of every item in some order */
29
xbt_dynar_iterator_t xbt_dynar_iterator_new(xbt_dynar_t list, xbt_dynar_t (*criteria_fn)(int))
31
xbt_dynar_iterator_t it = xbt_new(xbt_dynar_iterator_s, 1);
34
it->length = xbt_dynar_length(list);
35
it->indices_list = criteria_fn(it->length); //xbt_dynar_new(sizeof(int), NULL);
36
it->criteria_fn = criteria_fn;
42
void xbt_dynar_iterator_reset(xbt_dynar_iterator_t it)
44
xbt_dynar_free_container(&(it->indices_list));
45
it->indices_list = it->criteria_fn(it->length);
49
void xbt_dynar_iterator_seek(xbt_dynar_iterator_t it, int pos)
54
/* Returns the next element iterated by iterator it, NULL if there are no more elements */
55
void *xbt_dynar_iterator_next(xbt_dynar_iterator_t it)
58
if (it->current >= it->length) {
61
next = xbt_dynar_get_ptr(it->indices_list, it->current);
63
return xbt_dynar_get_ptr(it->list, *next);
67
void xbt_dynar_iterator_delete(xbt_dynar_iterator_t it)
69
xbt_dynar_free_container(&(it->indices_list));
73
xbt_dynar_t forward_indices_list(int size)
75
xbt_dynar_t indices_list = xbt_dynar_new(sizeof(int), NULL);
77
for (i = 0; i < size; i++)
78
xbt_dynar_push_as(indices_list, int, i);
82
xbt_dynar_t reverse_indices_list(int size)
84
xbt_dynar_t indices_list = xbt_dynar_new(sizeof(int), NULL);
86
for (i = size-1; i >= 0; i--)
87
xbt_dynar_push_as(indices_list, int, i);
91
xbt_dynar_t random_indices_list(int size)
93
xbt_dynar_t indices_list = forward_indices_list(size);
94
xbt_dynar_shuffle_in_place(indices_list);