:But the case when you have to backtrack should be easily detected (when :the sought element is greater than the right-most bound), right? And :with a radix of 64 that would on average only happen on every 64'th :lookup. I'm not arguing the effectiveness of your implementation, just :checking my understanding of B+trees. : :-- :Erik Wikstr
