// this function could only be called when the "nonlinear queue" is established
void setSparseGVarientTableMonte(SparseGVarientTableMonte *dest, const SparseGVarientTable *src,const NonlinearMonteList *list)
{
int i,j;
SparseGControlInfo *current;
for(i=0;i<src->totalRow;i++)
{
current = src->rowIndex[i];
while(current!=NULL)
{
const int queueSize = gdsl_queue_get_size(current->queue);
for(j=0;j<queueSize;j++)
{
const GControlInfo *element = gdsl_queue_search_by_position(current->queue,j);
GControlInfoMonte *monteElement = createGControlInfoMonte(element->vdsListSize,element->vgsListSize);
setGControlInfoMonte(monteElement,element,list);
insertSparseGVarientTableMonte(dest,monteElement,current->row,current->col);
}
current = current->rowLink;
}
}
}
int main (void)
{
int choice = 0;
gdsl_queue_t q = gdsl_queue_alloc ("Q", alloc_integer, free_integer);
do
{
printf ("\t\tMENU - QUEUE\n\n");
printf ("\t1> Put\n");
printf ("\t2> Pop\n");
printf ("\t3> Get Head\n");
printf ("\t4> Get Tail\n");
printf ("\t5> Flush\n");
printf ("\t6> Search\n");
printf ("\t7> Display\n");
printf ("\t8> Dump\n");
printf ("\t9> XML display\n");
printf ("\t0> Quit\n\n" );
printf ("\t\tYour choice: " );
scanf ("%d", &choice );
switch (choice)
{
case 1:
{
int value;
printf ("Enter an integer value: ");
scanf ("%d", &value);
gdsl_queue_insert (q, (void*) &value);
}
break;
case 2:
if (!gdsl_queue_is_empty (q))
{
int* value = (int*) gdsl_queue_remove (q);
printf ("Value: %d\n", *value);
free_integer (value);
}
else
{
printf ("The queue '%s' is empty\n", gdsl_queue_get_name (q));
}
break;
case 3:
{
if (!gdsl_queue_is_empty (q))
{
int head = *(int*) gdsl_queue_get_head (q);
printf ("Head = %d\n", head);
}
else
{
printf ("The queue '%s' is empty\n", gdsl_queue_get_name (q));
}
}
break;
case 4:
{
if (!gdsl_queue_is_empty (q))
{
int tail = *(int*) gdsl_queue_get_tail (q);
printf ("Tail = %d\n", tail);
}
else
{
printf ("The queue '%s' is empty\n", gdsl_queue_get_name (q));
}
}
break;
case 5:
if (gdsl_queue_is_empty (q))
{
printf ("The queue '%s' is empty\n", gdsl_queue_get_name (q));
}
else
{
gdsl_queue_flush (q);
}
break;
case 6:
{
int pos;
int* value;
printf ("Enter an integer value to search an element by its position: ");
scanf ("%d", &pos);
value = (int*) gdsl_queue_search_by_position (q, pos);
if (value != NULL)
{
printf ("Value found at position %d = %d\n", pos, *value);
}
}
break;
case 7:
if (gdsl_queue_is_empty (q))
{
printf ("The queue '%s' is empty\n", gdsl_queue_get_name (q));
}
else
{
printf ("%s = ", gdsl_queue_get_name (q));
gdsl_queue_map_forward (q, my_display_integer, NULL);
}
break;
case 8:
gdsl_queue_dump (q, my_write_integer, stdout, NULL);
break;
case 9:
gdsl_queue_write_xml (q, my_write_integer, stdout, NULL);
break;
}
}
while (choice != 0);
gdsl_queue_free (q);
exit (EXIT_SUCCESS);
}
