SERVER-137812In Progress

SeekableRecordCursor API for partitioning a RecordStore

Given a range between minRecordId and maxRecordId, and a number of partitions N, aka Degree of Parallelism (DOP), returns a sorted vector of unique RecordIds that partition the range, with the array size <= N -1. (Question for : or would you prefer N + 1 entries, with the first and last RecordId returned as well?) The bounds are optional: a missing lower bound means the beginning of a collection, and a missing upper bound means the end of a collection. The implementation will make use of

Affected Versions
Versions known to exhibit this issue

No affected versions recorded.

Fixed Versions
Versions that include the fix

No fix available yet.

Components
Server components related to this issue

No components specified.

Labels
Tags and classification
PQm1