Package org.aksw.commons.collections.lists

Class LinkedList<T>

java.lang.Object

java.util.AbstractCollection<E>

java.util.AbstractList<T>

org.aksw.commons.collections.lists.LinkedList<T>

All Implemented Interfaces:

Iterable<T>, Collection<T>, List<T>

public class LinkedList<T>
extends AbstractList<T>

Field Summary

Fields

Modifier and Type	Field	Description
protected LinkedListNode<T>	first
protected LinkedListNode<T>	last
protected int	size

Fields inherited from class java.util.AbstractList

modCount

Constructor Summary

Constructors

Constructor	Description
LinkedList()

Method Summary

Modifier and Type	Method	Description
boolean	add(T item)
LinkedListNode<T>	append(T item)
T	get(int index)
Iterator<T>	iterator()
int	size()	TODO: Ideally the complexity of the size function should be O(1) instead O(n) But this would mean, that certain functions (link / unlink) that are currently part of LinkedListNode would have to go here instead.

Methods inherited from class java.util.AbstractList

add, addAll, clear, equals, hashCode, indexOf, lastIndexOf, listIterator, listIterator, remove, removeRange, set, subList

Methods inherited from class java.util.AbstractCollection

addAll, contains, containsAll, isEmpty, remove, removeAll, retainAll, toArray, toArray, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Collection

parallelStream, removeIf, stream, toArray

Methods inherited from interface java.lang.Iterable

forEach

Methods inherited from interface java.util.List

addAll, contains, containsAll, isEmpty, remove, removeAll, replaceAll, retainAll, sort, spliterator, toArray, toArray

Field Details

first

protected LinkedListNode<T> first

last

protected LinkedListNode<T> last

size

protected int size

Constructor Details

LinkedList

public LinkedList()

Method Details

append

public LinkedListNode<T> append(T item)

add

public boolean add(T item)

Specified by:

add in interface Collection<T>

Specified by:

add in interface List<T>

Overrides:

add in class AbstractList<T>

get

public T get(int index)

Specified by:

get in interface List<T>

Specified by:

get in class AbstractList<T>

iterator

public Iterator<T> iterator()

Specified by:

iterator in interface Collection<T>

Specified by:

iterator in interface Iterable<T>

Specified by:

iterator in interface List<T>

Overrides:

iterator in class AbstractList<T>

size

public int size()

TODO: Ideally the complexity of the size function should be O(1) instead O(n) But this would mean, that certain functions (link / unlink) that are currently part of LinkedListNode would have to go here instead.

Specified by:

size in interface Collection<T>

Specified by:

size in interface List<T>

Specified by:

size in class AbstractCollection<T>