X-Git-Url: https://git.saurik.com/redis.git/blobdiff_plain/9f3c422c72d4cede717b5f61bb7bde5823db53f2..bfded2aa511f70bb07941698f883b38de68c7773:/doc/LremCommand.html diff --git a/doc/LremCommand.html b/doc/LremCommand.html index c7d6c878..142160f0 100644 --- a/doc/LremCommand.html +++ b/doc/LremCommand.html @@ -16,7 +16,7 @@
-LremCommand: Contents
  LREM _key_ _count_ _value_
    Return value
    See also +LremCommand: Contents
  LREM _key_ _count_ _value_
    Return value

LremCommand

@@ -26,12 +26,12 @@
-

LREM _key_ _count_ _value_

+ #sidebar ListCommandsSidebar

LREM _key_ _count_ _value_

Time complexity: O(N) (with N being the length of the list)
Remove the first count occurrences of the value element from the list.If count is zero all the elements are removed. If count is negativeelements are removed from tail to head, instead to go from head to tailthat is the normal behaviour. So for example LREM with count -2 and_hello_ as value to remove against the list (a,b,c,hello,x,hello,hello) willlave the list (a,b,c,hello,x). The number of removed elements is returnedas an integer, see below for more information about the returned value.Note that non existing keys are considered like empty lists by LREM, so LREMagainst non existing keys will always return 0.

Return value

Integer Reply, specifically:

 The number of removed elements if the operation succeeded
-

See also

- + +