@@ -274,16 +274,16 @@ def _scan(self, keys, cursor, *args):
274
274
This implementation is KNOWN to be un-performant, as it requires grabbing the full set of keys over which
275
275
we are investigating subsets.
276
276
277
- The SCAN command, and the other commands in the SCAN family, are able to provide to the user a set of guarantees
278
- associated to full iterations.
277
+ The SCAN command, and the other commands in the SCAN family, are able to provide to the user a set of
278
+ guarantees associated to full iterations.
279
279
280
280
- A full iteration always retrieves all the elements that were present in the collection from the start to the
281
281
end of a full iteration. This means that if a given element is inside the collection when an iteration is
282
282
started, and is still there when an iteration terminates, then at some point SCAN returned it to the user.
283
283
284
- - A full iteration never returns any element that was NOT present in the collection from the start to the end of
285
- a full iteration. So if an element was removed before the start of an iteration, and is never added back to the
286
- collection for all the time an iteration lasts, SCAN ensures that this element will never be returned.
284
+ - A full iteration never returns any element that was NOT present in the collection from the start to the end
285
+ of a full iteration. So if an element was removed before the start of an iteration, and is never added back
286
+ to the collection for all the time an iteration lasts, SCAN ensures that this element will never be returned.
287
287
288
288
However because SCAN has very little state associated (just the cursor) it has the following drawbacks:
289
289
0 commit comments