4 * Time-stamp: <09.11.2004 11:42:19h liekweg>
6 * File name: ir/ana2/qset.c
7 * Purpose: yet another set implementation
10 * Created: Mon 18 Oct 2004
12 * Copyright: (c) 1999-2004 Universität Karlsruhe
13 * Licence: This file is protected by GPL - GNU GENERAL PUBLIC LICENSE.
20 # include <sys/time.h>
27 /* Check whether the given list of sortables is sorted. */
29 static void q_check (sortable_t*, const int);
30 # endif /* defined UNSINN */
31 /* Test whether the given val is among values. Return the index of
32 val in values, or -1. */
33 static int q_test (sortable_t*, const sortable_t, const int);
34 /* Sort n_elems entries in 'values' */
35 static void q_sort (sortable_t*, const int);
37 static __inline__ int sortable_compare (const void *pa, const void *pb)
39 const int a = * (unsigned int*) pa;
40 const int b = * (unsigned int*) pb;
46 return ((a < b) ? -1 : +1);
50 Allocate a list of sortables of the given length.
52 static sortable_t *alloc_list (const int len)
54 sortable_t *values = (sortable_t*) malloc (len * sizeof (sortable_t));
56 memset (values, 0x00, len * sizeof (sortable_t));
63 Create a list of sortables of the given length.
65 static sortable_t *gen_list (const int len)
68 sortable_t *values = alloc_list (len);
70 for (i = 0; i < len; i ++) {
71 values [i] = rand () >> 16;
76 # endif /* defined UNSINN */
79 Helper to q_test --- return the index of val in values, or -1
81 static int _q_test (sortable_t *values,
83 const int lo, const int hi)
87 /* fprintf (stdout, "%s for %d [%i:%i]\n", __FUNCTION__, val, lo, hi); */
90 if (EQUAL (val, values [lo])) {
97 if (COMPARE (val, values [lo])) {
102 if (COMPARE (values [hi], val)) {
109 if (EQUAL (val, values [mid])) {
113 if (COMPARE (val, values [mid])) {
114 return (_q_test (values, val, lo, mid));
116 return (_q_test (values, val, mid+1, hi));
123 static void _q_sort (sortable_t *values, const int lo, const int hi)
129 /* handle base case: */
135 if (COMPARE (values [hi], values [lo])) {
136 sortable_t tmp = values [lo];
137 values [lo] = values [hi];
149 while (p_lo <= p_hi) {
150 if (COMPARE (values [p_lo], pivot)) {
151 values [p_lo-1] = values [p_lo];
155 sortable_t tmp = values [p_lo];
157 values [p_lo] = values [p_hi];
164 values [p_lo-1] = pivot;
166 _q_sort (values, lo, p_lo-1);
167 _q_sort (values, p_lo, hi);
172 Little test harness for q_sort and friends.
174 static void test_qsort (const int n_runs, const int max_elems, const int incr)
179 fprintf (stdout, "# n_elems: q_sort time : libc qsort time\n");
181 while (n_elems <= max_elems) {
185 for (i = 0; i < n_runs; i ++) {
186 sortable_t *list = gen_list (n_elems);
188 timing_t *timing = start_timing ();
189 q_sort (list, n_elems);
190 total += end_timing (timing);
192 q_check (list, n_elems);
197 for (i = 0; i < n_runs; i ++) {
198 sortable_t *list = gen_list (n_elems);
200 timing_t *timing = start_timing ();
201 qsort (list, n_elems, sizeof (sortable_t), sortable_compare);
202 qtotal += end_timing (timing);
204 q_check (list, n_elems);
209 fprintf (stdout, "%d %d %d\n", n_elems, total/n_runs, qtotal/n_runs);
215 fprintf (stdout, "\n");
219 Little test harness for the qset implementation
221 static void test_qset (const int n_entries)
226 qset_t *q1 = qset_new (n_entries);
227 qset_t *q2 = qset_new (n_entries);
230 sortable_t *values = gen_list (n_entries);
232 for (i = 0; i < n_entries; i ++) {
233 qset_insert (q1, values [i]);
234 qset_insert (q2, values [i]);
237 fprintf (stdout, "q1: \t\t");
238 qset_print (q1, stdout);
243 q2->is_sorted = FALSE;
246 fprintf (stdout, "q1 (sorted):\t");
247 qset_print (q1, stdout);
249 assert (qset_compare (q1, q2));
251 q = qset_union (q1, q2);
252 fprintf (stdout, "qq (union):\t");
253 qset_print (q, stdout);
259 fprintf (stdout, "q1.size = %i\n", n1);
260 fprintf (stdout, "q1.slots = %i\n", q1->n_slots);
261 fprintf (stdout, "q2.size = %i\n", n2);
262 fprintf (stdout, "q2.slots = %i\n", q2->n_slots);
263 fprintf (stdout, "q.size = %i\n", n);
264 fprintf (stdout, "q.slots = %i\n", q->n_slots);
269 assert (qset_compare (q1, q2));
270 assert (qset_compare (q2, q));
271 assert (qset_compare (q, q1));
273 for (i = 0; i < n_entries; i ++) {
274 assert (qset_contains (q1, values [i]));
275 assert (qset_contains (q2, values [i]));
276 assert (qset_contains (q, values [i]));
282 fprintf (stdout, "q1.size = %i\n", n1);
283 fprintf (stdout, "q1.slots = %i\n", q1->n_slots);
284 fprintf (stdout, "q2.size = %i\n", n2);
285 fprintf (stdout, "q2.slots = %i\n", q2->n_slots);
286 fprintf (stdout, "q.size = %i\n", n);
287 fprintf (stdout, "q.slots = %i\n", q->n_slots);
289 assert (qset_compare (q1, q2));
290 assert (qset_compare (q2, q));
291 assert (qset_compare (q, q1));
293 for (i = 0; i < n_entries; i ++) {
294 assert (qset_contains (q1, values [i]));
295 assert (qset_contains (q2, values [i]));
296 assert (qset_contains (q, values [i]));
303 # endif /* defned UNSINN */
305 /* PRIVATE QSET IMPLEMENTATION */
307 Resize a qset to (at least) the given size.
309 static void qset_resize (qset_t *qset, const int n_slots)
312 sortable_t *values = NULL;
314 if (qset->n_slots >= n_slots) {
318 new_size = qset->n_slots;
320 while (new_size < n_slots) {
324 values = alloc_list (new_size);
326 memcpy (values, qset->values, qset->n_elems * sizeof (sortable_t));
327 memset (qset->values, 0x00, qset->n_elems * sizeof (sortable_t)); /* debug only */
330 qset->values = values;
331 qset->n_slots = new_size;
335 Print a list of sortables.
337 static void q_print (sortable_t *values, const int n_values, FILE *stream)
341 fprintf (stream, "{");
343 for (i = 0; i < n_values; i ++) {
344 if (0 == values [i]) {
345 fprintf (stream, "_");
347 fprintf (stream, "0x08%x", (int) values [i]);
350 if (i + 1 != n_values) {
351 fprintf (stream, ", ");
355 fprintf (stream, "}\n");
360 Check whether the given list of sortables is sorted.
362 static void q_check (sortable_t *values, const int n_values)
366 for (i = 1; i < n_values; i ++) {
367 assert (COMPARE (values [i-1], values [i]) ||
368 EQUAL (values [i-1], values [i]));
371 for (i = 1; i < n_values; i ++) {
372 assert (-1 != q_test (values, values [i], n_values));
375 # endif /* defined UNSINN */
378 Test whether the given val is among values. Return the lowest index of val
381 static int q_test (sortable_t *values, const sortable_t val, const int n_elems)
383 int idx = _q_test (values, val, 0, n_elems-1);
385 while ((0 <= idx-1) && EQUAL (values [idx], val)) {
393 Sort entries in 'values' from index 'lo' to 'hi' (inclusive)
395 static void q_sort (sortable_t *values, const int n_elems)
397 _q_sort (values, 0, n_elems-1);
401 Merge two sorted lists. Keep duplicates (if present)
403 static sortable_t *q_merge (sortable_t *list1, const int n1_elems,
404 sortable_t *list2, const int n2_elems)
406 const int n_elems = n1_elems + n2_elems;
407 sortable_t *res = alloc_list (n_elems);
413 while ((i < n_elems) && (i1 < n1_elems) && (i2 < n2_elems)) {
414 if (COMPARE (list1 [i1], list2 [i2])) {
415 res [i ++] = list1 [i1 ++];
417 res [i ++] = list2 [i2 ++];
421 while (i1 < n1_elems) {
422 res [i ++] = list1 [i1 ++];
425 while (i2 < n2_elems) {
426 res [i ++] = list2 [i2 ++];
432 /* PUBLIC INTERFACE */
435 Allocate a new qset with initial space for up to n_elems.
437 qset_t *qset_new (const int n_elems)
439 qset_t *qset = (qset_t*) malloc (sizeof (qset_t));
441 qset->values = alloc_list (n_elems);
442 memset (qset->values, 0x00, n_elems * sizeof (sortable_t));
444 qset->n_slots = n_elems;
446 qset->is_sorted = FALSE;
452 Sort the entries of the given qset.
454 void qset_sort (qset_t *qset)
459 if (qset->is_sorted) {
463 q_sort (qset->values, qset->n_elems);
465 for (i = 1; i < qset->n_elems; i ++) {
466 if (! EQUAL (qset->values [i], qset->values [occ])) {
467 qset->values [++ occ] = qset->values [i];
474 if (qset->n_elems != occ) {
475 fprintf (stdout, "removed %i duplicates\n", qset->n_elems - occ);
480 qset->is_sorted = TRUE;
484 Compact a qset to take up no more space than required.
486 void qset_compact (qset_t *qset)
488 sortable_t *values = (sortable_t*) malloc (qset->n_elems * sizeof (sortable_t));
489 memcpy (values, qset->values, qset->n_elems * sizeof (sortable_t));
491 memset (qset->values, 0x00, qset->n_elems * sizeof (sortable_t));
494 qset->values = values;
495 qset->n_slots = qset->n_elems;
499 Free the memory associated with the given qset
501 void qset_delete (qset_t *qset)
503 memset (qset->values, 0x00, qset->n_elems * sizeof (sortable_t));
506 memset (qset, 0x00, sizeof (qset_t));
512 Test wether the given qset contains the given value.
514 int qset_contains (qset_t *qset, sortable_t val)
518 return (-1 != q_test (qset->values, val, qset->n_elems));
522 Delete the given value from the given qset (if it exists)
524 void qset_remove (qset_t *qset, sortable_t val)
532 idx = q_test (qset->values, val, qset->n_elems);
538 while (EQUAL (qset->values [idx + occ], val)) {
542 for (i = idx; i < qset->n_elems - occ; i ++) {
543 qset->values [i] = qset->values [i+occ];
546 qset->n_elems -= occ;
550 Insert the given elem into the given qset.
552 void qset_insert (qset_t *qset, sortable_t val)
555 const int n_elems = qset->n_elems;
557 /* todo: sort, find */
560 for (i = 0; i < n_elems; i ++) {
561 if (EQUAL (val, qset->values [i])) {
566 qset_resize (qset, qset->n_elems+1);
568 qset->values [qset->n_elems++] = val;
569 qset->is_sorted = FALSE;
573 Insert all elems of qset2 into qset1. qset2 is *not* deleted.
575 void qset_insert_all (qset_t *qset1, qset_t *qset2)
577 sortable_t *values = qset1->values;
578 const int n_elems = qset1->n_slots;
583 qset1->values = q_merge (qset1->values, qset1->n_elems,
584 qset2->values, qset2->n_elems);
586 qset1->n_elems = qset1->n_elems + qset2->n_elems;
587 qset1->n_slots = qset1->n_elems;
591 memset (values, 0x00, n_elems * sizeof (sortable_t));
598 int qset_compare (qset_t *qset1, qset_t *qset2)
601 const int n_elems = qset1->n_elems;
606 if (qset1->n_elems != qset2->n_elems) {
610 for (i = 0; i < n_elems; i ++) {
611 if (qset1->values [i] != qset2->values [i]) {
620 Returns the union of two qsets.
622 qset_t *qset_union (qset_t *qset1, qset_t *qset2)
624 qset_t *qset = (qset_t*) malloc (sizeof (qset_t));
625 const int n_elems = qset1->n_elems + qset2->n_elems;
627 qset->values = alloc_list (n_elems);
629 memcpy (qset->values, qset1->values,
630 qset1->n_elems * sizeof (sortable_t));
632 memcpy (qset->values+qset1->n_elems,
633 qset2->values, qset2->n_elems * sizeof (sortable_t));
635 qset->n_elems = n_elems;
636 qset->n_slots = qset->n_elems;
644 Report the size of the given qset.
646 int qset_size (qset_t *qset)
648 return (qset->n_elems);
652 Print the given qset to the given stream.
654 void qset_print (qset_t *qset, FILE *stream)
656 q_print (qset->values, qset->n_elems, stream);
660 Check wether the given qset is empty
662 int qset_is_empty (qset_t *qset)
664 return (0 == qset->n_elems);
668 Initialise a new iteration over a qset
670 sortable_t *qset_start (qset_t *qset)
674 return (qset_next (qset)); /* works for empty sets, too */
678 Step to the next element
680 sortable_t *qset_next (qset_t *qset)
682 if (qset->n_elems == qset->cursor) {
686 return (qset->values [qset->cursor++]);
691 int qset_test_main (int argc, char **argv)
696 if (-1 == gettimeofday (&tp, NULL)) {
697 perror ("gettimeofday");
701 seed = (unsigned int) tp.tv_usec;
704 /* test_qsort (20, 1000000, 100000); */
706 test_qset (atoi (argv [1]));
710 # endif /* defined UNSINN */
714 Revision 1.3 2004/11/09 16:45:36 liekweg
717 Revision 1.2 2004/11/08 12:32:00 liekweg
718 Moved q_* methods into private section
720 Revision 1.1 2004/11/04 14:55:13 liekweg