jack/42-archive
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

id.c

Browse source
This commit is contained in:
Jack Halford 2017-03-06 20:27:16 +01:00
parent ee9d9bfabb
commit 30f3606561
4 changed files with 11 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
libft/includes/btree.h
View file

@ -36,6 +36,7 @@ typedef struct s_btree t_btree;
typedef struct s_printdata t_printdata;
t_btree *btree_create_node(void const *item, size_t content_size);
t_btree *btree_map(t_btree *root, void *(*f)(void *))
void btree_insert_data(
t_btree **root,
void *item,

4
libft/includes/math.h
View file

@ -1,5 +1,4 @@
/* ************************************************************************** */
/* */
/* ************************************************************************** */ /* */
/* ::: :::::::: */
/* math.h :+: :+: :+: */
/* +:+ +:+ +:+ */
@ -33,5 +32,6 @@ size_t ft_lllen(long long n);
size_t ft_lllen_base(long long n, int base);
int ft_addrcmp(void *a, void *b);
void *id(void *data);
#endif

4
libft/src/btree/btree_map.c
View file

@ -1,13 +1,13 @@
#include "btree.h"
t_btree *btree_map(t_btree *root, void *(*f)(void *item))
t_btree *btree_map(t_btree *root, void *(*f)(void *))
{
t_btree *new;
if (!root)
return (NULL);
new = btree_create_node(root->item, root->content_size);
new->item = (*f)(root->item);
new->item = (*f)(new->item);
new->left = btree_map(root->left, f);
new->right = btree_map(root->right, f);
return (new);

6
libft/src/math/id.c Normal file
View file

@ -0,0 +1,6 @@
#include "libft.h"
void *id(void *data)
{
return (data);
}