Jump to content

Queue/Definition: Difference between revisions

→‎{{header|C}}: stripped usage (see FIFO(usage))
(→‎{{header|C}}: stripped usage (see FIFO(usage)))
Line 435:
if ( l->tqh_first == NULL ) return true;
return false;
}
 
int main()
{
int i;
FIFOList head;
 
TAILQ_INIT(&head);
 
/* insert 20 integer values */
for(i=0; i < 20; i++) {
m_enqueue(i, &head);
}
 
/* dequeue and print */
while( m_dequeue(&i, &head) )
printf("%d\n", i);
 
fprintf(stderr, "FIFO list %s\n",
( m_dequeue(&i, &head) ) ?
"had still an element" :
"is void!");
 
exit(0);
}</lang>
 
Cookies help us deliver our services. By using our services, you agree to our use of cookies.