RedisList
Related Doc:
package redis
Insert all the specified values at the head of the list stored at key.
Insert all the specified values at the head of the list stored at key. If key does not exist, it is created as empty list before performing the push operations. When key holds a value that is not a list, an error is returned.
It is possible to push multiple elements using a single command call just specifying multiple arguments at the end of the command. Elements are inserted one after the other to the head of the list, from the leftmost element to the rightmost element. So for instance the command LPUSH mylist a b c will result into a list containing c as first element, b as second element and a as third element.
element to be prepended
this collection to chain commands
Insert all the specified values at the head of the list stored at key.
Insert all the specified values at the head of the list stored at key. If key does not exist, it is created as empty list before performing the push operations. When key holds a value that is not a list, an error is returned.
It is possible to push multiple elements using a single command call just specifying multiple arguments at the end of the command. Elements are inserted one after the other to the head of the list, from the leftmost element to the rightmost element. So for instance the command LPUSH mylist a b c will result into a list containing c as first element, b as second element and a as third element.
element to be prepended
this collection to chain commands
Insert all the specified values at the tail of the list stored at key.
Insert all the specified values at the tail of the list stored at key. If key does not exist, it is created as empty list before performing the push operation. When key holds a value that is not a list, an error is returned. * It is possible to push multiple elements using a single command call just specifying multiple arguments at the end of the command. Elements are inserted one after the other to the tail of the list, from the leftmost element to the rightmost element. So for instance the command RPUSH mylist a b c will result into a list containing a as first element, b as second element and c as third element.
to be apended
this collection to chain commands
Insert all the specified values at the tail of the list stored at key.
Insert all the specified values at the tail of the list stored at key. If key does not exist, it is created as empty list before performing the push operation. When key holds a value that is not a list, an error is returned. * It is possible to push multiple elements using a single command call just specifying multiple arguments at the end of the command. Elements are inserted one after the other to the tail of the list, from the leftmost element to the rightmost element. So for instance the command RPUSH mylist a b c will result into a list containing a as first element, b as second element and c as third element.
to be apended
this collection to chain commands
Insert all the specified values at the tail of the list stored at key.
Insert all the specified values at the tail of the list stored at key. If key does not exist, it is created as empty list before performing the push operation. When key holds a value that is not a list, an error is returned. * It is possible to push multiple elements using a single command call just specifying multiple arguments at the end of the command. Elements are inserted one after the other to the tail of the list, from the leftmost element to the rightmost element. So for instance the command RPUSH mylist a b c will result into a list containing a as first element, b as second element and c as third element.
to be apended
this collection to chain commands
Returns the element at index index in the list stored at key.
Returns the element at index index in the list stored at key. The index is zero-based, so 0 means the first element, 1 the second element and so on. Negative indices can be used to designate elements starting at the tail of the list. Here, -1 means the last element, -2 means the penultimate and so forth. When the value at key is not a list, an error is returned.
Time 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).
position of the element
element at the index or exception
Returns the element at index index in the list stored at key.
Returns the element at index index in the list stored at key. The index is zero-based, so 0 means the first element, 1 the second element and so on. Negative indices can be used to designate elements starting at the tail of the list. Here, -1 means the last element, -2 means the penultimate and so forth. When the value at key is not a list, an error is returned.
Time 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).
position of the element
Some( element ) at the index, None if no element exists, or exception when the value is not a list
Removes and returns the first element of the list stored at key.
Removes and returns the first element of the list stored at key.
Time complexity: O(1)
head element if exists
Inserts value in the list stored at key either before the reference value pivot.
Inserts value in the list stored at key either before the reference value pivot. When key does not exist, it is considered an empty list and no operation is performed. An error is returned when key exists but does not hold a list value.
Time 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).
insert before this value
elements to be inserted
new size of the collection or None if pivot not found
write-only operations over the collection, modify data
Insert all the specified values at the head of the list stored at key.
Insert all the specified values at the head of the list stored at key. If key does not exist, it is created as empty list before performing the push operations. When key holds a value that is not a list, an error is returned.
It is possible to push multiple elements using a single command call just specifying multiple arguments at the end of the command. Elements are inserted one after the other to the head of the list, from the leftmost element to the rightmost element. So for instance the command LPUSH mylist a b c will result into a list containing c as first element, b as second element and a as third element.
element to be prepended
this collection to chain commands
Removes first N values equal to the given value from the list.
Removes first N values equal to the given value from the list.
Note: If the value is serialized object, it is not proofed that serialized strings will match and the value will be actually deleted. This function is intended to be used with primitive types only.
Time complexity: O(N)
element to be removed from the list
first N occurrences
this collection to chain commands
Removes the element at the given position.
Removes the element at the given position. If the index is out of range, it throws an exception.
Time complexity: O(N)
element index to be removed
this collection to chain commands
Sets the list element at index to value.
Sets the list element at index to value. For more information on the index argument, see LINDEX. An error is returned for out of range indexes.
position to insert at
elements to be inserted
this collection to chain commands
Returns the length of the collection stored at key.
Returns the length of the collection stored at key. If key does not exist, it is interpreted as an empty collection and 0 is returned. An error is returned when the value stored at key is not a proper collection.
Time complexity: O(1)
size of the list
read-only operations over the collection, does not modify data
first element of the collection or an exception
first element of the collection or None
last element of the collection or an exception
last element of the collection or None
Helper to this.view.all returning all object in the list
Redis Lists are simply lists of strings, sorted by insertion order. It is possible to add elements to a Redis List pushing new elements on the head (on the left) or on the tail (on the right) of the list.
Data type of the inserted element