ft_lstadd_back_bonus.c File Reference

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   ft_lstadd_back_bonus.c                             :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: tgrekov <tgrekov@student.hive.fi>          +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2023/10/28 01:25:47 by tgrekov           #+#    #+#             */
/*   Updated: 2023/11/04 22:24:36 by tgrekov          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */
 

Definition in file ft_lstadd_back_bonus.c.

#include "libft.h"

Include dependency graph for ft_lstadd_back_bonus.c:

Go to the source code of this file.

Functions
void	ft_lstadd_back (t_list **lst, t_list *new)
	Adds node at pointer new to the end of the list starting at pointer pointed to by lst.

Function Documentation

ft_lstadd_back()

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

Adds node at pointer new to the end of the list starting at pointer pointed to by lst.

If lst is NULL, does nothing.
If pointer at lst is NULL, sets pointer at lst to new.
Otherwise sets next property of the last node in the list to new

Parameters

[in,out]	lst	Pointer to pointer to first node in the list.
[in]	new	Pointer to the new node to add

Definition at line 35 of file ft_lstadd_back_bonus.c.

References ft_lstlast(), and s_list::next.

Here is the call graph for this function:

Here is the caller graph for this function: