Updated stuff to be more normed

output/src/vec/subtree/subtree_functions3.c

@@ -0,0 +1,82 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   vec_subtree.c                                  :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: maiboyer <maiboyer@student.42.fr>          +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2023/12/30 17:59:28 by maiboyer          #+#    #+#             */
+/*   Updated: 2023/12/30 17:59:28 by maiboyer         ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "me/mem/mem.h"
+#include "me/types.h"
+#include "me/vec/vec_subtree.h"
+#include <stdlib.h>
+
+t_error vec_subtree_push_front(t_vec_subtree *vec,
+								   t_subtree	  element)
+{
+	t_usize i;
+
+	if (vec->len == 0)
+		return (vec_subtree_push(vec, element));
+	i = vec->len - 1;
+	if (vec->capacity < vec->len + 1 &&
+		vec_subtree_reserve(vec, 3 * vec->len / 2 + 1))
+		return (ERROR);
+	while (i > 0)
+	{
+		vec->buffer[i + 1] = vec->buffer[i];
+		i--;
+	}
+	vec->buffer[1] = vec->buffer[0];
+	vec->buffer[0] = element;
+	vec->len++;
+	return (NO_ERROR);
+}
+
+t_error vec_subtree_pop_front(t_vec_subtree *vec, t_subtree *value)
+{
+	t_usize i;
+
+	if (vec->len <= 1)
+		return (vec_subtree_pop(vec, value));
+	i = 0;
+	*value = vec->buffer[0];
+	vec->len--;
+	while (i < vec->len)
+	{
+		vec->buffer[i] = vec->buffer[i + 1];
+		i++;
+	}
+	mem_set_zero(&vec->buffer[i], sizeof(*vec->buffer));
+	return (NO_ERROR);
+}
+
+void vec_subtree_reverse(t_vec_subtree *vec)
+{
+	t_subtree temporary;
+	t_usize		  i;
+
+	i = 0;
+	while (i < vec->len / 2)
+	{
+		temporary = vec->buffer[vec->len - 1 - i];
+		vec->buffer[vec->len - 1 - i] = vec->buffer[i];
+		vec->buffer[i] = temporary;
+		i++;
+	}
+}
+
+t_error vec_subtree_back(t_vec_subtree *vec, t_subtree **out)
+{
+	t_subtree *temporary;
+
+	if (out == NULL)
+		out = &temporary;
+	if (vec->len != 0)
+		return (*out = &vec->buffer[vec->len - 1], true);
+	return (false);
+}