Every shard a key could be on, newest epoch first, without repeats.
The first entry is where a write goes and where a read looks first. The rest
are the epoch walk: the shards an earlier topology or an earlier algorithm
would have chosen, tried only when the row is not where it should be.
Shards absent from available are dropped, since a query cannot be sent to a
binding this process does not hold.
Every shard a key could be on, newest epoch first, without repeats.
The first entry is where a write goes and where a read looks first. The rest are the epoch walk: the shards an earlier topology or an earlier algorithm would have chosen, tried only when the row is not where it should be.
Shards absent from
availableare dropped, since a query cannot be sent to a binding this process does not hold.