| BTree.swift:97 | precondition(index.root.value === self.root) |
| BTree.swift:98 | let node = index.path.last!.value! |
| BTree.swift:240 | index.expectValid(index.path[0].value === root) |
| BTree.swift:244 | guard var last = index.path.last?.value else { index.invalid() } |
| BTree.swift:247 | guard let node = index.path[i].value else { index.invalid() } |
| BTreeIndex.swift:61 | var node = node ?? path.last!.value!.children[slots.last!] |
| BTreeIndex.swift:73 | guard let n = path.removeLast().value else { invalid() } |
| BTreeIndex.swift:76 | guard let p = path.last!.value else { invalid() } |
| BTreeIndex.swift:83 | guard root.value != nil else { invalid() } |
| BTreeIndex.swift:84 | guard let node = self.path.last?.value else { invalid() } |
| BTreeIndex.swift:92 | while slots.count > 0 && slots.last! == path.last!.value!.elements.count { |
| BTreeIndex.swift:104 | expectValid(root.value != nil) |
| BTreeIndex.swift:106 | descend(.Backward, node: root.value!) |
| BTreeIndex.swift:109 | guard let node = self.path.last!.value else { invalid() } |
| BTreeIndex.swift:153 | guard let ar = a.root.value, br = b.root.value where ar === br else { return false } |
| BTreeIndex.swift:153 | guard let ar = a.root.value, br = b.root.value where ar === br else { return false } |
| BTreeIndex.swift:156 | guard a.path[i].value === b.path[i].value else { return false } |
| BTreeIndex.swift:156 | guard a.path[i].value === b.path[i].value else { return false } |
| Weak.swift:13 | self.value = value |