in complience with norminette 53 and 51.

jos-felipe · Feb 23, 2024 · b2ff43a · b2ff43a
1 parent 1ac79f3
commit b2ff43a
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 8 deletions.
diff --git a/sources/01_user_input_validation.c b/sources/01_user_input_validation.c
@@ -3,10 +3,10 @@
 /*                                                        :::      ::::::::   */
 /*   01_user_input_validation.c                         :+:      :+:    :+:   */
 /*                                                    +:+ +:+         +:+     */
-/*   By: gfantoni <gfantoni@student.42.fr>          +#+  +:+       +#+        */
+/*   By: josfelip <josfelip@student.42sp.org.br>    +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2024/01/30 10:43:20 by josfelip          #+#    #+#             */
-/*   Updated: 2024/02/23 10:41:15 by gfantoni         ###   ########.fr       */
+/*   Updated: 2024/02/23 12:36:27 by josfelip         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -35,15 +35,15 @@ void	ft_int(int argc, char *argv[], t_bst **bst)
 	was_inserted = false;
 	i = 1;
 	while (i < argc)
-	{	
+	{
 		if (!only_digit(argv[i]))
 			push_error(bst);
 		nbr = ft_atol(argv[i]);
 		if (ft_int_overflow(nbr))
 			push_safe_exit(1, NULL, NULL, bst);
 		(*bst) = push_bst_insert(bst, *bst, (int)nbr, &was_inserted);
 		i++;
-	}	
+	}
 }
 
 t_bst	*push_bst_insert(t_bst **head, t_bst *node, int key, bool *was_inserted)

diff --git a/sources/02_indexing.c b/sources/02_indexing.c
@@ -3,10 +3,10 @@
 /*                                                        :::      ::::::::   */
 /*   02_indexing.c                                      :+:      :+:    :+:   */
 /*                                                    +:+ +:+         +:+     */
-/*   By: gfantoni <gfantoni@student.42.fr>          +#+  +:+       +#+        */
+/*   By: josfelip <josfelip@student.42sp.org.br>    +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2024/02/01 19:05:24 by josfelip          #+#    #+#             */
-/*   Updated: 2024/02/22 19:19:52 by gfantoni         ###   ########.fr       */
+/*   Updated: 2024/02/23 12:35:53 by josfelip         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -19,11 +19,11 @@ void	push_fill_stack(t_list_push **a, int argc, char *argv[])
 
 	i = 1;
 	while (i < argc)
-	{	
+	{
 		nbr = ft_atol(argv[i]);
 		push_lstadd_back(a, push_lstnew(nbr));
 		i++;
-	}	
+	}
 }
 
 int	push_bst_is_member(t_bst *node, int find_key)