"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).",
"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).",
"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.",
"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.",