1 /** @file objectlist.c List of objects.
2
3 @authors Copyright (c) 2017 Jaakko Keränen <jaakko.keranen@iki.fi>
4
5 @par License
6
7 Redistribution and use in source and binary forms, with or without
8 modification, are permitted provided that the following conditions are met:
9
10 1. Redistributions of source code must retain the above copyright notice, this
11 list of conditions and the following disclaimer.
12 2. Redistributions in binary form must reproduce the above copyright notice,
13 this list of conditions and the following disclaimer in the documentation
14 and/or other materials provided with the distribution.
15
16 <small>THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
17 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18 WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
20 ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23 ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</small>
26 */
27
28 #include "the_Foundation/objectlist.h"
29
30 #include <stdlib.h>
31
32 iDefineClass(ObjectList)
iDefineObjectConstruction(ObjectList)33 iDefineObjectConstruction(ObjectList)
34
35 void init_ObjectList(iObjectList *d) {
36 init_List(&d->list);
37 }
38
deinit_ObjectList(iObjectList * d)39 void deinit_ObjectList(iObjectList *d) {
40 clear_ObjectList(d);
41 }
42
copy_ObjectList(const iObjectList * d)43 iObjectList *copy_ObjectList(const iObjectList *d) {
44 iObjectList *copy = new_ObjectList();
45 iConstForEach(ObjectList, i, d) {
46 pushBack_ObjectList(copy, iConstCast(iObject *, i.object));
47 }
48 return copy;
49 }
50
front_ObjectList(const iObjectList * d)51 iObject *front_ObjectList(const iObjectList *d) {
52 if (isEmpty_ObjectList(d)) return NULL;
53 return ((const iObjectListNode *) front_List(&d->list))->object;
54 }
55
back_ObjectList(const iObjectList * d)56 iObject *back_ObjectList(const iObjectList *d) {
57 if (isEmpty_ObjectList(d)) return NULL;
58 return ((const iObjectListNode *) back_List(&d->list))->object;
59 }
60
clear_ObjectList(iObjectList * d)61 void clear_ObjectList(iObjectList *d) {
62 iReverseForEach(ObjectList, i, d) {
63 removeNode_ObjectList(d, i.value);
64 }
65 }
66
new_ObjectListNode_(iAnyObject * object)67 static iObjectListNode *new_ObjectListNode_(iAnyObject *object) {
68 iObjectListNode *d = iMalloc(ObjectListNode);
69 d->object = ref_Object(object);
70 return d;
71 }
72
delete_ObjectListNode_(iAny * any)73 static void delete_ObjectListNode_(iAny *any) {
74 if (any) {
75 iObjectListNode *d = any;
76 deref_Object(d->object);
77 free(d);
78 }
79 }
80
pushBack_ObjectList(iObjectList * d,iAnyObject * object)81 iAnyObject *pushBack_ObjectList(iObjectList *d, iAnyObject *object) {
82 pushBack_List(&d->list, new_ObjectListNode_(object));
83 return object;
84 }
85
pushFront_ObjectList(iObjectList * d,iAnyObject * object)86 iAnyObject *pushFront_ObjectList(iObjectList *d, iAnyObject *object) {
87 pushFront_List(&d->list, new_ObjectListNode_(object));
88 return object;
89 }
90
insertAfter_ObjectList(iObjectList * d,iObjectListNode * after,iObject * object)91 iAnyObject *insertAfter_ObjectList(iObjectList *d, iObjectListNode *after, iObject *object) {
92 insertAfter_List(&d->list, after, new_ObjectListNode_(object));
93 return object;
94 }
95
insertBefore_ObjectList(iObjectList * d,iObjectListNode * before,iObject * object)96 iAnyObject *insertBefore_ObjectList(iObjectList *d, iObjectListNode *before, iObject *object) {
97 insertBefore_List(&d->list, before, new_ObjectListNode_(object));
98 return object;
99 }
100
removeNode_ObjectList(iObjectList * d,iObjectListNode * node)101 void removeNode_ObjectList(iObjectList *d, iObjectListNode *node) {
102 delete_ObjectListNode_(remove_List(&d->list, node));
103 }
104
popFront_ObjectList(iObjectList * d)105 void popFront_ObjectList(iObjectList *d) {
106 delete_ObjectListNode_(popFront_List(&d->list));
107 }
108
popBack_ObjectList(iObjectList * d)109 void popBack_ObjectList(iObjectList *d) {
110 delete_ObjectListNode_(popBack_List(&d->list));
111 }
112
113 /*-------------------------------------------------------------------------------------*/
114
init_ObjectListIterator(iObjectListIterator * d,iObjectList * list)115 void init_ObjectListIterator(iObjectListIterator *d, iObjectList *list) {
116 iAssert(!list || isInstance_Object(list, &Class_ObjectList));
117 d->list = list;
118 d->value = (list ? front_List(&list->list) : NULL);
119 d->object = (d->value ? d->value->object : NULL);
120 d->next = next_ObjectListNode(d->value);
121 }
122
next_ObjectListIterator(iObjectListIterator * d)123 void next_ObjectListIterator(iObjectListIterator *d) {
124 d->value = d->next;
125 d->object = (d->value? d->value->object : NULL);
126 if (d->value == end_ObjectList(d->list)) {
127 d->value = NULL;
128 }
129 else {
130 d->next = (iObjectListNode *) d->value->node.next;
131 }
132 }
133
remove_ObjectListIterator(iObjectListIterator * d)134 void remove_ObjectListIterator(iObjectListIterator *d) {
135 removeNode_ObjectList(d->list, d->value);
136 }
137
init_ObjectListReverseIterator(iObjectListReverseIterator * d,iObjectList * list)138 void init_ObjectListReverseIterator(iObjectListReverseIterator *d, iObjectList *list) {
139 iAssert(!list || isInstance_Object(list, &Class_ObjectList));
140 d->list = list;
141 d->value = (list ? back_List(&list->list) : NULL);
142 d->object = (d->value ? d->value->object : NULL);
143 d->next = prev_ObjectListNode(d->value);
144 }
145
next_ObjectListReverseIterator(iObjectListReverseIterator * d)146 void next_ObjectListReverseIterator(iObjectListReverseIterator *d) {
147 d->value = d->next;
148 d->object = (d->value? d->value->object : NULL);
149 if (d->value == end_ObjectList(d->list)) {
150 d->value = NULL;
151 }
152 else {
153 d->next = (iObjectListNode *) d->value->node.prev;
154 }
155 }
156
remove_ObjectListReverseIterator(iObjectListReverseIterator * d)157 void remove_ObjectListReverseIterator(iObjectListReverseIterator *d) {
158 removeNode_ObjectList(d->list, d->value);
159 }
160
161 /*-------------------------------------------------------------------------------------*/
162
init_ObjectListConstIterator(iObjectListConstIterator * d,const iObjectList * list)163 void init_ObjectListConstIterator(iObjectListConstIterator *d, const iObjectList *list) {
164 iAssert(!list || isInstance_Object(list, &Class_ObjectList));
165 d->list = list;
166 d->value = (list ? front_List(&list->list) : NULL);
167 d->object = (d->value ? d->value->object : NULL);
168 }
169
next_ObjectListConstIterator(iObjectListConstIterator * d)170 void next_ObjectListConstIterator(iObjectListConstIterator *d) {
171 d->value = (const iObjectListNode *) d->value->node.next;
172 if (d->value == constEnd_ObjectList(d->list)) {
173 d->value = NULL;
174 }
175 d->object = (d->value? d->value->object : NULL);
176 }
177
init_ObjectListReverseConstIterator(iObjectListReverseConstIterator * d,const iObjectList * list)178 void init_ObjectListReverseConstIterator(iObjectListReverseConstIterator *d, const iObjectList *list) {
179 iAssert(!list || isInstance_Object(list, &Class_ObjectList));
180 d->list = list;
181 d->value = (list ? back_List(&list->list) : NULL);
182 d->object = (d->value ? d->value->object : NULL);
183 }
184
next_ObjectListReverseConstIterator(iObjectListReverseConstIterator * d)185 void next_ObjectListReverseConstIterator(iObjectListReverseConstIterator *d) {
186 d->value = (const iObjectListNode *) d->value->node.prev;
187 if (d->value == constEnd_ObjectList(d->list)) {
188 d->value = NULL;
189 }
190 d->object = (d->value? d->value->object : NULL);
191 }
192