/* slist.h
 *
 * Copyright 2025 Francois Techene
 *
 * 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/>.
 *
 * SPDX-License-Identifier: GPL-3.0-or-later
 */

#ifndef SLIST_H
#define SLIST_H

typedef struct _SListItem {

	void* 				data;
	struct _SListItem* 	next;

} SListItem;

typedef struct _SList {

	void* (*first)(struct _SList* self);
	void* (*last)(struct _SList* self);
	void* (*next)(struct _SList* self, SListItem* item);

	SListItem* 	head;
	int			count;

} SList;

// SListItem ////////////////
//
SListItem* 	SListItem_new();
void 		SListItem_delete(SListItem** item);

// SList ////////////////////
//
SList* 	SList_new();
void 	SList_delete(SList** self);

void* 	slist_first(SList* self);
void* 	slist_last(SList* self);
void* 	slist_next(SList* self, SListItem* item);

void	slist_append(SList* self, void* data);
void	slist_insert_at(SList* self, void* data, int index);
void    slist_insert_after(SList* self, void* data, void* value);

void	slist_remove_at(SList* self, int index);
void	slist_remove_last(SList* self);
void	slist_remove_value(SList* self, void* data);
void	slist_empty(SList* self);


#define SL_FOREACH(item, list) \
	for ((item) = (list)->first(list); \
	  	(item) != (list)->last(list); \
	  	(item)  = (list)->next(list, item))

#endif