regenerated stuff

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

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)

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)
{

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;

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;
}

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)
{