diff options
| author | Charles <sircharlesaze@gmail.com> | 2020-02-15 04:37:16 +0100 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2020-02-15 04:37:16 +0100 |
| commit | bf4dc8e5c1dbb8149f0cab473f73b5e9bac24ae0 (patch) | |
| tree | c28598f33364e0bbb18dcc53978cbb65938878d0 /README.md | |
| parent | 9af2885d872de9c60b11159efe0685738031096d (diff) | |
| download | libft-bf4dc8e5c1dbb8149f0cab473f73b5e9bac24ae0.tar.gz libft-bf4dc8e5c1dbb8149f0cab473f73b5e9bac24ae0.tar.bz2 libft-bf4dc8e5c1dbb8149f0cab473f73b5e9bac24ae0.zip | |
Added lst* tests (mainly boilerplate)
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 8 |
1 files changed, 4 insertions, 4 deletions
@@ -128,20 +128,20 @@ Much like the `.gitignore` file, you can put the files/directory to ignore when | Name | Prototype | Description | Tested | |--------------------|---------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------|--------| -| ft_lstadd_back | `void ft_lstadd_back(t_ftlst **alst, t_ftlst *new)` | add `new` at the start of `alst` | [ ] | -| ft_lstadd_front | `void ft_lstadd_front(t_ftlst **alst, t_ftlst *new)` | add `new` at the end of `alst` | [ ] | +| ft_lstadd_back | `void ft_lstadd_back(t_ftlst **alst, t_ftlst *new)` | add `new` at the start of `alst` | [x] | +| ft_lstadd_front | `void ft_lstadd_front(t_ftlst **alst, t_ftlst *new)` | add `new` at the end of `alst` | [x] | | ft_lstbsearch | `t_ftlst *ft_lstbsearch(t_ftlst *lst, t_ftbool (*equal)(void *ref, void *content), void *ref)` | search `ref` in `lst` using binary search | [ ] | | ft_lstclear | `void ft_lstclear(t_ftlst **lst, void (*del)(void *))` | free all data with `del`, free all nodes and set `*lst` to NULL | [ ] | | ft_lstdelone | `void ft_lstdelone(t_ftlst *lst, void (*del)(void *))` | free `lst` node | [ ] | | ft_lstiter | `void ft_lstiter(t_ftlst *lst, void (*f)(void *))` | apply `f` on each node of `lst` | [ ] | | ft_lstlast | `t_ftlst *ft_lstlast(t_ftlst *lst)` | return the last node of `lst` | [ ] | | ft_lstmap | `t_ftlst *ft_lstmap(t_ftlst *lst, void *(*f)(void *), void (*del)(void *))` | create a new list which is `lst` with all node passed through `f` | [ ] | -| ft_lstnew | `t_ftlst *ft_lstnew(void const *content)` | create a new node with `content` | [ ] | +| ft_lstnew | `t_ftlst *ft_lstnew(void const *content)` | create a new node with `content` | [x] | | ft_lstpop_front | `void ft_lstpop_front(t_ftlst **lst, void (*del)(void *))` | remove the front of `lst` | [ ] | | ft_lstremove_if | `void ft_lstremove_if(t_ftlst **lst, t_ftbool (*equal)(void *ref, void *content), void *ref, void (*del)(void *content))` | remove all element which verify `equal` | [ ] | | ft_lstreverse | `void ft_lstreverse(t_ftlst **lst)` | reverse `lst` | [ ] | | ft_lstreverse_ret | `t_ftlst *ft_lstreverse_ret(t_ftlst *lst)` | reverse `lst` and return it | [ ] | -| ft_lstsize | `int ft_lstsize(t_ftlst *lst)` | return the number of node in `lst` | [ ] | +| ft_lstsize | `int ft_lstsize(t_ftlst *lst)` | return the number of node in `lst` | [x] | | ft_lstsort | `void ft_lstsort(t_ftlst **begin_list, int (*cmp)(void *, void*))` | sort `begin_list` using mergesort | [ ] | | ft_lstsorted_merge | `t_ftlst *ft_lstsorted_merge(t_ftlst *l1, t_ftlst *l2, int (*cmp)(void *, void *))` | merge 2 sorted list and return the merged and still sorted one | [ ] | |