XAUTOCLAIM
Scan and claim idle pending entries starting from a cursor.
XAUTOCLAIM key group consumer min-idle-time start [COUNT count] [JUSTID]Complexity
O(log P + K + COUNT log N); the idle filter runs before the take, so a PEL of fresh entries is walked in full
Complexity and compatibility are read out of kevy's implementation, not copied from Redis's reference. Several genuinely differ.
Redis compatibility
Differs
the next-cursor is last-claimed+1 rather than 0-0 when the PEL scan completes, so a client looping until 0-0 needs one extra round trip
See also
XACKXADDXCLAIMXDELXGROUPXINFOXLENXPENDINGXRANGEXREADXREADGROUPXREVRANGEXSETIDXTRIM