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

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

parents a08686a5 e55568ed
{
"HISTOGRAM": {
"summary": "Return the cumulative distribution of latencies of a subset of commands or all.",
"summary": "Returns the cumulative distribution of latencies of a subset or all commands.",
"complexity": "O(N) where N is the number of commands with latency information being retrieved.",
"group": "server",
"since": "7.0.0",
......
{
"HISTORY": {
"summary": "Return timestamp-latency samples for the event.",
"summary": "Returns timestamp-latency samples for an event.",
"complexity": "O(1)",
"group": "server",
"since": "2.8.13",
......
{
"LATEST": {
"summary": "Return the latest latency samples for all events.",
"summary": "Returns the latest latency samples for all events.",
"complexity": "O(1)",
"group": "server",
"since": "2.8.13",
......
{
"RESET": {
"summary": "Reset latency data for one or more events.",
"summary": "Resets the latency data for one or more events.",
"complexity": "O(1)",
"group": "server",
"since": "2.8.13",
......
{
"LATENCY": {
"summary": "A container for latency diagnostics commands",
"summary": "A container for latency diagnostics commands.",
"complexity": "Depends on subcommand.",
"group": "server",
"since": "2.8.13",
......
{
"LCS": {
"summary": "Find longest common substring",
"summary": "Finds the longest common substring.",
"complexity": "O(N*M) where N and M are the lengths of s1 and s2, respectively",
"group": "string",
"since": "7.0.0",
......
{
"LINDEX": {
"summary": "Get an element from a list by its index",
"summary": "Returns an element from a list by its index.",
"complexity": "O(N) where N is the number of elements to traverse to get to the element at index. This makes asking for the first or the last element of the list O(1).",
"group": "list",
"since": "1.0.0",
......
{
"LINSERT": {
"summary": "Insert an element before or after another element in a list",
"summary": "Inserts an element before or after another element in a list.",
"complexity": "O(N) where N is the number of elements to traverse before seeing the value pivot. This means that inserting somewhere on the left end on the list (head) can be considered O(1) and inserting somewhere on the right end (tail) is O(N).",
"group": "list",
"since": "2.2.0",
......
{
"LLEN": {
"summary": "Get the length of a list",
"summary": "Returns the length of a list.",
"complexity": "O(1)",
"group": "list",
"since": "1.0.0",
......
{
"LMOVE": {
"summary": "Pop an element from a list, push it to another list and return it",
"summary": "Returns an element after popping it from one list and pushing it to another. Deletes the list if the last element was moved.",
"complexity": "O(1)",
"group": "list",
"since": "6.2.0",
......
{
"LMPOP": {
"summary": "Pop elements from a list",
"summary": "Returns multiple elements from a list after removing them. Deletes the list if the last element was popped.",
"complexity": "O(N+M) where N is the number of provided keys and M is the number of elements returned.",
"group": "list",
"since": "7.0.0",
......
{
"LOLWUT": {
"summary": "Display some computer art and the Redis version",
"summary": "Displays computer art and the Redis version",
"group": "server",
"since": "5.0.0",
"arity": -1,
......
{
"LPOP": {
"summary": "Remove and get the first elements in a list",
"summary": "Returns the first elements in a list after removing it. Deletes the list if the last element was popped.",
"complexity": "O(N) where N is the number of elements returned",
"group": "list",
"since": "1.0.0",
......
{
"LPOS": {
"summary": "Return the index of matching elements on a list",
"summary": "Returns the index of matching elements in a list.",
"complexity": "O(N) where N is the number of elements in the list, for the average case. When searching for elements near the head or the tail of the list, or when the MAXLEN option is provided, the command may run in constant time.",
"group": "list",
"since": "6.0.6",
......
{
"LPUSH": {
"summary": "Prepend one or multiple elements to a list",
"summary": "Prepends one or more elements to a list. Creates the key if it doesn't exist.",
"complexity": "O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.",
"group": "list",
"since": "1.0.0",
......
{
"LPUSHX": {
"summary": "Prepend an element to a list, only if the list exists",
"summary": "Prepends one or more elements to a list only when the list exists.",
"complexity": "O(1) for each element added, so O(N) to add N elements when the command is called with multiple arguments.",
"group": "list",
"since": "2.2.0",
......
{
"LRANGE": {
"summary": "Get a range of elements from a list",
"summary": "Returns a range of elements from a list.",
"complexity": "O(S+N) where S is the distance of start offset from HEAD for small lists, from nearest end (HEAD or TAIL) for large lists; and N is the number of elements in the specified range.",
"group": "list",
"since": "1.0.0",
......
{
"LREM": {
"summary": "Remove elements from a list",
"summary": "Removes elements from a list. Deletes the list if the last element was removed.",
"complexity": "O(N+M) where N is the length of the list and M is the number of elements removed.",
"group": "list",
"since": "1.0.0",
......
{
"LSET": {
"summary": "Set the value of an element in a list by its index",
"summary": "Sets the value of an element in a list by its index.",
"complexity": "O(N) where N is the length of the list. Setting either the first or the last element of the list is O(1).",
"group": "list",
"since": "1.0.0",
......
{
"LTRIM": {
"summary": "Trim a list to the specified range",
"summary": "Removes elements from both ends a list. Deletes the list if all elements were trimmed.",
"complexity": "O(N) where N is the number of elements to be removed by the operation.",
"group": "list",
"since": "1.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