scala.collection.mutable

LinkedList

class LinkedList [A] extends LinearSeq[A] with GenericTraversableTemplate[A, LinkedList] with LinkedListLike[A, LinkedList[A]]

This class implements single linked lists where both the head (elem) and the tail (next) are mutable.

A

the type of the elements contained in this linked list.

go to: companion
linear super types: LinkedListLike[A, LinkedList[A]], LinearSeq[A], LinearSeq[A], LinearSeqLike[A, LinearSeq[A]], Seq[A], Seq[A], SeqLike[A, LinkedList[A]], PartialFunction[Int, A], (Int) ⇒ A, Iterable[A], Iterable[A], IterableLike[A, LinkedList[A]], Equals, Traversable[A], Mutable, Traversable[A], GenericTraversableTemplate[A, LinkedList], TraversableLike[A, LinkedList[A]], TraversableOnce[A], FilterMonadic[A, LinkedList[A]], HasNewBuilder[A, LinkedList[A]], AnyRef, Any
source: LinkedList.scala
    version
  1. 2.8

    since
  1. 1

Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. LinkedList
  2. LinkedListLike
  3. LinearSeq
  4. LinearSeq
  5. LinearSeqLike
  6. Seq
  7. Seq
  8. SeqLike
  9. PartialFunction
  10. Function1
  11. Iterable
  12. Iterable
  13. IterableLike
  14. Equals
  15. Traversable
  16. Mutable
  17. Traversable
  18. GenericTraversableTemplate
  19. TraversableLike
  20. TraversableOnce
  21. FilterMonadic
  22. HasNewBuilder
  23. AnyRef
  24. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new LinkedList (elem: A, next: LinkedList[A])

  2. new LinkedList ()

Type Members

  1. type Self = LinkedList[A]

    The type implementing this traversable

    The type implementing this traversable

    attributes: protected
    definition classes: TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    A class supporting filtered operations.

Value Members

  1. def != (arg0: AnyRef) : Boolean

    attributes: final
    definition classes: AnyRef
  2. def != (arg0: Any) : Boolean

    o != arg0 is the same as !(o == (arg0)).

    o != arg0 is the same as !(o == (arg0)).

    arg0

    the object to compare against this object for dis-equality.

    returns

    false if the receiver object is equivalent to the argument; true otherwise.

    attributes: final
    definition classes: Any
  3. def ## () : Int

    attributes: final
    definition classes: AnyRef → Any
  4. def $asInstanceOf [T0] () : T0

    attributes: final
    definition classes: AnyRef
  5. def $isInstanceOf [T0] () : Boolean

    attributes: final
    definition classes: AnyRef
  6. def ++ (that: TraversableOnce[A]) : LinkedList[A]

    [use case] Concatenates this linked list with the elements of a traversable collection.

    [use case]

    Concatenates this linked list with the elements of a traversable collection.

    that

    the traversable to append.

    returns

    a new linked list which contains all elements of this linked list followed by all elements of that.

    attributes: abstract
    definition classes: TraversableLike
  7. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Concatenates this linked list with the elements of a traversable collection.

    Concatenates this linked list with the elements of a traversable collection.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    that

    the traversable to append.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That which contains all elements of this linked list followed by all elements of that.

    definition classes: TraversableLike
  8. def +: (elem: A) : LinkedList[A]

    [use case] Prepends an element to this linked list

    [use case]

    Prepends an element to this linked list

    elem

    the prepended element

    returns

    a new linked list consisting of elem followed by all elements of this linked list.

    attributes: abstract
    definition classes: SeqLike
  9. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Prepends an element to this linked list

    Prepends an element to this linked list

    B

    the element type of the returned linked list.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    elem

    the prepended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of elem followed by all elements of this linked list.

    definition classes: SeqLike
  10. def /: [B] (z: B)(op: (B, A) ⇒ B) : B

    Applies a binary operator to a start value and all elements of this linked list, going left to right.

    Applies a binary operator to a start value and all elements of this linked list, going left to right.

    Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked list, going left to right with the start value z on the left: op(...op(op(z, x1), x2), ..., xn) where x,,1,,, ..., x,,n,, are the elements of this linked list.

    definition classes: TraversableOnce
  11. def :+ (elem: A) : LinkedList[A]

    [use case] Appends an element to this linked list

    [use case]

    Appends an element to this linked list

    elem

    the appended element

    returns

    a new linked list consisting of all elements of this linked list followed by elem.

    attributes: abstract
    definition classes: SeqLike
  12. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Appends an element to this linked list

    Appends an element to this linked list

    B

    the element type of the returned linked list.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    elem

    the appended element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of all elements of this linked list followed by elem.

    definition classes: SeqLike
  13. def :\ [B] (z: B)(op: (A, B) ⇒ B) : B

    Applies a binary operator to all elements of this linked list and a start value, going right to left.

    Applies a binary operator to all elements of this linked list and a start value, going right to left.

    Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.

    B

    the result type of the binary operator.

    z

    the start value

    op

    the binary operator

    returns

    the result of inserting op between consecutive elements of this linked list, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this linked list.

    definition classes: TraversableOnce
  14. def == (arg0: AnyRef) : Boolean

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    o == arg0 is the same as if (o eq null) arg0 eq null else o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: AnyRef
  15. def == (arg0: Any) : Boolean

    o == arg0 is the same as o.equals(arg0).

    o == arg0 is the same as o.equals(arg0).

    arg0

    the object to compare against this object for equality.

    returns

    true if the receiver object is equivalent to the argument; false otherwise.

    attributes: final
    definition classes: Any
  16. def addString (b: StringBuilder) : StringBuilder

    Appends all elements of this linked list to a string builder.

    Appends all elements of this linked list to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this linked list without any separator string.

    b

    the string builder to which elements are appended.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  17. def addString (b: StringBuilder, sep: String) : StringBuilder

    Appends all elements of this linked list to a string builder using a separator string.

    Appends all elements of this linked list to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this linked list, separated by the string sep.

    b

    the string builder to which elements are appended.

    sep

    the separator string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  18. def addString (b: StringBuilder, start: String, sep: String, end: String) : StringBuilder

    Appends all elements of this linked list to a string builder using start, end, and separator strings.

    Appends all elements of this linked list to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this linked list are separated by the string sep.

    b

    the string builder to which elements are appended.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    the string builder b to which elements were appended.

    definition classes: TraversableOnce
  19. def andThen [C] (k: (A) ⇒ C) : PartialFunction[Int, C]

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    Composes this partial function with a transformation function that gets applied to results of this partial function.

    C

    the result type of the transformation function.

    k

    the transformation function

    returns

    a partial function with the same domain as this partial function, which maps arguments x to k(this(x)).

    definition classes: PartialFunctionFunction1
  20. def append (that: LinkedList[A]) : LinkedList[A]

    Append linked list that at current position of this linked list

    Append linked list that at current position of this linked list

    returns

    the list after append (this is the list itself if nonempty, or list that if list this is empty. )

    definition classes: LinkedListLike
  21. def apply (n: Int) : A

    Selects an element by its index in the linked list.

    Selects an element by its index in the linked list.

    returns

    the element of this linked list at index idx, where 0 indicates the first element.

    definition classes: LinkedListLikeSeqLike
  22. def asInstanceOf [T0] : T0

    This method is used to cast the receiver object to be of type T0.

    This method is used to cast the receiver object to be of type T0.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expressionList(1).asInstanceOf[List[String]] will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  23. def canEqual (that: Any) : Boolean

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

    that

    The object with which this linked list should be compared

    returns

    true, if this linked list can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

    definition classes: IterableLikeEquals
  24. def clone () : AnyRef

    This method creates and returns a copy of the receiver object.

    This method creates and returns a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    attributes: protected[lang]
    definition classes: AnyRef
  25. def collect [B] (pf: PartialFunction[A, B]) : LinkedList[B]

    [use case] Builds a new collection by applying a partial function to all elements of this linked list on which the function is defined.

    [use case]

    Builds a new collection by applying a partial function to all elements of this linked list on which the function is defined.

    B

    the element type of the returned collection.

    pf

    the partial function which filters and maps the linked list.

    returns

    a new linked list resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    attributes: abstract
    definition classes: TraversableLike
  26. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Builds a new collection by applying a partial function to all elements of this linked list on which the function is defined.

    Builds a new collection by applying a partial function to all elements of this linked list on which the function is defined.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    pf

    the partial function which filters and maps the linked list.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

    definition classes: TraversableLike
  27. def companion : GenericCompanion[LinkedList]

    The factory companion object that builds instances of class LinkedList.

    The factory companion object that builds instances of class LinkedList. (or its Iterable superclass where class LinkedList is not a Seq.)

    definition classes: LinkedListLinearSeqLinearSeqSeqSeqIterableIterableTraversableTraversableGenericTraversableTemplate
  28. def compose [A] (g: (A) ⇒ Int) : (A) ⇒ A

    (f compose g)(x) == f(g(x))

    (f compose g)(x) == f(g(x))

    definition classes: Function1
  29. def contains (elem: Any) : Boolean

    Tests whether this linked list contains a given value as an element.

    Tests whether this linked list contains a given value as an element.

    elem

    the element to test.

    returns

    true if this linked list has an element that is is equal (wrt ==) to elem, false otherwise.

    definition classes: SeqLike
  30. def containsSlice [B] (that: Seq[B]) : Boolean

    Tests whether this linked list contains a given sequence as a slice.

    Tests whether this linked list contains a given sequence as a slice.

    that

    the sequence to test

    returns

    true if this linked list contains a slice with the same elements as that, otherwise false.

    definition classes: SeqLike
  31. def copyToArray (xs: Array[A], start: Int, len: Int) : Unit

    [use case] Copies elements of this linked list to an array.

    [use case]

    Copies elements of this linked list to an array. Fills the given array xs with at most len elements of this linked list, starting at position start. Copying will stop once either the end of the current linked list is reached, or the end of the array is reached, or len elements have been copied.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    attributes: abstract
    definition classes: TraversableLike
  32. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int) : Unit

    Copies elements of this linked list to an array.

    Copies elements of this linked list to an array. Fills the given array xs with at most len elements of this linked list, starting at position start. Copying will stop once either the end of the current linked list is reached, or the end of the array is reached, or len elements have been copied.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    len

    the maximal number of elements to copy.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  33. def copyToArray (xs: Array[A]) : Unit

    [use case] Copies values of this linked list to an array.

    [use case]

    Copies values of this linked list to an array. Fills the given array xs with values of this linked list. Copying will stop once either the end of the current linked list is reached, or the end of the array is reached.

    xs

    the array to fill.

    attributes: abstract
    definition classes: TraversableOnce
  34. def copyToArray [B >: A] (xs: Array[B]) : Unit

    Copies values of this linked list to an array.

    Copies values of this linked list to an array. Fills the given array xs with values of this linked list. Copying will stop once either the end of the current linked list is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    definition classes: TraversableOnce
  35. def copyToArray (xs: Array[A], start: Int) : Unit

    [use case] Copies values of this linked list to an array.

    [use case]

    Copies values of this linked list to an array. Fills the given array xs with values of this linked list, after skipping start values. Copying will stop once either the end of the current linked list is reached, or the end of the array is reached.

    xs

    the array to fill.

    start

    the starting index.

    attributes: abstract
    definition classes: TraversableOnce
  36. def copyToArray [B >: A] (xs: Array[B], start: Int) : Unit

    Copies values of this linked list to an array.

    Copies values of this linked list to an array. Fills the given array xs with values of this linked list, after skipping start values. Copying will stop once either the end of the current linked list is reached, or the end of the array is reached.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    definition classes: TraversableOnce
  37. def copyToBuffer [B >: A] (dest: Buffer[B]) : Unit

    Copies all elements of this linked list to a buffer.

    Copies all elements of this linked list to a buffer.

    dest

    The buffer to which elements are copied.

    definition classes: TraversableOnce
  38. def corresponds [B] (that: Seq[B])(p: (A, B) ⇒ Boolean) : Boolean

    Tests whether every element of this linked list relates to the corresponding element of another sequence by satisfying a test predicate.

    Tests whether every element of this linked list relates to the corresponding element of another sequence by satisfying a test predicate.

    B

    the type of the elements of that

    that

    the other sequence

    p

    the test predicate, which relates elements from both sequences

    returns

    true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this linked list and y of that, otherwise false.

    definition classes: SeqLike
  39. def count (p: (A) ⇒ Boolean) : Int

    Counts the number of elements in the linked list which satisfy a predicate.

    Counts the number of elements in the linked list which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    the number of elements satisfying the predicate p.

    definition classes: TraversableOnce
  40. def diff (that: Seq[A]) : LinkedList[A]

    [use case] Computes the multiset difference between this linked list and another sequence.

    [use case]

    Computes the multiset difference between this linked list and another sequence.

    that

    the sequence of elements to remove

    returns

    a new linked list which contains all elements of this linked list except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

    attributes: abstract
    definition classes: SeqLike
  41. def diff [B >: A] (that: Seq[B]) : LinkedList[A]

    Computes the multiset difference between this linked list and another sequence.

    Computes the multiset difference between this linked list and another sequence.

    B

    the element type of the returned linked list.

    that

    the sequence of elements to remove

    returns

    a new collection of type That which contains all elements of this linked list except some of occurrences of elements that also appear in that. If an element value x appears n times in that, then the first n occurrences of x will not form part of the result, but any following occurrences will.

    definition classes: SeqLike
  42. def distinct : LinkedList[A]

    Builds a new linked list from this linked list without any duplicate elements.

    Builds a new linked list from this linked list without any duplicate elements.

    returns

    A new linked list which contains the first occurrence of every element of this linked list.

    definition classes: SeqLike
  43. def drop (n: Int) : LinkedList[A]

    Selects all elements except first n ones.

    Selects all elements except first n ones.

    n

    the number of elements to drop from this linked list.

    returns

    a linked list consisting of all elements of this linked list except the first n ones, or else the empty linked list, if this linked list has less than n elements.

    definition classes: LinkedListLikeTraversableLike
  44. def dropRight (n: Int) : LinkedList[A]

    Selects all elements except last n ones.

    Selects all elements except last n ones.

    n

    The number of elements to take

    returns

    a linked list consisting of all elements of this linked list except the first n ones, or else the empty linked list, if this linked list has less than n elements.

    definition classes: IterableLike
  45. def dropWhile (p: (A) ⇒ Boolean) : LinkedList[A]

    Drops longest prefix of elements that satisfy a predicate.

    Drops longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest suffix of this linked list whose first element does not satisfy the predicate p.

    definition classes: TraversableLike
  46. var elem : A

    definition classes: LinkedListLike
  47. def elements : Iterator[A]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  48. def endsWith [B] (that: Seq[B]) : Boolean

    Tests whether this linked list ends with the given sequence.

    Tests whether this linked list ends with the given sequence.

    that

    the sequence to test

    returns

    true if this linked list has that as a suffix, false otherwise.

    definition classes: SeqLike
  49. def eq (arg0: AnyRef) : Boolean

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    This method is used to test whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation] on non-null instances of AnyRef: * It is reflexive: for any non-null instance x of type AnyRef, x.eq(x) returns true. * It is symmetric: for any non-null instances x and y of type AnyRef, x.eq(y) returns true if and only if y.eq(x) returns true. * It is transitive: for any non-null instances x, y, and z of type AnyRef if x.eq(y) returns true and y.eq(z) returns true, then x.eq(z) returns true.

    Additionally, the eq method has three other properties. * It is consistent: for any non-null instances x and y of type AnyRef, multiple invocations of x.eq(y) consistently returns true or consistently returns false. * For any non-null instance x of type AnyRef, x.eq(null) and null.eq(x) returns false. * null.eq(null) returns true.

    When overriding the equals or hashCode methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (o1 eq o2), they should be equal to each other (o1 == o2) and they should hash to the same value (o1.hashCode == o2.hashCode).

    arg0

    the object to compare against this object for reference equality.

    returns

    true if the argument is a reference to the receiver object; false otherwise.

    attributes: final
    definition classes: AnyRef
  50. def equals (that: Any) : Boolean

    The equality method defined in AnyRef.

    The equality method defined in AnyRef[email protected] true if the receiver object is equivalent to the argument; false otherwise. */

    definition classes: SeqLikeEquals → AnyRef → Any
  51. def equalsWith [B] (that: Seq[B])(f: (A, B) ⇒ Boolean) : Boolean

    Tests whether every element of this linked list relates to the corresponding element of another sequence by satisfying a test predicate.

    Tests whether every element of this linked list relates to the corresponding element of another sequence by satisfying a test predicate.

    B

    the type of the elements of that

    that

    the other sequence

    returns

    true if both sequences have the same length and p(x, y) is true for all corresponding elements x of this linked list and y of that, otherwise false.

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

  52. def exists (p: (A) ⇒ Boolean) : Boolean

    Tests whether a predicate holds for some of the elements of this linked list.

    Tests whether a predicate holds for some of the elements of this linked list.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for some of the elements of this linked list, otherwise false.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  53. def filter (p: (A) ⇒ Boolean) : LinkedList[A]

    Selects all elements of this linked list which satisfy a predicate.

    Selects all elements of this linked list which satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new linked list consisting of all elements of this linked list that satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  54. def filterNot (p: (A) ⇒ Boolean) : LinkedList[A]

    Selects all elements of this linked list which do not satisfy a predicate.

    Selects all elements of this linked list which do not satisfy a predicate.

    p

    the predicate used to test elements.

    returns

    a new linked list consisting of all elements of this linked list that do not satisfy the given predicate p. The order of the elements is preserved.

    definition classes: TraversableLike
  55. def finalize () : Unit

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    This method is called by the garbage collector on the receiver object when garbage collection determines that there are no more references to the object.

    The details of when and if the finalize method are invoked, as well as the interaction between finalizeand non-local returns and exceptions, are all platform dependent.

    attributes: protected[lang]
    definition classes: AnyRef
  56. def find (p: (A) ⇒ Boolean) : Option[A]

    Finds the first element of the linked list satisfying a predicate, if any.

    Finds the first element of the linked list satisfying a predicate, if any.

    p

    the predicate used to test elements.

    returns

    an option value containing the first element in the linked list that satisfies p, or None if none exists.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  57. def findIndexOf (p: (A) ⇒ Boolean) : Int

    Returns index of the first element satisfying a predicate, or -1.

    Returns index of the first element satisfying a predicate, or -1.

    definition classes: SeqLike
  58. def findLastIndexOf (p: (A) ⇒ Boolean) : Int

    Returns index of the last element satisfying a predicate, or -1.

    Returns index of the last element satisfying a predicate, or -1.

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  59. def first : A

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  60. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  61. def flatMap [B] (f: (A) ⇒ Traversable[B]) : LinkedList[B]

    [use case] Builds a new collection by applying a function to all elements of this linked list and concatenating the results.

    [use case]

    Builds a new collection by applying a function to all elements of this linked list and concatenating the results.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new linked list resulting from applying the given collection-valued function f to each element of this linked list and concatenating the results.

    attributes: abstract
    definition classes: TraversableLike
  62. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Builds a new collection by applying a function to all elements of this linked list and concatenating the results.

    Builds a new collection by applying a function to all elements of this linked list and concatenating the results.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the given collection-valued function f to each element of this linked list and concatenating the results.

    definition classes: TraversableLikeFilterMonadic
  63. def flatten [B] : LinkedList[B]

    [use case] Converts this linked list of traversable collections into a linked list in which all element collections are concatenated.

    [use case]

    Converts this linked list of traversable collections into a linked list in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    returns

    a new linked list resulting from concatenating all element linked lists.

    attributes: abstract
    definition classes: GenericTraversableTemplate
  64. def flatten [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : LinkedList[B]

    Converts this linked list of traversable collections into a linked list in which all element collections are concatenated.

    Converts this linked list of traversable collections into a linked list in which all element collections are concatenated.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this linked list is a Traversable.

    returns

    a new linked list resulting from concatenating all element linked lists.

    definition classes: GenericTraversableTemplate
  65. def foldLeft [B] (z: B)(op: (B, A) ⇒ B) : B

    Applies a binary operator to a start value and all elements of this linked list, going left to right.

    Applies a binary operator to a start value and all elements of this linked list, going left to right.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked list, going left to right with the start value z on the left: op(...op(z, x1), x2, ..., xn) where x,,1,,, ..., x,,n,, are the elements of this linked list.

    definition classes: TraversableOnce
  66. def foldRight [B] (z: B)(op: (A, B) ⇒ B) : B

    Applies a binary operator to all elements of this linked list and a start value, going right to left.

    Applies a binary operator to all elements of this linked list and a start value, going right to left.

    B

    the result type of the binary operator.

    z

    the start value.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked list, going right to left with the start value z on the right: op(x1, op(x2, ... op(xn, z)...)) where x,,1,,, ..., x,,n,, are the elements of this linked list.

    definition classes: IterableLikeTraversableOnce
  67. def forall (p: (A) ⇒ Boolean) : Boolean

    Tests whether a predicate holds for all elements of this linked list.

    Tests whether a predicate holds for all elements of this linked list.

    p

    the predicate used to test elements.

    returns

    true if the given predicate p holds for all elements of this linked list, otherwise false.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  68. def foreach (f: (A) ⇒ Unit) : Unit

    [use case] Applies a function f to all elements of this linked list.

    [use case]

    Applies a function f to all elements of this linked list.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

    attributes: abstract
    definition classes: IterableLike
  69. def foreach [B] (f: (A) ⇒ B) : Unit

    Applies a function f to all elements of this linked list.

    Applies a function f to all elements of this linked list.

    Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

    f

    the function that is applied for its side-effect to every element. The result of function f is discarded.

  70. def genericBuilder [B] : Builder[B, LinkedList[B]]

    The generic builder that builds instances of LinkedList at arbitrary element types.

    The generic builder that builds instances of LinkedList at arbitrary element types.

    definition classes: GenericTraversableTemplate
  71. def get (n: Int) : Option[A]

    definition classes: LinkedListLike
  72. def getClass () : java.lang.Class[_ <: java.lang.Object]

    Returns a representation that corresponds to the dynamic class of the receiver object.

    Returns a representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

    a representation that corresponds to the dynamic class of the receiver object.

    attributes: final
    definition classes: AnyRef
  73. def groupBy [K] (f: (A) ⇒ K) : Map[K, LinkedList[A]]

    Partitions this linked list into a map of linked lists according to some discriminator function.

    Partitions this linked list into a map of linked lists according to some discriminator function.

    Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new linked list.

    K

    the type of keys returned by the discriminator function.

    f

    the discriminator function.

    returns

    A map from keys to linked lists such that the following invariant holds: (xs partition f)(k) = xs filter (x => f(x) == k) That is, every key k is bound to a linked list of those elements x for which f(x) equals k.

    definition classes: TraversableLike
  74. def grouped (size: Int) : Iterator[LinkedList[A]]

    Partitions elements in fixed size linked lists.

    Partitions elements in fixed size linked lists.

    size

    the number of elements per group

    returns

    An iterator producing linked lists of size size, except the last will be truncated if the elements don't divide evenly.

    definition classes: IterableLike
      see also:
    1. Iterator#grouped

  75. def hasDefiniteSize : Boolean

    Tests whether this linked list is known to have a finite size.

    Tests whether this linked list is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.

    Note: many collection methods will not work on collections of infinite sizes.

    returns

    true if this collection is known to have finite size, false otherwise.

    definition classes: TraversableLikeTraversableOnce
  76. def hashCode () : Int

    Hashcodes for LinkedList produce a value from the hashcodes of all the elements of the linked list.

    Hashcodes for LinkedList produce a value from the hashcodes of all the elements of the linked [email protected] the hash code value for the object. */

    definition classes: SeqLike → AnyRef → Any
  77. def head : A

    Selects the first element of this linked list.

    Selects the first element of this linked list.

    returns

    the first element of this linked list.

    definition classes: LinkedListLikeIterableLikeTraversableLike
  78. def headOption : Option[A]

    Optionally selects the first element.

    Optionally selects the first element.

    returns

    the first element of this linked list if it is nonempty, None if it is empty.

    definition classes: TraversableLike
  79. def indexOf (elem: A, from: Int) : Int

    [use case] Finds index of first occurrence of some value in this linked list after or at some start index.

    [use case]

    Finds index of first occurrence of some value in this linked list after or at some start index.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this linked list that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  80. def indexOf [B >: A] (elem: B, from: Int) : Int

    Finds index of first occurrence of some value in this linked list after or at some start index.

    Finds index of first occurrence of some value in this linked list after or at some start index.

    B

    the type of the element elem.

    elem

    the element value to search for.

    from

    the start index

    returns

    the index >= from of the first element of this linked list that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  81. def indexOf (elem: A) : Int

    [use case] Finds index of first occurrence of some value in this linked list.

    [use case]

    Finds index of first occurrence of some value in this linked list.

    elem

    the element value to search for.

    returns

    the index of the first element of this linked list that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  82. def indexOf [B >: A] (elem: B) : Int

    Finds index of first occurrence of some value in this linked list.

    Finds index of first occurrence of some value in this linked list.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index of the first element of this linked list that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  83. def indexOfSlice [B >: A] (that: Seq[B], from: Int) : Int

    Finds first index after or at a start index where this linked list contains a given sequence as a slice.

    Finds first index after or at a start index where this linked list contains a given sequence as a slice.

    that

    the sequence to test

    from

    the start index

    returns

    the first index >= from such that the elements of this linked list starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  84. def indexOfSlice [B >: A] (that: Seq[B]) : Int

    Finds first index where this linked list contains a given sequence as a slice.

    Finds first index where this linked list contains a given sequence as a slice.

    that

    the sequence to test

    returns

    the first index such that the elements of this linked list starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  85. def indexWhere (p: (A) ⇒ Boolean, from: Int) : Int

    Finds index of the first element satisfying some predicate after or at some start index.

    Finds index of the first element satisfying some predicate after or at some start index.

    p

    the predicate used to test elements.

    from

    the start index

    returns

    the index >= from of the first element of this linked list that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  86. def indexWhere (p: (A) ⇒ Boolean) : Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index of the first element of this linked list that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  87. def indices : Range

    Produces the range of all indices of this sequence.

    Produces the range of all indices of this sequence.

    returns

    a Range value from 0 to one less than the length of this linked list.

    definition classes: SeqLike
  88. def init : LinkedList[A]

    Selects all elements except the last.

    Selects all elements except the last.

    returns

    a linked list consisting of all elements of this linked list except the last one.

    definition classes: TraversableLike
  89. def insert (that: LinkedList[A]) : Unit

    Insert linked list that at current position of this linked list

    Insert linked list that at current position of this linked list

    definition classes: LinkedListLike
  90. def intersect (that: Seq[A]) : LinkedList[A]

    [use case] Computes the multiset intersection between this linked list and another sequence.

    [use case]

    Computes the multiset intersection between this linked list and another sequence.

    that

    the sequence of elements to intersect with.

    returns

    a new linked list which contains all elements of this linked list which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

    attributes: abstract
    definition classes: SeqLike
  91. def intersect [B >: A] (that: Seq[B]) : LinkedList[A]

    Computes the multiset intersection between this linked list and another sequence.

    Computes the multiset intersection between this linked list and another sequence.

    B

    the element type of the returned linked list.

    that

    the sequence of elements to intersect with.

    returns

    a new collection of type That which contains all elements of this linked list which also appear in that. If an element value x appears n times in that, then the first n occurrences of x will be retained in the result, but any following occurrences will be omitted.

    definition classes: SeqLike
  92. def isDefinedAt (idx: Int) : Boolean

    Tests whether this linked list contains given index.

    Tests whether this linked list contains given index.

    The implementations of methods apply and isDefinedAt turn a Seq[A] into a PartialFunction[Int, A].

    idx

    the index to test

    returns

    true if this linked list contains an element at position idx, false otherwise.

    definition classes: SeqLike
  93. def isEmpty : Boolean

    Tests whether this linked list is empty.

    Tests whether this linked list is empty.

    returns

    true if the linked list contain no elements, false otherwise.

  94. def isInstanceOf [T0] : Boolean

    This method is used to test whether the dynamic type of the receiver object is T0.

    This method is used to test whether the dynamic type of the receiver object is T0.

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the expression1.isInstanceOf[String] will return false, while the expression List(1).isInstanceOf[List[String]] will return true. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested typed.

    returns

    true if the receiver object is an instance of erasure of type T0; false otherwise.

    attributes: final
    definition classes: Any
  95. def isTraversableAgain : Boolean

    Tests whether this linked list can be repeatedly traversed.

    Tests whether this linked list can be repeatedly traversed.

    returns

    true

    attributes: final
    definition classes: TraversableLikeTraversableOnce
  96. def iterator : Iterator[A]

    Creates a new iterator over all elements contained in this iterable object.

    Creates a new iterator over all elements contained in this iterable object.

    returns

    the new iterator

    definition classes: LinkedListLikeIterableLike
  97. def last : A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this linked list.

    definition classes: TraversableLike
  98. def lastIndexOf (elem: A, end: Int) : Int

    [use case] Finds index of last occurrence of some value in this linked list before or at a given end index.

    [use case]

    Finds index of last occurrence of some value in this linked list before or at a given end index.

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this linked list that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  99. def lastIndexOf [B >: A] (elem: B, end: Int) : Int

    Finds index of last occurrence of some value in this linked list before or at a given end index.

    Finds index of last occurrence of some value in this linked list before or at a given end index.

    B

    the type of the element elem.

    elem

    the element value to search for.

    end

    the end index.

    returns

    the index <= end of the last element of this linked list that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  100. def lastIndexOf (elem: A) : Int

    [use case] Finds index of last occurrence of some value in this linked list.

    [use case]

    Finds index of last occurrence of some value in this linked list.

    elem

    the element value to search for.

    returns

    the index of the last element of this linked list that is equal (wrt ==) to elem, or -1, if none exists.

    attributes: abstract
    definition classes: SeqLike
  101. def lastIndexOf [B >: A] (elem: B) : Int

    Finds index of last occurrence of some value in this linked list.

    Finds index of last occurrence of some value in this linked list.

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

    the index of the last element of this linked list that is equal (wrt ==) to elem, or -1, if none exists.

    definition classes: SeqLike
  102. def lastIndexOfSlice [B >: A] (that: Seq[B], end: Int) : Int

    Finds last index before or at a given end index where this linked list contains a given sequence as a slice.

    Finds last index before or at a given end index where this linked list contains a given sequence as a slice.

    that

    the sequence to test

    end

    the end index

    returns

    the last index <= end such that the elements of this linked list starting at this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  103. def lastIndexOfSlice [B >: A] (that: Seq[B]) : Int

    Finds last index where this linked list contains a given sequence as a slice.

    Finds last index where this linked list contains a given sequence as a slice.

    that

    the sequence to test

    returns

    the last index such that the elements of this linked list starting a this index match the elements of sequence that, or -1 of no such subsequence exists.

    definition classes: SeqLike
  104. def lastIndexWhere (p: (A) ⇒ Boolean, end: Int) : Int

    Finds index of last element satisfying some predicate before or at given end index.

    Finds index of last element satisfying some predicate before or at given end index.

    p

    the predicate used to test elements.

    returns

    the index <= end of the last element of this linked list that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  105. def lastIndexWhere (p: (A) ⇒ Boolean) : Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    p

    the predicate used to test elements.

    returns

    the index of the last element of this linked list that satisfies the predicate p, or -1, if none exists.

    definition classes: SeqLike
  106. def lastOption : Option[A]

    Optionally selects the last element.

    Optionally selects the last element.

    returns

    the last element of this linked list$ if it is nonempty, None if it is empty.

    definition classes: TraversableLike
  107. def length : Int

    The length of the linked list.

    The length of the linked list.

    Note: xs.length and xs.size yield the same result.

    returns

    the number of elements in this linked list.

    definition classes: LinkedListLikeSeqLike
  108. def lengthCompare (len: Int) : Int

    Compares the length of this linked list to a test value.

    Compares the length of this linked list to a test value.

    len

    the test value that gets compared with the length.

    returns

    A value x where x < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len The method as implemented here does not call length directly; its running time is O(length min len) instead of O(length). The method should be overwritten if computing length is cheap.

    definition classes: SeqLike
  109. def lift : (Int) ⇒ Option[A]

    Turns this partial function into an plain function returning an Option result.

    Turns this partial function into an plain function returning an Option result.

    returns

    a function that takes an argument x to Some(this(x)) if this is defined for x, and to None otherwise.

    definition classes: PartialFunction
  110. def map [B] (f: (A) ⇒ B) : LinkedList[B]

    [use case] Builds a new collection by applying a function to all elements of this linked list.

    [use case]

    Builds a new collection by applying a function to all elements of this linked list.

    B

    the element type of the returned collection.

    f

    the function to apply to each element.

    returns

    a new linked list resulting from applying the given function f to each element of this linked list and collecting the results.

    attributes: abstract
    definition classes: TraversableLike
  111. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Builds a new collection by applying a function to all elements of this linked list.

    Builds a new collection by applying a function to all elements of this linked list.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this linked list and collecting the results.

    definition classes: TraversableLikeFilterMonadic
  112. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

    the largest element of this linked list.

    attributes: abstract
    definition classes: TraversableOnce
  113. def max [B >: A] (implicit cmp: Ordering[B]) : A

    Finds the largest element.

    Finds the largest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the largest element of this linked list with respect to the ordering cmp.

    definition classes: TraversableOnce
  114. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

    the smallest element of this linked list

    attributes: abstract
    definition classes: TraversableOnce
  115. def min [B >: A] (implicit cmp: Ordering[B]) : A

    Finds the smallest element.

    Finds the smallest element.

    B

    The type over which the ordering is defined.

    cmp

    An ordering to be used for comparing elements.

    returns

    the smallest element of this linked list with respect to the ordering cmp.

    definition classes: TraversableOnce
  116. def mkString : String

    Displays all elements of this linked list in a string.

    Displays all elements of this linked list in a string.

    returns

    a string representation of this linked list. In the resulting string the string representations (w.r.t. the method toString) of all elements of this linked list follow each other without any separator string.

    definition classes: TraversableOnce
  117. def mkString (sep: String) : String

    Displays all elements of this linked list in a string using a separator string.

    Displays all elements of this linked list in a string using a separator string.

    sep

    the separator string.

    returns

    a string representation of this linked list. In the resulting string the string representations (w.r.t. the method toString) of all elements of this linked list are separated by the string sep.

    definition classes: TraversableOnce
  118. def mkString (start: String, sep: String, end: String) : String

    Displays all elements of this linked list in a string using start, end, and separator strings.

    Displays all elements of this linked list in a string using start, end, and separator strings.

    start

    the starting string.

    sep

    the separator string.

    end

    the ending string.

    returns

    a string representation of this linked list. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this linked list are separated by the string sep.

    definition classes: TraversableOnce
  119. def ne (arg0: AnyRef) : Boolean

    o.ne(arg0) is the same as !(o.eq(arg0)).

    o.ne(arg0) is the same as !(o.eq(arg0)).

    arg0

    the object to compare against this object for reference dis-equality.

    returns

    false if the argument is not a reference to the receiver object; true otherwise.

    attributes: final
    definition classes: AnyRef
  120. def newBuilder : Builder[A, LinkedList[A]]

    The builder that builds instances of type LinkedList[A]

    The builder that builds instances of type LinkedList[A]

    attributes: protected[this]
    definition classes: GenericTraversableTemplateHasNewBuilder
  121. var next : LinkedList[A]

    definition classes: LinkedListLike
  122. def nonEmpty : Boolean

    Tests whether the linked list is not empty.

    Tests whether the linked list is not empty.

    returns

    true if the linked list contains at least one element, false otherwise.

    definition classes: TraversableOnce
  123. def notify () : Unit

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  124. def notifyAll () : Unit

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    attributes: final
    definition classes: AnyRef
  125. def orElse [A1 <: A, B1 >: B] (that: PartialFunction[A1, B1]) : PartialFunction[A1, B1]

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    Composes this partial function with a fallback partial function which gets applied where this partial function is not defined.

    A1

    the argument type of the fallback function

    B1

    the result type of the fallback function

    that

    the fallback function

    returns

    a partial function which has as domain the union of the domains of this partial function and that. The resulting partial function takes x to this(x) where this is defined, and to that(x) where it is not.

    definition classes: PartialFunction
  126. def padTo (len: Int, elem: A) : LinkedList[A]

    [use case] Appends an element value to this linked list until a given target length is reached.

    [use case]

    Appends an element value to this linked list until a given target length is reached.

    len

    the target length

    elem

    the padding value

    returns

    a new linked list consisting of all elements of this linked list followed by the minimal number of occurrences of elem so that the resulting linked list has a length of at least len.

    attributes: abstract
    definition classes: SeqLike
  127. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Appends an element value to this linked list until a given target length is reached.

    Appends an element value to this linked list until a given target length is reached.

    B

    the element type of the returned linked list.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    len

    the target length

    elem

    the padding value

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That consisting of all elements of this linked list followed by the minimal number of occurrences of elem so that the resulting collection has a length of at least len.

    definition classes: SeqLike
  128. def partition (p: (A) ⇒ Boolean) : (LinkedList[A], LinkedList[A])

    Partitions this linked list in two linked lists according to a predicate.

    Partitions this linked list in two linked lists according to a predicate.

    p

    the predicate on which to partition.

    returns

    a pair of linked lists: the first linked list consists of all elements that satisfy the predicate p and the second linked list consists of all elements that don't. The relative order of the elements in the resulting linked lists is the same as in the original linked list.

    definition classes: TraversableLike
  129. def patch (from: Int, that: Seq[A], replaced: Int) : LinkedList[A]

    [use case] Produces a new linked list where a slice of elements in this linked list is replaced by another sequence.

    [use case]

    Produces a new linked list where a slice of elements in this linked list is replaced by another sequence.

    from

    the index of the first replaced element

    replaced

    the number of elements to drop in the original linked list

    returns

    a new linked list consisting of all elements of this linked list except that replaced elements starting from from are replaced by patch.

    attributes: abstract
    definition classes: SeqLike
  130. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Produces a new linked list where a slice of elements in this linked list is replaced by another sequence.

    Produces a new linked list where a slice of elements in this linked list is replaced by another sequence.

    B

    the element type of the returned linked list.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    from

    the index of the first replaced element

    patch

    the replacement sequence

    replaced

    the number of elements to drop in the original linked list

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new linked list consisting of all elements of this linked list except that replaced elements starting from from are replaced by patch.

    definition classes: SeqLike
  131. def prefixLength (p: (A) ⇒ Boolean) : Int

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    Returns the length of the longest prefix whose elements all satisfy some predicate.

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this linked list such that every element of the segment satisfies the predicate p.

    definition classes: SeqLike
  132. def product : A

    [use case] Multiplies up the elements of this collection.

    [use case]

    Multiplies up the elements of this collection.

    returns

    the product of all elements in this linked list of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the linked list and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  133. def product [B >: A] (implicit num: Numeric[B]) : B

    Multiplies up the elements of this collection.

    Multiplies up the elements of this collection.

    B

    the result type of the * operator.

    num

    an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.

    returns

    the product of all elements of this linked list with respect to the * operator in num.

    definition classes: TraversableOnce
  134. def projection : SeqView[A, LinkedList[A]]

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

    definition classes: SeqLikeIterableLike
      deprecated:
    1. use view' instead

  135. def reduceLeft [B >: A] (op: (B, A) ⇒ B) : B

    Applies a binary operator to all elements of this linked list, going left to right.

    Applies a binary operator to all elements of this linked list, going left to right.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked list, going left to right: op(...(op(x1, x2), ... ) , xn) where x,,1,,, ..., x,,n,, are the elements of this linked list.

    definition classes: TraversableOnce
  136. def reduceLeftOption [B >: A] (op: (B, A) ⇒ B) : Option[B]

    Optionally applies a binary operator to all elements of this linked list, going left to right.

    Optionally applies a binary operator to all elements of this linked list, going left to right.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceLeft(op) is this linked list is nonempty, None otherwise.

    definition classes: TraversableOnce
  137. def reduceRight [B >: A] (op: (A, B) ⇒ B) : B

    Applies a binary operator to all elements of this linked list, going right to left.

    Applies a binary operator to all elements of this linked list, going right to left.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    the result of inserting op between consecutive elements of this linked list, going right to left: op(x1, op(x2, ..., op(xn-1, xn)...)) where x,,1,,, ..., x,,n,, are the elements of this linked list.

    definition classes: IterableLikeTraversableOnce
  138. def reduceRightOption [B >: A] (op: (A, B) ⇒ B) : Option[B]

    Optionally applies a binary operator to all elements of this linked list, going right to left.

    Optionally applies a binary operator to all elements of this linked list, going right to left.

    B

    the result type of the binary operator.

    op

    the binary operator.

    returns

    an option value containing the result of reduceRight(op) is this linked list is nonempty, None otherwise.

    definition classes: TraversableOnce
  139. def repr : LinkedList[A]

    The collection of type linked list underlying this TraversableLike object.

    The collection of type linked list underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

    definition classes: TraversableLike
  140. def reverse : LinkedList[A]

    Returns new linked list wih elements in reversed order.

    Returns new linked list wih elements in reversed order.

    returns

    A new linked list with all elements of this linked list in reversed order.

    definition classes: SeqLike
  141. def reverseIterator : Iterator[A]

    An iterator yielding elements in reversed order.

    An iterator yielding elements in reversed order.

    Note: xs.reverseIterator is the same as xs.reverse.iterator but might be more efficient.

    returns

    an iterator yielding the elements of this linked list in reversed order

    definition classes: SeqLike
  142. def reverseMap [B] (f: (A) ⇒ B) : LinkedList[B]

    [use case] Builds a new collection by applying a function to all elements of this linked list and collecting the results in reversed order.

    [use case]

    Builds a new collection by applying a function to all elements of this linked list and collecting the results in reversed order.

    B

    the element type of the returned collection.

    Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

    f

    the function to apply to each element.

    returns

    a new linked list resulting from applying the given function f to each element of this linked list and collecting the results in reversed order.

    attributes: abstract
    definition classes: SeqLike
  143. def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Builds a new collection by applying a function to all elements of this linked list and collecting the results in reversed order.

    Builds a new collection by applying a function to all elements of this linked list and collecting the results in reversed order.

    Note: xs.reverseMap(f) is the same as xs.reverse.map(f) but might be more efficient.

    B

    the element type of the returned collection.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    f

    the function to apply to each element.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That resulting from applying the given function f to each element of this linked list and collecting the results in reversed order.

    definition classes: SeqLike
  144. def reversed : List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  145. def reversedElements : Iterator[A]

    definition classes: SeqLike
      deprecated:
    1. use reverseIterator' instead

  146. def sameElements (that: Iterable[A]) : Boolean

    [use case] Checks if the other iterable collection contains the same elements in the same order as this linked list.

    [use case]

    Checks if the other iterable collection contains the same elements in the same order as this linked list.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    attributes: abstract
    definition classes: IterableLike
  147. def sameElements [B >: A] (that: Iterable[B]) : Boolean

    Checks if the other iterable collection contains the same elements in the same order as this linked list.

    Checks if the other iterable collection contains the same elements in the same order as this linked list.

    B

    the type of the elements of collection that.

    that

    the collection to compare with.

    returns

    true, if both collections contain the same elements in the same order, false otherwise.

    definition classes: IterableLike
  148. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Produces a collection containing cummulative results of applying the operator going left to right.

    Produces a collection containing cummulative results of applying the operator going left to right.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  149. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Produces a collection containing cummulative results of applying the operator going right to left.

    Produces a collection containing cummulative results of applying the operator going right to left.

    B

    the type of the elements in the resulting collection

    That

    the actual type of the resulting collection

    z

    the initial value

    op

    the binary operator applied to the intermediate result and the element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    collection with intermediate results

    definition classes: TraversableLike
  150. def segmentLength (p: (A) ⇒ Boolean, from: Int) : Int

    Computes length of longest segment whose elements all satisfy some predicate.

    Computes length of longest segment whose elements all satisfy some predicate.

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

    the length of the longest segment of this linked list starting from index from such that every element of the segment satisfies the predicate p.

    definition classes: SeqLike
  151. def size : Int

    The size of this linked list, equivalent to length.

    The size of this linked list, equivalent to length.

    returns

    the number of elements in this linked list.

    definition classes: SeqLikeTraversableOnce
  152. def slice (from: Int, until: Int) : LinkedList[A]

    Selects an interval of elements.

    Selects an interval of elements.

    Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)

    from

    the index of the first returned element in this linked list.

    until

    the index one past the last returned element in this linked list.

    returns

    a linked list containing the elements starting at index from and extending up to (but not including) index until of this linked list.

    definition classes: IterableLikeTraversableLike
  153. def sliding [B >: A] (size: Int, step: Int) : Iterator[LinkedList[A]]

    definition classes: IterableLike
  154. def sliding [B >: A] (size: Int) : Iterator[LinkedList[A]]

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.

    Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)

    size

    the number of elements per group

    returns

    An iterator producing linked lists of size size, except the last and the only element will be truncated if there are fewer elements than size.

    definition classes: IterableLike
      see also:
    1. Iterator#sliding

  155. def sortBy [B] (f: (A) ⇒ B)(implicit ord: Ordering[B]) : LinkedList[A]

    Sorts this LinkedList according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    Sorts this LinkedList according to the Ordering which results from transforming an implicitly given Ordering with a transformation function.

    B

    the target type of the transformation f, and the type where the ordering ord is defined.

    f

    the transformation function mapping elements to some other domain B.

    ord

    the ordering assumed on domain B.

    returns

    a linked list consisting of the elements of this linked list sorted according to the ordering where x < y if ord.lt(f(x), f(y)).

    definition classes: SeqLike
      see also:
    1. scala.math.Ordering

  156. def sortWith (lt: (A, A) ⇒ Boolean) : LinkedList[A]

    Sorts this linked list according to a comparison function.

    Sorts this linked list according to a comparison function.

    The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original.

    lt

    the comparison function which tests whether its first argument precedes its second argument in the desired ordering.

    returns

    a linked list consisting of the elements of this linked list sorted according to the comparison function lt.

    definition classes: SeqLike
  157. def sorted [B >: A] (implicit ord: Ordering[B]) : LinkedList[A]

    Sorts this linked list according to an Ordering.

    Sorts this linked list according to an Ordering.

    The sort is stable. That is, elements that are equal wrt lt appear in the same order in the sorted sequence as in the original.

    ord

    the ordering to be used to compare elements.

    returns

    a linked list consisting of the elements of this linked list sorted according to the ordering ord.

    definition classes: SeqLike
      see also:
    1. scala.math.Ordering

  158. def span (p: (A) ⇒ Boolean) : (LinkedList[A], LinkedList[A])

    Splits this linked list into a prefix/suffix pair according to a predicate.

    Splits this linked list into a prefix/suffix pair according to a predicate.

    Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.

    p

    the test predicate

    returns

    a pair consisting of the longest prefix of this linked list whose elements all satisfy p, and the rest of this linked list.

    definition classes: TraversableLike
  159. def splitAt (n: Int) : (LinkedList[A], LinkedList[A])

    Splits this linked list into two at a given position.

    Splits this linked list into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).

    n

    the position at which to split.

    returns

    a pair of linked lists consisting of the first n elements of this linked list, and the other elements.

    definition classes: TraversableLike
  160. def startsWith [B] (that: Seq[B]) : Boolean

    Tests whether this linked list starts with the given sequence.

    Tests whether this linked list starts with the given sequence.

    that

    the sequence to test

    returns

    true if this collection has that as a prefix, false otherwise.

    definition classes: SeqLike
  161. def startsWith [B] (that: Seq[B], offset: Int) : Boolean

    Tests whether this linked list contains the given sequence at a given index.

    Tests whether this linked list contains the given sequence at a given index.

    If the both the receiver object, this and the argument, that are infinite sequences this method may not terminate.

    that

    the sequence to test

    offset

    the index where the sequence is searched.

    returns

    true if the sequence that is contained in this linked list at index offset, otherwise false.

    definition classes: SeqLike
  162. def stringPrefix : String

    Defines the prefix of this object's toString representation.

    Defines the prefix of this object's toString representation.

    returns

    a string representation which starts the result of toString applied to this linked list. By default the string prefix is the simple name of the collection class linked list.

    definition classes: TraversableLike
  163. def sum : A

    [use case] Sums up the elements of this collection.

    [use case]

    Sums up the elements of this collection.

    returns

    the sum of all elements in this linked list of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the linked list and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

    attributes: abstract
    definition classes: TraversableOnce
  164. def sum [B >: A] (implicit num: Numeric[B]) : B

    Sums up the elements of this collection.

    Sums up the elements of this collection.

    B

    the result type of the + operator.

    num

    an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.

    returns

    the sum of all elements of this linked list with respect to the + operator in num.

    definition classes: TraversableOnce
  165. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  166. def tail : LinkedList[A]

    Selects all elements except the first.

    Selects all elements except the first.

    returns

    a linked list consisting of all elements of this linked list except the first one.

    definition classes: LinkedListLikeTraversableLike
  167. def take (n: Int) : LinkedList[A]

    Selects first n elements.

    Selects first n elements.

    n

    Tt number of elements to take from this linked list.

    returns

    a linked list consisting only of the first n elements of this linked list, or else the whole linked list, if it has less than n elements.

    definition classes: IterableLikeTraversableLike
  168. def takeRight (n: Int) : LinkedList[A]

    Selects last n elements.

    Selects last n elements.

    n

    the number of elements to take

    returns

    a linked list consisting only of the last n elements of this linked list, or else the whole linked list, if it has less than n elements.

    definition classes: IterableLike
  169. def takeWhile (p: (A) ⇒ Boolean) : LinkedList[A]

    Takes longest prefix of elements that satisfy a predicate.

    Takes longest prefix of elements that satisfy a predicate.

    p

    The predicate used to test elements.

    returns

    the longest prefix of this linked list whose elements all satisfy the predicate p.

    definition classes: IterableLikeTraversableLike
  170. def thisCollection : LinearSeq[A]

    The underlying collection seen as an instance of LinkedList.

    The underlying collection seen as an instance of LinkedList. By default this is implemented as the current collection object itself, but this can be overridden.

    attributes: protected[this]
    definition classes: LinearSeqLikeSeqLikeIterableLikeTraversableLike
  171. def toArray : Array[A]

    [use case] Converts this linked list to an array.

    [use case]

    Converts this linked list to an array.

    returns

    an array containing all elements of this linked list. A ClassManifest must be available for the element type of this linked list.

    attributes: abstract
    definition classes: TraversableOnce
  172. def toArray [B >: A] (implicit arg0: ClassManifest[B]) : Array[B]

    Converts this linked list to an array.

    Converts this linked list to an array.

    B

    the type of the elements of the array. A ClassManifest for this type must be available.

    returns

    an array containing all elements of this linked list.

    definition classes: TraversableOnce
  173. def toBuffer [B >: A] : Buffer[B]

    Converts this linked list to a mutable buffer.

    Converts this linked list to a mutable buffer.

    returns

    a buffer containing all elements of this linked list.

    definition classes: TraversableOnce
  174. def toCollection (repr: LinearSeq[A]) : LinearSeq[A]

    A conversion from collections of type Repr to LinkedList objects.

    A conversion from collections of type Repr to LinkedList objects. By default this is implemented as just a cast, but this can be overridden.

    attributes: protected[this]
    definition classes: LinearSeqLikeSeqLikeIterableLikeTraversableLike
  175. def toCollection (repr: LinkedList[A]) : Seq[A]

    A conversion from collections of type Repr to LinkedList objects.

    A conversion from collections of type Repr to LinkedList objects. By default this is implemented as just a cast, but this can be overridden.

    attributes: protected[this]
    definition classes: SeqLikeIterableLikeTraversableLike
  176. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this linked list to an indexed sequence.

    Converts this linked list to an indexed sequence.

    returns

    an indexed sequence containing all elements of this linked list.

    definition classes: TraversableOnce
  177. def toIterable : Iterable[A]

    Converts this linked list to an iterable collection.

    Converts this linked list to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).

    returns

    an Iterable containing all elements of this linked list.

    definition classes: IterableLikeTraversableOnce
  178. def toIterator : Iterator[A]

    Returns an Iterator over the elements in this linked list.

    Returns an Iterator over the elements in this linked list. Will return the same Iterator if this instance is already an Iterator.

    returns

    an Iterator containing all elements of this linked list.

    definition classes: TraversableLikeTraversableOnce
  179. def toList : List[A]

    Converts this linked list to a list.

    Converts this linked list to a list.

    returns

    a list containing all elements of this linked list.

    definition classes: TraversableOnce
  180. def toMap [T, U] (implicit ev: <:<[A, (T, U)]) : Map[T, U]

    Converts this linked list to a map.

    Converts this linked list to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered collection, which key is in the resulting map is undefined.

    returns

    a map containing all elements of this linked list.

    definition classes: TraversableOnce
  181. def toSeq : Seq[A]

    Converts this linked list to a sequence.

    Converts this linked list to a sequence.

    Overridden for [email protected] a sequence containing all the elements of this linked list.

    definition classes: SeqLikeIterableLikeTraversableOnce
  182. def toSet [B >: A] : Set[B]

    Converts this linked list to a set.

    Converts this linked list to a set.

    returns

    a set containing all elements of this linked list.

    definition classes: TraversableOnce
  183. def toStream : Stream[A]

    Converts this linked list to a stream.

    Converts this linked list to a stream.

    returns

    a stream containing all elements of this linked list.

    definition classes: IterableLikeTraversableLikeTraversableOnce
  184. def toString () : String

    Converts this linked list to a string.

    Converts this linked list to a string.

    returns

    a string representation of this collection. By default this string consists of the stringPrefix of this linked list, followed by all elements separated by commas and enclosed in parentheses.

    definition classes: SeqLikeTraversableLike → AnyRef → Any
  185. def toTraversable : Traversable[A]

    Converts this linked list to an unspecified Traversable.

    Converts this linked list to an unspecified Traversable. Will return the same collection if this instance is already Traversable.

    returns

    a Traversable containing all elements of this linked list.

    definition classes: TraversableLikeTraversableOnce
  186. def transpose [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : LinkedList[LinkedList[B]]

    Transposes this linked list of traversable collections into a linked list of linked lists.

    Transposes this linked list of traversable collections into a linked list of linked lists.

    B

    the type of the elements of each traversable collection.

    asTraversable

    an implicit conversion which asserts that the element type of this linked list is a Traversable.

    returns

    a two-dimensional linked list of linked lists which has as nth row the nth column of this linked list.

    definition classes: GenericTraversableTemplate
  187. def union (that: Seq[A]) : LinkedList[A]

    [use case] Produces a new sequence which contains all elements of this linked list and also all elements of a given sequence.

    [use case]

    Produces a new sequence which contains all elements of this linked list and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

    that

    the sequence to add.

    returns

    a new linked list which contains all elements of this linked list followed by all elements of that.

    attributes: abstract
    definition classes: SeqLike
  188. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    Produces a new sequence which contains all elements of this linked list and also all elements of a given sequence.

    Produces a new sequence which contains all elements of this linked list and also all elements of a given sequence. xs union ys is equivalent to xs ++ ys.

    Another way to express this is that xs union ys computes the order-presevring multi-set union of xs and ys. union is hence a counter-part of diff and intersect which also work on multi-sets.

    B

    the element type of the returned linked list.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    that

    the sequence to add.

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new collection of type That which contains all elements of this linked list followed by all elements of that.

    definition classes: SeqLike
  189. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)) : (LinkedList[A1], LinkedList[A2])

    Converts this linked list of pairs into two collections of the first and second halfs of each pair.

    Converts this linked list of pairs into two collections of the first and second halfs of each pair.

    asPair

    an implicit conversion which asserts that the element type of this linked list is a pair.

    returns

    a pair linked lists, containing the first, respectively second half of each element pair of this linked list.

    definition classes: GenericTraversableTemplate
  190. def update (n: Int, x: A) : Unit

    definition classes: LinkedListLike
  191. def updated (index: Int, elem: A) : LinkedList[A]

    [use case] A copy of this linked list with one single replaced element.

    [use case]

    A copy of this linked list with one single replaced element.

    index

    the position of the replacement

    elem

    the replacing element

    returns

    a copy of this linked list with the element at position index replaced by elem.

    attributes: abstract
    definition classes: SeqLike
  192. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[LinkedList[A], B, That]) : That

    A copy of this linked list with one single replaced element.

    A copy of this linked list with one single replaced element.

    B

    the element type of the returned linked list.

    That

    the class of the returned collection. In the standard library configuration, That is always LinkedList[B] because an implicit of type CanBuildFrom[LinkedList, B, LinkedList[B]] is defined in object LinkedList.

    index

    the position of the replacement

    elem

    the replacing element

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type B.

    returns

    a new linked list which is a copy of this linked list with the element at position index replaced by elem.

    definition classes: SeqLike
  193. def view (from: Int, until: Int) : SeqView[A, LinkedList[A]]

    Creates a non-strict view of a slice of this linked list.

    Creates a non-strict view of a slice of this linked list.

    Note: the difference between view and slice is that view produces a view of the current linked list, whereas slice produces a new linked list.

    Note: view(from, to) is equivalent to view.slice(from, to)

    from

    the index of the first element of the view

    until

    the index of the element following the view

    returns

    a non-strict view of a slice of this linked list, starting at index from and extending up to (but not including) index until.

    definition classes: SeqLikeIterableLikeTraversableLike
  194. def view : SeqView[A, LinkedList[A]]

    Creates a non-strict view of this linked list.

    Creates a non-strict view of this linked list.

    returns

    a non-strict view of this linked list.

    definition classes: SeqLikeIterableLikeTraversableLike
  195. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  196. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  197. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  198. def withFilter (p: (A) ⇒ Boolean) : FilterMonadic[A, LinkedList[A]]

    Creates a non-strict filter of this linked list.

    Creates a non-strict filter of this linked list.

    Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.

    p

    the predicate used to test elements.

    returns

    an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this linked list which satisfy the predicate p.

    definition classes: TraversableLikeFilterMonadic
  199. def zip [B] (that: Iterable[B]) : LinkedList[(A, B)]

    [use case] Returns a linked list formed from this linked list and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a linked list formed from this linked list and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    returns

    a new linked list containing pairs consisting of corresponding elements of this linked list and that. The length of the returned collection is the minimum of the lengths of this linked list and that.

    attributes: abstract
    definition classes: IterableLike
  200. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[LinkedList[A], (A1, B), That]) : That

    Returns a linked list formed from this linked list and another iterable collection by combining corresponding elements in pairs.

    Returns a linked list formed from this linked list and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    B

    the type of the second half of the returned pairs

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.

    that

    The iterable providing the second half of each result pair

    bf

    an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this linked list and that. The length of the returned collection is the minimum of the lengths of this linked list and that.

    definition classes: IterableLike
  201. def zipAll [B] (that: Iterable[B], thisElem: A, thatElem: B) : LinkedList[(A, B)]

    [use case] Returns a linked list formed from this linked list and another iterable collection by combining corresponding elements in pairs.

    [use case]

    Returns a linked list formed from this linked list and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    B

    the type of the second half of the returned pairs

    that

    The iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this linked list is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this linked list.

    returns

    a new linked list containing pairs consisting of corresponding elements of this linked list and that. The length of the returned collection is the maximum of the lengths of this linked list and that. If this linked list is shorter than that, thisElem values are used to pad the result. If that is shorter than this linked list, thatElem values are used to pad the result.

    attributes: abstract
    definition classes: IterableLike
  202. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[LinkedList[A], (A1, B), That]) : That

    Returns a linked list formed from this linked list and another iterable collection by combining corresponding elements in pairs.

    Returns a linked list formed from this linked list and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this linked list is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this linked list.

    returns

    a new collection of type That containing pairs consisting of corresponding elements of this linked list and that. The length of the returned collection is the maximum of the lengths of this linked list and that. If this linked list is shorter than that, thisElem values are used to pad the result. If that is shorter than this linked list, thatElem values are used to pad the result.

    definition classes: IterableLike
  203. def zipWithIndex : LinkedList[(A, Int)]

    [use case] Zips this linked list with its indices.

    [use case]

    Zips this linked list with its indices.

    returns

    A new linked list containing pairs consisting of all elements of this linked list paired with their index. Indices start at 0. @example List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

    attributes: abstract
    definition classes: IterableLike
  204. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[LinkedList[A], (A1, Int), That]) : That

    Zips this linked list with its indices.

    Zips this linked list with its indices.

    A1

    the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).

    That

    the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.

    returns

    A new collection of type That containing pairs consisting of all elements of this linked list paired with their index. Indices start at 0.

    definition classes: IterableLike

Inherited from LinkedListLike[A, LinkedList[A]]

Inherited from LinearSeq[A]

Inherited from LinearSeq[A]

Inherited from LinearSeqLike[A, LinearSeq[A]]

Inherited from Seq[A]

Inherited from Seq[A]

Inherited from SeqLike[A, LinkedList[A]]

Inherited from PartialFunction[Int, A]

Inherited from (Int) ⇒ A

Inherited from Iterable[A]

Inherited from Iterable[A]

Inherited from IterableLike[A, LinkedList[A]]

Inherited from Equals

Inherited from Traversable[A]

Inherited from Mutable

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, LinkedList]

Inherited from TraversableLike[A, LinkedList[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, LinkedList[A]]

Inherited from HasNewBuilder[A, LinkedList[A]]

Inherited from AnyRef

Inherited from Any