43 Queue q = malloc(
sizeof(
Queue_ ) );
77 while ( q->first != NULL )
104 n = malloc(
sizeof(
Node_ ) );
107 if ( q->first == NULL )
136 if ( q->first == NULL )
141 q->first = q->first->
next;
142 if ( q->first == NULL )
165 if ( q->first == NULL )
void * q_dequeue(Queue q)
Dequeues an item.
int q_isEmpty(Queue q)
Checks if the queue is empty.
void q_destroy(Queue q)
Destroys a queue.
Queue q_create(void)
Creates a queue.
void q_enqueue(Queue q, void *data)
Enqueues an item.
Represents a node of an object. Each node can have multiple meshes and children nodes with an associa...