attaswift / BTree

Fast sorted collections for Swift using in-memory B-trees

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

Code that produced performance graph is missing

dabrahams opened this issue · comments

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 on an UnsafeBufferPointer projected from the array or not. It would be nice to be able to see the code so I could answer questions like this for myself.

(It would be great to have an numbers update using more recent compilers, too)