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

106
output/include/me/hashmap/hashmap_env.h
View file

@ -1,41 +1,44 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* hashmap_env.h :+: :+: :+: */
/* hashmap_env.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/06 11:00:22 by maiboyer #+# #+# */
/* Updated: 2024/09/19 17:44:19 by maiboyer ### ########.fr */
/* Updated: 2023/12/11 15:24:44 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef HASHMAP_ENV_H
# define HASHMAP_ENV_H
#define HASHMAP_ENV_H
# define DEFAULT_BUCKETS 750
#define DEFAULT_BUCKETS 750
# include "me/hash/hasher.h"
# include "me/types.h"
# include <stddef.h>
# include <stdint.h>
# include <stdio.h>
# include <stdlib.h>
# include <string.h>
#include "me/hash/hasher.h"
#include "me/types.h"
#include <stddef.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/// @struct A key-value pair for the hashmap
typedef struct s_kv_env
{
t_str key;
t_str val;
} t_kv_env;
t_str key;
t_str val;
} t_kv_env;
/// @typedef A function that hashes a key
typedef void (*t_hash_env_fn)(t_hasher *hasher, t_str *key);
typedef void (*t_hash_env_fn)(t_hasher *hasher, t_str *key);
/// @typedef A function that drops a key-value pair
typedef void (*t_free_env_fn)(t_kv_env val);
/// @typedef A function that compares two keys & returns true if they are equal
typedef bool (*t_eq_env_fn)(t_str *lhs, t_str *rhs);
typedef void (*t_free_env_fn)(t_kv_env val);
/// @typedef A function that compares two keys and returns true if they are equal
typedef bool (*t_eq_env_fn)(t_str *lhs, t_str *rhs);
/// @struct A single entry in the hashmap
/// @var hash_id The hash of the key
@ -43,10 +46,10 @@ typedef bool (*t_eq_env_fn)(t_str *lhs, t_str *rhs);
/// @var next The next entry in the bucket
typedef struct s_entry_env
{
t_usize hash_id;
t_usize hash_id;
t_kv_env kv;
struct s_entry_env *next;
} t_entry_env;
struct s_entry_env *next;
} t_entry_env;
/// @struct A hashmap of keys t_str and values t_str
/// @var buckets The array of buckets
@ -57,59 +60,54 @@ typedef struct s_entry_env
/// @var free The free function
typedef struct s_hashmap_env
{
t_entry_env **buckets;
t_usize num_buckets;
t_hasher hasher;
t_hash_env_fn hfunc;
t_eq_env_fn cfunc;
t_free_env_fn free;
} t_hashmap_env;
t_entry_env **buckets;
t_usize num_buckets;
t_hasher hasher;
t_hash_env_fn hfunc;
t_eq_env_fn cfunc;
t_free_env_fn free;
} t_hashmap_env;
/// @brief Creates a new hashmap with the given hash,
/// comparison, & free functions
/// @brief Creates a new hashmap with the given hash, comparison, and free functions
/// @param hash The hash function
/// @param cmp The comparison function
/// @param free The free function
/// @return A new hashmap
t_hashmap_env *hmap_env_new(\
t_hash_env_fn hash, t_eq_env_fn cmp, t_free_env_fn free);
t_hashmap_env *hmap_env_new(t_hash_env_fn hash, t_eq_env_fn cmp, t_free_env_fn free);
/// @brief Creates a new hashmap with the given hash,
/// comparison, and free functions
/// @brief Creates a new hashmap with the given hash, comparison, and free functions
/// @param hash The hash function
/// @param cmp The comparison function
/// @param free The free function
/// @param cap The number of buckets
/// @return A new hashmap
t_hashmap_env *hmap_env_new_with_buckets(\
t_hash_env_fn hash, t_eq_env_fn cmp, t_free_env_fn free, size_t cap);
t_hashmap_env *hmap_env_new_with_buckets(t_hash_env_fn hash, t_eq_env_fn cmp, t_free_env_fn free, size_t cap);
/// @brief Free the hashmap and all of its entries
/// @param hmap The hashmap to free
void hmap_env_free(t_hashmap_env *hmap);
void hmap_env_free(t_hashmap_env *hmap);
/// @brief Clear the hashmap, removing all of its entries
/// @param hmap The hashmap to clear
void hmap_env_clear(t_hashmap_env *hmap);
void hmap_env_clear(t_hashmap_env *hmap);
/// @brief Inserts a key-value pair into the hashmap
/// @param hmap The hashmap
/// @param key The key
/// @param value The value
/// @return true if the key already existed before, false otherwise
bool hmap_env_insert(t_hashmap_env *hmap, t_str key, t_str value);
bool hmap_env_insert(t_hashmap_env *hmap, t_str key, t_str value);
/// @brief Gets the value associated with the key
/// @param hmap The hashmap
/// @param key The key
/// @return The value associated with the key,
/// or NULL if the key is not in the hashmap
t_str *hmap_env_get(t_hashmap_env *hmap, t_str *key);
/// @return The value associated with the key, or NULL if the key is not in the hashmap
t_str *hmap_env_get(t_hashmap_env *hmap, t_str *key);
/// @brief Removes the key-value pair from the hashmap
/// @param hmap The hashmap
/// @param key The key
void hmap_env_remove(t_hashmap_env *hmap, t_str *key);
void hmap_env_remove(t_hashmap_env *hmap, t_str *key);
/// @brief Get an entry from the hashmap
/// @param hmap The hashmap
@ -118,31 +116,23 @@ void hmap_env_remove(t_hashmap_env *hmap, t_str *key);
/// @param prev The previous entry in the bucket
/// @return The entry, or NULL if the key is not in the hashmap
/// @note this is an internal function
t_entry_env *hmap_env_get_entry(\
t_hashmap_env *hmap, t_usize hash, t_str *key, t_entry_env **prev);
t_entry_env *hmap_env_get_entry(t_hashmap_env *hmap, t_usize hash, t_str *key, t_entry_env **prev);
/// @brief Iterates over the hashmap &
/// calls the given function for each key-value pair
/// @brief Iterates over the hashmap and calls the given function for each key-value pair
/// @param self The hashmap
/// @param func The function to call
/// @param ctx The context to pass to the function
/// @return An error code
/// @note The iteration can be stopped by returning
/// an error code from the function
t_error hmap_env_iter(\
t_hashmap_env *self, t_error (*func)(\
t_usize idx, const t_str *key, t_str *val, void *ctx), void *ctx);
/// @note The iteration can be stopped by returning an error code from the function
t_error hmap_env_iter(t_hashmap_env *self, t_error (*func)(t_usize idx, const t_str *key, t_str *val, void *ctx), void *ctx);
/// @brief Clone an entire hashmap,
/// using the given function to duplicate the items
/// @brief Clone an entire hashmap, using the given function to duplicate the items
/// @param self The hashmap
/// @param func The function to call
/// @param ctx The context to pass to the function
/// @param out The cloned hashmap
/// @return An error code
t_error hmap_env_clone(\
t_hashmap_env *self, t_error (*clone)(\
const t_kv_env *val, void *ctx, t_kv_env *out), \
void *ctx, t_hashmap_env **out);
t_error hmap_env_clone(t_hashmap_env *self, t_error (*clone)(const t_kv_env *val, void *ctx, t_kv_env *out), void *ctx, t_hashmap_env **out);
#endif

108
output/include/me/vec/vec_ast.h
View file

@ -1,41 +1,43 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_ast.h :+: :+: :+: */
/* vec_ast.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/04 18:46:53 by maiboyer #+# #+# */
/* Updated: 2024/09/19 17:42:32 by maiboyer ### ########.fr */
/* Updated: 2023/12/09 17:53:00 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef VEC_AST_H
# define VEC_AST_H
#define VEC_AST_H
# include "ast/_forward_def.h"
# include "me/types.h"
#include "ast/_forward_def.h"
#include "me/types.h"
/// @brief A function that takes two t_ast_node and compare them
typedef bool (*t_vec_ast_sort_fn)(t_ast_node *, t_ast_node *);
typedef bool (*t_vec_ast_sort_fn)(t_ast_node *lhs, t_ast_node *rhs);
/// @brief A function that free an t_ast_node
typedef void (*t_free_ast_item)(t_ast_node);
typedef void (*t_free_ast_item)(t_ast_node elem);
/// @brief A dynamic array of t_ast_node
typedef struct s_vec_ast
typedef struct s_vec_ast t_vec_ast;
struct s_vec_ast
{
t_free_ast_item free_func;
t_usize len;
t_usize capacity;
t_ast_node *buffer;
} t_vec_ast;
t_free_ast_item free_func;
t_usize len;
t_usize capacity;
t_ast_node *buffer;
};
struct s_vec_ast_splice_arguments
{
t_usize index;
t_usize old_count;
t_usize new_count;
const t_ast_node *elements;
t_usize index;
t_usize old_count;
t_usize new_count;
const t_ast_node *elements;
};
/// @brief Create a new vec_ast with a given capacity
@ -43,28 +45,26 @@ struct s_vec_ast_splice_arguments
/// elements)
/// @param free_function The function that will be used to free the elements of
/// the vec_ast
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);
/// @brief Push an element to the last position of the vec_ast
/// @param vec The vec_ast to push the element to
/// @param element The element to push
t_error vec_ast_push(\
t_vec_ast *vec, t_ast_node element);
t_error vec_ast_push(t_vec_ast *vec, t_ast_node element);
/// @brief Push an element to the first position of the vec_ast
/// @param vec The vec_ast to push the element to
/// @param element The element to push
/// @note This operation is O(n)
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);
/// @brief Get the last element from the vec_ast, and remove it from the
/// vec_ast
/// @param vec The vec_ast to get the element from
/// @param[out] out The last element of the vec_ast
/// @return true if the operation failed, false otherwise
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);
/// @brief Get the first element from the vec_ast, and remove it from
/// the vec_ast
@ -72,27 +72,26 @@ t_error vec_ast_pop(\
/// @param[out] out The first element of the vec_ast
/// @return true if the operation failed, false otherwise
/// @note This operation is O(n)
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);
/// @brief Free the vector and all its elements
/// @param vec The vec_ast to free
void vec_ast_free(t_vec_ast vec);
void vec_ast_free(t_vec_ast vec);
/// @brief Make the vec_ast at least the given capacity
/// @param vec The vec_ast to reserve
/// @param wanted_capacity The minimum capacity to reserve
/// @return true if the operation failed, false otherwise
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);
/// @brief Run the function and returns the index of the first element that
/// returns true
/// @param vec The vec_ast to search in
/// @param fn The function to run on each element
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function and returns the index of the first element that
/// returns true, but starting at index starting_index
@ -100,9 +99,9 @@ t_error vec_ast_find(t_vec_ast *vec, bool (*fn)(\
/// @param fn The function to run on each element
/// @param starting_index The index to start the search from
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function on every element of the vec_ast and returns
/// if all elements returned true
@ -111,8 +110,8 @@ t_error vec_ast_find_starting(\
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_ast is empty, result will be true
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);
/// @brief Run the function on every element of the vec_ast and returns
/// if any element returned true
@ -121,54 +120,55 @@ t_error vec_ast_all(t_vec_ast *vec, bool (*fn)(\
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_ast is empty, result will be false
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);
/// @brief Run the function on every element of the vec_ast
/// @param vec The vec_ast to iterate over
/// @param fn The function to run on each element
/// @param state The state to pass to the function
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);
/// @brief Reverse the order of the elements in the vec_ast
/// @param vec The vec_ast to reverse
void vec_ast_reverse(t_vec_ast *vec);
void vec_ast_reverse(t_vec_ast *vec);
/// @brief Sort the elements of the vec_ast
/// @param vec The vec_ast to sort
/// @param is_sorted The function to use to compare the elements
void vec_ast_sort(\
t_vec_ast *vec, t_vec_ast_sort_fn is_sorted);
void vec_ast_sort(t_vec_ast *vec,
t_vec_ast_sort_fn is_sorted);
/// @brief Get a pointer to the last element of the vec_ast
/// @param vec The vec_ast to get the element from
/// @param[out] out A pointer to the last element of the vec_ast
/// @return true if the operation failed, false otherwise
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);
/// @brief Get a pointer to the i'th element, or NULL otherwise
/// @param vec The vec_ast to get the element from
/// @return A pointer to the element or NULL
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);
/// @brief Get a pointer to the last element, or NULL otherwise
/// @param vec The vec_ast to get the element from
/// @return A pointer to the last element or NULL
t_ast_node *vec_ast_last(t_vec_ast *vec);
t_ast_node *vec_ast_last(t_vec_ast *vec);
/// @brief Perform a simple bytewise copy into the other vector
/// @param vec The vec_ast to be copied from
/// @param dest The vec_ast to be copied to
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);
/// read code lol
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);
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);
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);
#endif

110
output/include/me/vec/vec_estr.h
View file

@ -1,41 +1,43 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_estr.h :+: :+: :+: */
/* vec_estr.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/04 18:46:53 by maiboyer #+# #+# */
/* Updated: 2024/09/19 14:33:29 by rparodi ### ########.fr */
/* Updated: 2023/12/09 17:53:00 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef VEC_ESTR_H
# define VEC_ESTR_H
#define VEC_ESTR_H
# include "exec/_tuple_expanded_str.h"
# include "me/types.h"
#include "exec/_tuple_expanded_str.h"
#include "me/types.h"
/// @brief A function that takes two t_expandable_str and compare them
typedef bool (*t_vec_estr_sort_fn)(t_expandable_str *, t_expandable_str *);
typedef bool (*t_vec_estr_sort_fn)(t_expandable_str *lhs, t_expandable_str *rhs);
/// @brief A function that free an t_expandable_str
typedef void (*t_free_estr_item)(t_expandable_str);
typedef void (*t_free_estr_item)(t_expandable_str elem);
/// @brief A dynamic array of t_expandable_str
typedef struct s_vec_estr
typedef struct s_vec_estr t_vec_estr;
struct s_vec_estr
{
t_free_estr_item free_func;
t_usize len;
t_usize capacity;
t_expandable_str *buffer;
} t_vec_estr;
t_free_estr_item free_func;
t_usize len;
t_usize capacity;
t_expandable_str *buffer;
};
struct s_vec_estr_splice_arguments
{
t_usize index;
t_usize old_count;
t_usize new_count;
const t_expandable_str *elements;
t_usize index;
t_usize old_count;
t_usize new_count;
const t_expandable_str *elements;
};
/// @brief Create a new vec_estr with a given capacity
@ -43,29 +45,26 @@ struct s_vec_estr_splice_arguments
/// elements)
/// @param free_function The function that will be used to free the elements of
/// the vec_estr
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);
/// @brief Push an element to the last position of the vec_estr
/// @param vec The vec_estr to push the element to
/// @param element The element to push
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);
/// @brief Push an element to the first position of the vec_estr
/// @param vec The vec_estr to push the element to
/// @param element The element to push
/// @note This operation is O(n)
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);
/// @brief Get the last element from the vec_estr, and remove it from the
/// vec_estr
/// @param vec The vec_estr to get the element from
/// @param[out] out The last element of the vec_estr
/// @return true if the operation failed, false otherwise
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);
/// @brief Get the first element from the vec_estr, and remove it from
/// the vec_estr
@ -73,27 +72,26 @@ t_error vec_estr_pop(\
/// @param[out] out The first element of the vec_estr
/// @return true if the operation failed, false otherwise
/// @note This operation is O(n)
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);
/// @brief Free the vector and all its elements
/// @param vec The vec_estr to free
void vec_estr_free(t_vec_estr vec);
void vec_estr_free(t_vec_estr vec);
/// @brief Make the vec_estr at least the given capacity
/// @param vec The vec_estr to reserve
/// @param wanted_capacity The minimum capacity to reserve
/// @return true if the operation failed, false otherwise
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);
/// @brief Run the function and returns the index of the first element that
/// returns true
/// @param vec The vec_estr to search in
/// @param fn The function to run on each element
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function and returns the index of the first element that
/// returns true, but starting at index starting_index
@ -101,9 +99,9 @@ t_error vec_estr_find(\
/// @param fn The function to run on each element
/// @param starting_index The index to start the search from
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function on every element of the vec_estr and returns
/// if all elements returned true
@ -112,8 +110,8 @@ t_error vec_estr_find_starting(\
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_estr is empty, result will be true
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);
/// @brief Run the function on every element of the vec_estr and returns
/// if any element returned true
@ -122,57 +120,55 @@ t_error vec_estr_all(\
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_estr is empty, result will be false
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);
/// @brief Run the function on every element of the vec_estr
/// @param vec The vec_estr to iterate over
/// @param fn The function to run on each element
/// @param state The state to pass to the function
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);
/// @brief Reverse the order of the elements in the vec_estr
/// @param vec The vec_estr to reverse
void vec_estr_reverse(t_vec_estr *vec);
void vec_estr_reverse(t_vec_estr *vec);
/// @brief Sort the elements of the vec_estr
/// @param vec The vec_estr to sort
/// @param is_sorted The function to use to compare the elements
void vec_estr_sort(\
t_vec_estr *vec, t_vec_estr_sort_fn is_sorted);
void vec_estr_sort(t_vec_estr *vec,
t_vec_estr_sort_fn is_sorted);
/// @brief Get a pointer to the last element of the vec_estr
/// @param vec The vec_estr to get the element from
/// @param[out] out A pointer to the last element of the vec_estr
/// @return true if the operation failed, false otherwise
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);
/// @brief Get a pointer to the i'th element, or NULL otherwise
/// @param vec The vec_estr to get the element from
/// @return A pointer to the element or NULL
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);
/// @brief Get a pointer to the last element, or NULL otherwise
/// @param vec The vec_estr to get the element from
/// @return A pointer to the last element or NULL
t_expandable_str *vec_estr_last(t_vec_estr *vec);
t_expandable_str *vec_estr_last(t_vec_estr *vec);
/// @brief Perform a simple bytewise copy into the other vector
/// @param vec The vec_estr to be copied from
/// @param dest The vec_estr to be copied to
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);
/// read code lol
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);
struct s_vec_estr_splice_arguments vec_estr_splice_args( \
t_usize index, t_usize old_count, t_usize new_count, \
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);
#endif

112
output/include/me/vec/vec_pid.h
View file

@ -1,41 +1,43 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_pid.h :+: :+: :+: */
/* vec_pid.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/04 18:46:53 by maiboyer #+# #+# */
/* Updated: 2024/09/19 14:33:54 by rparodi ### ########.fr */
/* Updated: 2023/12/09 17:53:00 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef VEC_PID_H
# define VEC_PID_H
#define VEC_PID_H
# include "me/os/os.h"
# include "me/types.h"
#include "me/os/os.h"
#include "me/types.h"
/// @brief A function that takes two t_pid and compare them
typedef bool (*t_vec_pid_sort_fn)(t_pid *, t_pid *);
typedef bool (*t_vec_pid_sort_fn)(t_pid *lhs, t_pid *rhs);
/// @brief A function that free an t_pid
typedef void (*t_free_pid_item)(t_pid);
typedef void (*t_free_pid_item)(t_pid elem);
/// @brief A dynamic array of t_pid
typedef struct s_vec_pid
typedef struct s_vec_pid t_vec_pid;
struct s_vec_pid
{
t_free_pid_item free_func;
t_usize len;
t_usize capacity;
t_pid *buffer;
} t_vec_pid;
t_free_pid_item free_func;
t_usize len;
t_usize capacity;
t_pid *buffer;
};
struct s_vec_pid_splice_arguments
{
t_usize index;
t_usize old_count;
t_usize new_count;
const t_pid *elements;
t_usize index;
t_usize old_count;
t_usize new_count;
const t_pid *elements;
};
/// @brief Create a new vec_pid with a given capacity
@ -43,28 +45,26 @@ struct s_vec_pid_splice_arguments
/// elements)
/// @param free_function The function that will be used to free the elements of
/// the vec_pid
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);
/// @brief Push an element to the last position of the vec_pid
/// @param vec The vec_pid to push the element to
/// @param element The element to push
t_error vec_pid_push(\
t_vec_pid *vec, t_pid element);
t_error vec_pid_push(t_vec_pid *vec, t_pid element);
/// @brief Push an element to the first position of the vec_pid
/// @param vec The vec_pid to push the element to
/// @param element The element to push
/// @note This operation is O(n)
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);
/// @brief Get the last element from the vec_pid, and remove it from the
/// vec_pid
/// @param vec The vec_pid to get the element from
/// @param[out] out The last element of the vec_pid
/// @return true if the operation failed, false otherwise
t_error vec_pid_pop(\
t_vec_pid *vec, t_pid *value);
t_error vec_pid_pop(t_vec_pid *vec, t_pid *value);
/// @brief Get the first element from the vec_pid, and remove it from
/// the vec_pid
@ -72,28 +72,26 @@ t_error vec_pid_pop(\
/// @param[out] out The first element of the vec_pid
/// @return true if the operation failed, false otherwise
/// @note This operation is O(n)
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);
/// @brief Free the vector and all its elements
/// @param vec The vec_pid to free
void vec_pid_free(\
t_vec_pid vec);
void vec_pid_free(t_vec_pid vec);
/// @brief Make the vec_pid at least the given capacity
/// @param vec The vec_pid to reserve
/// @param wanted_capacity The minimum capacity to reserve
/// @return true if the operation failed, false otherwise
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);
/// @brief Run the function and returns the index of the first element that
/// returns true
/// @param vec The vec_pid to search in
/// @param fn The function to run on each element
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function and returns the index of the first element that
/// returns true, but starting at index starting_index
@ -101,9 +99,9 @@ t_error vec_pid_find(\
/// @param fn The function to run on each element
/// @param starting_index The index to start the search from
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function on every element of the vec_pid and returns
/// if all elements returned true
@ -112,8 +110,8 @@ t_error vec_pid_find_starting(\
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_pid is empty, result will be true
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);
/// @brief Run the function on every element of the vec_pid and returns
/// if any element returned true
@ -122,59 +120,55 @@ t_error vec_pid_all(\
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_pid is empty, result will be false
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);
/// @brief Run the function on every element of the vec_pid
/// @param vec The vec_pid to iterate over
/// @param fn The function to run on each element
/// @param state The state to pass to the function
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);
/// @brief Reverse the order of the elements in the vec_pid
/// @param vec The vec_pid to reverse
void vec_pid_reverse(\
t_vec_pid *vec);
void vec_pid_reverse(t_vec_pid *vec);
/// @brief Sort the elements of the vec_pid
/// @param vec The vec_pid to sort
/// @param is_sorted The function to use to compare the elements
void vec_pid_sort(\
t_vec_pid *vec, t_vec_pid_sort_fn is_sorted);
void vec_pid_sort(t_vec_pid *vec,
t_vec_pid_sort_fn is_sorted);
/// @brief Get a pointer to the last element of the vec_pid
/// @param vec The vec_pid to get the element from
/// @param[out] out A pointer to the last element of the vec_pid
/// @return true if the operation failed, false otherwise
t_error vec_pid_back(\
t_vec_pid *vec, t_pid **out);
t_error vec_pid_back(t_vec_pid *vec, t_pid **out);
/// @brief Get a pointer to the i'th element, or NULL otherwise
/// @param vec The vec_pid to get the element from
/// @return A pointer to the element or NULL
t_pid *vec_pid_get(\
t_vec_pid *vec, t_usize i);
t_pid *vec_pid_get(t_vec_pid *vec, t_usize i);
/// @brief Get a pointer to the last element, or NULL otherwise
/// @param vec The vec_pid to get the element from
/// @return A pointer to the last element or NULL
t_pid *vec_pid_last(\
t_vec_pid *vec);
t_pid *vec_pid_last(t_vec_pid *vec);
/// @brief Perform a simple bytewise copy into the other vector
/// @param vec The vec_pid to be copied from
/// @param dest The vec_pid to be copied to
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);
/// read code lol
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);
struct s_vec_pid_splice_arguments vec_pid_splice_args( \
t_usize index, t_usize old_count, t_usize new_count, \
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);
#endif

186
output/include/me/vec/vec_reduce_action.h
View file

@ -1,186 +0,0 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_reduce_action.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: rparodi <rparodi@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/09/19 14:09:05 by rparodi #+# #+# */
/* Updated: 2024/09/19 17:45:30 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef VEC_REDUCE_ACTION_H
# define VEC_REDUCE_ACTION_H
# include "parser/inner/reduce_action_inner.h"
# include "me/types.h"
/// @brief A function that takes two t_reduce_action and compare them
typedef bool (*t_vec_reduce_action_sort_fn)(\
t_reduce_action *, t_reduce_action *);
/// @brief A function that free an t_reduce_action
typedef void (*t_free_reduce_action_item)(t_reduce_action);
/// @brief A dynamic array of t_reduce_action
typedef struct s_vec_reduce_action
{
t_free_reduce_action_item free_func;
t_usize len;
t_usize capacity;
t_reduce_action *buffer;
} t_vec_reduce_action;
struct s_vec_reduce_action_splice_arguments
{
t_usize index;
t_usize old_count;
t_usize new_count;
const t_reduce_action *elements;
};
/// @brief Create a new vec_reduce_action with a given capacity
/// @param capacity The capacity of the new vec_reduce_action (in terms of
/// elements)
/// @param free_function The function that will be used to free the elements of
/// the vec_reduce_action
t_vec_reduce_action vec_reduce_action_new(\
t_usize capacity, t_free_reduce_action_item free_function);
/// @brief Push an element to the last position of the vec_reduce_action
/// @param vec The vec_reduce_action to push the element to
/// @param element The element to push
t_error vec_reduce_action_push(\
t_vec_reduce_action *vec, t_reduce_action element);
/// @brief Push an element to the first position of the vec_reduce_action
/// @param vec The vec_reduce_action to push the element to
/// @param element The element to push
/// @note This operation is O(n)
t_error vec_reduce_action_push_front(\
t_vec_reduce_action *vec, t_reduce_action element);
/// @brief Get the last element from the vec_reduce_action,
/// and remove it from the vec_reduce_action
/// @param vec The vec_reduce_action to get the element from
/// @param[out] out The last element of the vec_reduce_action
/// @return true if the operation failed, false otherwise
t_error vec_reduce_action_pop(\
t_vec_reduce_action *vec, t_reduce_action *value);
/// @brief Get the first element from the vec_reduce_action, and remove it from
/// the vec_reduce_action
/// @param vec The vec_reduce_action to get the element from
/// @param[out] out The first element of the vec_reduce_action
/// @return true if the operation failed, false otherwise
/// @note This operation is O(n)
t_error vec_reduce_action_pop_front(\
t_vec_reduce_action *vec, t_reduce_action *value);
/// @brief Free the vector and all its elements
/// @param vec The vec_reduce_action to free
void vec_reduce_action_free(\
t_vec_reduce_action vec);
/// @brief Make the vec_reduce_action at least the given capacity
/// @param vec The vec_reduce_action to reserve
/// @param wanted_capacity The minimum capacity to reserve
/// @return true if the operation failed, false otherwise
t_error vec_reduce_action_reserve(\
t_vec_reduce_action *vec, t_usize wanted_capacity);
/// @brief Run the function and returns the index of the first element that
/// returns true
/// @param vec The vec_reduce_action to search in
/// @param fn The function to run on each element
/// @param[out] index The index of the first element that returns true
t_error vec_reduce_action_find(\
t_vec_reduce_action *vec, bool (*fn)(\
const t_reduce_action *), t_usize *index);
/// @brief Run the function and returns the index of the first element that
/// returns true, but starting at index starting_index
/// @param vec The vec_reduce_action to search in
/// @param fn The function to run on each element
/// @param starting_index The index to start the search from
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function on every element of the
/// vec_reduce_action and returns if all elements returned true
/// @param vec The vec_reduce_action to search in
/// @param fn The function to run on each element
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_reduce_action is empty, result will be true
t_error vec_reduce_action_all(\
t_vec_reduce_action *vec, bool (*fn)(\
const t_reduce_action *), bool *result);
/// @brief Run the function on every element
/// of the vec_reduce_action and returns if any element returned true
/// @param vec The vec_reduce_action to search in
/// @param fn The function to run on each element
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_reduce_action is empty, result will be false
t_error vec_reduce_action_any(\
t_vec_reduce_action *vec, bool (*fn)(\
const t_reduce_action *), bool *result);
/// @brief Run the function on every element of the vec_reduce_action
/// @param vec The vec_reduce_action to iterate over
/// @param fn The function to run on each element
/// @param state The state to pass to the function
void vec_reduce_action_iter(\
t_vec_reduce_action *vec, void (*fn)(\
t_usize index, t_reduce_action *value, void *state), void *state);
/// @brief Reverse the order of the elements in the vec_reduce_action
/// @param vec The vec_reduce_action to reverse
void vec_reduce_action_reverse(\
t_vec_reduce_action *vec);
/// @brief Sort the elements of the vec_reduce_action
/// @param vec The vec_reduce_action to sort
/// @param is_sorted The function to use to compare the elements
void vec_reduce_action_sort(\
t_vec_reduce_action *vec, t_vec_reduce_action_sort_fn is_sorted);
/// @brief Get a pointer to the last element of the vec_reduce_action
/// @param vec The vec_reduce_action to get the element from
/// @param[out] out A pointer to the last element of the vec_reduce_action
/// @return true if the operation failed, false otherwise
t_error vec_reduce_action_back(\
t_vec_reduce_action *vec, t_reduce_action **out);
/// @brief Get a pointer to the i'th element, or NULL otherwise
/// @param vec The vec_reduce_action to get the element from
/// @return A pointer to the element or NULL
t_reduce_action *vec_reduce_action_get(\
t_vec_reduce_action *vec, t_usize i);
/// @brief Get a pointer to the last element, or NULL otherwise
/// @param vec The vec_reduce_action to get the element from
/// @return A pointer to the last element or NULL
t_reduce_action *vec_reduce_action_last(\
t_vec_reduce_action *vec);
/// @brief Perform a simple bytewise copy into the other vector
/// @param vec The vec_reduce_action to be copied from
/// @param dest The vec_reduce_action to be copied to
void vec_reduce_action_copy_into(\
t_vec_reduce_action *vec, t_vec_reduce_action *dest);
/// read code lol
void vec_reduce_action_splice(\
t_vec_reduce_action *self, \
struct s_vec_reduce_action_splice_arguments args);
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);
#endif

108
output/include/me/vec/vec_str.h
View file

@ -1,40 +1,43 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_str.h :+: :+: :+: */
/* vec_str.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/04 18:46:53 by maiboyer #+# #+# */
/* Updated: 2024/09/19 14:33:44 by rparodi ### ########.fr */
/* Updated: 2023/12/09 17:53:00 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef VEC_STR_H
# define VEC_STR_H
#define VEC_STR_H
# include "me/types.h"
#include "me/types.h"
/// @brief A function that takes two t_str and compare them
typedef bool (*t_vec_str_sort_fn)(t_str *, t_str *);
typedef bool (*t_vec_str_sort_fn)(t_str *lhs, t_str *rhs);
/// @brief A function that free an t_str
typedef void (*t_free_str_item)(t_str);
typedef void (*t_free_str_item)(t_str elem);
/// @brief A dynamic array of t_str
typedef struct s_vec_str
typedef struct s_vec_str t_vec_str;
struct s_vec_str
{
t_free_str_item free_func;
t_usize len;
t_usize capacity;
t_str *buffer;
} t_vec_str;
t_free_str_item free_func;
t_usize len;
t_usize capacity;
t_str *buffer;
};
struct s_vec_str_splice_arguments
{
t_usize index;
t_usize old_count;
t_usize new_count;
const t_str *elements;
t_usize index;
t_usize old_count;
t_usize new_count;
const t_str *elements;
};
/// @brief Create a new vec_str with a given capacity
@ -42,27 +45,26 @@ struct s_vec_str_splice_arguments
/// elements)
/// @param free_function The function that will be used to free the elements of
/// the vec_str
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);
/// @brief Push an element to the last position of the vec_str
/// @param vec The vec_str to push the element to
/// @param element The element to push
t_error vec_str_push(t_vec_str *vec, t_str element);
t_error vec_str_push(t_vec_str *vec, t_str element);
/// @brief Push an element to the first position of the vec_str
/// @param vec The vec_str to push the element to
/// @param element The element to push
/// @note This operation is O(n)
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);
/// @brief Get the last element from the vec_str, and remove it from the
/// vec_str
/// @param vec The vec_str to get the element from
/// @param[out] out The last element of the vec_str
/// @return true if the operation failed, false otherwise
t_error vec_str_pop(t_vec_str *vec, t_str *value);
t_error vec_str_pop(t_vec_str *vec, t_str *value);
/// @brief Get the first element from the vec_str, and remove it from
/// the vec_str
@ -70,28 +72,26 @@ t_error vec_str_pop(t_vec_str *vec, t_str *value);
/// @param[out] out The first element of the vec_str
/// @return true if the operation failed, false otherwise
/// @note This operation is O(n)
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);
/// @brief Free the vector and all its elements
/// @param vec The vec_str to free
void vec_str_free(t_vec_str vec);
void vec_str_free(t_vec_str vec);
/// @brief Make the vec_str at least the given capacity
/// @param vec The vec_str to reserve
/// @param wanted_capacity The minimum capacity to reserve
/// @return true if the operation failed, false otherwise
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);
/// @brief Run the function and returns the index of the first element that
/// returns true
/// @param vec The vec_str to search in
/// @param fn The function to run on each element
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function and returns the index of the first element that
/// returns true, but starting at index starting_index
@ -99,9 +99,9 @@ t_error vec_str_find(\
/// @param fn The function to run on each element
/// @param starting_index The index to start the search from
/// @param[out] index The index of the first element that returns true
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);
/// @brief Run the function on every element of the vec_str and returns
/// if all elements returned true
@ -110,9 +110,8 @@ t_error vec_str_find_starting(\
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_str is empty, result will be true
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);
/// @brief Run the function on every element of the vec_str and returns
/// if any element returned true
@ -121,56 +120,55 @@ t_error vec_str_all(\
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_str is empty, result will be false
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);
/// @brief Run the function on every element of the vec_str
/// @param vec The vec_str to iterate over
/// @param fn The function to run on each element
/// @param state The state to pass to the function
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);
/// @brief Reverse the order of the elements in the vec_str
/// @param vec The vec_str to reverse
void vec_str_reverse(t_vec_str *vec);
void vec_str_reverse(t_vec_str *vec);
/// @brief Sort the elements of the vec_str
/// @param vec The vec_str to sort
/// @param is_sorted The function to use to compare the elements
void vec_str_sort(\
t_vec_str *vec, t_vec_str_sort_fn is_sorted);
void vec_str_sort(t_vec_str *vec,
t_vec_str_sort_fn is_sorted);
/// @brief Get a pointer to the last element of the vec_str
/// @param vec The vec_str to get the element from
/// @param[out] out A pointer to the last element of the vec_str
/// @return true if the operation failed, false otherwise
t_error vec_str_back(t_vec_str *vec, t_str **out);
t_error vec_str_back(t_vec_str *vec, t_str **out);
/// @brief Get a pointer to the i'th element, or NULL otherwise
/// @param vec The vec_str to get the element from
/// @return A pointer to the element or NULL
t_str *vec_str_get(t_vec_str *vec, t_usize i);
t_str *vec_str_get(t_vec_str *vec, t_usize i);
/// @brief Get a pointer to the last element, or NULL otherwise
/// @param vec The vec_str to get the element from
/// @return A pointer to the last element or NULL
t_str *vec_str_last(t_vec_str *vec);
t_str *vec_str_last(t_vec_str *vec);
/// @brief Perform a simple bytewise copy into the other vector
/// @param vec The vec_str to be copied from
/// @param dest The vec_str to be copied to
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);
/// read code lol
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);
struct s_vec_str_splice_arguments vec_str_splice_args( \
t_usize index, t_usize old_count, t_usize new_count, \
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);
#endif

182
output/include/me/vec/vec_subtree.h
View file

@ -1,182 +0,0 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_subtree.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/04 18:46:53 by maiboyer #+# #+# */
/* Updated: 2024/09/19 14:44:48 by rparodi ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef VEC_SUBTREE_H
# define VEC_SUBTREE_H
# include "parser/inner/subtree_inner.h"
# include "me/types.h"
/// @brief A function that takes two t_subtree and compare them
typedef bool (*t_vec_subtree_sort_fn)(t_subtree *, t_subtree *);
/// @brief A function that free an t_subtree
typedef void (*t_free_subtree_item)(t_subtree);
/// @brief A dynamic array of t_subtree
typedef struct s_vec_subtree
{
t_free_subtree_item free_func;
t_usize len;
t_usize capacity;
t_subtree *buffer;
} t_vec_subtree;
struct s_vec_subtree_splice_arguments
{
t_usize index;
t_usize old_count;
t_usize new_count;
const t_subtree *elements;
};
/// @brief Create a new vec_subtree with a given capacity
/// @param capacity The capacity of the new vec_subtree (in terms of
/// elements)
/// @param free_function The function that will be used to free the elements of
/// the vec_subtree
t_vec_subtree vec_subtree_new(\
t_usize capacity, t_free_subtree_item free_function);
/// @brief Push an element to the last position of the vec_subtree
/// @param vec The vec_subtree to push the element to
/// @param element The element to push
t_error vec_subtree_push(\
t_vec_subtree *vec, t_subtree element);
/// @brief Push an element to the first position of the vec_subtree
/// @param vec The vec_subtree to push the element to
/// @param element The element to push
/// @note This operation is O(n)
t_error vec_subtree_push_front(\
t_vec_subtree *vec, t_subtree element);
/// @brief Get the last element from the vec_subtree, and remove it from the
/// vec_subtree
/// @param vec The vec_subtree to get the element from
/// @param[out] out The last element of the vec_subtree
/// @return true if the operation failed, false otherwise
t_error vec_subtree_pop(\
t_vec_subtree *vec, t_subtree *value);
/// @brief Get the first element from the vec_subtree, and remove it from
/// the vec_subtree
/// @param vec The vec_subtree to get the element from
/// @param[out] out The first element of the vec_subtree
/// @return true if the operation failed, false otherwise
/// @note This operation is O(n)
t_error vec_subtree_pop_front(\
t_vec_subtree *vec, t_subtree *value);
/// @brief Free the vector and all its elements
/// @param vec The vec_subtree to free
void vec_subtree_free(\
t_vec_subtree vec);
/// @brief Make the vec_subtree at least the given capacity
/// @param vec The vec_subtree to reserve
/// @param wanted_capacity The minimum capacity to reserve
/// @return true if the operation failed, false otherwise
t_error vec_subtree_reserve(\
t_vec_subtree *vec, t_usize wanted_capacity);
/// @brief Run the function and returns the index of the first element that
/// returns true
/// @param vec The vec_subtree to search in
/// @param fn The function to run on each element
/// @param[out] index The index of the first element that returns true
t_error vec_subtree_find(\
t_vec_subtree *vec, bool (*fn)(\
const t_subtree *), t_usize *index);
/// @brief Run the function and returns the index of the first element that
/// returns true, but starting at index starting_index
/// @param vec The vec_subtree to search in
/// @param fn The function to run on each element
/// @param starting_index The index to start the search from
/// @param[out] index The index of the first element that returns true
t_error vec_subtree_find_starting(\
t_vec_subtree *vec, bool (*fn)(\
const t_subtree *), t_usize starting_index, t_usize *index);
/// @brief Run the function on every element of the vec_subtree and returns
/// if all elements returned true
/// @param vec The vec_subtree to search in
/// @param fn The function to run on each element
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_subtree is empty, result will be true
t_error vec_subtree_all(\
t_vec_subtree *vec, bool (*fn)(\
const t_subtree *), bool *result);
/// @brief Run the function on every element of the vec_subtree and returns
/// if any element returned true
/// @param vec The vec_subtree to search in
/// @param fn The function to run on each element
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_subtree is empty, result will be false
t_error vec_subtree_any(\
t_vec_subtree *vec, bool (*fn)(\
const t_subtree *), bool *result);
/// @brief Run the function on every element of the vec_subtree
/// @param vec The vec_subtree to iterate over
/// @param fn The function to run on each element
/// @param state The state to pass to the function
void vec_subtree_iter(\
t_vec_subtree *vec, void (*fn)(\
t_usize index, t_subtree *value, void *state), void *state);
/// @brief Reverse the order of the elements in the vec_subtree
/// @param vec The vec_subtree to reverse
void vec_subtree_reverse(t_vec_subtree *vec);
/// @brief Sort the elements of the vec_subtree
/// @param vec The vec_subtree to sort
/// @param is_sorted The function to use to compare the elements
void vec_subtree_sort(\
t_vec_subtree *vec, t_vec_subtree_sort_fn is_sorted);
/// @brief Get a pointer to the last element of the vec_subtree
/// @param vec The vec_subtree to get the element from
/// @param[out] out A pointer to the last element of the vec_subtree
/// @return true if the operation failed, false otherwise
t_error vec_subtree_back(\
t_vec_subtree *vec, t_subtree **out);
/// @brief Get a pointer to the i'th element, or NULL otherwise
/// @param vec The vec_subtree to get the element from
/// @return A pointer to the element or NULL
t_subtree *vec_subtree_get(\
t_vec_subtree *vec, t_usize i);
/// @brief Get a pointer to the last element, or NULL otherwise
/// @param vec The vec_subtree to get the element from
/// @return A pointer to the last element or NULL
t_subtree *vec_subtree_last(t_vec_subtree *vec);
/// @brief Perform a simple bytewise copy into the other vector
/// @param vec The vec_subtree to be copied from
/// @param dest The vec_subtree to be copied to
void vec_subtree_copy_into(\
t_vec_subtree *vec, t_vec_subtree *dest);
/// read code lol
void vec_subtree_splice(\
t_vec_subtree *self, struct s_vec_subtree_splice_arguments args);
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);
#endif

151
output/include/me/vec/vec_token.h Normal file
View file

@ -0,0 +1,151 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* vec_token.h :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/04 18:46:53 by maiboyer #+# #+# */
/* Updated: 2024/09/26 18:29:43 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
#ifndef VEC_TOKEN_H
#define VEC_TOKEN_H
typedef struct s_token t_token;
#include "me/types.h"
/// @brief A function that free an t_token
typedef void (*t_free_token_item)(t_token elem);
/// @brief A dynamic array of t_token
typedef struct s_vec_token t_vec_token;
struct s_vec_token
{
t_free_token_item free_func;
t_usize len;
t_usize capacity;
t_token *buffer;
};
#ifndef TOKEN_H
# include "parser/token.h"
#endif
/// @brief A function that takes two t_token and compare them
typedef bool (*t_vec_token_sort_fn)(t_token *lhs, t_token *rhs);
/// @brief Create a new vec_token with a given capacity
/// @param capacity The capacity of the new vec_token (in terms of
/// elements)
/// @param free_function The function that will be used to free the elements of
/// the vec_token
t_vec_token vec_token_new(t_usize capacity, t_free_token_item free_function);
/// @brief Push an element to the last position of the vec_token
/// @param vec The vec_token to push the element to
/// @param element The element to push
t_error vec_token_push(t_vec_token *vec, t_token element);
/// @brief Push an element to the first position of the vec_token
/// @param vec The vec_token to push the element to
/// @param element The element to push
/// @note This operation is O(n)
t_error vec_token_push_front(t_vec_token *vec, t_token element);
/// @brief Get the last element from the vec_token, and remove it from the
/// vec_token
/// @param vec The vec_token to get the element from
/// @param[out] out The last element of the vec_token
/// @return true if the operation failed, false otherwise
t_error vec_token_pop(t_vec_token *vec, t_token *value);
/// @brief Get the first element from the vec_token, and remove it from
/// the vec_token
/// @param vec The vec_token to get the element from
/// @param[out] out The first element of the vec_token
/// @return true if the operation failed, false otherwise
/// @note This operation is O(n)
t_error vec_token_pop_front(t_vec_token *vec, t_token *value);
/// @brief Free the vector and all its elements
/// @param vec The vec_token to free
void vec_token_free(t_vec_token vec);
/// @brief Make the vec_token at least the given capacity
/// @param vec The vec_token to reserve
/// @param wanted_capacity The minimum capacity to reserve
/// @return true if the operation failed, false otherwise
t_error vec_token_reserve(t_vec_token *vec, t_usize wanted_capacity);
/// @brief Run the function and returns the index of the first element that
/// returns true
/// @param vec The vec_token to search in
/// @param fn The function to run on each element
/// @param[out] index The index of the first element that returns true
t_error vec_token_find(t_vec_token *vec, bool (*fn)(const t_token *), t_usize *index);
/// @brief Run the function and returns the index of the first element that
/// returns true, but starting at index starting_index
/// @param vec The vec_token to search in
/// @param fn The function to run on each element
/// @param starting_index The index to start the search from
/// @param[out] index The index of the first element that returns true
t_error vec_token_find_starting(t_vec_token *vec, bool (*fn)(const t_token *), t_usize starting_index, t_usize *index);
/// @brief Run the function on every element of the vec_token and returns
/// if all elements returned true
/// @param vec The vec_token to search in
/// @param fn The function to run on each element
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_token is empty, result will be true
t_error vec_token_all(t_vec_token *vec, bool (*fn)(const t_token *), bool *result);
/// @brief Run the function on every element of the vec_token and returns
/// if any element returned true
/// @param vec The vec_token to search in
/// @param fn The function to run on each element
/// @param[out] result The result of the operation
/// @return true if the operation failed, false otherwise
/// @note If the vec_token is empty, result will be false
t_error vec_token_any(t_vec_token *vec, bool (*fn)(const t_token *), bool *result);
/// @brief Run the function on every element of the vec_token
/// @param vec The vec_token to iterate over
/// @param fn The function to run on each element
/// @param state The state to pass to the function
void vec_token_iter(t_vec_token *vec, void (*fn)(t_usize index, t_token *value, void *state), void *state);
/// @brief Reverse the order of the elements in the vec_token
/// @param vec The vec_token to reverse
void vec_token_reverse(t_vec_token *vec);
/// @brief Sort the elements of the vec_token
/// @param vec The vec_token to sort
/// @param is_sorted The function to use to compare the elements
void vec_token_sort(t_vec_token *vec, t_vec_token_sort_fn is_sorted);
/// @brief Get a pointer to the last element of the vec_token
/// @param vec The vec_token to get the element from
/// @param[out] out A pointer to the last element of the vec_token
/// @return true if the operation failed, false otherwise
t_error vec_token_back(t_vec_token *vec, t_token **out);
/// @brief Get a pointer to the i'th element, or NULL otherwise
/// @param vec The vec_token to get the element from
/// @return A pointer to the element or NULL
t_token *vec_token_get(t_vec_token *vec, t_usize i);
/// @brief Get a pointer to the last element, or NULL otherwise
/// @param vec The vec_token to get the element from
/// @return A pointer to the last element or NULL
t_token *vec_token_last(t_vec_token *vec);
/// @brief Perform a simple bytewise copy into the other vector
/// @param vec The vec_token to be copied from
/// @param dest The vec_token to be copied to
void vec_token_copy_into(t_vec_token *vec, t_vec_token *dest);
#endif