XFN/glinked_list.h at master · dardevelin/XFN · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/*
 * glinked_list.h
 * This file is part of dbsglinked
 *
 * Copyright (C) 2012 - Darcy Brás da Silva
 *
 * dbsglinked 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.
 *
 * dbsglinked 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 dbsglinked. If not, see <http://www.gnu.org/licenses/>.
 */


#ifndef LIBGLINKED_LIST_H_
#define LIBGLINKED_LIST_H_

#include <stdbool.h> /*because of find function*/
#include <stdlib.h>
#define LIBGLINKED_DEFAULT_ALLOCATOR malloc
#define LIBGLINKED_DEFAULT_DEALLOCATOR free

typedef struct sGlinkedNode {
	void *data;
	void(*data_deallocator)(void *);
	struct sGlinkedNode *next;
} libglinked_node_t;

typedef struct sGlinkedList {
	size_t count;
	void *(*node_allocator)(size_t);
	void (*node_deallocator)(void *);
	libglinked_node_t *head;
} libglinked_list_t;
//interface
void libglinked_init_list(libglinked_list_t *,
  void *(*node_allocator)(size_t), void(*node_deallocator)(void*));

libglinked_node_t *libglinked_create_node(libglinked_list_t *,
  void *, void(*dalloc)(void*));

void libglinked_delete_node(libglinked_list_t *, libglinked_node_t *);

libglinked_node_t *libglinked_enqueue_node(libglinked_list_t *,
  libglinked_node_t *);

libglinked_node_t *libglinked_dequeue_node(libglinked_list_t *);

libglinked_node_t *libglinked_push_node(libglinked_list_t *,
    libglinked_node_t *);

libglinked_node_t *libglinked_pop_node(libglinked_list_t *);

void libglinked_delete_list(libglinked_list_t * );

size_t libglinked_get_num_items(libglinked_list_t *);

void libglinked_show_node(libglinked_node_t *, void(*f)(void*));

void libglinked_show_list(libglinked_list_t *, void(*f)(void*));

void libglinked_reverse_list(libglinked_list_t*);

void *libglinked_foreach_node(libglinked_list_t *, void *,
    void * (*action)(void * , void * , void * ),
    void * );

libglinked_node_t *libglinked_find_node(libglinked_list_t *, void *,
    bool(*cmp)(void*,void*));

libglinked_node_t *libglinked_remove_node(libglinked_list_t *, void *,
    bool(*cmp)(void *, void*));

libglinked_list_t *libglinked_split_list(libglinked_list_t *,
    libglinked_list_t *, void *, bool(*cmp)(void *, void*));

libglinked_list_t *libglinked_join_list(libglinked_list_t *,
    libglinked_list_t *, void *, bool(*cmp)(void *,void*));
#endif