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
|
/*************************************************************************
* Copyright (C) 2010-2011 Tavian Barnes <tavianator@gmail.com> *
* *
* This file is part of The Dimension Library. *
* *
* The Dimension Library is free software; you can redistribute it and/ *
* or modify it under the terms of the GNU Lesser General Public License *
* as published by the Free Software Foundation; either version 3 of the *
* License, or (at your option) any later version. *
* *
* The Dimension Library 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 *
* Lesser General Public License for more details. *
* *
* You should have received a copy of the GNU Lesser General Public *
* License along with this program. If not, see *
* <http://www.gnu.org/licenses/>. *
*************************************************************************/
/**
* @file
* Doubly-linked lists.
*/
#include "dimension.h"
dmnsn_list *
dmnsn_list_from_array(const dmnsn_array *array)
{
dmnsn_list *list = dmnsn_new_list(array->obj_size);
for (size_t i = 0; i < dmnsn_array_size(array); ++i) {
dmnsn_list_push(list, dmnsn_array_at(array, i));
}
return list;
}
dmnsn_array *
dmnsn_array_from_list(const dmnsn_list *list)
{
dmnsn_array *array = dmnsn_new_array(list->obj_size);
for (dmnsn_list_iterator *i = dmnsn_list_first(list);
i != NULL;
i = dmnsn_list_next(i))
{
dmnsn_array_push(array, i->ptr);
}
return array;
}
void
dmnsn_delete_list(dmnsn_list *list)
{
if (list) {
while (dmnsn_list_first(list)) {
dmnsn_list_remove(list, dmnsn_list_first(list));
}
dmnsn_free(list);
}
}
/** Split the second half of a list into a new list. */
static void
dmnsn_list_split_impl(dmnsn_list *list, dmnsn_list *half)
{
/* Find the halfway point */
size_t i, max = dmnsn_list_size(list)/2;
dmnsn_list_iterator *ii;
for (i = 0, ii = dmnsn_list_last(list);
i < max && ii;
++i, ii = dmnsn_list_prev(ii));
if (ii && ii->next) {
half->first = ii->next;
half->last = list->last;
list->last = ii;
half->first->prev = NULL;
list->last->next = NULL;
}
list->length -= max;
half->length = max;
}
dmnsn_list *
dmnsn_list_split(dmnsn_list *list)
{
dmnsn_list *half = dmnsn_new_list(list->obj_size);
dmnsn_list_split_impl(list, half);
return half;
}
void
dmnsn_list_sort(dmnsn_list *list, dmnsn_list_comparator_fn *comparator)
{
if (dmnsn_list_size(list) < 2) {
return;
} else if (dmnsn_list_size(list) <= 16) {
/* Use insertion sort on small lists */
dmnsn_list_iterator *current = dmnsn_list_next(dmnsn_list_first(list));
do {
dmnsn_list_iterator *next = dmnsn_list_next(current);
dmnsn_list_iterator_remove(list, current);
dmnsn_list_iterator *i = next;
do {
dmnsn_list_iterator *prev = i ? dmnsn_list_prev(i)
: dmnsn_list_last(list);
if (!(*comparator)(current, prev))
break;
i = prev;
} while (i != dmnsn_list_first(list));
dmnsn_list_iterator_insert(list, i, current);
current = next;
} while (current);
} else {
/* Recursive merge sort */
dmnsn_list half;
dmnsn_list_split_impl(list, &half);
dmnsn_list_sort(list, comparator);
dmnsn_list_sort(&half, comparator);
dmnsn_list_iterator *i = dmnsn_list_first(list);
dmnsn_list_iterator *j = dmnsn_list_first(&half);
while (i || j) {
if (!i) {
j->prev = dmnsn_list_last(list);
list->last->next = j;
list->last = half.last;
list->length += half.length;
half.first = half.last = NULL;
half.length = 0;
break;
} else if (!j) {
break;
} else if ((*comparator)(j, i)) {
dmnsn_list_iterator *temp = dmnsn_list_next(j);
dmnsn_list_iterator_remove(&half, j);
dmnsn_list_iterator_insert(list, i, j);
j = temp;
} else {
i = dmnsn_list_next(i);
}
}
}
}
|
