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

update: fix compilation bug

Browse source
This commit is contained in:
maix0 2024-09-19 17:47:06 +02:00
parent 50a2f3d4be
commit 4a6ea68d08
3 changed files with 14 additions and 14 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -6,7 +6,7 @@
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/06 11:00:22 by maiboyer #+# #+# */
/* Updated: 2024/09/19 12:11:03 by rparodi ### ########.fr */
/* Updated: 2024/09/19 17:44:19 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
@ -65,7 +65,7 @@ typedef struct s_hashmap_env
t_free_env_fn free;
} t_hashmap_env;
/// @brief Creates a new hashmap with the given hash, \
/// @brief Creates a new hashmap with the given hash,
/// comparison, & free functions
/// @param hash The hash function
/// @param cmp The comparison function
@ -74,7 +74,7 @@ typedef struct s_hashmap_env
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, \
/// @brief Creates a new hashmap with the given hash,
/// comparison, and free functions
/// @param hash The hash function
/// @param cmp The comparison function
@ -102,7 +102,7 @@ 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, \
/// @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);
@ -121,19 +121,19 @@ void hmap_env_remove(t_hashmap_env *hmap, t_str *key);
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 & \
/// @brief Iterates over the hashmap &
/// 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 \
/// @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, \
/// @brief Clone an entire hashmap,
/// using the given function to duplicate the items
/// @param self The hashmap
/// @param func The function to call

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

@ -6,7 +6,7 @@
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/04 18:46:53 by maiboyer #+# #+# */
/* Updated: 2024/09/19 14:33:03 by rparodi ### ########.fr */
/* Updated: 2024/09/19 17:42:32 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
@ -27,7 +27,7 @@ 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;
struct s_vec_ast_splice_arguments

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

@ -6,7 +6,7 @@
/* By: rparodi <rparodi@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/09/19 14:09:05 by rparodi #+# #+# */
/* Updated: 2024/09/19 14:20:30 by rparodi ### ########.fr */
/* Updated: 2024/09/19 17:45:30 by maiboyer ### ########.fr */
/* */
/* ************************************************************************** */
@ -23,7 +23,7 @@ typedef bool (*t_vec_reduce_action_sort_fn)(\
typedef void (*t_free_reduce_action_item)(t_reduce_action);
/// @brief A dynamic array of t_reduce_action
struct s_vec_reduce_action
typedef struct s_vec_reduce_action
{
t_free_reduce_action_item free_func;
t_usize len;
@ -60,7 +60,7 @@ t_error vec_reduce_action_push(\
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, \
/// @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
@ -108,7 +108,7 @@ 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 \
/// @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
@ -119,7 +119,7 @@ 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 \
/// @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