BTree
BTree copied to clipboard
attaswift
Fast sorted collections for Swift using in-memory B-trees
I am asking myself questions about the code that was run to produce the insertion performance graph. In particular, I'm wondering whether the binary searches for insertion position were done...
You mention that `forEach` is more efficient than a regular `for` loop for `BTree`s, which isn't really ideal. It's true that it's a lot easier to write an efficient `forEach`...
Hey, thank you for the BTree, I use it in my other pet project and it works flawlessly! This is an attempt to support of Swift Codable to BTree. The...
Right now half open ranges and closed ranges are supported, but there is no support for getting a fully open range: (start, end) or a half open range where the...
This fix suspends BridgedList's countByEnumerating func on Linux.
It would be nice if a native English speaker reviewed the documentation and fixed my bad grammar. Also, I'd love to have a list of places where the existing text...
Swift's `Collection` protocol has a number of nontrivial semantic constraints that are rather under-documented; one of these is that a collection's `SubSequence` must be a collection that shares indices with...
Most mutations are supposed to invalidate all existing indices, but `BTreeIndex` only detects invalidation when a mutation deallocates a node that was weakly referenced by the index, or when a...
Now that [SE-0065] moved index manipulation methods into collections, it would be possible to switch to `unowned(unsafe)` references inside `BTreeWeakPath`, probably speeding up indexing considerably. Perhaps even making indexing competitive...