"summary":"Sort the elements in a list, set or sorted set. Read-only variant of SORT.",
"summary":"Returns the sorted elements of a list, a set, or a sorted set.",
"complexity":"O(N+M*log(M)) where N is the number of elements in the list or set to sort, and M the number of returned elements. When the elements are not sorted, complexity is O(N).",
"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":"Get a substring of the string stored at a key",
"summary":"Returns a substring from a string value.",
"complexity":"O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.",
"summary":"Delete a key asynchronously in another thread. Otherwise it is just as DEL, but non blocking.",
"summary":"Asynchronously deletes one or more keys.",
"complexity":"O(1) for each key removed regardless of its size. Then the command does O(N) work in a different thread in order to reclaim memory, where N is the number of allocations the deleted objects where composed of.",