linked list node data
A link to the first node of the list
A link to the last node of the list
Internal length value of the list
Data of the first node in the list
Data of the last node in the list
Number of nodes in the list
Returns an iterator over the data from the list
Clears all nodes from the list
Returns true if the list contains a node with the given data
Removes the last node from the list and returns its data as the result. This method changes the length of the list.
Adds the passed data to the end of the list and returns its new length
Returns an iterator over the data in the list. The traversal will proceed from the last node to the first.
Removes the first node from the list and returns its data as the result. This method changes the length of the list.
Returns a shallow copy of a portion of a list into a new LinkedList selected from start to end (end not included) where start and end represent the index of nodes in that list. The original list will not be modified.
Adds the passed data to the beginning of the list and returns its new length
Returns an iterator over the data from the list
Double-ended two-way linked list