"summary":"Return information and entries from a stream consumer group pending entries list, that are messages fetched but never acknowledged.",
"summary":"Returns the information and entries from a stream consumer group's pending entries list.",
"complexity":"O(N) with N being the number of elements returned, so asking for a small fixed number of entries per call is O(1). O(M), where M is the total number of entries scanned when used with the IDLE filter. When the command returns just the summary and the list of consumers is small, it runs in O(1) time; otherwise, an additional O(N) time for iterating every consumer.",
"summary":"Return a range of elements in a stream, with IDs matching the specified IDs interval",
"summary":"Returns the messages from a stream within a range of IDs.",
"complexity":"O(N) with N being the number of elements being returned. If N is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1).",
"summary":"Return never seen elements in multiple streams, with IDs greater than the ones reported by the caller for each stream. Can block.",
"complexity":"For each stream mentioned: O(N) with N being the number of elements being returned, it means that XREAD-ing with a fixed COUNT is O(1). Note that when the BLOCK option is used, XADD will pay O(M) time in order to serve the M clients blocked on the stream getting new data.",
"summary":"Returns messages from multiple streams with IDs greater than the ones requested. Blocks until a message is available otherwise.",
"summary":"Return new entries from a stream using a consumer group, or access the history of the pending entries for a given consumer. Can block.",
"summary":"Returns new or historical messages from a stream for a consumer in agroup. Blocks until a message is available otherwise.",
"complexity":"For each stream mentioned: O(M) with M being the number of elements returned. If M is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1). On the other side when XREADGROUP blocks, XADD will pay the O(N) time in order to serve the N clients blocked on the stream getting new data.",
"summary":"Return a range of elements in a stream, with IDs matching the specified IDs interval, in reverse order (from greater to smaller IDs) compared to XRANGE",
"summary":"Returns the messages from a stream within a range of IDs in reverse order.",
"complexity":"O(N) with N being the number of elements returned. If N is constant (e.g. always asking for the first 10 elements with COUNT), you can consider it O(1).",
"summary":"Trims the stream to (approximately if '~' is passed) a certain size",
"summary":"Deletes messages from the beginning of a stream.",
"complexity":"O(N), with N being the number of evicted entries. Constant times are very small however, since entries are organized in macro nodes containing multiple entries that can be released with a single deallocation.",
"summary":"Returns the difference between multiple sorted sets.",
"complexity":"O(L + (N-K)log(N)) worst case where L is the total number of elements in all the sets, N is the size of the first set, and K is the size of the result set.",
"summary":"Subtract multiple sorted sets and store the resulting sorted set in a new key",
"summary":"Stores the difference of multiple sorted sets in a key.",
"complexity":"O(L + (N-K)log(N)) worst case where L is the total number of elements in all the sets, N is the size of the first set, and K is the size of the result set.",
"summary":"Returns the intersect of multiple sorted sets.",
"complexity":"O(N*K)+O(M*log(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.",
"summary":"Intersect multiple sorted sets and store the resulting sorted set in a new key",
"summary":"Stores the intersect of multiple sorted sets in a key.",
"complexity":"O(N*K)+O(M*log(M)) worst case with N being the smallest input sorted set, K being the number of input sorted sets and M being the number of elements in the resulting sorted set.",
"summary":"Remove and return members with scores in a sorted set",
"summary":"Returns the highest- or lowest-scoring members from one or more sorted sets after removing them. Deletes the sorted set if the last member was popped.",
"complexity":"O(K) + O(M*log(N)) where K is the number of provided keys, N being the number of elements in the sorted set, and M being the number of elements popped.",