blob: ff4682eda8d197f1910c57de93a2b4e40c4e0b70 (
plain) (
blame)
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
#include "list.h"
#include <assert.h>
void
__sll_push(struct sllist_node **head, struct sllist_node *data)
{
assert(head != NULL);
assert(data != NULL);
data->next = *head;
*head = data;
}
void
__sll_pushback(struct sllist_node **head, struct sllist_node *data)
{
assert(head != NULL);
assert(data != NULL);
struct sllist_node *node = *head;
while(node->next) node = node->next;
node->next = data;
data->next = NULL;
}
void *
__sll_pop(struct sllist_node **head)
{
assert(head != NULL);
struct sllist_node *tmp = *head;
*head = tmp->next;
return tmp;
}
void *
__sll_at(struct sllist_node **head, size_t i)
{
assert(head != NULL);
struct sllist_node *node = *head;
while(i--) {
if(node == NULL) return NULL;
node = node->next;
}
return node;
}
void
__sll_remove(struct sllist_node **head, size_t i)
{
assert(head != NULL);
struct sllist_node *node = *head;
struct sllist_node *prev = node;
if(i == 0) {
*head = node->next;
return;
}
while(i--) {
prev = node;
node = node->next;
if(node == NULL) return;
}
prev->next = node->next;
}
void
__sll_delete(struct sllist_node **head, struct sllist_node *node)
{
assert(head != NULL);
assert(node != NULL);
struct sllist_node *prev = *head;
if(node == *head) {
*head = node->next;
return;
}
while(prev->next != node) {
prev = prev->next;
if(prev == NULL) return;
}
prev->next = node->next;
}
void
__sll_insert(struct sllist_node **head, struct sllist_node *val, size_t i)
{
assert(head != NULL);
assert(val != NULL);
struct sllist_node *node = *head;
struct sllist_node *prev = node;
if(i == 0) {
val->next = *head;
*head = val;
return;
}
while(i--) {
if(node == NULL) return;
prev = node;
node = node->next;
}
val->next = node;
prev->next = val;
}
|