Commit ad94bc31 authored by Vitaly Arbuzov's avatar Vitaly Arbuzov
Browse files

Merge branch 'unstable' into dict-split-by-slot

parents a08686a5 e55568ed
{ {
"ZPOPMAX": { "ZPOPMAX": {
"summary": "Remove and return members with the highest scores in a sorted set", "summary": "Returns the highest-scoring members from a sorted set after removing them. Deletes the sorted set if the last member was popped.",
"complexity": "O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.", "complexity": "O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.",
"group": "sorted_set", "group": "sorted_set",
"since": "5.0.0", "since": "5.0.0",
......
{ {
"ZPOPMIN": { "ZPOPMIN": {
"summary": "Remove and return members with the lowest scores in a sorted set", "summary": "Returns the lowest-scoring members from a sorted set after removing them. Deletes the sorted set if the last member was popped.",
"complexity": "O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.", "complexity": "O(log(N)*M) with N being the number of elements in the sorted set, and M being the number of elements popped.",
"group": "sorted_set", "group": "sorted_set",
"since": "5.0.0", "since": "5.0.0",
......
{ {
"ZRANDMEMBER": { "ZRANDMEMBER": {
"summary": "Get one or multiple random elements from a sorted set", "summary": "Returns one or more random members from a sorted set.",
"complexity": "O(N) where N is the number of elements returned", "complexity": "O(N) where N is the number of members returned",
"group": "sorted_set", "group": "sorted_set",
"since": "6.2.0", "since": "6.2.0",
"arity": -2, "arity": -2,
......
{ {
"ZRANGE": { "ZRANGE": {
"summary": "Return a range of members in a sorted set", "summary": "Returns members in a sorted set within a range of indexes.",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.", "complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.",
"group": "sorted_set", "group": "sorted_set",
"since": "1.2.0", "since": "1.2.0",
......
{ {
"ZRANGEBYLEX": { "ZRANGEBYLEX": {
"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)).", "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)).",
"group": "sorted_set", "group": "sorted_set",
"since": "2.8.9", "since": "2.8.9",
......
{ {
"ZRANGEBYSCORE": { "ZRANGEBYSCORE": {
"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)).", "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)).",
"group": "sorted_set", "group": "sorted_set",
"since": "1.0.5", "since": "1.0.5",
......
{ {
"ZRANGESTORE": { "ZRANGESTORE": {
"summary": "Store a range of members from sorted set into another key", "summary": "Stores a range of members from sorted set in a key.",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements stored into the destination key.", "complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements stored into the destination key.",
"group": "sorted_set", "group": "sorted_set",
"since": "6.2.0", "since": "6.2.0",
......
{ {
"ZRANK": { "ZRANK": {
"summary": "Determine the index of a member in a sorted set", "summary": "Returns the index of a member in a sorted set ordered by ascending scores.",
"complexity": "O(log(N))", "complexity": "O(log(N))",
"group": "sorted_set", "group": "sorted_set",
"since": "2.0.0", "since": "2.0.0",
......
{ {
"ZREM": { "ZREM": {
"summary": "Remove one or more members from a sorted set", "summary": "Removes one or more members from a sorted set. Deletes the sorted set if all members were removed.",
"complexity": "O(M*log(N)) with N being the number of elements in the sorted set and M the number of elements to be removed.", "complexity": "O(M*log(N)) with N being the number of elements in the sorted set and M the number of elements to be removed.",
"group": "sorted_set", "group": "sorted_set",
"since": "1.2.0", "since": "1.2.0",
......
{ {
"ZREMRANGEBYLEX": { "ZREMRANGEBYLEX": {
"summary": "Remove all members in a sorted set between the given lexicographical range", "summary": "Removes members in a sorted set within a lexicographical range. Deletes the sorted set if all members were removed.",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.", "complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.",
"group": "sorted_set", "group": "sorted_set",
"since": "2.8.9", "since": "2.8.9",
......
{ {
"ZREMRANGEBYRANK": { "ZREMRANGEBYRANK": {
"summary": "Remove all members in a sorted set within the given indexes", "summary": "Removes members in a sorted set within a range of indexes. Deletes the sorted set if all members were removed.",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.", "complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.",
"group": "sorted_set", "group": "sorted_set",
"since": "2.0.0", "since": "2.0.0",
......
{ {
"ZREMRANGEBYSCORE": { "ZREMRANGEBYSCORE": {
"summary": "Remove all members in a sorted set within the given scores", "summary": "Removes members in a sorted set within a range of scores. Deletes the sorted set if all members were removed.",
"complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.", "complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements removed by the operation.",
"group": "sorted_set", "group": "sorted_set",
"since": "1.2.0", "since": "1.2.0",
......
{ {
"ZREVRANGE": { "ZREVRANGE": {
"summary": "Return a range of members in a sorted set, by index, with scores ordered from high to low", "summary": "Returns members in a sorted set within a range of indexes 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 returned.", "complexity": "O(log(N)+M) with N being the number of elements in the sorted set and M the number of elements returned.",
"group": "sorted_set", "group": "sorted_set",
"since": "1.2.0", "since": "1.2.0",
......
{ {
"ZREVRANGEBYLEX": { "ZREVRANGEBYLEX": {
"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)).", "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)).",
"group": "sorted_set", "group": "sorted_set",
"since": "2.8.9", "since": "2.8.9",
......
{ {
"ZREVRANGEBYSCORE": { "ZREVRANGEBYSCORE": {
"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)).", "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)).",
"group": "sorted_set", "group": "sorted_set",
"since": "2.2.0", "since": "2.2.0",
......
{ {
"ZREVRANK": { "ZREVRANK": {
"summary": "Determine the index of a member in a sorted set, with scores ordered from high to low", "summary": "Returns the index of a member in a sorted set ordered by descending scores.",
"complexity": "O(log(N))", "complexity": "O(log(N))",
"group": "sorted_set", "group": "sorted_set",
"since": "2.0.0", "since": "2.0.0",
......
{ {
"ZSCAN": { "ZSCAN": {
"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.", "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.",
"group": "sorted_set", "group": "sorted_set",
"since": "2.8.0", "since": "2.8.0",
......
{ {
"ZSCORE": { "ZSCORE": {
"summary": "Get the score associated with the given member in a sorted set", "summary": "Returns the score of a member in a sorted set.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "sorted_set", "group": "sorted_set",
"since": "1.2.0", "since": "1.2.0",
......
{ {
"ZUNION": { "ZUNION": {
"summary": "Add multiple sorted sets", "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.", "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.",
"group": "sorted_set", "group": "sorted_set",
"since": "6.2.0", "since": "6.2.0",
......
{ {
"ZUNIONSTORE": { "ZUNIONSTORE": {
"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.", "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.",
"group": "sorted_set", "group": "sorted_set",
"since": "2.0.0", "since": "2.0.0",
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment