/*
 * BreakHack - A dungeone crawler RPG
 * Copyright (C) 2018  Linus Probert <linus.probert@gmail.com>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef LINKEDLIST_H_
#define	LINKEDLIST_H_

struct Node {
	struct Node *next;
	void *data;
};
typedef struct Node LinkedList;

LinkedList* linkedlist_create(void);

void linkedlist_push(LinkedList **head, void *value);

void* linkedlist_pop(LinkedList **head);

void linkedlist_append(LinkedList **head, void *value);

void* linkedlist_poplast(LinkedList **head);

void* linkedlist_get(LinkedList **head, unsigned int index);

void linkedlist_each(const LinkedList **head, void (*fun)(void*));

void linkedlist_destroy(LinkedList **head);

unsigned int linkedlist_size(LinkedList *head);

#endif // LINKEDLIST_H_