This repository was archived by the owner on Aug 31, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 227
Expand file tree
/
Copy pathfoundation-set.cpp
More file actions
426 lines (333 loc) · 9.39 KB
/
foundation-set.cpp
File metadata and controls
426 lines (333 loc) · 9.39 KB
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
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
/* Copyright (C) 2003-2015 LiveCode Ltd.
This file is part of LiveCode.
LiveCode is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License v3 as published by the Free
Software Foundation.
LiveCode 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 General Public License
for more details.
You should have received a copy of the GNU General Public License
along with LiveCode. If not see <http://www.gnu.org/licenses/>. */
#include <foundation.h>
#include "foundation-private.h"
////////////////////////////////////////////////////////////////////////////////
static bool __MCSetClone(MCSetRef self, bool as_mutable, MCSetRef& r_new_self);
////////////////////////////////////////////////////////////////////////////////
MC_DLLEXPORT_DEF
bool MCSetCreateSingleton(uindex_t p_element, MCSetRef& r_set)
{
return MCSetCreateWithIndices(&p_element, 1, r_set);
}
MC_DLLEXPORT_DEF
bool MCSetCreateWithIndices(uindex_t *p_elements, uindex_t p_element_count, MCSetRef& r_set)
{
if (p_element_count == 0)
{
if (nil != kMCEmptySet)
{
r_set = MCValueRetain(kMCEmptySet);
return true;
}
}
else
{
MCAssert(nil != p_elements);
}
MCSetRef t_set;
if (!MCSetCreateMutable(t_set))
return false;
for(uindex_t i = 0; i < p_element_count; i++)
MCSetIncludeIndex(t_set, p_elements[i]);
return MCSetCopyAndRelease(t_set, r_set);
}
MC_DLLEXPORT_DEF
bool MCSetCreateWithLimbsAndRelease(uindex_t *p_limbs, uindex_t p_limb_count, MCSetRef& r_set)
{
MCAssert(nil != p_limbs);
__MCSet *self;
if (!__MCValueCreate(kMCValueTypeCodeSet, self))
return false;
self -> limbs = p_limbs;
self -> limb_count = p_limb_count;
r_set = self;
return true;
}
MC_DLLEXPORT_DEF
bool MCSetCreateMutable(MCSetRef& r_set)
{
__MCSet *self;
if (!__MCValueCreate(kMCValueTypeCodeSet, self))
return false;
self -> flags |= kMCSetFlagIsMutable;
r_set = self;
return true;
}
////////////////////////////////////////////////////////////////////////////////
MC_DLLEXPORT_DEF
bool MCSetCopy(MCSetRef self, MCSetRef& r_new_set)
{
__MCAssertIsSet(self);
if (!MCSetIsMutable(self))
{
r_new_set = MCValueRetain(self);
return true;
}
return __MCSetClone(self, false, r_new_set);
}
MC_DLLEXPORT_DEF
bool MCSetCopyAndRelease(MCSetRef self, MCSetRef& r_new_set)
{
__MCAssertIsSet(self);
if (!MCSetIsMutable(self))
{
r_new_set = self;
return true;
}
if (self -> references == 1)
{
self -> flags &= ~kMCSetFlagIsMutable;
r_new_set = self;
return true;
}
return __MCSetClone(self, false, r_new_set);
}
MC_DLLEXPORT_DEF
bool MCSetMutableCopy(MCSetRef self, MCSetRef& r_new_set)
{
__MCAssertIsSet(self);
return __MCSetClone(self, true, r_new_set);
}
MC_DLLEXPORT_DEF
bool MCSetMutableCopyAndRelease(MCSetRef self, MCSetRef& r_new_set)
{
__MCAssertIsSet(self);
if (self -> references == 1)
{
self -> flags |= kMCSetFlagIsMutable;
r_new_set = self;
return true;
}
return __MCSetClone(self, true, r_new_set);
}
////////////////////////////////////////////////////////////////////////////////
MC_DLLEXPORT_DEF
bool MCSetIsMutable(MCSetRef self)
{
__MCAssertIsSet(self);
return (self -> flags & kMCSetFlagIsMutable) != 0;
}
////////////////////////////////////////////////////////////////////////////////
MC_DLLEXPORT_DEF
bool MCSetIsEmpty(MCSetRef self)
{
__MCAssertIsSet(self);
for(uindex_t i = 0; i < self -> limb_count; i++)
if (self -> limbs[i] != 0)
return false;
return true;
}
MC_DLLEXPORT_DEF
bool MCSetIsEqualTo(MCSetRef self, MCSetRef other_self)
{
__MCAssertIsSet(self);
__MCAssertIsSet(other_self);
for(uindex_t i = 0; i < MCMax(self -> limb_count, other_self -> limb_count); i++)
{
uindex_t t_left_limb, t_right_limb;
t_left_limb = i < self -> limb_count ? self -> limbs[i] : 0;
t_right_limb = i < other_self -> limb_count ? other_self -> limbs[i] : 0;
if ((t_left_limb ^ t_right_limb) != 0)
return false;
}
return true;
}
MC_DLLEXPORT_DEF
bool MCSetContains(MCSetRef self, MCSetRef other_self)
{
__MCAssertIsSet(self);
__MCAssertIsSet(other_self);
for(uindex_t i = 0; i < MCMax(self -> limb_count, other_self -> limb_count); i++)
{
uindex_t t_left_limb, t_right_limb;
t_left_limb = i < self -> limb_count ? self -> limbs[i] : 0;
t_right_limb = i < other_self -> limb_count ? other_self -> limbs[i] : 0;
if ((t_left_limb | t_right_limb) != t_left_limb)
return false;
}
return true;
}
MC_DLLEXPORT_DEF
bool MCSetIntersects(MCSetRef self, MCSetRef other_self)
{
__MCAssertIsSet(self);
__MCAssertIsSet(other_self);
for(uindex_t i = 0; i < MCMax(self -> limb_count, other_self -> limb_count); i++)
{
uindex_t t_left_limb, t_right_limb;
t_left_limb = i < self -> limb_count ? self -> limbs[i] : 0;
t_right_limb = i < other_self -> limb_count ? other_self -> limbs[i] : 0;
if ((t_left_limb & t_right_limb) != 0)
return true;
}
return false;
}
MC_DLLEXPORT_DEF
bool MCSetContainsIndex(MCSetRef self, uindex_t p_element)
{
__MCAssertIsSet(self);
if (p_element >= self -> limb_count * 32)
return false;
return (self -> limbs[p_element / 32] & (1 << (p_element % 32))) != 0;
}
////////////////////////////////////////////////////////////////////////////////
MC_DLLEXPORT_DEF
bool MCSetIncludeIndex(MCSetRef self, uindex_t p_index)
{
if (!MCSetIsMutable(self))
return false;
if (p_index / 32 >= self -> limb_count)
if (!MCMemoryResizeArray(p_index / 32 + 1, self -> limbs, self -> limb_count))
return false;
self -> limbs[p_index / 32] |= 1 << (p_index % 32);
return true;
}
MC_DLLEXPORT_DEF
bool MCSetExcludeIndex(MCSetRef self, uindex_t p_index)
{
if (!MCSetIsMutable(self))
return false;
if (p_index / 32 >= self -> limb_count)
return true;
self -> limbs[p_index / 32] &= ~(1 << (p_index % 32));
return true;
}
MC_DLLEXPORT_DEF
bool MCSetUnion(MCSetRef self, MCSetRef p_other_set)
{
if (!MCSetIsMutable(self))
return false;
if (!MCMemoryResizeArray(MCMax(self -> limb_count, p_other_set -> limb_count), self -> limbs, self -> limb_count))
return false;
for(uindex_t i = 0; i < p_other_set -> limb_count; i++)
self -> limbs[i] |= p_other_set -> limbs[i];
return true;
}
MC_DLLEXPORT_DEF
bool MCSetDifference(MCSetRef self, MCSetRef p_other_set)
{
if (!MCSetIsMutable(self))
return false;
for(uindex_t i = 0; i < self -> limb_count; i++)
{
if (i == p_other_set -> limb_count)
break;
self -> limbs[i] &= ~(p_other_set -> limbs[i]);
}
return true;
}
MC_DLLEXPORT_DEF
bool MCSetIntersect(MCSetRef self, MCSetRef p_other_set)
{
if (!MCSetIsMutable(self))
return false;
if (!MCMemoryResizeArray(MCMin(self -> limb_count, p_other_set -> limb_count), self -> limbs, self -> limb_count))
return false;
for(uindex_t i = 0; i < self -> limb_count; i++)
self -> limbs[i] &= p_other_set -> limbs[i];
return true;
}
MC_DLLEXPORT_DEF
bool MCSetIterate(MCSetRef self, uindex_t& x_iterator, uindex_t& r_element)
{
__MCAssertIsSet(self);
while(x_iterator < self -> limb_count * 32)
{
x_iterator++;
if (MCSetContainsIndex(self, x_iterator - 1))
{
r_element = x_iterator - 1;
return true;
}
}
return false;
}
////////////////////////////////////////////////////////////////////////////////
static bool __MCSetClone(MCSetRef self, bool p_as_mutable, MCSetRef& r_new_self)
{
__MCSet *t_new_set;
if (!__MCValueCreate(kMCValueTypeCodeSet, t_new_set))
return false;
if (!MCMemoryNewArray(self -> limb_count, t_new_set -> limbs, t_new_set -> limb_count))
{
MCValueRelease(t_new_set);
return false;
}
MCMemoryCopy(t_new_set -> limbs, self -> limbs, sizeof(uindex_t) * self -> limb_count);
if (p_as_mutable)
t_new_set -> flags |= kMCSetFlagIsMutable;
r_new_self = t_new_set;
return true;
}
////////////////////////////////////////////////////////////////////////////////
MCSetRef kMCEmptySet;
bool __MCSetInitialize(void)
{
if (!MCSetCreateWithIndices(nil, 0, kMCEmptySet))
return false;
return true;
}
void __MCSetFinalize(void)
{
MCValueRelease(kMCEmptySet);
}
void __MCSetDestroy(__MCSet *self)
{
MCMemoryDeleteArray(self -> limbs);
}
hash_t __MCSetHash(__MCSet *self)
{
uindex_t t_used;
t_used = self -> limb_count;
while(t_used > 0 && self -> limbs[t_used - 1] == 0)
t_used -= 1;
return MCHashBytes(self -> limbs, t_used * sizeof(uindex_t));
}
bool __MCSetIsEqualTo(__MCSet *self, __MCSet *other_self)
{
return MCSetIsEqualTo(self, other_self);
}
bool __MCSetCopyDescription(__MCSet *self, MCStringRef& r_string)
{
bool t_success;
t_success = true;
MCStringRef t_string;
t_string = nil;
if (t_success)
t_success = MCStringCreateMutable(0, t_string);
if (t_success)
t_success = MCStringAppendFormat(t_string, "{");
uindex_t t_iterator, t_element;
bool t_first;
t_first = true;
t_iterator = 0;
while(t_success && MCSetIterate(self, t_iterator, t_element))
{
t_success = MCStringAppendFormat(t_string, "%s%d", t_first ? "" : ",", t_element);
t_first = false;
}
if (t_success)
t_success = MCStringAppendFormat(t_string, "}");
if (t_success)
t_success = MCStringCopyAndRelease(t_string, r_string);
if (!t_success)
MCValueRelease(t_string);
return t_success;
}
bool __MCSetImmutableCopy(__MCSet *self, bool p_release, __MCSet*& r_immutable_value)
{
if (!p_release)
return MCSetCopy(self, r_immutable_value);
return MCSetCopyAndRelease(self, r_immutable_value);
}
////////////////////////////////////////////////////////////////////////////////