commit | f5b196241a159952aaeee36bce4e2702156093ee | [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 | 01e894de5aadad85c33a26afbe234aa5b3e81555 | |
parent | e6ce24e734aaaf3e4c3f0aa49ad29b9c019dcb3a [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@249 123451ca-8445-de46-9d55-352943316053