LINSERT key <BEFORE | AFTER> pivot element
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).
element in the list stored at
key either before or after the reference
key does not exist, it is considered an empty list and no operation is
An error is returned when
key exists but does not hold a list value.
Integer reply: the list length after a successful insert operation,
0 if the
key doesn't exist, and
-1 when the
pivot wasn't found.
dragonfly> RPUSH mylist "Hello"
dragonfly> RPUSH mylist "World"
dragonfly> LINSERT mylist BEFORE "World" "There"
dragonfly> LRANGE mylist 0 -1