(extension in BTree):BTree.List<A where A: Swift.Equatable>.contains (A) -> Swift.Bool
(extension in BTree):BTree.List<A where A: Swift.Equatable>.indexOf (A) -> Swift.Optional<Swift.Int>
BTree.(WalkDirection in _96DE105B9E60A4F35DCD5B6FA4DC8953)
BTree.(WalkDirection in _96DE105B9E60A4F35DCD5B6FA4DC8953).Backward (BTree.(WalkDirection in _96DE105B9E60A4F35DCD5B6FA4DC8953).Type) -> BTree.(WalkDirection in _96DE105B9E60A4F35DCD5B6FA4DC8953)
BTree.(WalkDirection in _96DE105B9E60A4F35DCD5B6FA4DC8953).Forward (BTree.(WalkDirection in _96DE105B9E60A4F35DCD5B6FA4DC8953).Type) -> BTree.(WalkDirection in _96DE105B9E60A4F35DCD5B6FA4DC8953)
BTree.(WalkDirection in _D98AC9426559197E38F8211AFC7054D5)
BTree.(WalkDirection in _D98AC9426559197E38F8211AFC7054D5).Backward (BTree.(WalkDirection in _D98AC9426559197E38F8211AFC7054D5).Type) -> BTree.(WalkDirection in _D98AC9426559197E38F8211AFC7054D5)
BTree.(WalkDirection in _D98AC9426559197E38F8211AFC7054D5).Forward (BTree.(WalkDirection in _D98AC9426559197E38F8211AFC7054D5).Type) -> BTree.(WalkDirection in _D98AC9426559197E38F8211AFC7054D5)
BTree.BTree
BTree.BTree with unmangled suffix "3KeyMx"
BTree.BTree with unmangled suffix "4Node"
BTree.BTree with unmangled suffix "5Index"
BTree.BTree with unmangled suffix "6Cursor"
BTree.BTree with unmangled suffix "7Element"
BTree.BTree with unmangled suffix "7PayloadMq_"
BTree.BTree with unmangled suffix "9Generator"
BTree.BTree.count : Swift.Int
BTree.BTree.depth : Swift.Int
BTree.BTree.edit (descend : (BTree.BTreeNode<A, B>) -> Swift.Optional<Swift.Int>, ascend : (BTree.BTreeNode<A, B>, Swift.Int) -> ()) -> ()
BTree.BTree.elementAtPosition (Swift.Int) -> (A, B)
BTree.BTree.endIndex : BTree.BTreeIndex<A, B>
BTree.BTree.forEach ((A, B) throws -> ()) throws -> ()
BTree.BTree.forEach ((A, B) throws -> Swift.Bool) throws -> Swift.Bool
BTree.BTree.generate () -> BTree.BTreeGenerator<A, B>
BTree.BTree.indexOf (A, choosing : BTree.BTreeKeySelector) -> Swift.Optional<BTree.BTreeIndex<A, B>>
BTree.BTree.indexOfPosition (Swift.Int) -> BTree.BTreeIndex<A, B>
BTree.BTree.init (BTree.BTreeNode<A, B>) -> BTree.BTree<A, B>
BTree.BTree.init (order : Swift.Int) -> BTree.BTree<A, B>
BTree.BTree.init <A where A1: Swift.SequenceType, A1.Generator.Element == (A, B)> (elements : A1, order : Swift.Int, fillFactor : Swift.Double) -> BTree.BTree<A, B>
BTree.BTree.init <A where A1: Swift.SequenceType, A1.Generator.Element == (A, B)> (sortedElements : A1, order : Swift.Int, fillFactor : Swift.Double) -> BTree.BTree<A, B>
BTree.BTree.insert ((A, B), at : BTree.BTreeKeySelector) -> ()
BTree.BTree.insert ((A, B), at : Swift.Int) -> ()
BTree.BTree.insertOrReplace ((A, B), at : BTree.BTreeKeySelector) -> Swift.Optional<B>
BTree.BTree.isEmpty : Swift.Bool
BTree.BTree.isUnique : Swift.Bool
BTree.BTree.makeUnique () -> ()
BTree.BTree.order : Swift.Int
BTree.BTree.payloadOf (A, choosing : BTree.BTreeKeySelector) -> Swift.Optional<B>
BTree.BTree.positionOf (A, choosing : BTree.BTreeKeySelector) -> Swift.Optional<Swift.Int>
BTree.BTree.positionOfIndex (BTree.BTreeIndex<A, B>) -> Swift.Int
BTree.BTree.remove (A, at : BTree.BTreeKeySelector) -> Swift.Optional<B>
BTree.BTree.removeAt (Swift.Int) -> (A, B)
BTree.BTree.root : BTree.BTreeNode<A, B>
BTree.BTree.setPayloadAt (Swift.Int, to : B) -> B
BTree.BTree.startIndex : BTree.BTreeIndex<A, B>
BTree.BTree.subscript (BTree.BTreeIndex<A, B>) -> (A, B)
BTree.BTree.withCursorAt (A, choosing : BTree.BTreeKeySelector, body : (BTree.BTreeCursor<A, B>) throws -> ()) throws -> ()
BTree.BTree.withCursorAt (BTree.BTreeIndex<A, B>, body : (BTree.BTreeCursor<A, B>) throws -> ()) throws -> ()
BTree.BTree.withCursorAtEnd ((BTree.BTreeCursor<A, B>) throws -> ()) throws -> ()
BTree.BTree.withCursorAtPosition (Swift.Int, body : (BTree.BTreeCursor<A, B>) throws -> ()) throws -> ()
BTree.BTree.withCursorAtStart ((BTree.BTreeCursor<A, B>) throws -> ()) throws -> ()
BTree.BTreeCursor
BTree.BTreeCursor with unmangled suffix "3KeyMx"
BTree.BTreeCursor with unmangled suffix "4Node"
BTree.BTreeCursor with unmangled suffix "4Tree"
BTree.BTreeCursor with unmangled suffix "7Element"
BTree.BTreeCursor with unmangled suffix "7PayloadMq_"
BTree.BTreeCursor.(_position in _D98AC9426559197E38F8211AFC7054D5) : Swift.Int
BTree.BTreeCursor.(descendToKey in _D98AC9426559197E38F8211AFC7054D5) (A, choosing : BTree.BTreeKeySelector) -> ()
BTree.BTreeCursor.(descendToPosition in _D98AC9426559197E38F8211AFC7054D5) (Swift.Int) -> ()
BTree.BTreeCursor.(descendToSlots in _D98AC9426559197E38F8211AFC7054D5) (Swift.Array<Swift.Int>) -> ()
BTree.BTreeCursor.(fixupAfterInsert in _D98AC9426559197E38F8211AFC7054D5) () -> ()
BTree.BTreeCursor.(insertWithoutCloning in _D98AC9426559197E38F8211AFC7054D5) (BTree.BTreeNode<A, B>) -> ()
BTree.BTreeCursor.(invalidate in _D98AC9426559197E38F8211AFC7054D5) () -> ()
BTree.BTreeCursor.(path in _D98AC9426559197E38F8211AFC7054D5) : Swift.Array<BTree.BTreeNode<A, B>>
BTree.BTreeCursor.(popFromPath in _D98AC9426559197E38F8211AFC7054D5) () -> BTree.BTreeNode<A, B>
BTree.BTreeCursor.(popFromSlots in _D98AC9426559197E38F8211AFC7054D5) () -> Swift.Int
BTree.BTreeCursor.(pushToPath in _D98AC9426559197E38F8211AFC7054D5) () -> BTree.BTreeNode<A, B>
BTree.BTreeCursor.(pushToSlots in _D98AC9426559197E38F8211AFC7054D5) (Swift.Int, positionOfSlot : Swift.Optional<Swift.Int>) -> ()
BTree.BTreeCursor.(reset in _D98AC9426559197E38F8211AFC7054D5) (BTree.BTreeNode<A, B>) -> ()
BTree.BTreeCursor.(root in _D98AC9426559197E38F8211AFC7054D5) : BTree.BTreeNode<A, B>
BTree.BTreeCursor.(slots in _D98AC9426559197E38F8211AFC7054D5) : Swift.Array<Swift.Int>
BTree.BTreeCursor.count : Swift.Int
BTree.BTreeCursor.extract (Swift.Int) -> BTree.BTree<A, B>
BTree.BTreeCursor.finish () -> BTree.BTree<A, B>
BTree.BTreeCursor.finishAndKeepPrefix () -> BTree.BTree<A, B>
BTree.BTreeCursor.finishAndKeepSuffix () -> BTree.BTree<A, B>
BTree.BTreeCursor.finishByCutting () -> (left : BTree.BTree<A, B>, separator : (A, B), right : BTree.BTree<A, B>)
BTree.BTreeCursor.init (BTree.BTreeNode<A, B>) -> BTree.BTreeCursor<A, B>
BTree.BTreeCursor.insert (A, B) -> ()
BTree.BTreeCursor.insert (BTree.BTree<A, B>) -> ()
BTree.BTreeCursor.insert <A where A1: Swift.SequenceType, A1.Generator.Element == (A, B)> (A1) -> ()
BTree.BTreeCursor.insertAfter (A, B) -> ()
BTree.BTreeCursor.isAtEnd : Swift.Bool
BTree.BTreeCursor.isAtStart : Swift.Bool
BTree.BTreeCursor.isValid : Swift.Bool
BTree.BTreeCursor.key : A
BTree.BTreeCursor.moveBackward () -> ()
BTree.BTreeCursor.moveForward () -> ()
BTree.BTreeCursor.moveToEnd () -> ()
BTree.BTreeCursor.moveToKey (A, choosing : BTree.BTreeKeySelector) -> ()
BTree.BTreeCursor.moveToPosition (Swift.Int) -> ()
BTree.BTreeCursor.moveToStart () -> ()
BTree.BTreeCursor.payload : B
BTree.BTreeCursor.position : Swift.Int
BTree.BTreeCursor.remove () -> (A, B)
BTree.BTreeCursor.remove (Swift.Int) -> ()
BTree.BTreeCursor.reset (endOf : BTree.BTreeNode<A, B>) -> ()
BTree.BTreeCursor.reset (root : BTree.BTreeNode<A, B>, key : A, choosing : BTree.BTreeKeySelector) -> ()
BTree.BTreeCursor.reset (root : BTree.BTreeNode<A, B>, position : Swift.Int) -> ()
BTree.BTreeCursor.reset (startOf : BTree.BTreeNode<A, B>) -> ()
BTree.BTreeCursor.setPayload (B) -> B
BTree.BTreeGenerator
BTree.BTreeGenerator with unmangled suffix "3KeyMx"
BTree.BTreeGenerator with unmangled suffix "4Node"
BTree.BTreeGenerator with unmangled suffix "7Element"
BTree.BTreeGenerator with unmangled suffix "7PayloadMq_"
BTree.BTreeGenerator.indexPath : Swift.Array<Swift.Int>
BTree.BTreeGenerator.init (BTree.BTreeNode<A, B>) -> BTree.BTreeGenerator<A, B>
BTree.BTreeGenerator.next () -> Swift.Optional<(A, B)>
BTree.BTreeGenerator.nodePath : Swift.Array<BTree.BTreeNode<A, B>>
BTree.BTreeIndex
BTree.BTreeIndex with unmangled suffix "3KeyMx"
BTree.BTreeIndex with unmangled suffix "4Node"
BTree.BTreeIndex with unmangled suffix "7PayloadMq_"
BTree.BTreeIndex with unmangled suffix "8Distance"
BTree.BTreeIndex.(descend in _96DE105B9E60A4F35DCD5B6FA4DC8953) (BTree.(WalkDirection in _96DE105B9E60A4F35DCD5B6FA4DC8953), node : Swift.Optional<BTree.BTreeNode<A, B>>) -> ()
BTree.BTreeIndex.(popPath in _96DE105B9E60A4F35DCD5B6FA4DC8953) () -> ()
BTree.BTreeIndex.expectValid (@autoclosure () -> Swift.Bool, file : Swift.StaticString, line : Swift.UInt) -> ()
BTree.BTreeIndex.init (endIndexOf : BTree.BTreeNode<A, B>) -> BTree.BTreeIndex<A, B>
BTree.BTreeIndex.init (path : Swift.Array<BTree.Weak<BTree.BTreeNode<A, B>>>, slots : Swift.Array<Swift.Int>) -> BTree.BTreeIndex<A, B>
BTree.BTreeIndex.init (startIndexOf : BTree.BTreeNode<A, B>) -> BTree.BTreeIndex<A, B>
BTree.BTreeIndex.invalid (Swift.StaticString, line : Swift.UInt) -> ()
BTree.BTreeIndex.path : Swift.Array<BTree.Weak<BTree.BTreeNode<A, B>>>
BTree.BTreeIndex.predecessor () -> BTree.BTreeIndex<A, B>
BTree.BTreeIndex.predecessorInPlace () -> ()
BTree.BTreeIndex.root : BTree.Weak<BTree.BTreeNode<A, B>>
BTree.BTreeIndex.slots : Swift.Array<Swift.Int>
BTree.BTreeIndex.successor () -> BTree.BTreeIndex<A, B>
BTree.BTreeIndex.successorInPlace () -> ()
BTree.BTreeKeySelector
BTree.BTreeKeySelector.Any (BTree.BTreeKeySelector.Type) -> BTree.BTreeKeySelector
BTree.BTreeKeySelector.First (BTree.BTreeKeySelector.Type) -> BTree.BTreeKeySelector
BTree.BTreeKeySelector.Last (BTree.BTreeKeySelector.Type) -> BTree.BTreeKeySelector
BTree.BTreeNode
BTree.BTreeNode with unmangled suffix "3KeyMx"
BTree.BTreeNode with unmangled suffix "4Node"
BTree.BTreeNode with unmangled suffix "7Element"
BTree.BTreeNode with unmangled suffix "7PayloadMq_"
BTree.BTreeNode with unmangled suffix "9Generator"
BTree.BTreeNode._depth : Swift.Int32
BTree.BTreeNode._order : Swift.Int32
BTree.BTreeNode.append (A, B) -> ()
BTree.BTreeNode.children : Swift.Array<BTree.BTreeNode<A, B>>
BTree.BTreeNode.clone () -> BTree.BTreeNode<A, B>
BTree.BTreeNode.collapse (Swift.Int) -> ()
BTree.BTreeNode.contains (A, choosing : BTree.BTreeKeySelector) -> Swift.Bool
BTree.BTreeNode.count : Swift.Int
BTree.BTreeNode.depth : Swift.Int
BTree.BTreeNode.edit (descend : (BTree.BTreeNode<A, B>) -> Swift.Optional<Swift.Int>, ascend : (BTree.BTreeNode<A, B>, Swift.Int) -> ()) -> ()
BTree.BTreeNode.elements : Swift.Array<(A, B)>
BTree.BTreeNode.fixDeficiency (Swift.Int) -> ()
BTree.BTreeNode.forEach ((A, B) throws -> ()) throws -> ()
BTree.BTreeNode.forEach ((A, B) throws -> Swift.Bool) throws -> Swift.Bool
BTree.BTreeNode.generate () -> BTree.BTreeGenerator<A, B>
BTree.BTreeNode.init (left : BTree.BTreeNode<A, B>, separator : (A, B), right : BTree.BTreeNode<A, B>) -> BTree.BTreeNode<A, B>
BTree.BTreeNode.init (node : BTree.BTreeNode<A, B>, slotRange : Swift.Range<Swift.Int>) -> BTree.BTreeNode<A, B>
BTree.BTreeNode.init (order : Swift.Int) -> BTree.BTreeNode<A, B>
BTree.BTreeNode.init (order : Swift.Int, elements : Swift.Array<(A, B)>, children : Swift.Array<BTree.BTreeNode<A, B>>, count : Swift.Int) -> BTree.BTreeNode<A, B>
BTree.BTreeNode.insert ((A, B), inSlot : Swift.Int) -> ()
BTree.BTreeNode.insert (BTree.BTreeSplinter<A, B>, inSlot : Swift.Int) -> ()
BTree.BTreeNode.isBalanced : Swift.Bool
BTree.BTreeNode.isEmpty : Swift.Bool
BTree.BTreeNode.isLeaf : Swift.Bool
BTree.BTreeNode.isTooLarge : Swift.Bool
BTree.BTreeNode.isTooSmall : Swift.Bool
BTree.BTreeNode.makeChildUnique (Swift.Int) -> BTree.BTreeNode<A, B>
BTree.BTreeNode.maxChildren : Swift.Int
BTree.BTreeNode.maxKeys : Swift.Int
BTree.BTreeNode.minChildren : Swift.Int
BTree.BTreeNode.minKeys : Swift.Int
BTree.BTreeNode.order : Swift.Int
BTree.BTreeNode.positionOfSlot (Swift.Int) -> Swift.Int
BTree.BTreeNode.removeSlot (Swift.Int) -> (A, B)
BTree.BTreeNode.rotateLeft (Swift.Int) -> ()
BTree.BTreeNode.rotateRight (Swift.Int) -> ()
BTree.BTreeNode.setElementInSlot (Swift.Int, to : (A, B)) -> (A, B)
BTree.BTreeNode.slotOf (A, choosing : BTree.BTreeKeySelector) -> (match : Swift.Optional<Swift.Int>, descend : Swift.Int)
BTree.BTreeNode.slotOfPosition (Swift.Int) -> (index : Swift.Int, match : Swift.Bool, position : Swift.Int)
BTree.BTreeNode.split () -> BTree.BTreeSplinter<A, B>
BTree.BTreeNode.split (Swift.Int) -> BTree.BTreeSplinter<A, B>
BTree.BTreeSplinter
BTree.BTreeSplinter with unmangled suffix "3KeyMx"
BTree.BTreeSplinter with unmangled suffix "7PayloadMq_"
BTree.BTreeSplinter.exploded : (separator : (A, B), node : BTree.BTreeNode<A, B>)
BTree.BTreeSplinter.node : BTree.BTreeNode<A, B>
BTree.BTreeSplinter.separator : (A, B)
BTree.EmptyKey
BTree.List
BTree.List with unmangled suffix "4Tree"
BTree.List with unmangled suffix "5Index"
BTree.List with unmangled suffix "7ElementMx"
BTree.List with unmangled suffix "9Generator"
BTree.List.append (A) -> ()
BTree.List.appendContentsOf (BTree.List<A>) -> ()
BTree.List.appendContentsOf <A where A1: Swift.SequenceType, A == A1.Generator.Element> (A1) -> ()
BTree.List.count : Swift.Int
BTree.List.debugDescription : Swift.String
BTree.List.description : Swift.String
BTree.List.endIndex : Swift.Int
BTree.List.filter ((A) throws -> Swift.Bool) throws -> Swift.Array<A>
BTree.List.flatMap <A where A1: Swift.SequenceType> ((A) throws -> A1) throws -> Swift.Array<A1.Generator.Element>
BTree.List.flatMap <A> ((A) throws -> Swift.Optional<A1>) throws -> Swift.Array<A1>
BTree.List.forEach ((A) throws -> ()) throws -> ()
BTree.List.generate () -> BTree.ListGenerator<A>
BTree.List.indexOf ((A) throws -> Swift.Bool) throws -> Swift.Optional<Swift.Int>
BTree.List.init () -> BTree.List<A>
BTree.List.init (arrayLiteral : Swift.Array<A>...) -> BTree.List<A>
BTree.List.init <A where A1: Swift.SequenceType, A == A1.Generator.Element> (A1) -> BTree.List<A>
BTree.List.insert (A, atIndex : Swift.Int) -> ()
BTree.List.insertContentsOf (BTree.List<A>, at : Swift.Int) -> ()
BTree.List.insertContentsOf <A where A1: Swift.SequenceType, A == A1.Generator.Element> (A1, at : Swift.Int) -> ()
BTree.List.isEmpty : Swift.Bool
BTree.List.map <A> ((A) throws -> A1) throws -> Swift.Array<A1>
BTree.List.popFirst () -> Swift.Optional<A>
BTree.List.popLast () -> Swift.Optional<A>
BTree.List.reduce <A> (A1, combine : (A1, A) throws -> A1) throws -> A1
BTree.List.removeAll () -> ()
BTree.List.removeAtIndex (Swift.Int) -> A
BTree.List.removeFirst () -> A
BTree.List.removeFirst (Swift.Int) -> ()
BTree.List.removeLast () -> A
BTree.List.removeLast (Swift.Int) -> ()
BTree.List.removeRange (Swift.Range<Swift.Int>) -> ()
BTree.List.replaceRange <A where A1: Swift.CollectionType, A == A1.Generator.Element> (Swift.Range<Swift.Int>, with : A1) -> ()
BTree.List.startIndex : Swift.Int
BTree.List.subscript (Swift.Int) -> A
BTree.List.tree : BTree.BTree<BTree.EmptyKey, A>
BTree.ListGenerator
BTree.ListGenerator with unmangled suffix "4Base"
BTree.ListGenerator with unmangled suffix "7ElementMx"
BTree.ListGenerator.(base in _C4A5A49623B057BB7AF98DE22AD92AAA) : BTree.BTreeGenerator<BTree.EmptyKey, A>
BTree.ListGenerator.init (BTree.BTreeGenerator<BTree.EmptyKey, A>) -> BTree.ListGenerator<A>
BTree.ListGenerator.next () -> Swift.Optional<A>
BTree.Map
BTree.Map with unmangled suffix "3KeyMx"
BTree.Map with unmangled suffix "4Tree"
BTree.Map with unmangled suffix "5Index"
BTree.Map with unmangled suffix "5ValueMq_"
BTree.Map with unmangled suffix "7Element"
BTree.Map with unmangled suffix "9Generator"
BTree.Map.count : Swift.Int
BTree.Map.debugDescription : Swift.String
BTree.Map.description : Swift.String
BTree.Map.endIndex : BTree.BTreeIndex<A, B>
BTree.Map.flatMap <A where A1: Swift.SequenceType> ((A, B) throws -> A1) throws -> Swift.Array<A1.Generator.Element>
BTree.Map.flatMap <A> ((A, B) throws -> Swift.Optional<A1>) throws -> Swift.Array<A1>
BTree.Map.forEach ((A, B) throws -> ()) throws -> ()
BTree.Map.generate () -> BTree.BTreeGenerator<A, B>
BTree.Map.indexForKey (A) -> Swift.Optional<BTree.BTreeIndex<A, B>>
BTree.Map.init () -> BTree.Map<A, B>
BTree.Map.init (dictionaryLiteral : Swift.Array<(A, B)>...) -> BTree.Map<A, B>
BTree.Map.init <A where A1: Swift.SequenceType, A1.Generator.Element == (A, B)> (elements : A1) -> BTree.Map<A, B>
BTree.Map.init <A where A1: Swift.SequenceType, A1.Generator.Element == (A, B)> (sortedElements : A1) -> BTree.Map<A, B>
BTree.Map.isEmpty : Swift.Bool
BTree.Map.keys : Swift.LazyMapCollection<BTree.Map<A, B>, A>
BTree.Map.map <A> ((A, B) throws -> A1) throws -> Swift.Array<A1>
BTree.Map.reduce <A> (A1, combine : (A1, (A, B)) throws -> A1) throws -> A1
BTree.Map.removeAll () -> ()
BTree.Map.removeAtIndex (BTree.BTreeIndex<A, B>) -> (A, B)
BTree.Map.removeValueForKey (A) -> Swift.Optional<B>
BTree.Map.startIndex : BTree.BTreeIndex<A, B>
BTree.Map.subscript (A) -> Swift.Optional<B>
BTree.Map.subscript (BTree.BTreeIndex<A, B>) -> (A, B)
BTree.Map.tree : BTree.BTree<A, B>
BTree.Map.updateValue (B, forKey : A) -> Swift.Optional<B>
BTree.Map.values : Swift.LazyMapCollection<BTree.Map<A, B>, B>
BTree.Weak
BTree.Weak with unmangled suffix "1TMx"
BTree.Weak.init (A) -> BTree.Weak<A>
BTree.Weak.value : weak Swift.Optional<A>
BTree.bTreeNodeSize : Swift.Int
static BTree.!= infix <A where A: Swift.Equatable> (BTree.List<A>, BTree.List<A>) -> Swift.Bool
static BTree.!= infix <A, B where A: Swift.Comparable, B: Swift.Equatable> (BTree.Map<A, B>, BTree.Map<A, B>) -> Swift.Bool
static BTree.< infix (BTree.EmptyKey, BTree.EmptyKey) -> Swift.Bool
static BTree.== infix (BTree.EmptyKey, BTree.EmptyKey) -> Swift.Bool
static BTree.== infix <A where A: Swift.Equatable> (BTree.List<A>, BTree.List<A>) -> Swift.Bool
static BTree.== infix <A, B where A: Swift.Comparable, B: Swift.Equatable> (BTree.Map<A, B>, BTree.Map<A, B>) -> Swift.Bool
static BTree.== infix <A, B where A: Swift.Comparable> (BTree.BTreeIndex<A, B>, BTree.BTreeIndex<A, B>) -> Swift.Bool
static BTree.BTreeNode.defaultOrder : Swift.Int
static BTree.BTreeNode.join (left : BTree.BTreeNode<A, B>, separator : (A, B), right : BTree.BTreeNode<A, B>) -> BTree.BTreeNode<A, B>