ft_lst.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	t_list

Functions
t_list *	ft_lstnew (void *content)
void	ft_lstadd_front (t_list **lst, t_list *new)
int	ft_lstsize (t_list *lst)
t_list *	ft_lstlast (t_list *lst)
void	ft_lstadd_back (t_list **lst, t_list *new)
void	ft_lstdelone (t_list *lst, void(*del)(void *))
void	ft_lstclear (t_list **lst, void(*del)(void *))
void	ft_lstiter (t_list *lst, void(*f)(void *))
t_list *	ft_lstmap (t_list *lst, void *(*f)(void *), void(*del)(void *))

Function Documentation

ft_lstadd_back()

void ft_lstadd_back	(	t_list **	lst,
		t_list *	new
	)

Definition at line 16 of file ft_lstadd_back.c.

{
    if (lst == NULL || new == NULL)
        return ;
    if (*lst == NULL)
        *lst = new;
    else
        ft_lstlast(*lst)->next = new;
}

Here is the call graph for this function:

Here is the caller graph for this function:

ft_lstadd_front()

void ft_lstadd_front	(	t_list **	lst,
		t_list *	new
	)

Definition at line 16 of file ft_lstadd_front.c.

{
    if (lst == NULL || new == NULL)
        return ;
    new->next = *lst;
    *lst = new;
}

ft_lstclear()

void ft_lstclear	(	t_list **	lst,
		void(*)(void *)	del
	)

Definition at line 16 of file ft_lstclear.c.

{
    t_list  *p_next;
 
    if (lst == NULL || *lst == NULL || del == NULL)
        return ;
    while (*lst != NULL)
    {
        p_next = (*lst)->next;
        ft_lstdelone(*lst, del);
        *lst = p_next;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

ft_lstdelone()

void ft_lstdelone	(	t_list *	lst,
		void(*)(void *)	del
	)

Definition at line 16 of file ft_lstdelone.c.

{
    if (lst == NULL || del == NULL)
        return ;
    del(lst->content);
    free(lst);
}

Here is the caller graph for this function:

ft_lstiter()

void ft_lstiter	(	t_list *	lst,
		void(*)(void *)	f
	)

Definition at line 16 of file ft_lstiter.c.

{
    if (lst == NULL || f == NULL)
        return ;
    while (lst != NULL)
    {
        f(lst->content);
        lst = lst->next;
    }
}

ft_lstlast()

t_list* ft_lstlast

(

t_list *

lst

)

Definition at line 16 of file ft_lstlast.c.

{
    if (lst != NULL)
        while (lst->next != NULL)
            lst = lst->next;
    return (lst);
}

Here is the caller graph for this function:

ft_lstmap()

t_list* ft_lstmap	(	t_list *	lst,
		void *(*)(void *)	f,
		void(*)(void *)	del
	)

Definition at line 16 of file ft_lstmap.c.

{
    t_list  *p_new_lst_top;
    t_list  *p_new_lst;
 
    if (lst == NULL)
        return (NULL);
    p_new_lst_top = ft_lstnew(f(lst->content));
    if (p_new_lst_top == NULL)
        return (NULL);
    p_new_lst = p_new_lst_top;
    lst = lst->next;
    while (lst != NULL)
    {
        p_new_lst->next = ft_lstnew(f(lst->content));
        p_new_lst = p_new_lst->next;
        lst = lst->next;
        if (p_new_lst == NULL)
        {
            ft_lstclear(&p_new_lst_top, del);
            return (NULL);
        }
    }
    return (p_new_lst_top);
}

Here is the call graph for this function:

ft_lstnew()

t_list* ft_lstnew

(

void *

content

)

Definition at line 16 of file ft_lstnew.c.

{
    t_list  *p_ret;
 
    p_ret = malloc(sizeof(t_list));
    if (p_ret != NULL)
    {
        p_ret->content = content;
        p_ret->next = NULL;
    }
    return (p_ret);
}

Here is the caller graph for this function:

ft_lstsize()

int ft_lstsize

(

t_list *

lst

)

Definition at line 16 of file ft_lstsize.c.

{
    size_t  count;
 
    if (lst == NULL)
        return (0);
    count = 0;
    while (lst != NULL)
    {
        count++;
        lst = lst->next;
    }
    return (count);
}