Concept
Walk — where it appears
A recursive descent that visits only the positions an answer needs, splitting a range at the position a query returns. Its cost is proportional to what it reports rather than to the range it started with, which is what output-sensitive means when it is made concrete.
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
The array the walk never reads
Document listing compares a chain entry against the start of a range. The comparison is true exactly when the document has not been reported yet — which the walk already knows, because it just wrote it down.
A document already in the answer
The same walk, with the chain's test replaced by a lookup in the answer so far. It reports the same documents at the same cost, and two exchanged lines make it lose nine of seventeen without failing.
Named alongside it
The objects these essays reach for when they reach for this one.
Document arrayDocument listingIndex sizeInvariantOutput-sensitivePrevious occurrence chainRange minimumBitmapCheckDocument collectionOccurrenceRecursion