mirror of
https://github.com/firebase/firebase-ios-sdk
synced 2026-11-10 22:45:59 +05:45
485 lines
19 KiB
Objective-C
485 lines
19 KiB
Objective-C
|
/*
|
||
|
|
* Copyright 2017 Google
|
||
|
|
*
|
||
|
|
* 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.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#import <XCTest/XCTest.h>
|
||
|
|
|
||
|
|
#import "FArraySortedDictionary.h"
|
||
|
|
#import "FTreeSortedDictionary.h"
|
||
|
|
|
||
|
|
@interface FArraySortedDictionaryTests : XCTestCase
|
||
|
|
|
||
|
|
@end
|
||
|
|
|
||
|
|
@implementation FArraySortedDictionaryTests
|
||
|
|
|
||
|
|
- (NSComparator) defaultComparator {
|
||
|
|
return ^(id obj1, id obj2) {
|
||
|
|
if([obj1 respondsToSelector:@selector(compare:)] && [obj2 respondsToSelector:@selector(compare:)]) {
|
||
|
|
return [obj1 compare:obj2];
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
if(obj1 < obj2) {
|
||
|
|
return (NSComparisonResult)NSOrderedAscending;
|
||
|
|
}
|
||
|
|
else if (obj1 > obj2) {
|
||
|
|
return (NSComparisonResult)NSOrderedDescending;
|
||
|
|
}
|
||
|
|
else {
|
||
|
|
return (NSComparisonResult)NSOrderedSame;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
};
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
- (void)testCreateNode
|
||
|
|
{
|
||
|
|
FImmutableSortedDictionary *map = [[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@"key" withValue:@"value"];
|
||
|
|
XCTAssertEqual(map.count, 1, @"Contains one element");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void)testGetNilReturnsNil {
|
||
|
|
FImmutableSortedDictionary *map1 = [[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@"key" withValue:@"value"];
|
||
|
|
XCTAssertNil([map1 get:nil]);
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *map2 = [[[FArraySortedDictionary alloc] initWithComparator:^NSComparisonResult(id obj1, id obj2) {
|
||
|
|
return [obj1 compare:obj2];
|
||
|
|
}]
|
||
|
|
insertKey:@"key" withValue:@"value"];
|
||
|
|
XCTAssertNil([map2 get:nil]);
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void)testSearchForSpecificKey {
|
||
|
|
FImmutableSortedDictionary *map = [[[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@1 withValue:@1]
|
||
|
|
insertKey:@2 withValue:@2];
|
||
|
|
|
||
|
|
XCTAssertEqualObjects([map get:@1], @1, @"Found first object");
|
||
|
|
XCTAssertEqualObjects([map get:@2], @2, @"Found second object");
|
||
|
|
XCTAssertNil([map get:@3], @"Properly not found object");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void)testRemoveKeyValuePair {
|
||
|
|
FImmutableSortedDictionary *map = [[[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@1 withValue:@1]
|
||
|
|
insertKey:@2 withValue:@2];
|
||
|
|
|
||
|
|
FImmutableSortedDictionary* newMap = [map removeKey:@1];
|
||
|
|
XCTAssertEqualObjects([newMap get:@2], @2, @"Found second object");
|
||
|
|
XCTAssertNil([newMap get:@1], @"Properly not found object");
|
||
|
|
|
||
|
|
// Make sure the original one is not mutated
|
||
|
|
XCTAssertEqualObjects([map get:@1], @1, @"Found first object");
|
||
|
|
XCTAssertEqualObjects([map get:@2], @2, @"Found second object");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void)testMoreRemovals {
|
||
|
|
FImmutableSortedDictionary *map = [[[[[[[[[[[[[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@1 withValue:@1]
|
||
|
|
insertKey:@50 withValue:@50]
|
||
|
|
insertKey:@3 withValue:@3]
|
||
|
|
insertKey:@4 withValue:@4]
|
||
|
|
insertKey:@7 withValue:@7]
|
||
|
|
insertKey:@9 withValue:@9]
|
||
|
|
insertKey:@20 withValue:@20]
|
||
|
|
insertKey:@18 withValue:@18]
|
||
|
|
insertKey:@2 withValue:@2]
|
||
|
|
insertKey:@71 withValue:@71]
|
||
|
|
insertKey:@42 withValue:@42]
|
||
|
|
insertKey:@88 withValue:@88];
|
||
|
|
XCTAssertNotNil([map get:@7], @"Found object");
|
||
|
|
XCTAssertNotNil([map get:@3], @"Found object");
|
||
|
|
XCTAssertNotNil([map get:@1], @"Found object");
|
||
|
|
|
||
|
|
|
||
|
|
FImmutableSortedDictionary* m1 = [map removeKey:@7];
|
||
|
|
FImmutableSortedDictionary* m2 = [map removeKey:@3];
|
||
|
|
FImmutableSortedDictionary* m3 = [map removeKey:@1];
|
||
|
|
|
||
|
|
XCTAssertNil([m1 get:@7], @"Removed object");
|
||
|
|
XCTAssertNotNil([m1 get:@3], @"Found object");
|
||
|
|
XCTAssertNotNil([m1 get:@1], @"Found object");
|
||
|
|
|
||
|
|
XCTAssertNil([m2 get:@3], @"Removed object");
|
||
|
|
XCTAssertNotNil([m2 get:@7], @"Found object");
|
||
|
|
XCTAssertNotNil([m2 get:@1], @"Found object");
|
||
|
|
|
||
|
|
|
||
|
|
XCTAssertNil([m3 get:@1], @"Removed object");
|
||
|
|
XCTAssertNotNil([m3 get:@7], @"Found object");
|
||
|
|
XCTAssertNotNil([m3 get:@3], @"Found object");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testRemovalBug {
|
||
|
|
FImmutableSortedDictionary *map = [[[[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@1 withValue:@1]
|
||
|
|
insertKey:@2 withValue:@2]
|
||
|
|
insertKey:@3 withValue:@3];
|
||
|
|
|
||
|
|
XCTAssertEqualObjects([map get:@1], @1, @"Found object");
|
||
|
|
XCTAssertEqualObjects([map get:@2], @2, @"Found object");
|
||
|
|
XCTAssertEqualObjects([map get:@3], @3, @"Found object");
|
||
|
|
|
||
|
|
FImmutableSortedDictionary* m1 = [map removeKey:@2];
|
||
|
|
XCTAssertEqualObjects([m1 get:@1], @1, @"Found object");
|
||
|
|
XCTAssertEqualObjects([m1 get:@3], @3, @"Found object");
|
||
|
|
XCTAssertNil([m1 get:@2], @"Removed object");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testIncreasing {
|
||
|
|
int total = 20;
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
|
||
|
|
for(int i = 0; i < total; i++) {
|
||
|
|
NSNumber* item = [NSNumber numberWithInt:i];
|
||
|
|
map = [map insertKey:item withValue:item];
|
||
|
|
}
|
||
|
|
|
||
|
|
XCTAssertTrue([map count] == 20, @"Check if all 100 objects are in the map");
|
||
|
|
|
||
|
|
for(int i = 0; i < total; i++) {
|
||
|
|
NSNumber* item = [NSNumber numberWithInt:i];
|
||
|
|
map = [map removeKey:item];
|
||
|
|
}
|
||
|
|
|
||
|
|
XCTAssertTrue([map count] == 0, @"Check if all 100 objects were removed");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testOverride {
|
||
|
|
FImmutableSortedDictionary *map = [[[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@10 withValue:@10]
|
||
|
|
insertKey:@10 withValue:@8];
|
||
|
|
|
||
|
|
XCTAssertEqualObjects([map get:@10], @8, @"Found first object");
|
||
|
|
}
|
||
|
|
- (void) testEmpty {
|
||
|
|
FImmutableSortedDictionary *map = [[[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@10 withValue:@10]
|
||
|
|
removeKey:@10];
|
||
|
|
|
||
|
|
XCTAssertTrue([map isEmpty], @"Properly empty");
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testEmptyGet {
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
XCTAssertNil([map get:@"something"], @"Properly nil");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testEmptyCount {
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
XCTAssertTrue([map count] == 0, @"Properly zero count");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testEmptyRemoval {
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
XCTAssertTrue([[map removeKey:@"sometjhing"] count] == 0, @"Properly zero count");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testReverseTraversal {
|
||
|
|
FImmutableSortedDictionary *map = [[[[[[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@1 withValue:@1]
|
||
|
|
insertKey:@5 withValue:@5]
|
||
|
|
insertKey:@3 withValue:@3]
|
||
|
|
insertKey:@2 withValue:@2]
|
||
|
|
insertKey:@4 withValue:@4];
|
||
|
|
|
||
|
|
__block int next = 5;
|
||
|
|
[map enumerateKeysAndObjectsReverse:YES usingBlock:^(id key, id value, BOOL *stop) {
|
||
|
|
XCTAssertEqualObjects(key, [NSNumber numberWithInt:next], @"Properly equal");
|
||
|
|
next = next - 1;
|
||
|
|
}];
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
- (void) testInsertionAndRemovalOfAHundredItems {
|
||
|
|
int N = 20;
|
||
|
|
NSMutableArray* toInsert = [[NSMutableArray alloc] initWithCapacity:N];
|
||
|
|
NSMutableArray* toRemove = [[NSMutableArray alloc] initWithCapacity:N];
|
||
|
|
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
[toInsert addObject:[NSNumber numberWithInt:i]];
|
||
|
|
[toRemove addObject:[NSNumber numberWithInt:i]];
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
[self shuffleArray:toInsert];
|
||
|
|
[self shuffleArray:toRemove];
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
|
||
|
|
// add them to the dictionary
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
map = [map insertKey:[toInsert objectAtIndex:i] withValue:[toInsert objectAtIndex:i]];
|
||
|
|
}
|
||
|
|
XCTAssertTrue([map count] == N, @"Check if all N objects are in the map");
|
||
|
|
|
||
|
|
// check the order is correct
|
||
|
|
__block int next = 0;
|
||
|
|
[map enumerateKeysAndObjectsUsingBlock:^(id key, id value, BOOL *stop) {
|
||
|
|
XCTAssertEqualObjects(key, [NSNumber numberWithInt:next], @"Correct key");
|
||
|
|
XCTAssertEqualObjects(value, [NSNumber numberWithInt:next], @"Correct value");
|
||
|
|
next = next + 1;
|
||
|
|
}];
|
||
|
|
XCTAssertEqual(next, N, @"Check we traversed all of the items");
|
||
|
|
|
||
|
|
// remove them
|
||
|
|
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
map = [map removeKey:[toRemove objectAtIndex:i]];
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
XCTAssertEqual([map count], 0, @"Check we removed all of the items");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) shuffleArray:(NSMutableArray *)array {
|
||
|
|
NSUInteger count = [array count];
|
||
|
|
for(NSUInteger i = 0; i < count; i++) {
|
||
|
|
NSInteger nElements = count - i;
|
||
|
|
NSInteger n = (arc4random() % nElements) + i;
|
||
|
|
[array exchangeObjectAtIndex:i withObjectAtIndex:n];
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testOrderIsCorrect {
|
||
|
|
|
||
|
|
NSArray* toInsert = [[NSArray alloc] initWithObjects:@1,@7,@8,@5,@2,@6,@4,@0,@3, nil];
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
|
||
|
|
// add them to the dictionary
|
||
|
|
for(int i = 0; i < [toInsert count]; i++) {
|
||
|
|
map = [map insertKey:[toInsert objectAtIndex:i] withValue:[toInsert objectAtIndex:i]];
|
||
|
|
}
|
||
|
|
XCTAssertTrue([map count] == [toInsert count], @"Check if all N objects are in the map");
|
||
|
|
|
||
|
|
// check the order is correct
|
||
|
|
__block NSUInteger next = 0;
|
||
|
|
[map enumerateKeysAndObjectsUsingBlock:^(id key, id value, BOOL *stop) {
|
||
|
|
XCTAssertEqualObjects(key, [NSNumber numberWithInteger:next], @"Correct key");
|
||
|
|
XCTAssertEqualObjects(value, [NSNumber numberWithInteger:next], @"Correct value");
|
||
|
|
next = next + 1;
|
||
|
|
}];
|
||
|
|
XCTAssertEqual(next, [toInsert count], @"Check we traversed all of the items");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testPredecessorKey {
|
||
|
|
FImmutableSortedDictionary *map = [[[[[[[[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]]
|
||
|
|
insertKey:@1 withValue:@1]
|
||
|
|
insertKey:@50 withValue:@50]
|
||
|
|
insertKey:@3 withValue:@3]
|
||
|
|
insertKey:@4 withValue:@4]
|
||
|
|
insertKey:@7 withValue:@7]
|
||
|
|
insertKey:@9 withValue:@9];
|
||
|
|
|
||
|
|
XCTAssertNil([map getPredecessorKey:@1], @"First object doesn't have a predecessor");
|
||
|
|
XCTAssertEqualObjects([map getPredecessorKey:@3], @1, @"@1");
|
||
|
|
XCTAssertEqualObjects([map getPredecessorKey:@4], @3, @"@3");
|
||
|
|
XCTAssertEqualObjects([map getPredecessorKey:@7], @4, @"@4");
|
||
|
|
XCTAssertEqualObjects([map getPredecessorKey:@9], @7, @"@7");
|
||
|
|
XCTAssertEqualObjects([map getPredecessorKey:@50], @9, @"@9");
|
||
|
|
XCTAssertThrows([map getPredecessorKey:@777], @"Expect exception about nonexistant key");
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testEnumerator {
|
||
|
|
int N = 20;
|
||
|
|
NSMutableArray* toInsert = [[NSMutableArray alloc] initWithCapacity:N];
|
||
|
|
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
[toInsert addObject:[NSNumber numberWithInt:i]];
|
||
|
|
}
|
||
|
|
|
||
|
|
[self shuffleArray:toInsert];
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
|
||
|
|
// add them to the dictionary
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
map = [map insertKey:[toInsert objectAtIndex:i] withValue:[toInsert objectAtIndex:i]];
|
||
|
|
}
|
||
|
|
XCTAssertTrue([map count] == N, @"Check if all N objects are in the map");
|
||
|
|
XCTAssertTrue([map isKindOfClass:[FArraySortedDictionary class]], @"Make sure we still have a array backed dictionary");
|
||
|
|
|
||
|
|
NSEnumerator* enumerator = [map keyEnumerator];
|
||
|
|
id next = [enumerator nextObject];
|
||
|
|
int correctValue = 0;
|
||
|
|
while(next != nil) {
|
||
|
|
XCTAssertEqualObjects(next, [NSNumber numberWithInt:correctValue], @"Correct key");
|
||
|
|
next = [enumerator nextObject];
|
||
|
|
correctValue = correctValue + 1;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testReverseEnumerator {
|
||
|
|
int N = 20;
|
||
|
|
NSMutableArray* toInsert = [[NSMutableArray alloc] initWithCapacity:N];
|
||
|
|
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
[toInsert addObject:[NSNumber numberWithInt:i]];
|
||
|
|
}
|
||
|
|
|
||
|
|
[self shuffleArray:toInsert];
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
|
||
|
|
// add them to the dictionary
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
map = [map insertKey:[toInsert objectAtIndex:i] withValue:[toInsert objectAtIndex:i]];
|
||
|
|
}
|
||
|
|
XCTAssertTrue([map count] == N, @"Check if all N objects are in the map");
|
||
|
|
XCTAssertTrue([map isKindOfClass:[FArraySortedDictionary class]], @"Make sure we still have a array backed dictionary");
|
||
|
|
|
||
|
|
NSEnumerator* enumerator = [map reverseKeyEnumerator];
|
||
|
|
id next = [enumerator nextObject];
|
||
|
|
int correctValue = N - 1;
|
||
|
|
while(next != nil) {
|
||
|
|
XCTAssertEqualObjects(next, [NSNumber numberWithInt:correctValue], @"Correct key");
|
||
|
|
next = [enumerator nextObject];
|
||
|
|
correctValue--;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testEnumeratorFrom {
|
||
|
|
int N = 20;
|
||
|
|
NSMutableArray* toInsert = [[NSMutableArray alloc] initWithCapacity:N];
|
||
|
|
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
[toInsert addObject:[NSNumber numberWithInt:i*2]];
|
||
|
|
}
|
||
|
|
|
||
|
|
[self shuffleArray:toInsert];
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
|
||
|
|
// add them to the dictionary
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
map = [map insertKey:[toInsert objectAtIndex:i] withValue:[toInsert objectAtIndex:i]];
|
||
|
|
}
|
||
|
|
XCTAssertTrue([map count] == N, @"Check if all N objects are in the map");
|
||
|
|
XCTAssertTrue([map isKindOfClass:[FArraySortedDictionary class]], @"Make sure we still have a array backed dictionary");
|
||
|
|
|
||
|
|
// Test from inbetween keys
|
||
|
|
{
|
||
|
|
NSEnumerator* enumerator = [map keyEnumeratorFrom:@11];
|
||
|
|
id next = [enumerator nextObject];
|
||
|
|
int correctValue = 12;
|
||
|
|
while(next != nil) {
|
||
|
|
XCTAssertEqualObjects(next, [NSNumber numberWithInt:correctValue], @"Correct key");
|
||
|
|
next = [enumerator nextObject];
|
||
|
|
correctValue = correctValue + 2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
// Test from key in map
|
||
|
|
{
|
||
|
|
NSEnumerator* enumerator = [map keyEnumeratorFrom:@10];
|
||
|
|
id next = [enumerator nextObject];
|
||
|
|
int correctValue = 10;
|
||
|
|
while(next != nil) {
|
||
|
|
XCTAssertEqualObjects(next, [NSNumber numberWithInt:correctValue], @"Correct key");
|
||
|
|
next = [enumerator nextObject];
|
||
|
|
correctValue = correctValue + 2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void) testReverseEnumeratorFrom {
|
||
|
|
int N = 20;
|
||
|
|
NSMutableArray* toInsert = [[NSMutableArray alloc] initWithCapacity:N];
|
||
|
|
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
[toInsert addObject:[NSNumber numberWithInt:i*2]];
|
||
|
|
}
|
||
|
|
|
||
|
|
[self shuffleArray:toInsert];
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *map = [[FArraySortedDictionary alloc] initWithComparator:[self defaultComparator]];
|
||
|
|
|
||
|
|
// add them to the dictionary
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
map = [map insertKey:[toInsert objectAtIndex:i] withValue:[toInsert objectAtIndex:i]];
|
||
|
|
}
|
||
|
|
XCTAssertTrue([map count] == N, @"Check if all N objects are in the map");
|
||
|
|
XCTAssertTrue([map isKindOfClass:[FArraySortedDictionary class]], @"Make sure we still have a array backed dictionary");
|
||
|
|
|
||
|
|
// Test from inbetween keys
|
||
|
|
{
|
||
|
|
NSEnumerator* enumerator = [map reverseKeyEnumeratorFrom:@11];
|
||
|
|
id next = [enumerator nextObject];
|
||
|
|
int correctValue = 10;
|
||
|
|
while(next != nil) {
|
||
|
|
XCTAssertEqualObjects(next, [NSNumber numberWithInt:correctValue], @"Correct key");
|
||
|
|
next = [enumerator nextObject];
|
||
|
|
correctValue = correctValue - 2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
// Test from key in map
|
||
|
|
{
|
||
|
|
NSEnumerator* enumerator = [map reverseKeyEnumeratorFrom:@10];
|
||
|
|
id next = [enumerator nextObject];
|
||
|
|
int correctValue = 10;
|
||
|
|
while(next != nil) {
|
||
|
|
XCTAssertEqualObjects(next, [NSNumber numberWithInt:correctValue], @"Correct key");
|
||
|
|
next = [enumerator nextObject];
|
||
|
|
correctValue = correctValue - 2;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
- (void)testConversionToTreeMap {
|
||
|
|
int N = SORTED_DICTIONARY_ARRAY_TO_RB_TREE_SIZE_THRESHOLD + 5;
|
||
|
|
NSMutableArray* toInsert = [[NSMutableArray alloc] initWithCapacity:N];
|
||
|
|
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
[toInsert addObject:[NSNumber numberWithInt:i]];
|
||
|
|
}
|
||
|
|
|
||
|
|
[self shuffleArray:toInsert];
|
||
|
|
|
||
|
|
FImmutableSortedDictionary *dict = [FImmutableSortedDictionary dictionaryWithComparator:[self defaultComparator]];
|
||
|
|
|
||
|
|
for(int i = 0; i < N; i++) {
|
||
|
|
dict = [dict insertKey:toInsert[i] withValue:toInsert[i]];
|
||
|
|
if (i < SORTED_DICTIONARY_ARRAY_TO_RB_TREE_SIZE_THRESHOLD) {
|
||
|
|
XCTAssertTrue([dict isKindOfClass:[FArraySortedDictionary class]],
|
||
|
|
@"We're below the threshold we should be an array backed implementation");
|
||
|
|
XCTAssertEqual(dict.count, i + 1, @"Size doesn't match");
|
||
|
|
} else {
|
||
|
|
XCTAssertTrue([dict isKindOfClass:[FTreeSortedDictionary class]],
|
||
|
|
@"We're above the threshold we should be a tree backed implementation");
|
||
|
|
XCTAssertEqual(dict.count, i + 1, @"Size doesn't match");
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
// check the order is correct
|
||
|
|
__block NSUInteger next = 0;
|
||
|
|
[dict enumerateKeysAndObjectsUsingBlock:^(id key, id value, BOOL *stop) {
|
||
|
|
XCTAssertEqualObjects(key, [NSNumber numberWithInteger:next], @"Correct key");
|
||
|
|
XCTAssertEqualObjects(value, [NSNumber numberWithInteger:next], @"Correct value");
|
||
|
|
next = next + 1;
|
||
|
|
}];
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
@end
|
||
|
|
|