Hi, On Wed, 18 Jul 2007, Linus Torvalds wrote: > On Thu, 19 Jul 2007, Johannes Schindelin wrote: > > > > There is one severe shortcoming, though. Since tree objects can > > contain file names of a variable length, it is not possible to do a > > binary search for the correct base name in the tree object's contents. > > Well, I've been thinking about this, and that's not really entirely > correct. > > It *is* possible to do a binary search, it's just a bit complicated, > because you have to take the "halfway" thing, and find the beginning of > an entry. I will try to work from your proposal, and do some timings. But for the notes, I really, really like the average constant running time of the hash map. As you can see from my timings in http://thread.gmane.org/gmane.comp.version-control.git/52598/focus=52603 it does make a difference, compared to binary search. Ciao, Dscho - To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html
