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
|
/** Concrete implementation of GSOrderedSet and GSMutableOrderedSet
based on GNU NSOrderedSet and NSMutableOrderedSet classes
Copyright (C) 2019 Free Software Foundation, Inc.
Written by: Gregory Casamento <greg.casamento@gmail.com>
Created: May 17 2019
This file is part of the GNUstep Base Library.
This 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 2 of the License, or (at your option) any later _version.
This 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 library; if not, write to the Free
Software Foundation, Inc., 31 Milk Street #960789 Boston, MA 02196 USA.
*/
#import "common.h"
#import "Foundation/NSOrderedSet.h"
#import "Foundation/NSAutoreleasePool.h"
#import "Foundation/NSArray.h"
#import "Foundation/NSEnumerator.h"
#import "Foundation/NSException.h"
#import "Foundation/NSPortCoder.h"
#import "Foundation/NSIndexSet.h"
#import "Foundation/NSKeyedArchiver.h"
#import "Foundation/NSValue.h"
#import "Foundation/NSDictionary.h"
#import "GNUstepBase/GSObjCRuntime.h"
#import "GSPrivate.h"
#import "GSFastEnumeration.h"
#import "GSDispatch.h"
#import "GSSorting.h"
#define GSI_ARRAY_TYPES GSUNION_OBJ
#import "GNUstepBase/GSIArray.h"
#define GSI_MAP_HAS_VALUE 0
#define GSI_MAP_KTYPES GSUNION_OBJ
#define GSI_MAP_RETAIN_KEY(M, X)
#define GSI_MAP_RELEASE_KEY(M, X)
#include "GNUstepBase/GSIMap.h"
@interface GSOrderedSet : NSOrderedSet
{
@public
GSIArray_t array;
GSIMapTable_t map;
}
@end
@interface GSMutableOrderedSet : NSMutableOrderedSet
{
@public
GSIArray_t array;
GSIMapTable_t map;
@private
unsigned long _version;
}
@end
@interface GSOrderedSetEnumerator : NSEnumerator
{
GSOrderedSet *set;
unsigned current;
unsigned count;
}
@end
@interface GSOrderedSetEnumeratorReverse : GSOrderedSetEnumerator
@end
@implementation GSOrderedSetEnumerator
- (id) initWithOrderedSet: (NSOrderedSet*)d
{
self = [super init];
if (self != nil)
{
set = (GSOrderedSet*)RETAIN(d);
current = 0;
count = GSIArrayCount(&set->array);
}
return self;
}
- (id) nextObject
{
if (current < count)
{
GSIArrayItem item = GSIArrayItemAtIndex(&set->array, current);
current++;
return (id)(item.obj);
}
return nil;
}
- (void) dealloc
{
RELEASE(set);
[super dealloc];
}
@end
@implementation GSOrderedSetEnumeratorReverse
- (id) initWithOrderedSet: (GSOrderedSet*)d
{
self = [super initWithOrderedSet: d];
if (self != nil)
{
current = GSIArrayCount(&set->array);
}
return self;
}
- (id) nextObject
{
GSIArrayItem item;
if (current == 0)
{
return nil;
}
item = GSIArrayItemAtIndex(&set->array, --current);
return (id)(item.obj);
}
@end
@implementation GSOrderedSet
static Class setClass;
static Class mutableSetClass;
+ (void) initialize
{
if (self == [GSOrderedSet class])
{
setClass = [GSOrderedSet class];
mutableSetClass = [GSMutableOrderedSet class];
}
}
- (id) copyWithZone: (NSZone*)z
{
return RETAIN(self);
}
- (void) dealloc
{
GSIArrayEmpty(&array);
GSIMapEmptyMap(&map);
[super dealloc];
}
- (NSUInteger) hash
{
return [self count];
}
- (instancetype) init
{
return [self initWithObjects: NULL count: 0];
}
- (NSEnumerator*) objectEnumerator
{
return AUTORELEASE([[GSOrderedSetEnumerator alloc] initWithOrderedSet: self]);
}
- (NSEnumerator*) reverseObjectEnumerator
{
return AUTORELEASE([[GSOrderedSetEnumeratorReverse alloc] initWithOrderedSet: self]);
}
- (NSUInteger) sizeInBytesExcluding: (NSHashTable*)exclude
{
NSUInteger size = GSPrivateMemorySize(self, exclude);
if (size > 0)
{
NSUInteger count = [self count];
NSUInteger i = 0;
for (i = 0; i < count; i++)
{
GSIArrayItem item = GSIArrayItemAtIndex(&array, i);
size += [item.obj sizeInBytesExcluding: exclude];
}
}
return size;
}
// Put required overrides here...
- (BOOL) containsObject: (id)anObject
{
if (anObject != nil)
{
GSIMapNode node = GSIMapNodeForKey(&map, (GSIMapKey)anObject);
if (node != 0)
{
return YES;
}
}
return NO;
}
- (NSUInteger) count
{
return GSIArrayCount(&array);
}
- (id) objectAtIndex: (NSUInteger)index
{
GSIArrayItem item = GSIArrayItemAtIndex(&array, index);
return item.obj;
}
- (void) getObjects: (__unsafe_unretained id[])aBuffer range: (NSRange)aRange
{
NSUInteger i, j = 0;
NSUInteger c = GSIArrayCount(&array);
NSUInteger e = NSMaxRange(aRange);
GS_RANGE_CHECK(aRange, c);
for (i = aRange.location; i < e; i++)
{
GSIArrayItem item = GSIArrayItemAtIndex(&array, i);
aBuffer[j++] = item.obj;
}
}
/* Designated initialiser */
- (id) initWithObjects: (const id*)objs count: (NSUInteger)c
{
NSUInteger i = 0;
// Initialize and fill the set.
GSIArrayInitWithZoneAndCapacity(&array, [self zone], c);
GSIMapInitWithZoneAndCapacity(&map, [self zone], c);
for (i = 0; i < c; i++)
{
id obj = objs[i];
if (obj == nil)
{
DESTROY(self);
[NSException raise: NSInvalidArgumentException
format: @"Tried to init set with nil value"];
}
if (![self containsObject: obj])
{
GSIArrayItem item;
item.obj = obj;
GSIArrayAddItem(&array, item);
GSIMapAddKey(&map, (GSIMapKey)obj);
}
}
return self;
}
@end
@implementation GSMutableOrderedSet
+ (void) initialize
{
if (self == [GSMutableOrderedSet class])
{
GSObjCAddClassBehavior(self, [GSOrderedSet class]);
}
}
- (void) insertObject: (id)object atIndex: (NSUInteger)index
{
if (object == nil)
{
[NSException raise: NSInvalidArgumentException
format: @"Tried to add nil to set"];
}
else
{
if ([self containsObject: object] == NO)
{
GSIArrayItem item;
_version++;
item.obj = object;
GSIArrayInsertItem(&array, item, index);
GSIMapAddKey(&map, (GSIMapKey)object);
_version++;
}
}
}
- (void) removeObjectAtIndex: (NSUInteger)index
{
GSIArrayItem item = GSIArrayItemAtIndex(&array, index);
_version++;
GSIArrayRemoveItemAtIndex(&array, index);
GSIMapRemoveKey(&map, (GSIMapKey)item.obj);
_version++;
}
- (id) init
{
return [self initWithCapacity: 0];
}
/* Designated initialiser */
- (id) initWithCapacity: (NSUInteger)cap
{
GSIArrayInitWithZoneAndCapacity(&array, [self zone], cap);
GSIMapInitWithZoneAndCapacity(&map, [self zone], cap);
return self;
}
- (id) initWithObjects: (const id*)objects
count: (NSUInteger)count
{
NSUInteger i = 0;
// Init and fill set
self = [self initWithCapacity: count];
if (self != nil)
{
for (i = 0; i < count; i++)
{
id anObject = objects[i];
[self addObject: anObject];
}
}
return self;
}
- (BOOL) makeImmutable
{
GSClassSwizzle(self, [GSOrderedSet class]);
return YES;
}
- (id) makeImmutableCopyOnFail: (BOOL)force
{
GSClassSwizzle(self, [GSOrderedSet class]);
return self;
}
- (NSUInteger) countByEnumeratingWithState: (NSFastEnumerationState *)state
objects: (__unsafe_unretained id[])stackbuf
count: (NSUInteger)len
{
NSInteger count;
/* This is cached in the caller at the start and compared at each
* iteration. If it changes during the iteration then
* objc_enumerationMutation() will be called, throwing an exception.
*/
state->mutationsPtr = &_version;
count = MIN(len, [self count] - state->state);
/* If a mutation has occurred then it's possible that we are being asked to
* get objects from after the end of the array. Don't pass negative values
* to memcpy.
*/
if (count > 0)
{
[self getObjects: stackbuf range: NSMakeRange(state->state, count)];
state->state += count;
}
else
{
count = 0;
}
state->itemsPtr = stackbuf;
return count;
}
@end
|