wider

inline sort search

inline sort search

hardcode degree

hardcode degree

up tests

bytebtree

bytes btree

Minor documentation fix, DescendGreaterThan starts with the last item…

… in the tree and decends to the least item greater than the pivot

 Improve the iterate seek to O(logN) (google#25)

* improve the iterate seek to O(logN)

* add benchmark