"summary":"Return a range of members in a sorted set, by lexicographical range",
"summary":"Returns members in a sorted set within a lexicographical range.",
"complexity":"O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).",
"summary":"Return a range of members in a sorted set, by score",
"summary":"Returns members in a sorted set within a range of scores.",
"complexity":"O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).",
"summary":"Return a range of members in a sorted set, by lexicographical range, ordered from higher to lower strings.",
"summary":"Returns members in a sorted set within a lexicographical range in reverse order.",
"complexity":"O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).",
"summary":"Return a range of members in a sorted set, by score, with scores ordered from high to low",
"summary":"Returns members in a sorted set within a range of scores in reverse order.",
"complexity":"O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements being returned. If M is constant (e.g. always asking for the first 10 elements with LIMIT), you can consider it O(log(N)).",
"summary":"Incrementally iterate sorted sets elements and associated scores",
"summary":"Iterates over members and scores of a sorted set.",
"complexity":"O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection.",
"summary":"Returns the union of multiple sorted sets.",
"complexity":"O(N)+O(M*log(M)) with N being the sum of the sizes of the input sorted sets, and M being the number of elements in the resulting sorted set.",
"summary":"Add multiple sorted sets and store the resulting sorted set in a new key",
"summary":"Stores the union of multiple sorted sets in a key.",
"complexity":"O(N)+O(M log(M)) with N being the sum of the sizes of the input sorted sets, and M being the number of elements in the resulting sorted set.",