data_structures
queue_new.c
Go to the documentation of this file.
1 /* ************************************************************************** */
3 /* */
4 /* ::: :::::::: */
5 /* queue_new.c :+: :+: :+: */
6 /* +:+ +:+ +:+ */
7 /* By: unite <marvin@42.fr> +#+ +:+ +#+ */
8 /* +#+#+#+#+#+ +#+ */
9 /* Created: 2020/07/17 00:43:30 by unite #+# #+# */
10 /* Updated: 2020/07/17 01:22:20 by unite ### ########.fr */
11 /* */
12 /* ************************************************************************** */
13 
14 #include "queue.h"
15 
17 {
18  return (list_new(type));
19 }
s_list
Doubly-linked list of generic items.
Definition: list.h:54
queue_new
t_queue * queue_new(const t_type *type)
Allocates memory and initializes an empty queue.
Definition: queue_new.c:16
queue.h
s_type
A full representation of a data type, used to achieve polymorphism in the implementation of data stru...
Definition: types.h:47
s_list::type
const t_type * type
The type of items in this list.
Definition: list.h:59
list_new
t_list * list_new(const t_type *type)
Allocates memory and initializes an empty list.
Definition: list_new.c:16