aboutsummaryrefslogtreecommitdiffhomepage
path: root/Firebase/Database/FImmutableSortedDictionary/FImmutableSortedDictionary/FLLRBEmptyNode.m
blob: 5528285b4c37099910cbe718f8b9b01be97c6f55 (plain)
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
/*
 * 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 "FLLRBEmptyNode.h"
#import "FLLRBValueNode.h"

@implementation FLLRBEmptyNode

@synthesize key, value, color, left, right;

- (NSString *) description {
    return [NSString stringWithFormat:@"[key=%@ val=%@ color=%@]", key, value, (color ? @"true" : @"false")];
}

+ (id)emptyNode
{
    static dispatch_once_t pred = 0;
    __strong static id _sharedObject = nil;
    dispatch_once(&pred, ^{
        _sharedObject = [[self alloc] init]; // or some other init method
    });
    return _sharedObject;
}

- (id)copyWith:(id) aKey withValue:(id) aValue withColor:(FLLRBColor*) aColor withLeft:(id<FLLRBNode>)aLeft withRight:(id<FLLRBNode>)aRight {
    return self;
}

- (id<FLLRBNode>) insertKey:(id) aKey forValue:(id)aValue withComparator:(NSComparator)aComparator {
    FLLRBValueNode* result = [[FLLRBValueNode alloc] initWithKey:aKey withValue:aValue withColor:nil withLeft:nil withRight:nil];
    return result;
}

- (id<FLLRBNode>) remove:(id) key withComparator:(NSComparator)aComparator {
    return self;
}

- (int) count {
    return 0;
}

- (BOOL) isEmpty {
    return YES;
}

- (BOOL) inorderTraversal:(BOOL (^)(id key, id value))action {
    return NO;
}

- (BOOL) reverseTraversal:(BOOL (^)(id key, id value))action {
    return NO;
}

- (id<FLLRBNode>) min {
    return self;
}

- (id) minKey {
    return nil;
}

- (id) maxKey {
    return nil;
}

- (BOOL) isRed {
    return NO;
}

- (int) check {
    return 0;
}

@end