queue array implementation

Author: dev-jko

queue/queue_array/implementation_example/queue_array_implementation.c

@@ -6,7 +6,7 @@
 /*   By: jko <jko@student.42seoul.kr>               +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2020/03/24 16:09:35 by jko               #+#    #+#             */
-/*   Updated: 2020/03/24 16:35:10 by jko              ###   ########.fr       */
+/*   Updated: 2020/03/24 16:48:13 by jko              ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -39,7 +39,7 @@ int	queue_size(t_queue *queue)
 
 int	queue_push(t_queue *queue, void *data)
 {
-	if (!queue || queue_size(queue) >= queue->max_size)
+	if (!queue || (unsigned int)queue_size(queue) >= queue->max_size)
 		return (0);
 	queue->last_index++;
 	queue->data[queue->last_index] = data;

queue/queue_array/implementation_example/test_main.c

@@ -0,0 +1,101 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   test_main.c                                        :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: jko <jko@student.42seoul.kr>               +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2020/03/24 16:36:35 by jko               #+#    #+#             */
+/*   Updated: 2020/03/24 16:48:41 by jko              ###   ########.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);
+}