Take first match.
Add some tests.
IfElse conditions have not yet been compacted (see javadoc).
Add a test case.
Add a test showing the problem.
Use correct pegged counts.
Now have expected result.
merge mmcm: Take the closest (deepest to shallowest nesting) table binding instead of giving an error.

https://code.launchpad.net/~mmcm/akiban-server/sql-binder-closest-table-name/+merge/167666
merge mmcm: A CASE condition with BETWEEN (or AND) would get an error in the overload resolver.

https://code.launchpad.net/~mmcm/akiban-server/sql-overload-complex-case/+merge/167667
Have Sort_Tree create the Cursor adapter with the StoreAdapter providing a Sorter
Simple MemorySorter
merge mmcm: (Relatively) recently added key comparable code in index intersection was mistakenly using the same skip ("pegged") count for the left and right sides.

https://code.launchpad.net/~mmcm/akiban-server/sql-assemble-index-scan-pegged-count/+merge/167668
Rename Sort_Tree to General, update javadoc
Support mixed order
Name updates
Test both Sorters directly
Fix new javadoc
merge nwilliams: Rename Sort_Tree to Sort_General and let StoreAdapter provide a generic Sorter implementation.

https://code.launchpad.net/~nwilliams/akiban-server/store-adapter-creates-sorter/+merge/167856