algorithm_study/03_queue/1_queue_using_array/queue.h at master · 365kim/algorithm_study · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   queue.h                                            :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: mihykim <mihykim@student.42seoul.kr>       +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2020/03/24 12:59:10 by mihykim           #+#    #+#             */
/*   Updated: 2020/03/24 15:50:35 by mihykim          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#ifndef QUEUE_H
# define QUEUE_H

#include <stdlib.h>

typedef struct		 s_queue
{
	unsigned int	max_size;
	int				last_index;
	void			**data;
}					t_queue;

t_queue *queue_init(unsigned int max_size);
void	*queue_front(t_queue *queue);
int		queue_push(t_queue *queue, void *data);
int		queue_size(t_queue *queue);
void	*queue_pop(t_queue *queue);
void	queue_clear(t_queue *queue, void (*free_data)(void *));
void	free_queue(t_queue *queue, void (*free_data)(void *));

#endif