mirror of
https://github.com/firebase/firebase-ios-sdk
synced 2026-11-10 22:45:59 +05:45
47 lines
1.6 KiB
Objective-C
47 lines
1.6 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.
|
|
*/
|
|
|
|
/**
|
|
* @fileoverview Implementation of an immutable SortedMap using a Left-leaning
|
|
* Red-Black Tree, adapted from the implementation in Mugs
|
|
* (http://mads379.github.com/mugs/) by Mads Hartmann Jensen
|
|
* (mads379@gmail.com).
|
|
*
|
|
* Original paper on Left-leaning Red-Black Trees:
|
|
* http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf
|
|
*
|
|
* Invariant 1: No red node has a red child
|
|
* Invariant 2: Every leaf path has the same number of black nodes
|
|
* Invariant 3: Only the left child can be red (left leaning)
|
|
*/
|
|
|
|
#import <Foundation/Foundation.h>
|
|
#import "FImmutableSortedDictionary.h"
|
|
#import "FLLRBNode.h"
|
|
|
|
@interface FTreeSortedDictionary : FImmutableSortedDictionary
|
|
|
|
@property (nonatomic, copy, readonly) NSComparator comparator;
|
|
@property (nonatomic, strong, readonly) id<FLLRBNode> root;
|
|
|
|
- (id)initWithComparator:(NSComparator)aComparator;
|
|
|
|
// Override methods to return subtype
|
|
- (FTreeSortedDictionary *) insertKey:(id)aKey withValue:(id)aValue;
|
|
- (FTreeSortedDictionary *) removeKey:(id)aKey;
|
|
|
|
@end
|