"summary":"Overwrite part of a string at key starting at the specified offset",
"summary":"Overwrites a part of a string value with another by an offset. Creates the key if it doesn't exist.",
"complexity":"O(1), not counting the time taken to copy the new string in place. Usually, this string is very small so the amortized complexity is O(1). Otherwise, complexity is O(M) with M being the length of the value argument.",
"summary":"Sort the elements in a list, set or sorted set",
"summary":"Sorts the elements in a list, a set, or a sorted set, optionally storing the result.",
"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).",