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
|
/*
* Copyright (c) 2017 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/**
*/
#include <config.h>
#include <parc/algol/parc_Object.h>
#include <parc/algol/parc_DisplayIndented.h>
#include <parc/algol/parc_Memory.h>
#include <parc/algol/parc_SortedList.h>
#include <parc/algol/parc_LinkedList.h>
struct PARCSortedList {
PARCLinkedList *list;
PARCSortedListEntryCompareFunction compare;
};
static void
_parcSortedList_Finalize(PARCSortedList **instancePtr)
{
parcAssertNotNull(instancePtr, "Parameter must be a non-null pointer to a PARCSortedList pointer.");
PARCSortedList *instance = *instancePtr;
parcSortedList_OptionalAssertValid(instance);
parcLinkedList_Release(&instance->list);
}
parcObject_ImplementAcquire(parcSortedList, PARCSortedList);
parcObject_ImplementRelease(parcSortedList, PARCSortedList);
parcObject_ExtendPARCObject(PARCSortedList, _parcSortedList_Finalize, parcSortedList_Copy, parcSortedList_ToString, parcSortedList_Equals, NULL, parcSortedList_HashCode, parcSortedList_ToJSON);
void
parcSortedList_AssertValid(const PARCSortedList *instance)
{
parcAssertTrue(parcSortedList_IsValid(instance),
"PARCSortedList is not valid.");
}
PARCSortedList *
parcSortedList_Create(void)
{
PARCSortedList *result = parcSortedList_CreateCompare(parcObject_Compare);
return result;
}
PARCSortedList *
parcSortedList_CreateCompare(PARCSortedListEntryCompareFunction compare)
{
PARCSortedList *result = parcObject_CreateInstance(PARCSortedList);
if (result != NULL) {
result->list = parcLinkedList_Create();
result->compare = compare;
}
return result;
}
PARCSortedList *
parcSortedList_Copy(const PARCSortedList *original)
{
PARCSortedList *result = parcObject_CreateInstance(PARCSortedList);
if (result != NULL) {
result->list = parcLinkedList_Copy(original->list);
}
return result;
}
void
parcSortedList_Display(const PARCSortedList *instance, int indentation)
{
parcDisplayIndented_PrintLine(indentation, "PARCSortedList@%p {", instance);
parcLinkedList_Display(instance->list, indentation + 1);
parcDisplayIndented_PrintLine(indentation, "}");
}
bool
parcSortedList_Equals(const PARCSortedList *x, const PARCSortedList *y)
{
return parcLinkedList_Equals(x->list, y->list);
}
PARCHashCode
parcSortedList_HashCode(const PARCSortedList *instance)
{
PARCHashCode result = parcLinkedList_HashCode(instance->list);
return result;
}
bool
parcSortedList_IsValid(const PARCSortedList *instance)
{
bool result = false;
if (instance != NULL) {
result = true;
}
return result;
}
PARCJSON *
parcSortedList_ToJSON(const PARCSortedList *instance)
{
PARCJSON *result = parcJSON_Create();
return result;
}
char *
parcSortedList_ToString(const PARCSortedList *instance)
{
char *result = parcMemory_Format("PARCSortedList@%p\n", instance);
return result;
}
size_t
parcSortedList_Size(const PARCSortedList *list)
{
return parcLinkedList_Size(list->list);
}
PARCObject *
parcSortedList_GetAtIndex(const PARCSortedList *list, const size_t index)
{
return parcLinkedList_GetAtIndex(list->list, index);
}
PARCObject *
parcSortedList_GetFirst(const PARCSortedList *list)
{
return parcLinkedList_GetAtIndex(list->list, 0);
}
PARCObject *
parcSortedList_GetLast(const PARCSortedList *list)
{
return parcLinkedList_GetAtIndex(list->list, parcLinkedList_Size(list->list) - 1);
}
PARCObject *
parcSortedList_RemoveFirst(PARCSortedList *list)
{
PARCObject *result = parcLinkedList_RemoveFirst(list->list);
return result;
}
PARCObject *
parcSortedList_RemoveLast(PARCSortedList *list)
{
PARCObject *result = parcLinkedList_RemoveLast(list->list);
return result;
}
bool
parcSortedList_Remove(PARCSortedList *list, const PARCObject *object)
{
bool result = false;
PARCIterator *iterator = parcSortedList_CreateIterator(list);
while (parcIterator_HasNext(iterator)) {
PARCObject *o = parcIterator_Next(iterator);
if (parcObject_Equals(object, o)) {
parcIterator_Remove(iterator);
result = true;
break;
}
}
parcIterator_Release(&iterator);
return result;
}
static size_t
_parcSortedList_GetInsertionIndex(const PARCSortedList *instance, const PARCObject *element)
{
ssize_t low = 0;
ssize_t high = parcLinkedList_Size(instance->list) - 1;
if (high == -1) {
return 0;
}
while (true) {
ssize_t midpoint = (low + (high - low) / 2);
PARCObject *e = parcLinkedList_GetAtIndex(instance->list, midpoint);
int signum = instance->compare(element, e);
if (high == low) {
if (signum < 0) {
return high;
} else if (signum > 0) {
return low + 1;
} else {
return low;
}
}
if (signum < 0) {
high = midpoint;
} else if (signum > 0) {
low = midpoint + 1;
} else {
return midpoint;
}
}
return -1;
}
PARCIterator *
parcSortedList_CreateIterator(PARCSortedList *instance)
{
return parcLinkedList_CreateIterator(instance->list);
}
void
parcSortedList_Add(PARCSortedList *instance, PARCObject *element)
{
size_t insertionPoint = _parcSortedList_GetInsertionIndex(instance, element);
parcAssertTrue(insertionPoint >= 0 && insertionPoint <= parcLinkedList_Size(instance->list),
"%zd is bad insertion point. Must be >=0 and <= %zd", insertionPoint, parcLinkedList_Size(instance->list));
parcLinkedList_InsertAtIndex(instance->list, insertionPoint, element);
}
|