normed: output directory
This commit is contained in:
maix0
parent
7bb95e24a6
commit
3d11b63428
37 changed files with 692 additions and 708 deletions
|
|
@ -1,44 +1,41 @@
|
|||
/* ************************************************************************** */
|
||||
/* */
|
||||
/* ::: :::::::: */
|
||||
/* hashmap_env.h :+: :+: :+: */
|
||||
/* hashmap_env.h :+: :+: :+: */
|
||||
/* +:+ +:+ +:+ */
|
||||
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
|
||||
/* +#+#+#+#+#+ +#+ */
|
||||
/* Created: 2023/12/06 11:00:22 by maiboyer #+# #+# */
|
||||
/* Updated: 2023/12/11 15:24:44 by maiboyer ### ########.fr */
|
||||
/* Updated: 2024/10/12 15:40:37 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 and 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 eq
|
||||
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
|
||||
|
|
@ -46,10 +43,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
|
||||
|
|
@ -60,54 +57,60 @@ 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, 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
|
||||
/// @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
|
||||
|
|
@ -116,23 +119,30 @@ 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 and 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
|
||||
|
|
|
|||
34
output/include/me/vec/include_token_workaround.h
Normal file
34
output/include/me/vec/include_token_workaround.h
Normal file
|
|
@ -0,0 +1,34 @@
|
|||
/* ************************************************************************** */
|
||||
/* */
|
||||
/* ::: :::::::: */
|
||||
/* include_token_workaround.h :+: :+: :+: */
|
||||
/* +:+ +:+ +:+ */
|
||||
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
|
||||
/* +#+#+#+#+#+ +#+ */
|
||||
/* Created: 2024/10/12 15:44:15 by maiboyer #+# #+# */
|
||||
/* Updated: 2024/10/12 15:44:35 by maiboyer ### ########.fr */
|
||||
/* */
|
||||
/* ************************************************************************** */
|
||||
|
||||
#ifndef INCLUDE_TOKEN_WORKAROUND_H
|
||||
# define INCLUDE_TOKEN_WORKAROUND_H
|
||||
|
||||
# include "me/types.h"
|
||||
|
||||
typedef struct s_token t_token;
|
||||
|
||||
/// @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;
|
||||
};
|
||||
|
||||
#endif /* INCLUDE_TOKEN_WORKAROUND_H */
|
||||
|
|
@ -11,33 +11,34 @@
|
|||
/* ************************************************************************** */
|
||||
|
||||
#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 *lhs, t_ast_node *rhs);
|
||||
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 elem);
|
||||
typedef void (*t_free_ast_item)(t_ast_node elem);
|
||||
|
||||
/// @brief A dynamic array of t_ast_node
|
||||
typedef struct s_vec_ast t_vec_ast;
|
||||
typedef struct s_vec_ast t_vec_ast;
|
||||
|
||||
struct s_vec_ast
|
||||
struct s_vec_ast
|
||||
{
|
||||
t_free_ast_item free_func;
|
||||
t_usize len;
|
||||
t_usize capacity;
|
||||
t_ast_node *buffer;
|
||||
t_free_ast_item free_func;
|
||||
t_usize len;
|
||||
t_usize capacity;
|
||||
t_ast_node *buffer;
|
||||
};
|
||||
|
||||
struct s_vec_ast_splice_arguments
|
||||
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
|
||||
|
|
@ -45,26 +46,28 @@ 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,26 +75,28 @@ 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
|
||||
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
|
||||
|
|
@ -99,9 +104,9 @@ t_error vec_ast_find(t_vec_ast *vec,
|
|||
/// @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
|
||||
|
|
@ -110,8 +115,9 @@ t_error vec_ast_find_starting(t_vec_ast *vec,
|
|||
/// @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
|
||||
|
|
@ -120,55 +126,58 @@ t_error vec_ast_all(t_vec_ast *vec,
|
|||
/// @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
|
||||
|
|
|
|||
|
|
@ -1,43 +1,44 @@
|
|||
/* ************************************************************************** */
|
||||
/* */
|
||||
/* ::: :::::::: */
|
||||
/* vec_estr.h :+: :+: :+: */
|
||||
/* vec_estr.h :+: :+: :+: */
|
||||
/* +:+ +:+ +:+ */
|
||||
/* By: maiboyer <maiboyer@student.42.fr> +#+ +:+ +#+ */
|
||||
/* +#+#+#+#+#+ +#+ */
|
||||
/* Created: 2023/12/04 18:46:53 by maiboyer #+# #+# */
|
||||
/* Updated: 2023/12/09 17:53:00 by maiboyer ### ########.fr */
|
||||
/* Updated: 2024/10/12 15:43:26 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 *lhs, t_expandable_str *rhs);
|
||||
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 elem);
|
||||
typedef void (*t_free_estr_item)(t_expandable_str elem);
|
||||
|
||||
/// @brief A dynamic array of t_expandable_str
|
||||
typedef struct s_vec_estr t_vec_estr;
|
||||
typedef struct s_vec_estr t_vec_estr;
|
||||
|
||||
struct s_vec_estr
|
||||
struct s_vec_estr
|
||||
{
|
||||
t_free_estr_item free_func;
|
||||
t_usize len;
|
||||
t_usize capacity;
|
||||
t_expandable_str *buffer;
|
||||
t_free_estr_item free_func;
|
||||
t_usize len;
|
||||
t_usize capacity;
|
||||
t_expandable_str *buffer;
|
||||
};
|
||||
|
||||
struct s_vec_estr_splice_arguments
|
||||
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
|
||||
|
|
@ -45,26 +46,28 @@ 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
|
||||
|
|
@ -72,26 +75,28 @@ t_error vec_estr_pop(t_vec_estr *vec, t_expandable_str *value);
|
|||
/// @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
|
||||
|
|
@ -99,9 +104,9 @@ t_error vec_estr_find(t_vec_estr *vec,
|
|||
/// @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
|
||||
|
|
@ -110,8 +115,9 @@ t_error vec_estr_find_starting(t_vec_estr *vec,
|
|||
/// @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
|
||||
|
|
@ -120,55 +126,50 @@ t_error vec_estr_all(t_vec_estr *vec,
|
|||
/// @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);
|
||||
|
||||
/// read code lol
|
||||
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,
|
||||
const t_expandable_str *elements);
|
||||
void vec_estr_copy_into(t_vec_estr *vec,
|
||||
t_vec_estr *dest);
|
||||
|
||||
#endif
|
||||
|
|
|
|||
|
|
@ -11,33 +11,34 @@
|
|||
/* ************************************************************************** */
|
||||
|
||||
#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 *lhs, t_pid *rhs);
|
||||
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 elem);
|
||||
typedef void (*t_free_pid_item)(t_pid elem);
|
||||
|
||||
/// @brief A dynamic array of t_pid
|
||||
typedef struct s_vec_pid t_vec_pid;
|
||||
typedef struct s_vec_pid t_vec_pid;
|
||||
|
||||
struct s_vec_pid
|
||||
struct s_vec_pid
|
||||
{
|
||||
t_free_pid_item free_func;
|
||||
t_usize len;
|
||||
t_usize capacity;
|
||||
t_pid *buffer;
|
||||
t_free_pid_item free_func;
|
||||
t_usize len;
|
||||
t_usize capacity;
|
||||
t_pid *buffer;
|
||||
};
|
||||
|
||||
struct s_vec_pid_splice_arguments
|
||||
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
|
||||
|
|
@ -45,26 +46,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,26 +73,28 @@ t_error vec_pid_pop(t_vec_pid *vec, t_pid *value);
|
|||
/// @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
|
||||
|
|
@ -99,9 +102,9 @@ t_error vec_pid_find(t_vec_pid *vec,
|
|||
/// @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
|
||||
|
|
@ -110,8 +113,9 @@ t_error vec_pid_find_starting(t_vec_pid *vec,
|
|||
/// @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
|
||||
|
|
@ -120,55 +124,56 @@ t_error vec_pid_all(t_vec_pid *vec,
|
|||
/// @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,
|
||||
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);
|
||||
|
||||
#endif
|
||||
|
|
|
|||
|
|
@ -11,33 +11,33 @@
|
|||
/* ************************************************************************** */
|
||||
|
||||
#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 *lhs, t_str *rhs);
|
||||
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 elem);
|
||||
typedef void (*t_free_str_item)(t_str elem);
|
||||
|
||||
/// @brief A dynamic array of t_str
|
||||
typedef struct s_vec_str t_vec_str;
|
||||
typedef struct s_vec_str t_vec_str;
|
||||
|
||||
struct s_vec_str
|
||||
struct s_vec_str
|
||||
{
|
||||
t_free_str_item free_func;
|
||||
t_usize len;
|
||||
t_usize capacity;
|
||||
t_str *buffer;
|
||||
t_free_str_item free_func;
|
||||
t_usize len;
|
||||
t_usize capacity;
|
||||
t_str *buffer;
|
||||
};
|
||||
|
||||
struct s_vec_str_splice_arguments
|
||||
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
|
||||
|
|
@ -45,26 +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
|
||||
|
|
@ -72,26 +72,28 @@ 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 +101,9 @@ t_error vec_str_find(t_vec_str *vec,
|
|||
/// @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,8 +112,9 @@ t_error vec_str_find_starting(t_vec_str *vec,
|
|||
/// @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
|
||||
|
|
@ -120,55 +123,56 @@ t_error vec_str_all(t_vec_str *vec,
|
|||
/// @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,
|
||||
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);
|
||||
|
||||
#endif
|
||||
|
|
|
|||
|
|
@ -6,60 +6,45 @@
|
|||
/* 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 */
|
||||
/* Updated: 2024/10/12 15:43:58 by maiboyer ### ########.fr */
|
||||
/* */
|
||||
/* ************************************************************************** */
|
||||
|
||||
#ifndef VEC_TOKEN_H
|
||||
#define 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
|
||||
# include "./include_token_workaround.h"
|
||||
# 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);
|
||||
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);
|
||||
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);
|
||||
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);
|
||||
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);
|
||||
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
|
||||
|
|
@ -67,24 +52,27 @@ t_error vec_token_pop(t_vec_token *vec, t_token *value);
|
|||
/// @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);
|
||||
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);
|
||||
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);
|
||||
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);
|
||||
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
|
||||
|
|
@ -92,7 +80,9 @@ t_error vec_token_find(t_vec_token *vec, bool (*fn)(const t_token *), t_usize *i
|
|||
/// @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);
|
||||
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
|
||||
|
|
@ -101,7 +91,8 @@ t_error vec_token_find_starting(t_vec_token *vec, bool (*fn)(const t_token *), t
|
|||
/// @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);
|
||||
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
|
||||
|
|
@ -110,42 +101,47 @@ t_error vec_token_all(t_vec_token *vec, bool (*fn)(const t_token *), bool *resul
|
|||
/// @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);
|
||||
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);
|
||||
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);
|
||||
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);
|
||||
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);
|
||||
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);
|
||||
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);
|
||||
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);
|
||||
void vec_token_copy_into(t_vec_token *vec,
|
||||
t_vec_token *dest);
|
||||
|
||||
#endif
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue