105 lines
2.7 KiB
C
105 lines
2.7 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_linked_list.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tischmid <marvin@42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2023/04/01 15:25:42 by tischmid #+# #+# */
|
|
/* Updated: 2023/04/01 20:59:06 by tischmid ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "ft_linked_list.h"
|
|
#include "ft_strlib.h"
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
t_map_entry *ll_map_new_entry(char *key, char *value)
|
|
{
|
|
t_map_entry *new_entry;
|
|
char *new_value;
|
|
|
|
new_value = (char *) malloc(sizeof(char) * (ft_strlen(value) + 1));
|
|
ft_strcpy(new_value, value);
|
|
new_entry = (t_map_entry *) malloc(sizeof(t_map_entry));
|
|
new_entry->key = key;
|
|
new_entry->value = new_value;
|
|
new_entry->next = NULL;
|
|
return (new_entry);
|
|
}
|
|
|
|
char *ll_map_get(t_map_entry *head, char *key)
|
|
{
|
|
t_map_entry *current;
|
|
|
|
if (head != NULL)
|
|
{
|
|
current = head;
|
|
while (current != NULL)
|
|
{
|
|
if (!ft_strcmp(current->key, key))
|
|
return (current->value);
|
|
current = current->next;
|
|
}
|
|
}
|
|
return (NULL);
|
|
}
|
|
|
|
void ll_map_push(t_map_entry *head, char *key, char *value)
|
|
{
|
|
t_map_entry *current;
|
|
|
|
if (head != NULL)
|
|
{
|
|
current = head;
|
|
while (current->next != NULL)
|
|
current = current->next;
|
|
current->next = ll_map_new_entry(key, value);
|
|
}
|
|
}
|
|
|
|
t_map_entry *ll_pop_last(t_map_entry *head, t_ll_flag noretval, int free_values)
|
|
{
|
|
t_map_entry *current;
|
|
t_map_entry *retval;
|
|
|
|
retval = NULL;
|
|
if (head != NULL)
|
|
{
|
|
if (head->next == NULL)
|
|
{
|
|
if (noretval != POP_NO_RETURN_VAL)
|
|
retval = ll_map_new_entry(head->key, head->value);
|
|
if (free_values)
|
|
free(head->value);
|
|
free(head);
|
|
return (retval);
|
|
}
|
|
|
|
current = head;
|
|
while (current->next->next != NULL)
|
|
current = current->next;
|
|
|
|
if (noretval != POP_NO_RETURN_VAL)
|
|
retval = ll_map_new_entry(current->next->key, current->next->value);
|
|
if (free_values)
|
|
free(current->next->value);
|
|
free(current->next);
|
|
current->next = NULL;
|
|
return (retval);
|
|
}
|
|
else
|
|
return (retval);
|
|
}
|
|
|
|
void ll_clear(t_map_entry *head, int free_values)
|
|
{
|
|
if (head != NULL)
|
|
{
|
|
while (head->next != NULL)
|
|
ll_pop_last(head, POP_NO_RETURN_VAL, free_values);
|
|
ll_pop_last(head, POP_NO_RETURN_VAL, free_values);
|
|
}
|
|
}
|