data_structures
queue_enqueue.c
Go to the documentation of this file.
1 /* ************************************************************************** */
3 /* */
4 /* ::: :::::::: */
5 /* queue_enqueue.c :+: :+: :+: */
6 /* +:+ +:+ +:+ */
7 /* By: unite <marvin@42.fr> +#+ +:+ +#+ */
8 /* +#+#+#+#+#+ +#+ */
9 /* Created: 2020/07/17 01:27:31 by unite #+# #+# */
10 /* Updated: 2020/09/07 22:42:10 by unite ### ########.fr */
11 /* */
12 /* ************************************************************************** */
13 
14 #include "queue.h"
15 
16 void queue_enqueue(t_queue *queue, const void *data)
17 {
18  list_add_last(queue, data);
19 }
list_add_last
void list_add_last(t_list *alst, const void *data)
Adds a copy of the specified element at the back of this list.
Definition: list_add_last.c:16
s_list
Doubly-linked list of generic items.
Definition: list.h:54
queue.h
queue_enqueue
void queue_enqueue(t_queue *queue, const void *data)
Copies the item and adds the copy to the queue.
Definition: queue_enqueue.c:16