/*
* Copyright (c) 2008, 2009, 2010, 2011, 2012
* Jonathan Schleifer <js@webkeks.org>
*
* All rights reserved.
*
* This file is part of ObjFW. It may be distributed under the terms of the
* Q Public License 1.0, which can be found in the file LICENSE.QPL included in
* the packaging of this file.
*
* Alternatively, it may be distributed under the terms of the GNU General
* Public License, either version 2 or 3, which can be found in the file
* LICENSE.GPLv2 or LICENSE.GPLv3 respectively included in the packaging of this
* file.
*/
#include "config.h"
#include <string.h>
#import "OFMutableArray_adjacent.h"
#import "OFArray_adjacent.h"
#import "OFDataArray.h"
#import "OFAutoreleasePool.h"
#import "OFEnumerationMutationException.h"
#import "OFInvalidArgumentException.h"
#import "OFOutOfRangeException.h"
@implementation OFMutableArray_adjacent
+ (void)initialize
{
if (self == [OFMutableArray_adjacent class])
[self inheritMethodsFromClass: [OFArray_adjacent class]];
}
- (void)addObject: (id)object
{
[array addItem: &object];
[object retain];
mutations++;
}
- (void)addObject: (id)object
atIndex: (size_t)index
{
[array addItem: &object
atIndex: index];
[object retain];
mutations++;
}
- (void)replaceObject: (id)oldObject
withObject: (id)newObject
{
id *cArray = [array cArray];
size_t i, count = [array count];
for (i = 0; i < count; i++) {
if ([cArray[i] isEqual: oldObject]) {
[newObject retain];
[cArray[i] release];
cArray[i] = newObject;
return;
}
}
}
- (void)replaceObjectAtIndex: (size_t)index
withObject: (id)object
{
id *cArray = [array cArray];
id oldObject;
if (index >= [array count])
@throw [OFOutOfRangeException exceptionWithClass: isa];
oldObject = cArray[index];
cArray[index] = [object retain];
[oldObject release];
}
- (void)replaceObjectIdenticalTo: (id)oldObject
withObject: (id)newObject
{
id *cArray = [array cArray];
size_t i, count = [array count];
for (i = 0; i < count; i++) {
if (cArray[i] == oldObject) {
[newObject retain];
[cArray[i] release];
cArray[i] = newObject;
return;
}
}
}
- (void)removeObject: (id)object
{
id *cArray = [array cArray];
size_t i, count = [array count];
for (i = 0; i < count; i++) {
if ([cArray[i] isEqual: object]) {
object = cArray[i];
[array removeItemAtIndex: i];
mutations++;
[object release];
return;
}
}
}
- (void)removeObjectIdenticalTo: (id)object
{
id *cArray = [array cArray];
size_t i, count = [array count];
for (i = 0; i < count; i++) {
if (cArray[i] == object) {
[array removeItemAtIndex: i];
mutations++;
[object release];
return;
}
}
}
- (void)removeObjectAtIndex: (size_t)index
{
id object = [self objectAtIndex: index];
[array removeItemAtIndex: index];
[object release];
mutations++;
}
- (void)removeNObjects: (size_t)nObjects
{
id *cArray = [array cArray], *copy;
size_t i, count = [array count];
if (nObjects > count)
@throw [OFOutOfRangeException exceptionWithClass: isa];
copy = [self allocMemoryForNItems: nObjects
ofSize: sizeof(id)];
memcpy(copy, cArray + (count - nObjects), nObjects * sizeof(id));
@try {
[array removeNItems: nObjects];
mutations++;
for (i = 0; i < nObjects; i++)
[copy[i] release];
} @finally {
[self freeMemory: copy];
}
}
- (void)removeAllObjects
{
id *cArray = [array cArray];
size_t i, count = [array count];
for (i = 0; i < count; i++)
[cArray[i] release];
[array removeAllItems];
}
- (void)removeObjectsInRange: (of_range_t)range
{
id *cArray = [array cArray], *copy;
size_t i, count = [array count];
if (range.length > count - range.start)
@throw [OFOutOfRangeException exceptionWithClass: isa];
copy = [self allocMemoryForNItems: range.length
ofSize: sizeof(id)];
memcpy(copy, cArray + range.start, range.length * sizeof(id));
@try {
[array removeNItems: range.length
atIndex: range.start];
mutations++;
for (i = 0; i < range.length; i++)
[copy[i] release];
} @finally {
[self freeMemory: copy];
}
}
- (void)removeLastObject
{
id object = [self objectAtIndex: [array count] - 1];
[array removeLastItem];
[object release];
mutations++;
}
- (void)swapObjectAtIndex: (size_t)index1
withObjectAtIndex: (size_t)index2
{
id *cArray = [array cArray];
size_t count = [array count];
id tmp;
if (index1 >= count || index2 >= count)
@throw [OFOutOfRangeException exceptionWithClass: isa];
tmp = cArray[index1];
cArray[index1] = cArray[index2];
cArray[index2] = tmp;
}
- (void)reverse
{
id *cArray = [array cArray];
size_t i, j, count = [array count];
if (count == 0 || count == 1)
return;
for (i = 0, j = count - 1; i < j; i++, j--) {
id tmp = cArray[i];
cArray[i] = cArray[j];
cArray[j] = tmp;
}
}
- (int)countByEnumeratingWithState: (of_fast_enumeration_state_t*)state
objects: (id*)objects
count: (int)count
{
/*
* Super means the implementation from OFArray here, as OFMutableArray
* does not reimplement it. As OFArray_adjacent does not reimplement it
* either, this is fine.
*/
int ret = [super countByEnumeratingWithState: state
objects: objects
count: count];
state->mutationsPtr = &mutations;
return ret;
}
- (OFEnumerator*)objectEnumerator
{
return [[[OFArrayEnumerator alloc]
initWithArray: self
mutationsPtr: &mutations] autorelease];
}
#ifdef OF_HAVE_BLOCKS
- (void)enumerateObjectsUsingBlock: (of_array_enumeration_block_t)block
{
id *cArray = [array cArray];
size_t i, count = [array count];
BOOL stop = NO;
unsigned long mutations2 = mutations;
for (i = 0; i < count && !stop; i++) {
if (mutations != mutations2)
@throw [OFEnumerationMutationException
exceptionWithClass: isa
object: self];
block(cArray[i], i, &stop);
}
}
- (void)replaceObjectsUsingBlock: (of_array_replace_block_t)block
{
id *cArray = [array cArray];
size_t i, count = [array count];
BOOL stop = NO;
unsigned long mutations2 = mutations;
for (i = 0; i < count && !stop; i++) {
id newObject;
if (mutations != mutations2)
@throw [OFEnumerationMutationException
exceptionWithClass: isa
object: self];
newObject = block(cArray[i], i, &stop);
if (newObject == nil)
@throw [OFInvalidArgumentException
exceptionWithClass: isa
selector: _cmd];
[newObject retain];
[cArray[i] release];
cArray[i] = newObject;
}
}
#endif
- (void)makeImmutable
{
isa = [OFArray_adjacent class];
}
@end