QueryPlanner::planWithCostBasedRanking keeps track of accepted and rejected solutions using a vector of size_t elements. We could possibly use bitsets for efficiency and that would also allow us to efficiently assert that they are disjoint.

We can only do this if order does not matter.