push_swap/parse_args.c at main · SaraFreitas-dev/push_swap · 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
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   parse_args.c                                       :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: sarfreit <sarfreit@student.42porto.com>    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2026/01/22 12:36:43 by sarfreit          #+#    #+#             */
/*   Updated: 2026/01/22 12:36:43 by sarfreit         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

// Split the string and prepare the stack a

void	free_split(char **tokens)
{
	int	i;

	if (!tokens)
		return ;
	i = 0;
	while (tokens[i])
	{
		free(tokens[i]);
		i++;
	}
	free(tokens);
}

// If it passes all checks, creates the stack a

static int	handle_token(t_stack **a, char *token)
{
	int		num;
	t_stack	*node;

	if (!is_valid_int_token(token) || !is_in_range_int(token))
		return (0);
	num = ft_atoi(token);
	if (!has_duplicate(*a, num))
		return (0);
	node = new_node(num);
	if (!node)
		return (0);
	add_node(a, node, "back");
	return (1);
}

int	parse_args(t_stack **a, int argc, char *argv[])
{
	int		i;
	int		j;
	char	**tokens;

	i = 1;
	while (i < argc)
	{
		tokens = ft_split(argv[i], ' ');
		if (!tokens || !tokens[0])
			return (free_split(tokens), 0);
		j = 0;
		while (tokens[j])
			if (!handle_token(a, tokens[j++]))
				return (free_split(tokens), 0);
		free_split(tokens);
		i++;
	}
	return (1);
}

int	is_sorted(t_stack *stack)
{
	t_stack	*node;
	t_stack	*next_node;

	node = stack;
	if ((!node) || (!node->next))
		return (1);
	while (node->next)
	{
		next_node = node->next;
		if (node->value > next_node->value)
			return (0);
		node = node->next;
	}
	return (1);
}
// Choose the sort mechanism

void	sort_dispatcher(t_stack **a, t_stack **b)
{
	int	size_a;

	if (is_sorted(*a))
		return ;
	assign_index(*a);
	size_a = stack_size(*a);
	if (size_a <= 3)
		sort_three(a, b);
	else if (size_a <= 5)
		sort_five(a, b);
	else
		chunk_sort(a, b);
}