class LinkedList[E] extends AbstractSequentialList[E] with List[E] with Deque[E] with Cloneable with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- LinkedList
- Serializable
- Cloneable
- Deque
- Queue
- AbstractSequentialList
- AbstractList
- List
- SequencedCollection
- AbstractCollection
- Collection
- Iterable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new LinkedList(c: Collection[_ <: E])
- new LinkedList()
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def add(index: Int, element: E): Unit
- Definition Classes
- LinkedList → AbstractSequentialList → AbstractList → List
- def add(e: E): Boolean
- Definition Classes
- LinkedList → Deque → Queue → AbstractList → AbstractCollection → Collection
- def addAll(c: Collection[_ <: E]): Boolean
- Definition Classes
- LinkedList → AbstractCollection → Collection
- def addAll(index: Int, c: Collection[_ <: E]): Boolean
- Definition Classes
- AbstractSequentialList → AbstractList → List
- def addFirst(e: E): Unit
- Definition Classes
- LinkedList → Deque
- def addLast(e: E): Unit
- Definition Classes
- LinkedList → Deque
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def checkIndexInBounds(index: Int): Unit
- Attributes
- protected
- Definition Classes
- AbstractList
- def checkIndexOnBounds(index: Int): Unit
- Attributes
- protected
- Definition Classes
- AbstractList
- def clear(): Unit
- Definition Classes
- LinkedList → AbstractList → AbstractCollection → Collection
- def clone(): AnyRef
- Definition Classes
- LinkedList → AnyRef
- def contains(o: Any): Boolean
- Definition Classes
- LinkedList → Deque → AbstractCollection → Collection
- def containsAll(c: Collection[_]): Boolean
- Definition Classes
- AbstractCollection → Collection
- def descendingIterator(): Iterator[E]
- Definition Classes
- LinkedList → Deque
- def element(): E
- Definition Classes
- LinkedList → Deque → Queue
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(o: Any): Boolean
- Definition Classes
- AbstractList → Collection → AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def forEach(action: Consumer[_ >: E]): Unit
- Definition Classes
- Iterable
- def get(index: Int): E
- Definition Classes
- LinkedList → AbstractSequentialList → AbstractList → List
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getFirst(): E
- Definition Classes
- LinkedList → Deque
- def getLast(): E
- Definition Classes
- LinkedList → Deque
- def hashCode(): Int
- Definition Classes
- AbstractList → Collection → AnyRef → Any
- def indexOf(o: Any): Int
- Definition Classes
- AbstractList → List
- def isEmpty(): Boolean
- Definition Classes
- AbstractCollection → Collection
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def iterator(): Iterator[E]
- Definition Classes
- AbstractList → AbstractCollection → Collection → Iterable
- def lastIndexOf(o: Any): Int
- Definition Classes
- AbstractList → List
- def listIterator(index: Int): ListIterator[E]
- Definition Classes
- LinkedList → AbstractSequentialList → AbstractList → List
- def listIterator(): ListIterator[E]
- Definition Classes
- AbstractList → List
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def offer(e: E): Boolean
- Definition Classes
- LinkedList → Deque → Queue
- def offerFirst(e: E): Boolean
- Definition Classes
- LinkedList → Deque
- def offerLast(e: E): Boolean
- Definition Classes
- LinkedList → Deque
- def parallelStream(): Stream[E]
- Definition Classes
- Collection
- def peek(): E
- Definition Classes
- LinkedList → Deque → Queue
- def peekFirst(): E
- Definition Classes
- LinkedList → Deque
- def peekLast(): E
- Definition Classes
- LinkedList → Deque
- def poll(): E
- Definition Classes
- LinkedList → Deque → Queue
- def pollFirst(): E
- Definition Classes
- LinkedList → Deque
- def pollLast(): E
- Definition Classes
- LinkedList → Deque
- def pop(): E
- Definition Classes
- LinkedList → Deque
- def push(e: E): Unit
- Definition Classes
- LinkedList → Deque
- def remove(): E
- Definition Classes
- LinkedList → Deque → Queue
- def remove(index: Int): E
- Definition Classes
- LinkedList → AbstractSequentialList → AbstractList → List
- def remove(o: Any): Boolean
- Definition Classes
- LinkedList → Deque → AbstractCollection → Collection
- def removeAll(c: Collection[_]): Boolean
- Definition Classes
- AbstractCollection → Collection
- def removeFirst(): E
- Definition Classes
- LinkedList → Deque
- def removeFirstOccurrence(o: Any): Boolean
- Definition Classes
- LinkedList → Deque
- def removeIf(filter: Predicate[_ >: E]): Boolean
- Definition Classes
- Collection
- def removeLast(): E
- Definition Classes
- LinkedList → Deque
- def removeLastOccurrence(o: Any): Boolean
- Definition Classes
- LinkedList → Deque
- def removeRange(fromIndex: Int, toIndex: Int): Unit
- Attributes
- protected
- Definition Classes
- AbstractList
- def replaceAll(operator: UnaryOperator[E]): Unit
- Definition Classes
- List
- def retainAll(c: Collection[_]): Boolean
- Definition Classes
- AbstractCollection → Collection
- def set(index: Int, element: E): E
- Definition Classes
- LinkedList → AbstractSequentialList → AbstractList → List
- def size(): Int
- Definition Classes
- LinkedList → Deque → AbstractCollection → Collection
- def sort(c: Comparator[_ >: E]): Unit
- Definition Classes
- List
- def spliterator(): Spliterator[E]
From the Java 8 documentation: The default implementation should usually be overridden.
From the Java 8 documentation: The default implementation should usually be overridden. The spliterator returned by the default implementation has poor splitting capabilities, is unsized, and does not report any spliterator characteristics. Implementing classes can nearly always provide a better implementation.
- Definition Classes
- LinkedList → Collection → Iterable
- def stream(): Stream[E]
- Definition Classes
- Collection
- def subList(fromIndex: Int, toIndex: Int): List[E]
- Definition Classes
- AbstractList → List
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toArray[T <: AnyRef](a: Array[T]): Array[T]
- Definition Classes
- AbstractCollection → Collection
- def toArray(): Array[AnyRef]
- Definition Classes
- AbstractCollection → Collection
- def toString(): String
- Definition Classes
- AbstractCollection → AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()