data_structures
queue_dequeue.c
Go to the documentation of this file.
1 /* ************************************************************************** */
3 /* */
4 /* ::: :::::::: */
5 /* queue_dequeue.c :+: :+: :+: */
6 /* +:+ +:+ +:+ */
7 /* By: unite <marvin@42.fr> +#+ +:+ +#+ */
8 /* +#+#+#+#+#+ +#+ */
9 /* Created: 2020/07/17 01:30:04 by unite #+# #+# */
10 /* Updated: 2020/07/21 22:33:15 by unite ### ########.fr */
11 /* */
12 /* ************************************************************************** */
13 
14 #include "queue.h"
15 
16 void *queue_dequeue(t_queue *queue)
17 {
18  return (list_unlink_first(queue));
19 }
s_list
Doubly-linked list of generic items.
Definition: list.h:54
queue.h
queue_dequeue
void * queue_dequeue(t_queue *queue)
Removes and returns the item on this queue that was least recently added.
Definition: queue_dequeue.c:16
list_unlink_first
void * list_unlink_first(t_list *alst)
Removes the first item in the list and returns it.
Definition: list_unlink_first.c:16
Generated by   doxygen 1.8.16