Go to the documentation of this file.
29 if(!queue->
size) free(queue);
32 for(aux1=queue->
head;aux1;)
70 if(value) *value=NULL;
120 if(queue->
size==0) result=1;
123 for(aux=queue->
head;aux;aux=aux->
next)
137 for(aux=queue->
head,ctrl=0;aux&&!ctrl;aux=aux->
next)
int size
Number of elements of this queue.
void queueDelete(Queue queue)
Deletes a queue.
int queueRemove(Queue queue, void **value)
Removes an element from a queue.
int queueConsult(Queue queue, void **value)
Provides the value at the head of a queue.
struct sQueueNode * next
Next node.
Implementation of a queue as linked list.
void itDelete(Iterator it)
Deletes an iterator.
int itAdd(Iterator it, void *val)
Adds an element to an iterator.
Iterator queueIterator(Queue queue)
Creates an iterator from a queue.
int queueSize(Queue queue)
Returns the size of a queue.
QueueNode head
Apontador para o início da queue.
Queue newQueue(void)
Creates a queue.
void * value
Node's value.
int queueMap(Queue queue, void(*fun)(void *))
Applies a function to the elements of a queue.
int queueInsert(Queue queue, void *value)
Inserts an element in a queue.
Iterator newIt(int size)
Creates an iterator.
LibRCG © 2004-2015
Rui Carlos Gonçalves