An empty List.
An iterable iterator over the elements in this List.
Removes the element at the back of the List, if it exists.
Time complexity: O(1)
undefined if the List is empty, else the removed element.
Time complexity: O(n), where n is the number of arguments.
The elements to append onto the back of this List.
The number of elements contained in this List.
Removes the element at the front of the List, if it exists.
Time complexity: O(1)
undefined if the List is empty, else the removed element.
Appends elements as if concatenating onto the front. Time complexity: O(n), where n is the number of arguments.
The elements to append onto the front of this List.
The number of elements contained in this List.
Time complexity: O(n), where n is the number of elements iterated over.
The sequence to populate a List with.
A List with all elements shallowly copied from init.
Implemented using #from. Time complexity: O(n), where n is the number of arguments.
The elements to copy into a new List.
A List of elements shallowly copied from the arguments.
Generated using TypeDoc
Listis a sequence container that supports constant-time insertion and removal from the front and back of the container. It does not support random access, meaning there is no indexing operator. It is implemented as a doubly-linked list.