BRPOP key timeout
Available since
Time complexity
O(N) where N is the number of provided keys.
ACL categories
@write, @list, @slow, @blocking

BRPOP is a blocking list pop primitive. It is the blocking version of RPOP because it blocks the connection when there are no elements to pop from any of the given lists. An element is popped from the tail of the first list that is non-empty, with the given keys being checked in the order that they are given.

See the BLPOP documentation for the exact semantics, since BRPOP is identical to BLPOP with the only difference being that it pops elements from the tail of a list instead of popping from the head.

Examples #

redict> DEL list1 list2
(integer) 0
redict> RPUSH list1 a b c
(integer) 3
redict> BRPOP list1 list2 0
1) "list1"
2) "c"

History #

`timeout` is interpreted as a double instead of an integer.

Redict logo courtesy of @janWilejan, CC-BY-SA-4.0. Download SVG ⤑

Portions of this website courtesy of Salvatore Sanfilippo, CC-BY-SA-4.0.