algorithm_study/03_queue/1_queue_using_array/main.c 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
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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   main.c                                             :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: jko <jko@student.42seoul.kr>               +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2020/03/24 16:36:35 by jko               #+#    #+#             */
/*   Updated: 2020/03/24 17:59:31 by mihykim          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */


#include "queue.h"
#include <stdio.h>
#include <string.h>
#include <unistd.h>

void	print_queue(t_queue *queue)
{
	if (!queue)
	{
		printf("queue == null_ptr\n");
		return ;
	}
	printf("print queue start\n");
	for (int i = 0; i <= queue->last_index; ++i) {
		printf("q [%d] -> %s\n", i, queue->data[i]);
	}
	printf("end\n\n");
}

int main(void)
{
	char *temp;
	t_queue *queue = queue_init(5);
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);

	queue_push(queue, strdup("aa"));
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);

	queue_push(queue, strdup("b"));
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);

	queue_push(queue, strdup("ccc"));
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);

	queue_push(queue, strdup("ddddd"));
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);

	queue_push(queue, strdup("ee"));
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);

	temp = strdup("f");
	queue_push(queue, temp);
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);
	free(temp);

	printf("=============== pop ===============\n");
	for (int i = 0; i < 9; i++)
	{
		temp = queue_pop(queue);
		printf("pop = %s\n", temp);
		free(temp);
		printf("size = %d\n", queue_size(queue));
		printf("front->data = %s\n", queue_front(queue));
		print_queue(queue);
	}

	queue_clear(queue, free);
	print_queue(queue);

	queue_push(queue, strdup("e22"));
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);

	queue_push(queue, strdup("f22"));
	printf("size = %d\n", queue_size(queue));
	printf("front->data = %s\n", queue_front(queue));
	print_queue(queue);

	free_queue(queue, free);

	system("leaks a.out > leaks_result && cat leaks_result | grep leaked");
	return (0);
}