stack_control.c

Go to the documentation of this file.

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   stack_control.c                                    :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: rmikhayl <marvin@42.fr>                    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2024/05/31 20:39:16 by rmikhayl          #+#    #+#             */
/*   Updated: 2024/06/11 15:38:29 by dmdemirk         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */
 
#include "tokens.h"
 
void    add_node(t_token **head, char *str)
{
    t_token *new_node;  
    t_token *curr_node;
 
    new_node = (t_token *)malloc(sizeof(t_token));
    if (!new_node)
        return ;
    new_node->data = str;
    new_node->next = NULL;
    if (*head == NULL)
    {
        *head = new_node;
        return ;
    }
    curr_node = *head;
    while (curr_node->next != NULL)
        curr_node = curr_node->next;
    curr_node->next = new_node;
}
 
void    print_stack(t_token **stack)
{
    t_token *current_node;
    int     i;
 
    i = 0;
    current_node = *stack;
    while (current_node != NULL)
    {
        ft_printf("input[%d] ->  %s \n", i, current_node->data);
        current_node = current_node->next;
        i++;
    }
}
 
void    free_stack(t_token **stack)
{
    t_token *current;
    t_token *next;
 
    current = *stack;
    while (current != NULL)
    {
        next = current->next;
        free(current);
        current = next;
    }
}
 
int calc_stack_size(t_token *stack)
{
    int         size;
    t_token     *current;
 
    size = 0;
    current = stack;
    while (current != NULL)
    {
        size++;
        current = current->next;
    }
    return (size);
}
 
char    **list_to_array(t_token *head)
{
    int         count;
    int         i;
    char        **arr;
    t_token     *current;
 
    current = head;
    count = calc_stack_size(current);
    arr = (char **)malloc((count + 1) * sizeof(char *));
    if (!arr)
        return (NULL);
    current = head;
    i = 0;
    while (i < count)
    {
        arr[i] = ft_strdup(current->data);
        current = current->next;
        i++;
    }
    arr[count] = NULL;
    return (arr);
}