commit | e5086548ee797724ffcf5320fa50b381d63a67a0 | [log] [tgz] |
---|---|---|
author | alexander.behm <alexander.behm@123451ca-8445-de46-9d55-352943316053> | Thu Dec 16 05:48:08 2010 +0000 |
committer | alexander.behm <alexander.behm@123451ca-8445-de46-9d55-352943316053> | Thu Dec 16 05:48:08 2010 +0000 |
tree | d3f84cab7652ab0cc4ff7a0fc4a5a4b8bf900533 | |
parent | f478927d9c32e5fe6372bbe894f50cd610d6b3d1 [diff] |
1. Improved performance of BTree RangeSearchCursor 2. Added test for BTree RangeSearchCursor to check all combinations of forward/backward scans with open/closed intervals 3. Fixed bug when lower bound in BTree search is -infinity (Asterix ticket #20) 4. Low and high search keys can now be on different prefixes of the BTree key git-svn-id: https://hyracks.googlecode.com/svn/trunk/hyracks@249 123451ca-8445-de46-9d55-352943316053