aboutsummaryrefslogtreecommitdiffstats
path: root/src/llist.c
blob: e5604085e7409ed94fb0d5893d2b805d852b9c3e (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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
/*
 * Calcurse - text-based organizer
 *
 * Copyright (c) 2004-2011 calcurse Development Team <misc@calcurse.org>
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 *      - Redistributions of source code must retain the above
 *        copyright notice, this list of conditions and the
 *        following disclaimer.
 *
 *      - Redistributions in binary form must reproduce the above
 *        copyright notice, this list of conditions and the
 *        following disclaimer in the documentation and/or other
 *        materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * Send your feedback or comments to : misc@calcurse.org
 * Calcurse home page : http://calcurse.org
 *
 */

#include "calcurse.h"

/*
 * Initialize a list.
 */
void
llist_init (llist_t *l)
{
  l->head = NULL;
  l->tail = NULL;
}

/*
 * Free a list, but not the contained data.
 */
void
llist_free (llist_t *l)
{
  llist_item_t *i, *t;

  for (i = l->head; i; i = t)
    {
      t = i->next;
      mem_free (i);
    }

  l->head = NULL;
  l->tail = NULL;
}

/*
 * Free the data contained in a list.
 */
void
llist_free_inner (llist_t *l, llist_fn_free_t fn_free)
{
  llist_item_t *i;

  for (i = l->head; i; i = i->next)
    {
      if (i->data)
        {
          fn_free(i->data);
          i->data = NULL;
        }
    }
}

/*
 * Get the first item of a list.
 */
llist_item_t *
llist_first (llist_t *l)
{
  return l->head;
}

/*
 * Get the nth item of a list.
 */
llist_item_t *
llist_nth (llist_t *l, int n)
{
  llist_item_t *i;

  if (n < 0)
    return NULL;

  for (i = l->head; i && n != 0; n--)
    i = i->next;

  return i;
}

/*
 * Get the successor of a list item.
 */
llist_item_t *
llist_next (llist_item_t *i)
{
  return i ? i->next : NULL;
}

/*
 * Return the successor of a list item if it is matched by some filter
 * callback. Return NULL otherwise.
 */
llist_item_t *
llist_next_filter (llist_item_t *i, long data, llist_fn_match_t fn_match)
{
  if (i && i->next && fn_match (i->next->data, data))
    return i->next;
  else
    return NULL;
}

/*
 * Get the actual data of an item.
 */
void *
llist_get_data (llist_item_t *i)
{
  return i ? i->data : NULL;
}

/*
 * Add an item at the end of a list.
 */
void
llist_add (llist_t *l, void *data)
{
  llist_item_t *o = mem_malloc (sizeof (llist_item_t));

  if (o)
    {
      o->data = data;
      o->next = NULL;

      if (!l->head)
        l->head = l->tail = o;
      else
        {
          l->tail->next = o;
          l->tail = o;
        }
    }
}

/*
 * Add an item to a sorted list.
 */
void
llist_add_sorted (llist_t *l, void *data, llist_fn_cmp_t fn_cmp)
{
  llist_item_t *o = mem_malloc (sizeof (llist_item_t));
  llist_item_t *i;

  if (o)
    {
      o->data = data;
      o->next = NULL;

      if (!l->head)
        l->head = l->tail = o;
      else if (fn_cmp(o->data, l->tail->data) >= 0)
        {
          l->tail->next = o;
          l->tail = o;
        }
      else if (fn_cmp(o->data, l->head->data) < 0)
        {
          o->next = l->head;
          l->head = o;
        }
      else
        {
          i = l->head;
          while (i->next && fn_cmp(o->data, i->next->data) >= 0)
            i = i->next;
          o->next = i->next;
          i->next = o;
        }
    }
}

/*
 * Remove an item from a list.
 */
void
llist_remove (llist_t *l, llist_item_t *i)
{
  llist_item_t *j = NULL;

  if (l->head && i == l->head)
    l->head = i->next;
  else
    {
      for (j = l->head; j && j->next != i; j = j->next)
        ;
    }

  if (i)
    {
      if (j)
        j->next = i->next;
      if (i == l->tail)
        l->tail = j;

      mem_free (i);
    }
}

/*
 * Find the first item matched by some filter callback.
 */
llist_item_t *
llist_find_first (llist_t *l, long data, llist_fn_match_t fn_match)
{
  llist_item_t *i;

  for (i = l->head; i; i = i->next)
    {
      if (fn_match (i->data, data))
        return i;
    }

  return NULL;
}

/*
 * Find the next item matched by some filter callback.
 */
llist_item_t *
llist_find_next (llist_item_t *i, long data, llist_fn_match_t fn_match)
{
  if (i)
    {
      i = i->next;
      for (; i; i = i->next)
        {
          if (fn_match (i->data, data))
            return i;
        }
    }

  return NULL;
}

/*
 * Find the nth item matched by some filter callback.
 */
llist_item_t *
llist_find_nth (llist_t *l, int n, long data, llist_fn_match_t fn_match)
{
  llist_item_t *i;

  if (n < 0)
    return NULL;

  for (i = l->head; i; i = i->next)
    {
      if (fn_match (i->data, data) && (n-- == 0))
        return i;
    }

  return NULL;
}