raphael/minishell
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

regenerated stuff

Browse source
This commit is contained in:
maix0 2024-09-26 18:31:56 +02:00
parent c284eb3786
commit 2e811bcec2
61 changed files with 1022 additions and 1697 deletions
Download patch file Download diff file Expand all files Collapse all files

31
output/src/vec/ast/ast.c
View file

@ -1,12 +1,12 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ast.c :+: :+: :+: */
/* vec_ast.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/05 18:46:28 by maiboyer #+# #+# */
/* Updated: 2024/09/19 15:30:00 by rparodi ### ########.fr */
/* Updated: 2023/12/09 17:54:11 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
@ -15,9 +15,10 @@
#include "me/vec/vec_ast.h"
#include <stdlib.h>
t_vec_ast vec_ast_new(t_usize capacity, t_free_ast_item free_function)
t_vec_ast vec_ast_new(t_usize capacity,
t_free_ast_item free_function)
{
t_vec_ast out;
t_vec_ast out;
out = (t_vec_ast){0};
out.free_func = free_function;
@ -27,8 +28,8 @@ t_vec_ast vec_ast_new(t_usize capacity, t_free_ast_item free_function)
return (out);
}
/// @return true in case of an error
t_error vec_ast_push(t_vec_ast *vec, t_ast_node element)
/// Return true in case of an error
t_error vec_ast_push(t_vec_ast *vec, t_ast_node element)
{
if (vec == NULL)
return (ERROR);
@ -39,9 +40,9 @@ t_error vec_ast_push(t_vec_ast *vec, t_ast_node element)
}
/// Return true in case of an error
t_error vec_ast_reserve(t_vec_ast *vec, t_usize wanted_capacity)
t_error vec_ast_reserve(t_vec_ast *vec, t_usize wanted_capacity)
{
size_t new_capacity;
size_t new_capacity;
if (vec == NULL)
return (ERROR);
@ -50,8 +51,8 @@ t_error vec_ast_reserve(t_vec_ast *vec, t_usize wanted_capacity)
new_capacity = (vec->capacity * 3) / 2 + 1;
while (wanted_capacity > new_capacity)
new_capacity = (new_capacity * 3) / 2 + 1;
vec->buffer = mem_realloc_array(\
vec->buffer, new_capacity, sizeof(t_ast_node));
vec->buffer =
mem_realloc_array(vec->buffer, new_capacity, sizeof(t_ast_node));
vec->capacity = new_capacity;
}
return (NO_ERROR);
@ -59,10 +60,10 @@ t_error vec_ast_reserve(t_vec_ast *vec, t_usize wanted_capacity)
/// Return true if the vector is empty
/// This function is safe to call with value being NULL
t_error vec_ast_pop(t_vec_ast *vec, t_ast_node *value)
t_error vec_ast_pop(t_vec_ast *vec, t_ast_node *value)
{
t_ast_node temp_value;
t_ast_node *ptr;
t_ast_node temp_value;
t_ast_node *ptr;
if (vec == NULL || vec->len == 0)
return (ERROR);
@ -76,10 +77,10 @@ t_error vec_ast_pop(t_vec_ast *vec, t_ast_node *value)
}
/// This function is safe to call with `free_elem` being NULL
void vec_ast_free(t_vec_ast vec)
void vec_ast_free(t_vec_ast vec)
{
if (vec.buffer == NULL)
return ;
return;
if (vec.free_func)
{
while (vec.len)

39
output/src/vec/ast/ast_functions2.c
View file

@ -1,12 +1,12 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ast_functions2.c :+: :+: :+: */
/* vec_ast.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/30 17:59:28 by maiboyer #+# #+# */
/* Updated: 2024/09/19 15:32:36 by rparodi ### ########.fr */
/* Updated: 2023/12/30 17:59:28 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
@ -17,10 +17,10 @@
#include "me/vec/vec_ast.h"
#include <stdlib.h>
t_error vec_ast_find(t_vec_ast *vec, bool (*fn)(\
const t_ast_node *), t_usize *index)
t_error vec_ast_find(t_vec_ast *vec,
bool (*fn)(const t_ast_node *), t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
@ -37,10 +37,11 @@ t_error vec_ast_find(t_vec_ast *vec, bool (*fn)(\
return (ERROR);
}
t_error vec_ast_find_starting(t_vec_ast *vec, bool (*fn)(\
const t_ast_node *), t_usize starting_index, t_usize *index)
t_error vec_ast_find_starting(t_vec_ast *vec,
bool (*fn)(const t_ast_node *),
t_usize starting_index, t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
@ -57,10 +58,10 @@ t_error vec_ast_find_starting(t_vec_ast *vec, bool (*fn)(\
return (ERROR);
}
t_error vec_ast_all(t_vec_ast *vec, bool (*fn)(\
const t_ast_node *), bool *result)
t_error vec_ast_all(t_vec_ast *vec,
bool (*fn)(const t_ast_node *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -75,10 +76,10 @@ t_error vec_ast_all(t_vec_ast *vec, bool (*fn)(\
return (ERROR);
}
t_error vec_ast_any(t_vec_ast *vec, bool (*fn)(\
const t_ast_node *), bool *result)
t_error vec_ast_any(t_vec_ast *vec,
bool (*fn)(const t_ast_node *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -93,13 +94,15 @@ t_error vec_ast_any(t_vec_ast *vec, bool (*fn)(\
return (ERROR);
}
void vec_ast_iter(t_vec_ast *vec, void (*fn)(\
t_usize index, t_ast_node *value, void *state), void *state)
void vec_ast_iter(t_vec_ast *vec,
void (*fn)(t_usize index, t_ast_node *value,
void *state),
void *state)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL)
return ;
return;
idx = 0;
while (idx < vec->len)
{

25
output/src/vec/ast/ast_functions3.c
View file

@ -1,12 +1,12 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ast_functions3.c :+: :+: :+: */
/* vec_ast.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/30 17:59:28 by maiboyer #+# #+# */
/* Updated: 2024/09/19 15:34:10 by rparodi ### ########.fr */
/* Updated: 2023/12/30 17:59:28 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
@ -15,14 +15,15 @@
#include "me/vec/vec_ast.h"
#include <stdlib.h>
t_error vec_ast_push_front(t_vec_ast *vec, t_ast_node element)
t_error vec_ast_push_front(t_vec_ast *vec,
t_ast_node element)
{
t_usize i;
t_usize i;
if (vec->len == 0)
return (vec_ast_push(vec, element));
i = vec->len - 1;
if (vec->capacity < vec->len + 1 && \
if (vec->capacity < vec->len + 1 &&
vec_ast_reserve(vec, 3 * vec->len / 2 + 1))
return (ERROR);
while (i > 0)
@ -36,9 +37,9 @@ t_error vec_ast_push_front(t_vec_ast *vec, t_ast_node element)
return (NO_ERROR);
}
t_error vec_ast_pop_front(t_vec_ast *vec, t_ast_node *value)
t_error vec_ast_pop_front(t_vec_ast *vec, t_ast_node *value)
{
t_usize i;
t_usize i;
if (vec->len <= 1)
return (vec_ast_pop(vec, value));
@ -54,10 +55,10 @@ t_error vec_ast_pop_front(t_vec_ast *vec, t_ast_node *value)
return (NO_ERROR);
}
void vec_ast_reverse(t_vec_ast *vec)
void vec_ast_reverse(t_vec_ast *vec)
{
t_ast_node temporary;
t_usize i;
t_ast_node temporary;
t_usize i;
i = 0;
while (i < vec->len / 2)
@ -69,9 +70,9 @@ void vec_ast_reverse(t_vec_ast *vec)
}
}
t_error vec_ast_back(t_vec_ast *vec, t_ast_node **out)
t_error vec_ast_back(t_vec_ast *vec, t_ast_node **out)
{
t_ast_node *temporary;
t_ast_node *temporary;
if (out == NULL)
out = &temporary;

39
output/src/vec/ast/ast_functions4.c
View file

@ -1,12 +1,12 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ast_functions4.c :+: :+: :+: */
/* vec_ast.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/30 17:59:28 by maiboyer #+# #+# */
/* Updated: 2024/09/19 15:36:47 by rparodi ### ########.fr */
/* Updated: 2023/12/30 17:59:28 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
@ -15,7 +15,7 @@
#include "me/vec/vec_ast.h"
#include <stdlib.h>
t_ast_node *vec_ast_get(t_vec_ast *vec, t_usize i)
t_ast_node *vec_ast_get(t_vec_ast *vec, t_usize i)
{
if (vec == NULL || vec->buffer == NULL)
return (NULL);
@ -24,14 +24,14 @@ t_ast_node *vec_ast_get(t_vec_ast *vec, t_usize i)
return (NULL);
}
t_ast_node *vec_ast_last(t_vec_ast *vec)
t_ast_node *vec_ast_last(t_vec_ast *vec)
{
if (vec == NULL || vec->len == 0)
return (NULL);
return (&vec->buffer[vec->len - 1]);
}
void vec_ast_copy_into(t_vec_ast *vec, t_vec_ast *dest)
void vec_ast_copy_into(t_vec_ast *vec, t_vec_ast *dest)
{
if (vec == NULL || dest == NULL)
return ;
@ -39,20 +39,21 @@ void vec_ast_copy_into(t_vec_ast *vec, t_vec_ast *dest)
mem_copy(dest->buffer, vec->buffer, vec->len * sizeof(t_ast_node));
}
struct s_vec_ast_splice_arguments vec_ast_splice_args(
struct s_vec_ast_splice_arguments vec_ast_splice_args(
t_usize index, t_usize old_count, t_usize new_count,
const t_ast_node *elements)
{
return ((struct s_vec_ast_splice_arguments){index, old_count, \
new_count, elements});
return ((struct s_vec_ast_splice_arguments){index, old_count,
new_count, elements});
}
void vec_ast_splice(t_vec_ast *self, struct s_vec_ast_splice_arguments args)
void vec_ast_splice(t_vec_ast *self,
struct s_vec_ast_splice_arguments args)
{
t_ast_node *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
t_ast_node *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
new_size = self->len + args.new_count - args.old_count;
old_end = args.index + args.old_count;
@ -60,17 +61,17 @@ void vec_ast_splice(t_vec_ast *self, struct s_vec_ast_splice_arguments args)
vec_ast_reserve(self, new_size);
contents = self->buffer;
if (self->len > old_end)
mem_move(contents + new_end, \
contents + old_end, \
(self->len - old_end) * sizeof(t_ast_node));
mem_move(contents + new_end,
contents + old_end,
(self->len - old_end) * sizeof(t_ast_node));
if (args.new_count > 0)
{
if (args.elements)
mem_copy((contents + args.index * sizeof(t_ast_node)), \
args.elements, args.new_count * sizeof(t_ast_node));
mem_copy((contents + args.index * sizeof(t_ast_node)),
args.elements, args.new_count * sizeof(t_ast_node));
else
mem_set_zero((contents + args.index * sizeof(t_ast_node)),
args.new_count * sizeof(t_ast_node));
args.new_count * sizeof(t_ast_node));
}
self->len += args.new_count - args.old_count;
}

15
output/src/vec/ast/ast_sort.c
View file

@ -1,26 +1,27 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ast_sort.c :+: :+: :+: */
/* best_move.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/01/29 20:04:33 by maiboyer #+# #+# */
/* Updated: 2024/09/19 15:37:59 by rparodi ### ########.fr */
/* Updated: 2024/01/31 14:25:00 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#include "me/types.h"
#include "me/vec/vec_ast.h"
void vec_ast_sort(t_vec_ast *v, t_vec_ast_sort_fn is_sorted_fn)
void vec_ast_sort(t_vec_ast *v,
t_vec_ast_sort_fn is_sorted_fn)
{
t_usize sorted_part;
t_usize i;
t_ast_node tmp;
t_usize sorted_part;
t_usize i;
t_ast_node tmp;
if (v == NULL)
return ;
return;
sorted_part = v->len;
while (sorted_part > 0)
{

25
output/src/vec/estr/estr.c
View file

@ -15,9 +15,10 @@
#include "me/vec/vec_estr.h"
#include <stdlib.h>
t_vec_estr vec_estr_new(t_usize capacity, t_free_estr_item free_function)
t_vec_estr vec_estr_new(t_usize capacity,
t_free_estr_item free_function)
{
t_vec_estr out;
t_vec_estr out;
out = (t_vec_estr){0};
out.free_func = free_function;
@ -28,7 +29,7 @@ t_vec_estr vec_estr_new(t_usize capacity, t_free_estr_item free_function)
}
/// Return true in case of an error
t_error vec_estr_push(t_vec_estr *vec, t_expandable_str element)
t_error vec_estr_push(t_vec_estr *vec, t_expandable_str element)
{
if (vec == NULL)
return (ERROR);
@ -39,9 +40,9 @@ t_error vec_estr_push(t_vec_estr *vec, t_expandable_str element)
}
/// Return true in case of an error
t_error vec_estr_reserve(t_vec_estr *vec, t_usize wanted_capacity)
t_error vec_estr_reserve(t_vec_estr *vec, t_usize wanted_capacity)
{
size_t new_capacity;
size_t new_capacity;
if (vec == NULL)
return (ERROR);
@ -50,8 +51,8 @@ t_error vec_estr_reserve(t_vec_estr *vec, t_usize wanted_capacity)
new_capacity = (vec->capacity * 3) / 2 + 1;
while (wanted_capacity > new_capacity)
new_capacity = (new_capacity * 3) / 2 + 1;
vec->buffer = mem_realloc_array(vec->buffer, new_capacity,
sizeof(t_expandable_str));
vec->buffer =
mem_realloc_array(vec->buffer, new_capacity, sizeof(t_expandable_str));
vec->capacity = new_capacity;
}
return (NO_ERROR);
@ -59,10 +60,10 @@ t_error vec_estr_reserve(t_vec_estr *vec, t_usize wanted_capacity)
/// Return true if the vector is empty
/// This function is safe to call with value being NULL
t_error vec_estr_pop(t_vec_estr *vec, t_expandable_str *value)
t_error vec_estr_pop(t_vec_estr *vec, t_expandable_str *value)
{
t_expandable_str temp_value;
t_expandable_str *ptr;
t_expandable_str temp_value;
t_expandable_str *ptr;
if (vec == NULL || vec->len == 0)
return (ERROR);
@ -76,10 +77,10 @@ t_error vec_estr_pop(t_vec_estr *vec, t_expandable_str *value)
}
/// This function is safe to call with `free_elem` being NULL
void vec_estr_free(t_vec_estr vec)
void vec_estr_free(t_vec_estr vec)
{
if (vec.buffer == NULL)
return ;
return;
if (vec.free_func)
{
while (vec.len)

38
output/src/vec/estr/estr_functions2.c
View file

@ -10,15 +10,17 @@
/* */
/* ************************************************************************** */
#include "me/mem/mem.h"
#include "me/mem/mem.h"
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_estr.h"
#include <stdlib.h>
t_error vec_estr_find(t_vec_estr *vec, bool (*fn)(const t_expandable_str *),
t_usize *index)
t_error vec_estr_find(t_vec_estr *vec,
bool (*fn)(const t_expandable_str *), t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
@ -35,11 +37,11 @@ t_error vec_estr_find(t_vec_estr *vec, bool (*fn)(const t_expandable_str *),
return (ERROR);
}
t_error vec_estr_find_starting(t_vec_estr *vec,
bool (*fn)(const t_expandable_str *), t_usize starting_index,
t_usize *index)
t_error vec_estr_find_starting(t_vec_estr *vec,
bool (*fn)(const t_expandable_str *),
t_usize starting_index, t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
@ -56,10 +58,10 @@ t_error vec_estr_find_starting(t_vec_estr *vec,
return (ERROR);
}
t_error vec_estr_all(t_vec_estr *vec, bool (*fn)(const t_expandable_str *),
bool *result)
t_error vec_estr_all(t_vec_estr *vec,
bool (*fn)(const t_expandable_str *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -74,10 +76,10 @@ t_error vec_estr_all(t_vec_estr *vec, bool (*fn)(const t_expandable_str *),
return (ERROR);
}
t_error vec_estr_any(t_vec_estr *vec, bool (*fn)(const t_expandable_str *),
bool *result)
t_error vec_estr_any(t_vec_estr *vec,
bool (*fn)(const t_expandable_str *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -92,13 +94,15 @@ t_error vec_estr_any(t_vec_estr *vec, bool (*fn)(const t_expandable_str *),
return (ERROR);
}
void vec_estr_iter(t_vec_estr *vec, void (*fn)(t_usize index,
t_expandable_str *value, void *state), void *state)
void vec_estr_iter(t_vec_estr *vec,
void (*fn)(t_usize index, t_expandable_str *value,
void *state),
void *state)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL)
return ;
return;
idx = 0;
while (idx < vec->len)
{

23
output/src/vec/estr/estr_functions3.c
View file

@ -15,15 +15,16 @@
#include "me/vec/vec_estr.h"
#include <stdlib.h>
t_error vec_estr_push_front(t_vec_estr *vec, t_expandable_str element)
t_error vec_estr_push_front(t_vec_estr *vec,
t_expandable_str element)
{
t_usize i;
t_usize i;
if (vec->len == 0)
return (vec_estr_push(vec, element));
i = vec->len - 1;
if (vec->capacity < vec->len + 1 && vec_estr_reserve(vec, 3 * vec->len / 2
+ 1))
if (vec->capacity < vec->len + 1 &&
vec_estr_reserve(vec, 3 * vec->len / 2 + 1))
return (ERROR);
while (i > 0)
{
@ -36,9 +37,9 @@ t_error vec_estr_push_front(t_vec_estr *vec, t_expandable_str element)
return (NO_ERROR);
}
t_error vec_estr_pop_front(t_vec_estr *vec, t_expandable_str *value)
t_error vec_estr_pop_front(t_vec_estr *vec, t_expandable_str *value)
{
t_usize i;
t_usize i;
if (vec->len <= 1)
return (vec_estr_pop(vec, value));
@ -54,10 +55,10 @@ t_error vec_estr_pop_front(t_vec_estr *vec, t_expandable_str *value)
return (NO_ERROR);
}
void vec_estr_reverse(t_vec_estr *vec)
void vec_estr_reverse(t_vec_estr *vec)
{
t_expandable_str temporary;
t_usize i;
t_expandable_str temporary;
t_usize i;
i = 0;
while (i < vec->len / 2)
@ -69,9 +70,9 @@ void vec_estr_reverse(t_vec_estr *vec)
}
}
t_error vec_estr_back(t_vec_estr *vec, t_expandable_str **out)
t_error vec_estr_back(t_vec_estr *vec, t_expandable_str **out)
{
t_expandable_str *temporary;
t_expandable_str *temporary;
if (out == NULL)
out = &temporary;

36
output/src/vec/estr/estr_functions4.c
View file

@ -15,7 +15,7 @@
#include "me/vec/vec_estr.h"
#include <stdlib.h>
t_expandable_str *vec_estr_get(t_vec_estr *vec, t_usize i)
t_expandable_str *vec_estr_get(t_vec_estr *vec, t_usize i)
{
if (vec == NULL || vec->buffer == NULL)
return (NULL);
@ -24,14 +24,14 @@ t_expandable_str *vec_estr_get(t_vec_estr *vec, t_usize i)
return (NULL);
}
t_expandable_str *vec_estr_last(t_vec_estr *vec)
t_expandable_str *vec_estr_last(t_vec_estr *vec)
{
if (vec == NULL || vec->len == 0)
return (NULL);
return (&vec->buffer[vec->len - 1]);
}
void vec_estr_copy_into(t_vec_estr *vec, t_vec_estr *dest)
void vec_estr_copy_into(t_vec_estr *vec, t_vec_estr *dest)
{
if (vec == NULL || dest == NULL)
return ;
@ -39,20 +39,21 @@ void vec_estr_copy_into(t_vec_estr *vec, t_vec_estr *dest)
mem_copy(dest->buffer, vec->buffer, vec->len * sizeof(t_expandable_str));
}
struct s_vec_estr_splice_arguments vec_estr_splice_args(t_usize index,
t_usize old_count, t_usize new_count, const t_expandable_str *elements)
struct s_vec_estr_splice_arguments vec_estr_splice_args(
t_usize index, t_usize old_count, t_usize new_count,
const t_expandable_str *elements)
{
return ((struct s_vec_estr_splice_arguments){index, old_count, new_count,
elements});
return ((struct s_vec_estr_splice_arguments){index, old_count,
new_count, elements});
}
void vec_estr_splice(t_vec_estr *self,
struct s_vec_estr_splice_arguments args)
void vec_estr_splice(t_vec_estr *self,
struct s_vec_estr_splice_arguments args)
{
t_expandable_str *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
t_expandable_str *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
new_size = self->len + args.new_count - args.old_count;
old_end = args.index + args.old_count;
@ -60,16 +61,17 @@ void vec_estr_splice(t_vec_estr *self,
vec_estr_reserve(self, new_size);
contents = self->buffer;
if (self->len > old_end)
mem_move(contents + new_end, contents + old_end, (self->len - old_end)
* sizeof(t_expandable_str));
mem_move(contents + new_end,
contents + old_end,
(self->len - old_end) * sizeof(t_expandable_str));
if (args.new_count > 0)
{
if (args.elements)
mem_copy((contents + args.index * sizeof(t_expandable_str)),
args.elements, args.new_count * sizeof(t_expandable_str));
args.elements, args.new_count * sizeof(t_expandable_str));
else
mem_set_zero((contents + args.index * sizeof(t_expandable_str)),
args.new_count * sizeof(t_expandable_str));
args.new_count * sizeof(t_expandable_str));
}
self->len += args.new_count - args.old_count;
}

11
output/src/vec/estr/estr_sort.c
View file

@ -13,14 +13,15 @@
#include "me/types.h"
#include "me/vec/vec_estr.h"
void vec_estr_sort(t_vec_estr *v, t_vec_estr_sort_fn is_sorted_fn)
void vec_estr_sort(t_vec_estr *v,
t_vec_estr_sort_fn is_sorted_fn)
{
t_usize sorted_part;
t_usize i;
t_expandable_str tmp;
t_usize sorted_part;
t_usize i;
t_expandable_str tmp;
if (v == NULL)
return ;
return;
sorted_part = v->len;
while (sorted_part > 0)
{

25
output/src/vec/pid/pid.c
View file

@ -15,9 +15,10 @@
#include "me/vec/vec_pid.h"
#include <stdlib.h>
t_vec_pid vec_pid_new(t_usize capacity, t_free_pid_item free_function)
t_vec_pid vec_pid_new(t_usize capacity,
t_free_pid_item free_function)
{
t_vec_pid out;
t_vec_pid out;
out = (t_vec_pid){0};
out.free_func = free_function;
@ -28,7 +29,7 @@ t_vec_pid vec_pid_new(t_usize capacity, t_free_pid_item free_function)
}
/// Return true in case of an error
t_error vec_pid_push(t_vec_pid *vec, t_pid element)
t_error vec_pid_push(t_vec_pid *vec, t_pid element)
{
if (vec == NULL)
return (ERROR);
@ -39,9 +40,9 @@ t_error vec_pid_push(t_vec_pid *vec, t_pid element)
}
/// Return true in case of an error
t_error vec_pid_reserve(t_vec_pid *vec, t_usize wanted_capacity)
t_error vec_pid_reserve(t_vec_pid *vec, t_usize wanted_capacity)
{
size_t new_capacity;
size_t new_capacity;
if (vec == NULL)
return (ERROR);
@ -50,8 +51,8 @@ t_error vec_pid_reserve(t_vec_pid *vec, t_usize wanted_capacity)
new_capacity = (vec->capacity * 3) / 2 + 1;
while (wanted_capacity > new_capacity)
new_capacity = (new_capacity * 3) / 2 + 1;
vec->buffer = mem_realloc_array(vec->buffer, new_capacity,
sizeof(t_pid));
vec->buffer =
mem_realloc_array(vec->buffer, new_capacity, sizeof(t_pid));
vec->capacity = new_capacity;
}
return (NO_ERROR);
@ -59,10 +60,10 @@ t_error vec_pid_reserve(t_vec_pid *vec, t_usize wanted_capacity)
/// Return true if the vector is empty
/// This function is safe to call with value being NULL
t_error vec_pid_pop(t_vec_pid *vec, t_pid *value)
t_error vec_pid_pop(t_vec_pid *vec, t_pid *value)
{
t_pid temp_value;
t_pid *ptr;
t_pid temp_value;
t_pid *ptr;
if (vec == NULL || vec->len == 0)
return (ERROR);
@ -76,10 +77,10 @@ t_error vec_pid_pop(t_vec_pid *vec, t_pid *value)
}
/// This function is safe to call with `free_elem` being NULL
void vec_pid_free(t_vec_pid vec)
void vec_pid_free(t_vec_pid vec)
{
if (vec.buffer == NULL)
return ;
return;
if (vec.free_func)
{
while (vec.len)

34
output/src/vec/pid/pid_functions2.c
View file

@ -10,14 +10,17 @@
/* */
/* ************************************************************************** */
#include "me/mem/mem.h"
#include "me/mem/mem.h"
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_pid.h"
#include <stdlib.h>
t_error vec_pid_find(t_vec_pid *vec, bool (*fn)(const t_pid *), t_usize *index)
t_error vec_pid_find(t_vec_pid *vec,
bool (*fn)(const t_pid *), t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
@ -34,10 +37,11 @@ t_error vec_pid_find(t_vec_pid *vec, bool (*fn)(const t_pid *), t_usize *index)
return (ERROR);
}
t_error vec_pid_find_starting(t_vec_pid *vec, bool (*fn)(const t_pid *),
t_usize starting_index, t_usize *index)
t_error vec_pid_find_starting(t_vec_pid *vec,
bool (*fn)(const t_pid *),
t_usize starting_index, t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
@ -54,9 +58,10 @@ t_error vec_pid_find_starting(t_vec_pid *vec, bool (*fn)(const t_pid *),
return (ERROR);
}
t_error vec_pid_all(t_vec_pid *vec, bool (*fn)(const t_pid *), bool *result)
t_error vec_pid_all(t_vec_pid *vec,
bool (*fn)(const t_pid *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -71,9 +76,10 @@ t_error vec_pid_all(t_vec_pid *vec, bool (*fn)(const t_pid *), bool *result)
return (ERROR);
}
t_error vec_pid_any(t_vec_pid *vec, bool (*fn)(const t_pid *), bool *result)
t_error vec_pid_any(t_vec_pid *vec,
bool (*fn)(const t_pid *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -88,13 +94,15 @@ t_error vec_pid_any(t_vec_pid *vec, bool (*fn)(const t_pid *), bool *result)
return (ERROR);
}
void vec_pid_iter(t_vec_pid *vec, void (*fn)(t_usize index, t_pid *value,
void *state), void *state)
void vec_pid_iter(t_vec_pid *vec,
void (*fn)(t_usize index, t_pid *value,
void *state),
void *state)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL)
return ;
return;
idx = 0;
while (idx < vec->len)
{

23
output/src/vec/pid/pid_functions3.c
View file

@ -15,15 +15,16 @@
#include "me/vec/vec_pid.h"
#include <stdlib.h>
t_error vec_pid_push_front(t_vec_pid *vec, t_pid element)
t_error vec_pid_push_front(t_vec_pid *vec,
t_pid element)
{
t_usize i;
t_usize i;
if (vec->len == 0)
return (vec_pid_push(vec, element));
i = vec->len - 1;
if (vec->capacity < vec->len + 1 && vec_pid_reserve(vec, 3 * vec->len / 2
+ 1))
if (vec->capacity < vec->len + 1 &&
vec_pid_reserve(vec, 3 * vec->len / 2 + 1))
return (ERROR);
while (i > 0)
{
@ -36,9 +37,9 @@ t_error vec_pid_push_front(t_vec_pid *vec, t_pid element)
return (NO_ERROR);
}
t_error vec_pid_pop_front(t_vec_pid *vec, t_pid *value)
t_error vec_pid_pop_front(t_vec_pid *vec, t_pid *value)
{
t_usize i;
t_usize i;
if (vec->len <= 1)
return (vec_pid_pop(vec, value));
@ -54,10 +55,10 @@ t_error vec_pid_pop_front(t_vec_pid *vec, t_pid *value)
return (NO_ERROR);
}
void vec_pid_reverse(t_vec_pid *vec)
void vec_pid_reverse(t_vec_pid *vec)
{
t_pid temporary;
t_usize i;
t_pid temporary;
t_usize i;
i = 0;
while (i < vec->len / 2)
@ -69,9 +70,9 @@ void vec_pid_reverse(t_vec_pid *vec)
}
}
t_error vec_pid_back(t_vec_pid *vec, t_pid **out)
t_error vec_pid_back(t_vec_pid *vec, t_pid **out)
{
t_pid *temporary;
t_pid *temporary;
if (out == NULL)
out = &temporary;

39
output/src/vec/pid/pid_functions4.c
View file

@ -15,7 +15,7 @@
#include "me/vec/vec_pid.h"
#include <stdlib.h>
t_pid *vec_pid_get(t_vec_pid *vec, t_usize i)
t_pid *vec_pid_get(t_vec_pid *vec, t_usize i)
{
if (vec == NULL || vec->buffer == NULL)
return (NULL);
@ -24,14 +24,14 @@ t_pid *vec_pid_get(t_vec_pid *vec, t_usize i)
return (NULL);
}
t_pid *vec_pid_last(t_vec_pid *vec)
t_pid *vec_pid_last(t_vec_pid *vec)
{
if (vec == NULL || vec->len == 0)
return (NULL);
return (&vec->buffer[vec->len - 1]);
}
void vec_pid_copy_into(t_vec_pid *vec, t_vec_pid *dest)
void vec_pid_copy_into(t_vec_pid *vec, t_vec_pid *dest)
{
if (vec == NULL || dest == NULL)
return ;
@ -39,19 +39,21 @@ void vec_pid_copy_into(t_vec_pid *vec, t_vec_pid *dest)
mem_copy(dest->buffer, vec->buffer, vec->len * sizeof(t_pid));
}
struct s_vec_pid_splice_arguments vec_pid_splice_args(t_usize index,
t_usize old_count, t_usize new_count, const t_pid *elements)
struct s_vec_pid_splice_arguments vec_pid_splice_args(
t_usize index, t_usize old_count, t_usize new_count,
const t_pid *elements)
{
return ((struct s_vec_pid_splice_arguments){index, old_count, new_count,
elements});
return ((struct s_vec_pid_splice_arguments){index, old_count,
new_count, elements});
}
void vec_pid_splice(t_vec_pid *self, struct s_vec_pid_splice_arguments args)
void vec_pid_splice(t_vec_pid *self,
struct s_vec_pid_splice_arguments args)
{
t_pid *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
t_pid *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
new_size = self->len + args.new_count - args.old_count;
old_end = args.index + args.old_count;
@ -59,16 +61,17 @@ void vec_pid_splice(t_vec_pid *self, struct s_vec_pid_splice_arguments args)
vec_pid_reserve(self, new_size);
contents = self->buffer;
if (self->len > old_end)
mem_move(contents + new_end, contents + old_end, (self->len - old_end)
* sizeof(t_pid));
mem_move(contents + new_end,
contents + old_end,
(self->len - old_end) * sizeof(t_pid));
if (args.new_count > 0)
{
if (args.elements)
mem_copy((contents + args.index * sizeof(t_pid)), args.elements,
args.new_count * sizeof(t_pid));
mem_copy((contents + args.index * sizeof(t_pid)),
args.elements, args.new_count * sizeof(t_pid));
else
mem_set_zero((contents + args.index * sizeof(t_pid)), args.new_count
* sizeof(t_pid));
mem_set_zero((contents + args.index * sizeof(t_pid)),
args.new_count * sizeof(t_pid));
}
self->len += args.new_count - args.old_count;
}

11
output/src/vec/pid/pid_sort.c
View file

@ -13,14 +13,15 @@
#include "me/types.h"
#include "me/vec/vec_pid.h"
void vec_pid_sort(t_vec_pid *v, t_vec_pid_sort_fn is_sorted_fn)
void vec_pid_sort(t_vec_pid *v,
t_vec_pid_sort_fn is_sorted_fn)
{
t_usize sorted_part;
t_usize i;
t_pid tmp;
t_usize sorted_part;
t_usize i;
t_pid tmp;
if (v == NULL)
return ;
return;
sorted_part = v->len;
while (sorted_part > 0)
{

95
output/src/vec/reduce_action/reduce_action.c
View file

@ -1,95 +0,0 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* reduce_action.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/05 18:46:28 by maiboyer #+# #+# */
/* Updated: 2024/09/19 17:50:33 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_reduce_action.h"
#include <stdlib.h>
t_vec_reduce_action vec_reduce_action_new(t_usize capacity,
t_free_reduce_action_item free_function)
{
t_vec_reduce_action out;
out = (t_vec_reduce_action){0};
out.free_func = free_function;
out.buffer = mem_alloc_array(capacity, sizeof(*out.buffer));
if (out.buffer)
out.capacity = capacity;
return (out);
}
/// Return true in case of an error
t_error vec_reduce_action_push(t_vec_reduce_action *vec,
t_reduce_action element)
{
if (vec == NULL)
return (ERROR);
vec_reduce_action_reserve(vec, vec->len + 1);
vec->buffer[vec->len] = element;
vec->len += 1;
return (NO_ERROR);
}
/// Return true in case of an error
t_error vec_reduce_action_reserve(t_vec_reduce_action *vec,
t_usize wanted_capacity)
{
size_t new_capacity;
if (vec == NULL)
return (ERROR);
if (wanted_capacity > vec->capacity)
{
new_capacity = (vec->capacity * 3) / 2 + 1;
while (wanted_capacity > new_capacity)
new_capacity = (new_capacity * 3) / 2 + 1;
vec->buffer = mem_realloc_array(vec->buffer, new_capacity,
sizeof(t_reduce_action));
vec->capacity = new_capacity;
}
return (NO_ERROR);
}
/// Return true if the vector is empty
/// This function is safe to call with value being NULL
t_error vec_reduce_action_pop(t_vec_reduce_action *vec, t_reduce_action *value)
{
t_reduce_action temp_value;
t_reduce_action *ptr;
if (vec == NULL || vec->len == 0)
return (ERROR);
ptr = value;
if (value == NULL)
ptr = &temp_value;
vec->len--;
*ptr = vec->buffer[vec->len];
mem_set_zero(&vec->buffer[vec->len], sizeof(t_reduce_action));
return (NO_ERROR);
}
/// This function is safe to call with `free_elem` being NULL
void vec_reduce_action_free(t_vec_reduce_action vec)
{
if (vec.buffer == NULL)
return ;
if (vec.free_func)
{
while (vec.len)
{
vec.free_func(vec.buffer[vec.len - 1]);
vec.len--;
}
}
mem_free(vec.buffer);
}

109
output/src/vec/reduce_action/reduce_action_functions2.c
View file

@ -1,109 +0,0 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* reduce_action_functions2.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/30 17:59:28 by maiboyer #+# #+# */
/* Updated: 2024/09/19 17:50:57 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_reduce_action.h"
#include <stdlib.h>
t_error vec_reduce_action_find(t_vec_reduce_action *vec,
bool (*fn)(const t_reduce_action *), t_usize *index)
{
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
idx = 0;
while (idx < vec->len)
{
if (fn((const t_reduce_action *)&vec->buffer[idx]))
{
*index = idx;
return (NO_ERROR);
}
idx++;
}
return (ERROR);
}
t_error vec_reduce_action_find_starting(t_vec_reduce_action *vec,
bool (*fn)(const t_reduce_action *), t_usize starting_index,
t_usize *index)
{
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
idx = starting_index;
while (idx < vec->len)
{
if (fn((const t_reduce_action *)&vec->buffer[idx]))
{
*index = idx;
return (NO_ERROR);
}
idx++;
}
return (ERROR);
}
t_error vec_reduce_action_all(t_vec_reduce_action *vec,
bool (*fn)(const t_reduce_action *), bool *result)
{
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
idx = 0;
*result = true;
while (*result && idx < vec->len)
{
if (!fn((const t_reduce_action *)&vec->buffer[idx]))
*result = false;
idx++;
}
return (ERROR);
}
t_error vec_reduce_action_any(t_vec_reduce_action *vec,
bool (*fn)(const t_reduce_action *), bool *result)
{
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
idx = 0;
*result = false;
while (*result && idx < vec->len)
{
if (fn((const t_reduce_action *)&vec->buffer[idx]))
*result = true;
idx++;
}
return (ERROR);
}
void vec_reduce_action_iter(t_vec_reduce_action *vec,
void (*fn)(t_usize index, t_reduce_action *value, void *state),
void *state)
{
t_usize idx;
if (vec == NULL || fn == NULL)
return ;
idx = 0;
while (idx < vec->len)
{
fn(idx, &vec->buffer[idx], state);
idx++;
}
}

83
output/src/vec/reduce_action/reduce_action_functions3.c
View file

@ -1,83 +0,0 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* reduce_action_functions3.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_reduce_action.h"
#include <stdlib.h>
t_error vec_reduce_action_push_front(t_vec_reduce_action *vec,
t_reduce_action element)
{
t_usize i;
if (vec->len == 0)
return (vec_reduce_action_push(vec, element));
i = vec->len - 1;
if (vec->capacity < vec->len + 1 && vec_reduce_action_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_reduce_action_pop_front(t_vec_reduce_action *vec,
t_reduce_action *value)
{
t_usize i;
if (vec->len <= 1)
return (vec_reduce_action_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_reduce_action_reverse(t_vec_reduce_action *vec)
{
t_reduce_action 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_reduce_action_back(t_vec_reduce_action *vec, t_reduce_action **out)
{
t_reduce_action *temporary;
if (out == NULL)
out = &temporary;
if (vec->len != 0)
return (*out = &vec->buffer[vec->len - 1], true);
return (false);
}

77
output/src/vec/reduce_action/reduce_action_functions4.c
View file

@ -1,77 +0,0 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* reduce_action_functions4.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/30 17:59:28 by maiboyer #+# #+# */
/* Updated: 2024/09/19 17:51:32 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_reduce_action.h"
#include <stdlib.h>
t_reduce_action *vec_reduce_action_get(t_vec_reduce_action *vec, t_usize i)
{
if (vec == NULL || vec->buffer == NULL)
return (NULL);
if (i < vec->len)
return (&vec->buffer[i]);
return (NULL);
}
t_reduce_action *vec_reduce_action_last(t_vec_reduce_action *vec)
{
if (vec == NULL || vec->len == 0)
return (NULL);
return (&vec->buffer[vec->len - 1]);
}
void vec_reduce_action_copy_into(t_vec_reduce_action *vec,
t_vec_reduce_action *dest)
{
if (vec == NULL || dest == NULL)
return ;
vec_reduce_action_reserve(dest, vec->capacity);
mem_copy(dest->buffer, vec->buffer, vec->len * sizeof(t_reduce_action));
}
struct s_vec_reduce_action_splice_arguments vec_reduce_action_splice_args(\
t_usize index, \
t_usize old_count, t_usize new_count, const t_reduce_action *elements)
{
return ((struct s_vec_reduce_action_splice_arguments){index, old_count,
new_count, elements});
}
void vec_reduce_action_splice(t_vec_reduce_action *self,
struct s_vec_reduce_action_splice_arguments args)
{
t_reduce_action *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
new_size = self->len + args.new_count - args.old_count;
old_end = args.index + args.old_count;
new_end = args.index + args.new_count;
vec_reduce_action_reserve(self, new_size);
contents = self->buffer;
if (self->len > old_end)
mem_move(contents + new_end, contents + old_end, (self->len - old_end)
* sizeof(t_reduce_action));
if (args.new_count > 0)
{
if (args.elements)
mem_copy((contents + args.index * sizeof(t_reduce_action)),
args.elements, args.new_count * sizeof(t_reduce_action));
else
mem_set_zero((contents + args.index * sizeof(t_reduce_action)),
args.new_count * sizeof(t_reduce_action));
}
self->len += args.new_count - args.old_count;
}

25
output/src/vec/str/str.c
View file

@ -15,9 +15,10 @@
#include "me/vec/vec_str.h"
#include <stdlib.h>
t_vec_str vec_str_new(t_usize capacity, t_free_str_item free_function)
t_vec_str vec_str_new(t_usize capacity,
t_free_str_item free_function)
{
t_vec_str out;
t_vec_str out;
out = (t_vec_str){0};
out.free_func = free_function;
@ -28,7 +29,7 @@ t_vec_str vec_str_new(t_usize capacity, t_free_str_item free_function)
}
/// Return true in case of an error
t_error vec_str_push(t_vec_str *vec, t_str element)
t_error vec_str_push(t_vec_str *vec, t_str element)
{
if (vec == NULL)
return (ERROR);
@ -39,9 +40,9 @@ t_error vec_str_push(t_vec_str *vec, t_str element)
}
/// Return true in case of an error
t_error vec_str_reserve(t_vec_str *vec, t_usize wanted_capacity)
t_error vec_str_reserve(t_vec_str *vec, t_usize wanted_capacity)
{
size_t new_capacity;
size_t new_capacity;
if (vec == NULL)
return (ERROR);
@ -50,8 +51,8 @@ t_error vec_str_reserve(t_vec_str *vec, t_usize wanted_capacity)
new_capacity = (vec->capacity * 3) / 2 + 1;
while (wanted_capacity > new_capacity)
new_capacity = (new_capacity * 3) / 2 + 1;
vec->buffer = mem_realloc_array(vec->buffer, new_capacity,
sizeof(t_str));
vec->buffer =
mem_realloc_array(vec->buffer, new_capacity, sizeof(t_str));
vec->capacity = new_capacity;
}
return (NO_ERROR);
@ -59,10 +60,10 @@ t_error vec_str_reserve(t_vec_str *vec, t_usize wanted_capacity)
/// Return true if the vector is empty
/// This function is safe to call with value being NULL
t_error vec_str_pop(t_vec_str *vec, t_str *value)
t_error vec_str_pop(t_vec_str *vec, t_str *value)
{
t_str temp_value;
t_str *ptr;
t_str temp_value;
t_str *ptr;
if (vec == NULL || vec->len == 0)
return (ERROR);
@ -76,10 +77,10 @@ t_error vec_str_pop(t_vec_str *vec, t_str *value)
}
/// This function is safe to call with `free_elem` being NULL
void vec_str_free(t_vec_str vec)
void vec_str_free(t_vec_str vec)
{
if (vec.buffer == NULL)
return ;
return;
if (vec.free_func)
{
while (vec.len)

34
output/src/vec/str/str_functions2.c
View file

@ -10,14 +10,17 @@
/* */
/* ************************************************************************** */
#include "me/mem/mem.h"
#include "me/mem/mem.h"
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_str.h"
#include <stdlib.h>
t_error vec_str_find(t_vec_str *vec, bool (*fn)(const t_str *), t_usize *index)
t_error vec_str_find(t_vec_str *vec,
bool (*fn)(const t_str *), t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
@ -34,10 +37,11 @@ t_error vec_str_find(t_vec_str *vec, bool (*fn)(const t_str *), t_usize *index)
return (ERROR);
}
t_error vec_str_find_starting(t_vec_str *vec, bool (*fn)(const t_str *),
t_usize starting_index, t_usize *index)
t_error vec_str_find_starting(t_vec_str *vec,
bool (*fn)(const t_str *),
t_usize starting_index, t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
@ -54,9 +58,10 @@ t_error vec_str_find_starting(t_vec_str *vec, bool (*fn)(const t_str *),
return (ERROR);
}
t_error vec_str_all(t_vec_str *vec, bool (*fn)(const t_str *), bool *result)
t_error vec_str_all(t_vec_str *vec,
bool (*fn)(const t_str *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -71,9 +76,10 @@ t_error vec_str_all(t_vec_str *vec, bool (*fn)(const t_str *), bool *result)
return (ERROR);
}
t_error vec_str_any(t_vec_str *vec, bool (*fn)(const t_str *), bool *result)
t_error vec_str_any(t_vec_str *vec,
bool (*fn)(const t_str *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -88,13 +94,15 @@ t_error vec_str_any(t_vec_str *vec, bool (*fn)(const t_str *), bool *result)
return (ERROR);
}
void vec_str_iter(t_vec_str *vec, void (*fn)(t_usize index, t_str *value,
void *state), void *state)
void vec_str_iter(t_vec_str *vec,
void (*fn)(t_usize index, t_str *value,
void *state),
void *state)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL)
return ;
return;
idx = 0;
while (idx < vec->len)
{

23
output/src/vec/str/str_functions3.c
View file

@ -15,15 +15,16 @@
#include "me/vec/vec_str.h"
#include <stdlib.h>
t_error vec_str_push_front(t_vec_str *vec, t_str element)
t_error vec_str_push_front(t_vec_str *vec,
t_str element)
{
t_usize i;
t_usize i;
if (vec->len == 0)
return (vec_str_push(vec, element));
i = vec->len - 1;
if (vec->capacity < vec->len + 1 && vec_str_reserve(vec, 3 * vec->len / 2
+ 1))
if (vec->capacity < vec->len + 1 &&
vec_str_reserve(vec, 3 * vec->len / 2 + 1))
return (ERROR);
while (i > 0)
{
@ -36,9 +37,9 @@ t_error vec_str_push_front(t_vec_str *vec, t_str element)
return (NO_ERROR);
}
t_error vec_str_pop_front(t_vec_str *vec, t_str *value)
t_error vec_str_pop_front(t_vec_str *vec, t_str *value)
{
t_usize i;
t_usize i;
if (vec->len <= 1)
return (vec_str_pop(vec, value));
@ -54,10 +55,10 @@ t_error vec_str_pop_front(t_vec_str *vec, t_str *value)
return (NO_ERROR);
}
void vec_str_reverse(t_vec_str *vec)
void vec_str_reverse(t_vec_str *vec)
{
t_str temporary;
t_usize i;
t_str temporary;
t_usize i;
i = 0;
while (i < vec->len / 2)
@ -69,9 +70,9 @@ void vec_str_reverse(t_vec_str *vec)
}
}
t_error vec_str_back(t_vec_str *vec, t_str **out)
t_error vec_str_back(t_vec_str *vec, t_str **out)
{
t_str *temporary;
t_str *temporary;
if (out == NULL)
out = &temporary;

39
output/src/vec/str/str_functions4.c
View file

@ -15,7 +15,7 @@
#include "me/vec/vec_str.h"
#include <stdlib.h>
t_str *vec_str_get(t_vec_str *vec, t_usize i)
t_str *vec_str_get(t_vec_str *vec, t_usize i)
{
if (vec == NULL || vec->buffer == NULL)
return (NULL);
@ -24,14 +24,14 @@ t_str *vec_str_get(t_vec_str *vec, t_usize i)
return (NULL);
}
t_str *vec_str_last(t_vec_str *vec)
t_str *vec_str_last(t_vec_str *vec)
{
if (vec == NULL || vec->len == 0)
return (NULL);
return (&vec->buffer[vec->len - 1]);
}
void vec_str_copy_into(t_vec_str *vec, t_vec_str *dest)
void vec_str_copy_into(t_vec_str *vec, t_vec_str *dest)
{
if (vec == NULL || dest == NULL)
return ;
@ -39,19 +39,21 @@ void vec_str_copy_into(t_vec_str *vec, t_vec_str *dest)
mem_copy(dest->buffer, vec->buffer, vec->len * sizeof(t_str));
}
struct s_vec_str_splice_arguments vec_str_splice_args(t_usize index,
t_usize old_count, t_usize new_count, const t_str *elements)
struct s_vec_str_splice_arguments vec_str_splice_args(
t_usize index, t_usize old_count, t_usize new_count,
const t_str *elements)
{
return ((struct s_vec_str_splice_arguments){index, old_count, new_count,
elements});
return ((struct s_vec_str_splice_arguments){index, old_count,
new_count, elements});
}
void vec_str_splice(t_vec_str *self, struct s_vec_str_splice_arguments args)
void vec_str_splice(t_vec_str *self,
struct s_vec_str_splice_arguments args)
{
t_str *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
t_str *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
new_size = self->len + args.new_count - args.old_count;
old_end = args.index + args.old_count;
@ -59,16 +61,17 @@ void vec_str_splice(t_vec_str *self, struct s_vec_str_splice_arguments args)
vec_str_reserve(self, new_size);
contents = self->buffer;
if (self->len > old_end)
mem_move(contents + new_end, contents + old_end, (self->len - old_end)
* sizeof(t_str));
mem_move(contents + new_end,
contents + old_end,
(self->len - old_end) * sizeof(t_str));
if (args.new_count > 0)
{
if (args.elements)
mem_copy((contents + args.index * sizeof(t_str)), args.elements,
args.new_count * sizeof(t_str));
mem_copy((contents + args.index * sizeof(t_str)),
args.elements, args.new_count * sizeof(t_str));
else
mem_set_zero((contents + args.index * sizeof(t_str)), args.new_count
* sizeof(t_str));
mem_set_zero((contents + args.index * sizeof(t_str)),
args.new_count * sizeof(t_str));
}
self->len += args.new_count - args.old_count;
}

11
output/src/vec/str/str_sort.c
View file

@ -13,14 +13,15 @@
#include "me/types.h"
#include "me/vec/vec_str.h"
void vec_str_sort(t_vec_str *v, t_vec_str_sort_fn is_sorted_fn)
void vec_str_sort(t_vec_str *v,
t_vec_str_sort_fn is_sorted_fn)
{
t_usize sorted_part;
t_usize i;
t_str tmp;
t_usize sorted_part;
t_usize i;
t_str tmp;
if (v == NULL)
return ;
return;
sorted_part = v->len;
while (sorted_part > 0)
{

75
output/src/vec/subtree/subtree_functions4.c
View file

@ -1,75 +0,0 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* 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_subtree *vec_subtree_get(t_vec_subtree *vec, t_usize i)
{
if (vec == NULL || vec->buffer == NULL)
return (NULL);
if (i < vec->len)
return (&vec->buffer[i]);
return (NULL);
}
t_subtree *vec_subtree_last(t_vec_subtree *vec)
{
if (vec == NULL || vec->len == 0)
return (NULL);
return (&vec->buffer[vec->len - 1]);
}
void vec_subtree_copy_into(t_vec_subtree *vec, t_vec_subtree *dest)
{
if (vec == NULL || dest == NULL)
return ;
vec_subtree_reserve(dest, vec->capacity);
mem_copy(dest->buffer, vec->buffer, vec->len * sizeof(t_subtree));
}
struct s_vec_subtree_splice_arguments vec_subtree_splice_args(t_usize index,
t_usize old_count, t_usize new_count, const t_subtree *elements)
{
return ((struct s_vec_subtree_splice_arguments){index, old_count, new_count,
elements});
}
void vec_subtree_splice(t_vec_subtree *self,
struct s_vec_subtree_splice_arguments args)
{
t_subtree *contents;
t_u32 new_size;
t_u32 old_end;
t_u32 new_end;
new_size = self->len + args.new_count - args.old_count;
old_end = args.index + args.old_count;
new_end = args.index + args.new_count;
vec_subtree_reserve(self, new_size);
contents = self->buffer;
if (self->len > old_end)
mem_move(contents + new_end, contents + old_end, (self->len - old_end)
* sizeof(t_subtree));
if (args.new_count > 0)
{
if (args.elements)
mem_copy((contents + args.index * sizeof(t_subtree)), args.elements,
args.new_count * sizeof(t_subtree));
else
mem_set_zero((contents + args.index * sizeof(t_subtree)),
args.new_count * sizeof(t_subtree));
}
self->len += args.new_count - args.old_count;
}

38
output/src/vec/subtree/subtree.c → output/src/vec/token/token.c
View file

@ -1,7 +1,7 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_subtree.c :+: :+: :+: */
/* vec_token.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
@ -12,37 +12,37 @@
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_subtree.h"
#include "me/vec/vec_token.h"
#include <stdlib.h>
t_vec_subtree vec_subtree_new(t_usize capacity,
t_free_subtree_item free_function)
t_vec_token vec_token_new(t_usize capacity,
t_free_token_item free_function)
{
t_vec_subtree out;
t_vec_token out;
out = (t_vec_subtree){0};
out = (t_vec_token){0};
out.free_func = free_function;
out.buffer = mem_alloc_array(capacity, sizeof(t_subtree));
out.buffer = mem_alloc_array(capacity, sizeof(t_token));
if (out.buffer)
out.capacity = capacity;
return (out);
}
/// Return true in case of an error
t_error vec_subtree_push(t_vec_subtree *vec, t_subtree element)
t_error vec_token_push(t_vec_token *vec, t_token element)
{
if (vec == NULL)
return (ERROR);
vec_subtree_reserve(vec, vec->len + 1);
vec_token_reserve(vec, vec->len + 1);
vec->buffer[vec->len] = element;
vec->len += 1;
return (NO_ERROR);
}
/// Return true in case of an error
t_error vec_subtree_reserve(t_vec_subtree *vec, t_usize wanted_capacity)
t_error vec_token_reserve(t_vec_token *vec, t_usize wanted_capacity)
{
size_t new_capacity;
size_t new_capacity;
if (vec == NULL)
return (ERROR);
@ -51,8 +51,8 @@ t_error vec_subtree_reserve(t_vec_subtree *vec, t_usize wanted_capacity)
new_capacity = (vec->capacity * 3) / 2 + 1;
while (wanted_capacity > new_capacity)
new_capacity = (new_capacity * 3) / 2 + 1;
vec->buffer = mem_realloc_array(vec->buffer, new_capacity,
sizeof(t_subtree));
vec->buffer =
mem_realloc_array(vec->buffer, new_capacity, sizeof(t_token));
vec->capacity = new_capacity;
}
return (NO_ERROR);
@ -60,10 +60,10 @@ t_error vec_subtree_reserve(t_vec_subtree *vec, t_usize wanted_capacity)
/// Return true if the vector is empty
/// This function is safe to call with value being NULL
t_error vec_subtree_pop(t_vec_subtree *vec, t_subtree *value)
t_error vec_token_pop(t_vec_token *vec, t_token *value)
{
t_subtree temp_value;
t_subtree *ptr;
t_token temp_value;
t_token *ptr;
if (vec == NULL || vec->len == 0)
return (ERROR);
@ -72,15 +72,15 @@ t_error vec_subtree_pop(t_vec_subtree *vec, t_subtree *value)
ptr = &temp_value;
vec->len--;
*ptr = vec->buffer[vec->len];
mem_set_zero(&vec->buffer[vec->len], sizeof(t_subtree));
mem_set_zero(&vec->buffer[vec->len], sizeof(t_token));
return (NO_ERROR);
}
/// This function is safe to call with `free_elem` being NULL
void vec_subtree_free(t_vec_subtree vec)
void vec_token_free(t_vec_token vec)
{
if (vec.buffer == NULL)
return ;
return;
if (vec.free_func)
{
while (vec.len)

49
output/src/vec/subtree/subtree_functions2.c → output/src/vec/token/token_functions2.c
View file

@ -1,7 +1,7 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_subtree.c :+: :+: :+: */
/* vec_token.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
@ -10,22 +10,24 @@
/* */
/* ************************************************************************** */
#include "me/mem/mem.h"
#include "me/mem/mem.h"
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_subtree.h"
#include "me/vec/vec_token.h"
#include <stdlib.h>
t_error vec_subtree_find(t_vec_subtree *vec, bool (*fn)(const t_subtree *),
t_usize *index)
t_error vec_token_find(t_vec_token *vec,
bool (*fn)(const t_token *), t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
idx = 0;
while (idx < vec->len)
{
if (fn((const t_subtree *)&vec->buffer[idx]))
if (fn((const t_token *)&vec->buffer[idx]))
{
*index = idx;
return (NO_ERROR);
@ -35,17 +37,18 @@ t_error vec_subtree_find(t_vec_subtree *vec, bool (*fn)(const t_subtree *),
return (ERROR);
}
t_error vec_subtree_find_starting(t_vec_subtree *vec,
bool (*fn)(const t_subtree *), t_usize starting_index, t_usize *index)
t_error vec_token_find_starting(t_vec_token *vec,
bool (*fn)(const t_token *),
t_usize starting_index, t_usize *index)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || index == NULL)
return (ERROR);
idx = starting_index;
while (idx < vec->len)
{
if (fn((const t_subtree *)&vec->buffer[idx]))
if (fn((const t_token *)&vec->buffer[idx]))
{
*index = idx;
return (NO_ERROR);
@ -55,10 +58,10 @@ t_error vec_subtree_find_starting(t_vec_subtree *vec,
return (ERROR);
}
t_error vec_subtree_all(t_vec_subtree *vec, bool (*fn)(const t_subtree *),
bool *result)
t_error vec_token_all(t_vec_token *vec,
bool (*fn)(const t_token *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -66,17 +69,17 @@ t_error vec_subtree_all(t_vec_subtree *vec, bool (*fn)(const t_subtree *),
*result = true;
while (*result && idx < vec->len)
{
if (!fn((const t_subtree *)&vec->buffer[idx]))
if (!fn((const t_token *)&vec->buffer[idx]))
*result = false;
idx++;
}
return (ERROR);
}
t_error vec_subtree_any(t_vec_subtree *vec, bool (*fn)(const t_subtree *),
bool *result)
t_error vec_token_any(t_vec_token *vec,
bool (*fn)(const t_token *), bool *result)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL || result == NULL)
return (ERROR);
@ -84,20 +87,22 @@ t_error vec_subtree_any(t_vec_subtree *vec, bool (*fn)(const t_subtree *),
*result = false;
while (*result && idx < vec->len)
{
if (fn((const t_subtree *)&vec->buffer[idx]))
if (fn((const t_token *)&vec->buffer[idx]))
*result = true;
idx++;
}
return (ERROR);
}
void vec_subtree_iter(t_vec_subtree *vec, void (*fn)(t_usize index,
t_subtree *value, void *state), void *state)
void vec_token_iter(t_vec_token *vec,
void (*fn)(t_usize index, t_token *value,
void *state),
void *state)
{
t_usize idx;
t_usize idx;
if (vec == NULL || fn == NULL)
return ;
return;
idx = 0;
while (idx < vec->len)
{

31
output/src/vec/subtree/subtree_functions3.c → output/src/vec/token/token_functions3.c
View file

@ -1,7 +1,7 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_subtree.c :+: :+: :+: */
/* vec_token.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
@ -12,18 +12,19 @@
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_subtree.h"
#include "me/vec/vec_token.h"
#include <stdlib.h>
t_error vec_subtree_push_front(t_vec_subtree *vec, t_subtree element)
t_error vec_token_push_front(t_vec_token *vec,
t_token element)
{
t_usize i;
t_usize i;
if (vec->len == 0)
return (vec_subtree_push(vec, element));
return (vec_token_push(vec, element));
i = vec->len - 1;
if (vec->capacity < vec->len + 1 && vec_subtree_reserve(vec, 3 * vec->len
/ 2 + 1))
if (vec->capacity < vec->len + 1 &&
vec_token_reserve(vec, 3 * vec->len / 2 + 1))
return (ERROR);
while (i > 0)
{
@ -36,12 +37,12 @@ t_error vec_subtree_push_front(t_vec_subtree *vec, t_subtree element)
return (NO_ERROR);
}
t_error vec_subtree_pop_front(t_vec_subtree *vec, t_subtree *value)
t_error vec_token_pop_front(t_vec_token *vec, t_token *value)
{
t_usize i;
t_usize i;
if (vec->len <= 1)
return (vec_subtree_pop(vec, value));
return (vec_token_pop(vec, value));
i = 0;
*value = vec->buffer[0];
vec->len--;
@ -54,10 +55,10 @@ t_error vec_subtree_pop_front(t_vec_subtree *vec, t_subtree *value)
return (NO_ERROR);
}
void vec_subtree_reverse(t_vec_subtree *vec)
void vec_token_reverse(t_vec_token *vec)
{
t_subtree temporary;
t_usize i;
t_token temporary;
t_usize i;
i = 0;
while (i < vec->len / 2)
@ -69,9 +70,9 @@ void vec_subtree_reverse(t_vec_subtree *vec)
}
}
t_error vec_subtree_back(t_vec_subtree *vec, t_subtree **out)
t_error vec_token_back(t_vec_token *vec, t_token **out)
{
t_subtree *temporary;
t_token *temporary;
if (out == NULL)
out = &temporary;

47
output/src/vec/reduce_action/reduce_action_sort.c → output/src/vec/token/token_functions4.c
View file

@ -1,41 +1,32 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* reduce_action_sort.c :+: :+: :+: */
/* token_functions4.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/01/29 20:04:33 by maiboyer #+# #+# */
/* Updated: 2024/01/31 14:25:00 by maiboyer ### ########.fr */
/* Created: 2023/12/30 17:59:28 by maiboyer #+# #+# */
/* Updated: 2024/09/26 18:29:18 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#include "me/mem/mem.h"
#include "me/types.h"
#include "me/vec/vec_reduce_action.h"
#include "me/vec/vec_token.h"
#include <stdlib.h>
void vec_reduce_action_sort(t_vec_reduce_action *v,
t_vec_reduce_action_sort_fn is_sorted_fn)
t_token *vec_token_get(t_vec_token *vec, t_usize i)
{
t_usize sorted_part;
t_usize i;
t_reduce_action tmp;
if (v == NULL)
return ;
sorted_part = v->len;
while (sorted_part > 0)
{
i = 0;
while (i < sorted_part - 1)
{
if (!is_sorted_fn(&v->buffer[i], &v->buffer[i + 1]))
{
tmp = v->buffer[i];
v->buffer[i] = v->buffer[i + 1];
v->buffer[i + 1] = tmp;
}
i++;
}
sorted_part--;
}
if (vec == NULL || vec->buffer == NULL)
return (NULL);
if (i < vec->len)
return (&vec->buffer[i]);
return (NULL);
}
t_token *vec_token_last(t_vec_token *vec)
{
if (vec == NULL || vec->len == 0)
return (NULL);
return (&vec->buffer[vec->len - 1]);
}

13
output/src/vec/subtree/subtree_sort.c → output/src/vec/token/token_sort.c
View file

@ -11,16 +11,17 @@
/* ************************************************************************** */
#include "me/types.h"
#include "me/vec/vec_subtree.h"
#include "me/vec/vec_token.h"
void vec_subtree_sort(t_vec_subtree *v, t_vec_subtree_sort_fn is_sorted_fn)
void vec_token_sort(t_vec_token *v,
t_vec_token_sort_fn is_sorted_fn)
{
t_usize sorted_part;
t_usize i;
t_subtree tmp;
t_usize sorted_part;
t_usize i;
t_token tmp;
if (v == NULL)
return ;
return;
sorted_part = v->len;
while (sorted_part > 0)
{