mirror of https://github.com/citusdata/citus.git
6bd2e3ed30
This determines whether it's possible to perform binary search on sortedShardIntervalArray or not. If e.g. two shards have overlapping ranges, that'd be prohibitive. That'll be useful in later commit introducing faster shard pruning. |
||
|---|---|---|
| .. | ||
| data | ||
| expected | ||
| input | ||
| output | ||
| specs | ||
| sql | ||
| .gitignore | ||
| Makefile | ||
| isolation_schedule | ||
| multi_binary_schedule | ||
| multi_mx_schedule | ||
| multi_schedule | ||
| multi_task_tracker_extra_schedule | ||
| pg_regress_multi.pl | ||
| worker_schedule | ||