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;
40 void xbt_dynar_iterator_reset(xbt_dynar_iterator_t it)
42 xbt_dynar_free_container(&(it->indices_list));
43 it->indices_list = it->criteria_fn(it->length);
47 void xbt_dynar_iterator_seek(xbt_dynar_iterator_t it, int pos)
52 /* Returns the next element iterated by iterator it, NULL if there are no more elements */
53 void *xbt_dynar_iterator_next(xbt_dynar_iterator_t it)
56 if (it->current >= it->length) {
59 next = xbt_dynar_get_ptr(it->indices_list, it->current);
61 return xbt_dynar_get_ptr(it->list, *next);
65 void xbt_dynar_iterator_delete(xbt_dynar_iterator_t it)
67 xbt_dynar_free_container(&(it->indices_list));
71 xbt_dynar_t forward_indices_list(int size)
73 xbt_dynar_t indices_list = xbt_dynar_new(sizeof(int), NULL);
75 for (i = 0; i < size; i++)
76 xbt_dynar_push_as(indices_list, int, i);
80 xbt_dynar_t reverse_indices_list(int size)
82 xbt_dynar_t indices_list = xbt_dynar_new(sizeof(int), NULL);
84 for (i = size-1; i >= 0; i--)
85 xbt_dynar_push_as(indices_list, int, i);
89 xbt_dynar_t random_indices_list(int size)
91 xbt_dynar_t indices_list = forward_indices_list(size);
92 xbt_dynar_shuffle_in_place(indices_list);