/*
** EPITECH PROJECT, 2019
** double.c
** File description:
** double.c
*/

#include "double_list.h"
#include <stdlib.h>
#include <stdio.h>

unsigned int double_list_get_size(double_list_t list)
{
    unsigned int len = 0;

    while (list != NULL) {
        len++;
        list = list->next;
    }
    return (len);
}

bool double_list_is_empty(double_list_t list)
{
    return (list ? false : true);
}

void double_list_dump(double_list_t list)
{
    unsigned int len = 0;

    while (list != NULL) {
        printf("%f\n", list->value);
        len++;
        list = list->next;
    }
}

bool double_list_add_elem_at_front(double_list_t *front_ptr, double elem)
{
    double_list_t new_node = malloc(sizeof(double_list_t));

    if (new_node == NULL)
        return (false);
    new_node->value = elem;
    new_node->next = *front_ptr;
    *front_ptr = new_node;
    return (true);
}

bool double_list_add_elem_at_back(double_list_t *front_ptr, double elem)
{
    double_list_t new_node = malloc(sizeof(double_list_t));
    double_list_t temp = *front_ptr;

    if (!new_node)
        return (false);
    new_node->value = elem;
    new_node->next = NULL;
    if (*front_ptr == NULL)
        *front_ptr = new_node;
    else {
        temp = *front_ptr;
        while (temp->next != NULL)
            temp = temp->next;
        temp->next = new_node;
    }
    return (true);
}