Bistromatic/queue.c at master · 42xphi/Bistromatic · 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
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   queue.c                                            :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: prosa <prosa@student.42.fr>                +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2018/01/14 00:42:24 by prosa             #+#    #+#             */
/*   Updated: 2018/01/14 00:42:24 by prosa            ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "queue.h"

int		is_empty_queue(void)
{
	if (first == NULL && last == NULL)
		return (1);

	return (0);
}

int		queue_length(void)
{
	return (nb_items);
}

int		queue_first(void)
{
	if (is_empty_queue())
		exit(1);

	return (*first->c);
}

int		queue_last(void)
{
	if (is_empty_queue())
		exit(1);

	return (*last->c);
}

void	print_queue(void)
{
	t_queueItem *tmp;

	if (is_empty_queue())
	{
		printf("Rien a afficher, la File est vide.\n");
		return ;
	}

	t_queueItem *tmp = first;

	while(tmp != NULL)
	{
		printf("[%d] ", *tmp->c);
		tmp = tmp->next;
	}
	printf("\n");
}

void	push_queue(char *c)
{
	t_queueItem *item;

	item = malloc(sizeof(*item));

	if (item == NULL)
	{
		fprintf(stderr, "Erreur : probleme allocation dynamique.\n");
		exit(EXIT_FAILURE);
	}

	item->c = c;
	item->next = NULL;

	if (is_empty_queue())
	{
		first = item;
		last = item;
	}
	else
	{
		last->next = item;
		last = item;
	}

	nb_items++;
}

void	pop_queue(void)
{
	t_queueItem *tmp;

	if(is_empty_queue())
	{
		printf("Rien a retirer, la File est deja vide.\n");
		return;
	}

	t_queueItem *tmp = first;

	if (first == last)
	{
		first = NULL;
		last = NULL;
	}
	else
		first = first->next;

	free(tmp);
	nb_items--;
}

void	clear_queue(void)
{
	if (is_empty_queue())
	{
		printf("Rien a nettoyer, la File est deja vide.\n");
		return ;
	}

	while (!is_empty_queue())
		pop_queue();
}