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

Small Update to ast...

Browse source
This commit is contained in:
Maix0 2024-06-16 18:46:17 +02:00
parent 9f41a868a7
commit c9baa2b499
8 changed files with 393 additions and 133 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -16,18 +16,18 @@
#include "ast/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 * *);
/// @brief A function that free an t_ast_node *
typedef void (*t_free_ast_item)(t_ast_node *);
/// @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 *);
/// @brief A function that free an t_ast_node
typedef void (*t_free_ast_item)(t_ast_node);
/// @brief A dynamic array of t_ast_node *
/// @brief A dynamic array of t_ast_node
typedef struct s_vec_ast
{
t_free_ast_item free_func;
t_usize len;
t_usize capacity;
t_ast_node * *buffer;
t_ast_node *buffer;
} t_vec_ast;
/// @brief Create a new vec_ast with a given capacity
@ -37,19 +37,19 @@ 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
@ -57,7 +57,7 @@ t_error vec_ast_pop(t_vec_ast *vec, t_ast_node * *value);
/// @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
@ -73,7 +73,7 @@ t_error vec_ast_reserve(t_vec_ast *vec, t_usize wanted_capacity);
/// @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
@ -81,7 +81,7 @@ t_error vec_ast_find(t_vec_ast *vec, bool (*fn)(const t_ast_node * *), t_usize *
/// @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
/// @param vec The vec_ast to search in
@ -89,7 +89,7 @@ t_error vec_ast_find_starting(t_vec_ast *vec, bool (*fn)(const t_ast_node * *),
/// @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
/// @param vec The vec_ast to search in
@ -97,13 +97,13 @@ t_error vec_ast_all(t_vec_ast *vec, bool (*fn)(const t_ast_node * *), bool *resu
/// @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
@ -118,6 +118,6 @@ void vec_ast_sort(t_vec_ast *vec, t_vec_ast_sort_fn is_sorted);
/// @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);
#endif