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
|
/*
* 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/assert/parc_Assert.h>
#include <parc/algol/parc_SortedList.h>
#include <parc/algol/parc_ArrayList.h>
#include <parc/algol/parc_Memory.h>
struct parc_sorted_list {
parcSortedList_Compare compare;
PARCArrayList *arrayList;
};
PARCSortedList *
parcSortedList_Create(parcSortedList_Compare compareFunction)
{
PARCSortedList *sortedList = parcMemory_Allocate(sizeof(PARCSortedList));
parcAssertNotNull(sortedList, "parcMemory_Allocate(%zu) returned NULL", sizeof(PARCSortedList));
sortedList->arrayList = parcArrayList_Create(NULL);
sortedList->compare = compareFunction;
return sortedList;
}
void
parcSortedList_Destroy(PARCSortedList **parcSortedListPointer)
{
parcArrayList_Destroy(&((*parcSortedListPointer)->arrayList));
parcMemory_Deallocate((void **) parcSortedListPointer);
*parcSortedListPointer = NULL;
}
void
parcSortedList_Add(PARCSortedList *parcSortedList, void *newItem)
{
parcAssertNotNull(parcSortedList, "sortedList parameter can't be null");
parcAssertNotNull(parcSortedList->arrayList, "arrayList can't be null");
parcAssertNotNull(newItem, "newItem can't be null");
size_t total_items = parcArrayList_Size(parcSortedList->arrayList);
for (size_t i = 0; i < total_items; i++) {
void *oldItem = parcArrayList_Get(parcSortedList->arrayList, i);
if (parcSortedList->compare(newItem, oldItem) == -1) {
// The old item at position i is bigger than the new item,
// we must insert the newItem here.
parcArrayList_InsertAtIndex(parcSortedList->arrayList, newItem, i);
return;
}
}
// We reached the end of the list, it must go here...
parcArrayList_Add(parcSortedList->arrayList, newItem);
}
size_t
parcSortedList_Length(PARCSortedList *parcSortedList)
{
return parcArrayList_Size(parcSortedList->arrayList);
}
void *
parcSortedList_PopFirst(PARCSortedList *parcSortedList)
{
parcAssertNotNull(parcSortedList, "sortedList parameter can't be null");
parcAssertNotNull(parcSortedList->arrayList, "arrayList can't be null");
if (parcArrayList_Size(parcSortedList->arrayList) == 0) {
return NULL;
}
void *item = parcArrayList_Get(parcSortedList->arrayList, 0);
parcArrayList_RemoveAndDestroyAtIndex(parcSortedList->arrayList, 0);
return item;
}
void *
parcSortedList_GetFirst(PARCSortedList *parcSortedList)
{
parcAssertNotNull(parcSortedList, "sortedList parameter can't be null");
parcAssertNotNull(parcSortedList->arrayList, "arrayList can't be null");
if (parcArrayList_Size(parcSortedList->arrayList) == 0) {
return NULL;
}
return parcArrayList_Get(parcSortedList->arrayList, 0);
}
|
