Simcllist linked list open source library sorting example program

Simcllist linked list open source library sorting example program

• Sorting will sort the master list, it won't have any separate list for sort.
• Simclist not support the single data place in two list, like one list as master and another list will be sorted one.
• EG for 1 node to be a member of 2 list:
•  linux list.h or bsd's queue.h it is possible to have one node be a member of two lists
• Thus one list is sorted by time and the other list is sorted by something else, like MAC or an order that matches the dpi data.

Program:

/* Simclist sorting by Velraj.K
 * Check : http://velrajcoding.blogspot.in
 */


#include 
#include 
#include 
#include 

#include "../simclist.h"

#include "printlist.c"

#define N       25

void line(char ch)
{
    int i = 0;

    for (i = 0; i < 80; printf("%c", ch), i++);

    printf("\n");

    return;
}
void display_list(list_t *list)
{
    int *temp2 = NULL;
    if (list_size(list) == 0) {
        printf("List is empty\n");
    }


    printf("\n");
    list_iterator_start(list);        /* starting an iteration "session" */
    while (list_iterator_hasnext(list)) { /* tell whether more values available */
        temp2 = list_iterator_next(list);
        printf("%d\n", *temp2);
    }
    list_iterator_stop(list);         /* stop the iteration "session" */

    return;
}


int main() {
    list_t l;
    int i, j, newpos, els[N];

    srandom(time(NULL));
    list_init(&l);

    list_attributes_copy(&l, list_meter_int32_t, 1);
    list_attributes_comparator(&l, list_comparator_int32_t);

    /* generate an unsorted list of values from 0 to N */
    printf("Test 2: random insertions and deletions ... \n");
    fflush(stdout);
    els[0] = 0;
    for (i = 1; i < N; i++) {
        els[i] = i;
        newpos = random() % (i + 1);
        j = els[newpos];
        els[newpos] = i;
        els[i] = j;
    }


    for (i = 0; i < N; i++) {
        list_append(&l, & els[i]);
    }
    line('=');
    printf("Displaying the list:\n");
    display_list(&l);
    printf("Insertion passed.\n");
    line('*');

#if 0
    printf("Test 3: positioning (The Revenge) ... ");
    fflush(stdout);
    for (i = 0; i < N; i++) {
        assert(*(int *)list_get_at(&l, i) == i);
    }
    printf("passed.\n");
#endif

    printf("Test 4: sorting ... ");
    fflush(stdout);
    assert(list_sort(&l, -1) == 0);

    printf("\nDisplaying the list:\n");
    display_list(&l);
    line('*');

    return 0;
}