scala.collection.mutable

LinkedListLike

trait LinkedListLike [A, This <: Seq[A] with LinkedListLike[A, This]] extends SeqLike[A, This]

This extensible class may be used as a basis for implementing linked list. Type variable A refers to the element type of the list, type variable This is used to model self types of linked lists.

If the list is empty next must be set to this. The last node in every mutable linked list is empty.

Examples (_ represents no value):

    Empty:

    [ _ ] --,
    [   ] <-`

    Single element:

    [ x ] --> [ _ ] --,
              [   ] <-`

    More elements:

    [ x ] --> [ y ] --> [ z ] --> [ _ ] --,
                                  [   ] <-`

A

type of the elements contained in the linked list

This

the type of the actual linked list holding the elements

Self Type
LinkedListLike[A, This]
Source
LinkedListLike.scala
Version

1.0, 08/07/2003

Since

2.8

Linear Supertypes
SeqLike[A, This], Cloneable[This], SeqLike[A, This], GenSeqLike[A, This], IterableLike[A, This], GenIterableLike[A, This], TraversableLike[A, This], GenTraversableLike[A, This], Parallelizable[A, ParSeq[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, This], HasNewBuilder[A, This], Equals, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. LinkedListLike
  2. SeqLike
  3. Cloneable
  4. SeqLike
  5. GenSeqLike
  6. IterableLike
  7. GenIterableLike
  8. TraversableLike
  9. GenTraversableLike
  10. Parallelizable
  11. TraversableOnce
  12. GenTraversableOnce
  13. FilterMonadic
  14. HasNewBuilder
  15. Equals
  16. AnyRef
  17. Any
Visibility
  1. Public
  2. All

Type Members

  1. type Self = This

    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.

Abstract Value Members

  1. def newBuilder : Builder[A, This]

    Creates a new builder for this collection type.

    Creates a new builder for this collection type.

    Attributes
    protected[this] abstract
    Definition Classes
    TraversableLikeHasNewBuilder
  2. def seq : TraversableOnce[A]

    Attributes
    abstract
    Definition Classes
    Parallelizable

Concrete Value Members

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

    Attributes
    final
    Definition Classes
    AnyRef
  2. def != (arg0: Any): Boolean

    Test two objects for inequality.

    Test two objects for inequality.

    returns

    true if !(this == that), false otherwise.

    Attributes
    final
    Definition Classes
    Any
  3. def ## (): Int

    Equivalent to x.hashCode except for boxed numeric types.

    Equivalent to x.hashCode except for boxed numeric types. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them.

    returns

    a hash value consistent with ==

    Attributes
    final
    Definition Classes
    AnyRef → Any
  4. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[This, B, That]): That

    Definition Classes
    TraversableLike
    Annotations
    @bridge()
  5. def ++ [B] (that: GenTraversableOnce[B]): LinkedList[B]

    [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.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  6. def ++ [B >: A, That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[This, 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenTraversableLike
  7. def ++: [B >: A, That] (that: Traversable[B])(implicit bf: CanBuildFrom[This, B, That]): That

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions.

    This overload exists because: for the implementation of ++: we should reuse that of ++ because many collections override it with more efficient versions. Since TraversableOnce has no '++' method, we have to implement that directly, but Traversable and down can use the overload.

    Definition Classes
    TraversableLike
  8. def ++: [B] (that: TraversableOnce[B]): LinkedList[B]

    [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. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    that

    the traversable to append.

    returns

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

    Attributes
    abstract
    Definition Classes
    TraversableLike
  9. def ++: [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[This, 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. It differs from ++ in that the right operand determines the type of the resulting collection rather than the left one.

    B

    the element type of the returned collection.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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
  10. 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 collection of type That consisting of elem followed by all elements of this linked list.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  11. def +: [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[This, 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenSeqLike
  12. 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.

    Note: will not terminate for infinite-sized collections.

    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, x,,1,,), x,,2,,), ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this linked list.

    Definition Classes
    TraversableOnceGenTraversableOnce
  13. def /:\ [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    A syntactic sugar for out of order folding.

    A syntactic sugar for out of order folding. See fold.

    Definition Classes
    GenTraversableOnce
  14. def :+ (elem: A): LinkedList[A]

    [use case] Appends an element to this linked list

    [use case]

    Appends an element to this linked list

    Note: will not terminate for infinite-sized collections.

    elem

    the appended element

    returns

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

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  15. def :+ [B >: A, That] (elem: B)(implicit bf: CanBuildFrom[This, B, That]): That

    Appends an element to this linked list

    Appends an element to this linked list

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned linked list.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenSeqLike
  16. 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.

    Note: will not terminate for infinite-sized collections.

    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(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this linked list.

    Definition Classes
    TraversableOnceGenTraversableOnce
  17. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  18. def == (arg0: Any): Boolean

    Test two objects for equality.

    Test two objects for equality.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  19. 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
  20. 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
  21. 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
  22. def aggregate [B] (z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Aggregates the results of applying an operator to subsequent elements.

    Aggregates the results of applying an operator to subsequent elements.

    This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked arbitrary number of times.

    For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.

       pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
    

    Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).

    z

    the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation)

    seqop

    an operator used to accumulate results within a partition

    combop

    an associative operator used to combine results from different partitions

    Definition Classes
    TraversableOnceGenTraversableOnce
  23. def append (that: This): This

    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. )

  24. 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 → GenSeqLike
  25. def asInstanceOf [T0] : T0

    Cast the receiver object to be of type T0.

    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 expression 1.asInstanceOf[String] will throw a ClassCastException at runtime, while the expression List(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 type.

    returns

    the receiver object.

    Attributes
    final
    Definition Classes
    Any
  26. 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
  27. def clone (): This

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    Definition Classes
    Cloneable → AnyRef
  28. 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 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.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  29. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[This, 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenTraversableLike
  30. def collectFirst [B] (pf: PartialFunction[A, B]): Option[B]

    Finds the first element of the linked list for which the given partial function is defined, and applies the partial function to it.

    Finds the first element of the linked list for which the given partial function is defined, and applies the partial function to it.

    Note: may not terminate for infinite-sized collections.

    pf

    the partial function

    returns

    an option value containing pf applied to the first value for which it is defined, or None if none exists.

    Definition Classes
    TraversableOnce
    Example:
    1. Seq("a", 1, 5L).collectFirst({ case x: Int => x*10 }) = Some(10)

  31. def combinations (n: Int): Iterator[This]

    Iterates over combinations.

    Iterates over combinations.

    returns

    An Iterator which traverses the possible n-element combinations of this linked list.

    Definition Classes
    SeqLike
    Example:
    1. "abbbc".combinations(2) = Iterator(ab, ac, bb, bc)

  32. 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.

    Note: may not terminate for infinite-sized collections.

    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
  33. def containsSlice [B] (that: Seq[B]): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  34. def containsSlice [B] (that: GenSeq[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.

    Note: may not terminate for infinite-sized collections.

    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
  35. 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
  36. 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.

    Note: will not terminate for infinite-sized collections.

    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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  37. 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
    GenTraversableOnce
  38. 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.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    Definition Classes
    TraversableOnceGenTraversableOnce
  39. 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, beginning at index start. 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
    GenTraversableOnce
  40. 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, beginning at index start. Copying will stop once either the end of the current linked list is reached, or the end of the array is reached.

    Note: will not terminate for infinite-sized collections.

    B

    the type of the elements of the array.

    xs

    the array to fill.

    start

    the starting index.

    Definition Classes
    TraversableOnceGenTraversableOnce
  41. 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.

    Note: will not terminate for infinite-sized collections.

    dest

    The buffer to which elements are copied.

    Definition Classes
    TraversableOnce
  42. def corresponds [B] (that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  43. def corresponds [B] (that: GenSeq[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 → GenSeqLike
  44. 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
    TraversableOnceGenTraversableOnce
  45. def diff [B >: A] (that: Seq[B]): This

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  46. 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.

    Note: will not terminate for infinite-sized collections.

    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.

    Attributes
    abstract
    Definition Classes
    SeqLike
  47. def diff [B >: A] (that: GenSeq[B]): This

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

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

    Note: will not terminate for infinite-sized collections.

    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 → GenSeqLike
  48. def distinct : This

    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.

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
    SeqLike → GenSeqLike
  49. def drop (n: Int): This

    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
    LinkedListLikeIterableLikeTraversableLike → GenTraversableLike
  50. def dropRight (n: Int): This

    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 last n ones, or else the empty linked list, if this linked list has less than n elements.

    Definition Classes
    IterableLike
  51. def dropWhile (p: (A) ⇒ Boolean): This

    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 → GenTraversableLike
  52. var elem : A

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

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  54. def endsWith [B] (that: GenSeq[B]): Boolean

    Tests whether this linked list ends with the given sequence.

    Tests whether this linked list ends with the given sequence.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to test

    returns

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

    Definition Classes
    SeqLike → GenSeqLike
  55. def eq (arg0: AnyRef): Boolean

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    Tests whether the argument (arg0) is a reference to the receiver object (this).

    The eq method implements an equivalence relation on non-null instances of AnyRef, and has three additional 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).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  56. def equals (that: Any): Boolean

    The equals method for arbitrary sequences.

    The equals method for arbitrary sequences. Compares this sequence to some other object.

    that

    The object to compare the sequence to

    returns

    true if that is a sequence that has the same elements as this sequence in the same order, false otherwise

    Definition Classes
    GenSeqLike → Equals → AnyRef → Any
  57. 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.

    Note: may not terminate for infinite-sized collections.

    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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  58. def filter (p: (A) ⇒ Boolean): This

    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 → GenTraversableLike
  59. def filterNot (p: (A) ⇒ Boolean): This

    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 → GenTraversableLike
  60. def finalize (): Unit

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

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

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  61. 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.

    Note: may not terminate for infinite-sized collections.

    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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  62. def flatMap [B] (f: (A) ⇒ GenTraversableOnce[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 collection of type That resulting from applying the given collection-valued function f to each element of this linked list and concatenating the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  63. def flatMap [B, That] (f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[This, 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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
    TraversableLike → GenTraversableLike → FilterMonadic
  64. def fold [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Folds the elements of this sequence using the specified associative binary operator.

    Folds the elements of this sequence using the specified associative binary operator. The order in which the elements are reduced is unspecified and may be nondeterministic.

    Note this method has a different signature than the foldLeft and foldRight methods of the trait Traversable. The result of folding may only be a supertype of this parallel collection's type parameter T.

    z

    a neutral element for the fold operation, it may be added to the result an arbitrary number of times, not changing the result (e.g. Nil for list concatenation, 0 for addition, or 1 for multiplication)

    op

    a binary operator that must be associative

    returns

    the result of applying fold operator op between all the elements and z

    Definition Classes
    TraversableOnceGenTraversableOnce
  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.

    Note: will not terminate for infinite-sized collections.

    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, x,,1,,), x,,2,,, ..., x,,n,,)
    

    where x,,1,,, ..., x,,n,, are the elements of this linked list.

    Definition Classes
    TraversableOnceGenTraversableOnce
  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.

    Note: will not terminate for infinite-sized collections.

    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(x,,1,,, op(x,,2,,, ... op(x,,n,,, z)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this linked list.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  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.

    Note: may not terminate for infinite-sized collections.

    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
    IterableLikeTraversableLikeTraversableOnceGenTraversableOnce
  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.

    Definition Classes
    LinkedListLikeIterableLikeTraversableLike → GenTraversableLike → TraversableOnceGenTraversableOnceFilterMonadic
  70. def get (n: Int): Option[A]

  71. def getClass (): java.lang.Class[_ <: java.lang.Object]

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

    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
  72. def groupBy [K] (f: (A) ⇒ K): Map[K, This]

    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 → GenTraversableLike
  73. def grouped (size: Int): Iterator[This]

    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

    Iterator#grouped

  74. 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
    TraversableLikeTraversableOnceGenTraversableOnce
  75. 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 list.

    returns

    the hash code value for this object.

    Definition Classes
    GenSeqLike → AnyRef → Any
  76. 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
    LinkedListLikeIterableLike → GenIterableLike → TraversableLike → GenTraversableLike
  77. 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
  78. 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
    GenSeqLike
  79. 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.

    Note: may not terminate for infinite-sized collections.

    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
    GenSeqLike
  80. 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
    GenSeqLike
  81. 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.

    Note: may not terminate for infinite-sized collections.

    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
    GenSeqLike
  82. def indexOfSlice [B >: A] (that: Seq[B], from: Int): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  83. def indexOfSlice [B >: A] (that: GenSeq[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.

    Note: may not terminate for infinite-sized collections.

    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

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  85. def indexOfSlice [B >: A] (that: GenSeq[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.

    Note: may not terminate for infinite-sized collections.

    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
  86. 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.

    Note: may not terminate for infinite-sized collections.

    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 → GenSeqLike
  87. def indexWhere (p: (A) ⇒ Boolean): Int

    Finds index of first element satisfying some predicate.

    Finds index of first element satisfying some predicate.

    Note: may not terminate for infinite-sized collections.

    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
    GenSeqLike
  88. 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
  89. def init : This

    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
  90. def inits : Iterator[This]

    Iterates over the inits of this linked list.

    Iterates over the inits of this linked list. The first value will be this linked list and the final one will be an empty linked list, with the intervening values the results of successive applications of init.

    returns

    an iterator over all the inits of this linked list

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).inits = Iterator(List(1,2,3), List(1,2), List(1), Nil)

  91. def insert (that: This): Unit

    Insert linked list that at current position of this linked list

  92. def intersect [B >: A] (that: Seq[B]): This

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  93. 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.

    Note: may not terminate for infinite-sized collections.

    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.

    Attributes
    abstract
    Definition Classes
    SeqLike
  94. def intersect [B >: A] (that: GenSeq[B]): This

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

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

    Note: may not terminate for infinite-sized collections.

    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 → GenSeqLike
  95. 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
    GenSeqLike
  96. def isEmpty : Boolean

    Tests whether the linked list is empty.

    Tests whether the linked list is empty.

    returns

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

    Definition Classes
    LinkedListLikeIterableLike → GenIterableLike → TraversableLikeTraversableOnceGenTraversableOnce
  97. def isInstanceOf [T0] : Boolean

    Test whether the dynamic type of the receiver object is T0.

    Test whether the dynamic type of the receiver object is T0.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression 1.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 specified type.

    returns

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

    Attributes
    final
    Definition Classes
    Any
  98. 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
    GenTraversableLike → GenTraversableOnce
  99. 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 → GenIterableLike
  100. def last : A

    Selects the last element.

    Selects the last element.

    returns

    The last element of this linked list.

    Definition Classes
    TraversableLike
  101. 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
    GenSeqLike
  102. 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
    GenSeqLike
  103. 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
    GenSeqLike
  104. 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.

    Note: will not terminate for infinite-sized collections.

    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
    GenSeqLike
  105. def lastIndexOfSlice [B >: A] (that: Seq[B], end: Int): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  106. def lastIndexOfSlice [B >: A] (that: GenSeq[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
  107. def lastIndexOfSlice [B >: A] (that: Seq[B]): Int

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  108. def lastIndexOfSlice [B >: A] (that: GenSeq[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.

    Note: will not terminate for infinite-sized collections.

    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
  109. 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 → GenSeqLike
  110. def lastIndexWhere (p: (A) ⇒ Boolean): Int

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    Note: will not terminate for infinite-sized collections.

    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
    GenSeqLike
  111. 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
  112. def length : Int

    The length of the linked list.

    The length of the linked list.

    Note: will not terminate for infinite-sized collections.

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

    returns

    the number of elements in this linked list.

    Definition Classes
    LinkedListLikeSeqLike → GenSeqLike
  113. 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
  114. 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 collection of type That resulting from applying the given function f to each element of this linked list and collecting the results.

    Attributes
    abstract
    Definition Classes
    GenTraversableLike
  115. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[This, 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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
    TraversableLike → GenTraversableLike → FilterMonadic
  116. def max : A

    [use case] Finds the largest element.

    [use case]

    Finds the largest element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  117. 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
    TraversableOnceGenTraversableOnce
  118. def maxBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  119. def min : A

    [use case] Finds the smallest element.

    [use case]

    Finds the smallest element.

    returns

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

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  120. 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
    TraversableOnceGenTraversableOnce
  121. def minBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnceGenTraversableOnce
  122. 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
    TraversableOnceGenTraversableOnce
  123. 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
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("|") = "1|2|3"

  124. 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
    TraversableOnceGenTraversableOnce
    Example:
    1. List(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"

  125. def ne (arg0: AnyRef): Boolean

    Equivalent to !(this eq that).

    Equivalent to !(this eq that).

    returns

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

    Attributes
    final
    Definition Classes
    AnyRef
  126. var next : This

  127. 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
    TraversableOnceGenTraversableOnce
  128. 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
  129. 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
  130. 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 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.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  131. def padTo [B >: A, That] (len: Int, elem: B)(implicit bf: CanBuildFrom[This, 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenSeqLike
  132. def par : ParSeq[A]

    Returns a parallel implementation of this collection.

    Returns a parallel implementation of this collection.

    For most collection types, this method creates a new parallel collection by copying all the elements. For these collection, par takes linear time. Mutable collections in this category do not produce a mutable parallel collection that has the same underlying dataset, so changes in one collection will not be reflected in the other one.

    Specific collections (e.g. ParArray or mutable.ParHashMap) override this default behaviour by creating a parallel collection which shares the same underlying dataset. For these collections, par takes constant or sublinear time.

    All parallel collections return a reference to themselves.

    returns

    a parallel implementation of this collection

    Definition Classes
    Parallelizable
  133. def parCombiner : Combiner[A, ParSeq[A]]

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    The default par implementation uses the combiner provided by this method to create a new parallel collection.

    returns

    a combiner for the parallel collection of type ParRepr

    Attributes
    protected[this]
    Definition Classes
    SeqLikeSeqLikeTraversableLikeParallelizable
  134. def partition (p: (A) ⇒ Boolean): (This, This)

    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 → GenTraversableLike
  135. def patch [B >: A, That] (from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[This, B, That]): That

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  136. def patch (from: Int, that: GenSeq[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
    GenSeqLike
  137. def patch [B >: A, That] (from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[This, 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenSeqLike
  138. def permutations : Iterator[This]

    Iterates over distinct permutations.

    Iterates over distinct permutations.

    returns

    An Iterator which traverses the distinct permutations of this linked list.

    Definition Classes
    SeqLike
    Example:
    1. "abb".permutations = Iterator(abb, bab, bba)

  139. 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.

    Note: may not terminate for infinite-sized collections.

    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
    GenSeqLike
  140. 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 of this linked list with respect to the * operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  141. 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
    TraversableOnceGenTraversableOnce
  142. def reduce [A1 >: A] (op: (A1, A1) ⇒ A1): A1

    Reduces the elements of this sequence using the specified associative binary operator.

    Reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeft and reduceRight methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

    The result of applying reduce operator op between all the elements if the collection is nonempty.

    Definition Classes
    TraversableOnceGenTraversableOnce
  143. def reduceLeft [B >: A] (op: (B, A) ⇒ B): B

    Definition Classes
    TraversableOnce
  144. 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.

    Note: will not terminate for infinite-sized collections.

    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
    TraversableOnceGenTraversableOnce
  145. def reduceOption [A1 >: A] (op: (A1, A1) ⇒ A1): Option[A1]

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    Optionally reduces the elements of this sequence using the specified associative binary operator.

    The order in which operations are performed on elements is unspecified and may be nondeterministic.

    Note this method has a different signature than the reduceLeftOption and reduceRightOption methods of the trait Traversable. The result of reducing may only be a supertype of this parallel collection's type parameter T.

    op

    A binary operator that must be associative.

    returns

    An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

    Definition Classes
    TraversableOnceGenTraversableOnce
  146. 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.

    Note: will not terminate for infinite-sized collections.

    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(x,,1,,, op(x,,2,,, ..., op(x,,n-1,,, x,,n,,)...))
    

    where x,,1,,, ..., x,,n,, are the elements of this linked list.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  147. 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.

    Note: will not terminate for infinite-sized collections.

    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
    TraversableOnceGenTraversableOnce
  148. def repr : This

    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 → GenTraversableLike
  149. def reverse : This

    Returns new linked list wih elements in reversed order.

    Returns new linked list wih elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    returns

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

    Definition Classes
    SeqLike → GenSeqLike
  150. def reverseIterator : Iterator[A]

    An iterator yielding elements in reversed order.

    An iterator yielding elements in reversed order.

    Note: will not terminate for infinite-sized collections.

    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
  151. 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.

    f

    the function to apply to each element.

    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.

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

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  152. def reverseMap [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[This, 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: will not terminate for infinite-sized collections.

    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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenSeqLike
  153. def reversed : List[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  154. def sameElements [B >: A] (that: Iterable[B]): Boolean

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  155. def sameElements (that: GenIterable[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
    GenIterableLike
  156. def sameElements [B >: A] (that: GenIterable[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.

    Note: will not terminate for infinite-sized collections.

    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 → GenIterableLike
  157. def scan [B >: A, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[This, B, That]): That

    Computes a prefix scan of the elements of the collection.

    Computes a prefix scan of the elements of the collection.

    Note: The neutral element z may be applied more than once.

    B

    element type of the resulting collection

    That

    type of the resulting collection

    z

    neutral element for the operator op

    op

    the associative operator for the scan

    cbf

    combiner factory which provides a combiner

    returns

    a new linked list containing the prefix scan of the elements in this linked list

    Definition Classes
    TraversableLike → GenTraversableLike
  158. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[This, 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.

    Note: will not terminate for infinite-sized collections.

    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 → GenTraversableLike
  159. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[This, 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. The head of the collection is the last cummulative result.

    Note: will not terminate for infinite-sized collections.

    Example:

       List(1, 2, 3, 4).scanRight(0)(_ + _) == List(10, 9, 7, 4, 0)
    
    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 → GenTraversableLike
    Annotations
    @migration
    Migration

    "This scanRight definition has changed in 2.9.\n" + "The previous behavior can be reproduced with scanRight.reverse."

  160. 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.

    Note: may not terminate for infinite-sized collections.

    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 → GenSeqLike
  161. def size : Int

    The size of this linked list, equivalent to length.

    The size of this linked list, equivalent to length.

    Note: will not terminate for infinite-sized collections.

    returns

    the number of elements in this linked list.

    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnceGenTraversableOnce
  162. def slice (from: Int, until: Int): This

    Selects an interval of elements.

    Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:

       from <= indexOf(x) < until
    
    from

    the lowest index to include from this linked list.

    until

    the highest index to EXCLUDE from this linked list.

    returns

    a linked list containing the elements greater than or equal to index from extending up to (but not including) index until of this linked list.

    Definition Classes
    IterableLikeTraversableLike → GenTraversableLike
  163. def sliding [B >: A] (size: Int, step: Int): Iterator[This]

    Definition Classes
    IterableLike
  164. def sliding [B >: A] (size: Int): Iterator[This]

    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

    Iterator#sliding

  165. def sortBy [B] (f: (A) ⇒ B)(implicit ord: Ordering[B]): This

    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
    Example:
    1.    val words = "The quick brown fox jumped over the lazy dog".split(' ')
         // this works because scala.Ordering will implicitly provide an Ordering[Tuple2[Int, Char]]
         words.sortBy(x => (x.length, x.head))
         res0: Array[String] = Array(The, dog, fox, the, lazy, over, brown, quick, jumped)
      
    See also

    scala.math.Ordering

    Note: will not terminate for infinite-sized collections.

  166. def sortWith (lt: (A, A) ⇒ Boolean): This

    Sorts this linked list according to a comparison function.

    Sorts this linked list according to a comparison function.

    Note: will not terminate for infinite-sized collections.

    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
    Example:
    1.    List("Steve", "Tom", "John", "Bob").sortWith(_.compareTo(_) < 0) =
         List("Bob", "John", "Steve", "Tom")
      
  167. def sorted [B >: A] (implicit ord: Ordering[B]): This

    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

    scala.math.Ordering

  168. def span (p: (A) ⇒ Boolean): (This, This)

    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 → GenTraversableLike
  169. def splitAt (n: Int): (This, This)

    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 → GenTraversableLike
  170. def startsWith [B] (that: Seq[B], offset: Int): Boolean

    Definition Classes
    SeqLike
    Annotations
    @bridge()
  171. def startsWith [B] (that: GenSeq[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 → GenSeqLike
  172. def startsWith [B] (that: Seq[B]): Boolean

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  173. def startsWith [B] (that: GenSeq[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
    GenSeqLike
  174. 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 → GenTraversableLike
  175. 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 of this linked list with respect to the + operator in num.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  176. 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
    TraversableOnceGenTraversableOnce
  177. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef
  178. def tail : This

    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 → GenTraversableLike
  179. def tails : Iterator[This]

    Iterates over the tails of this linked list.

    Iterates over the tails of this linked list. The first value will be this linked list and the final one will be an empty linked list, with the intervening values the results of successive applications of tail.

    returns

    an iterator over all the tails of this linked list

    Definition Classes
    TraversableLike
    Example:
    1. List(1,2,3).tails = Iterator(List(1,2,3), List(2,3), List(3), Nil)

  180. def take (n: Int): This

    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 → GenTraversableLike
  181. def takeRight (n: Int): This

    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
  182. def takeWhile (p: (A) ⇒ Boolean): This

    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 → GenTraversableLike
  183. def thisCollection : Seq[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
    SeqLikeIterableLikeTraversableLike
  184. def toArray : Array[A]

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

    [use case]

    Converts this linked list to an array.

    Note: will not terminate for infinite-sized collections.

    returns

    an array containing all elements of this linked list.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  185. def toArray [B >: A] (implicit arg0: ClassManifest[B]): Array[B]

    Converts this linked list to an array.

    Converts this linked list to an array.

    Note: will not terminate for infinite-sized collections.

    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
    TraversableOnceGenTraversableOnce
  186. def toBuffer [B >: A] : Buffer[B]

    Converts this linked list to a mutable buffer.

    Converts this linked list to a mutable buffer.

    Note: will not terminate for infinite-sized collections.

    returns

    a buffer containing all elements of this linked list.

    Definition Classes
    TraversableOnceGenTraversableOnce
  187. def toCollection (repr: This): 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
  188. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Converts this linked list to an indexed sequence.

    Converts this linked list to an indexed sequence.

    Note: will not terminate for infinite-sized collections.

    returns

    an indexed sequence containing all elements of this linked list.

    Definition Classes
    TraversableOnceGenTraversableOnce
  189. 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).

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterable containing all elements of this linked list.

    Definition Classes
    IterableLikeTraversableOnceGenTraversableOnce
  190. 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.

    Note: will not terminate for infinite-sized collections.

    returns

    an Iterator containing all elements of this linked list.

    Definition Classes
    TraversableLikeGenTraversableOnce
  191. def toList : List[A]

    Converts this linked list to a list.

    Converts this linked list to a list.

    Note: will not terminate for infinite-sized collections.

    returns

    a list containing all elements of this linked list.

    Definition Classes
    TraversableOnceGenTraversableOnce
  192. def toMap [T, U] : Map[T, U]

    [use case] Converts this linked list to a map.

    [use case]

    Converts this linked list to a map. This method is unavailable unless the elements are members of Tuple2, each ((T, U)) 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.

    Note: will not terminate for infinite-sized collections.

    returns

    a map containing all elements of this linked list.

    Attributes
    abstract
    Definition Classes
    GenTraversableOnce
  193. 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 ((T, U)) 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.

    Note: will not terminate for infinite-sized collections.

    returns

    a map containing all elements of this linked list.

    Definition Classes
    TraversableOnceGenTraversableOnce
  194. def toSeq : Seq[A]

    Converts this linked list to a sequence.

    Converts this linked list to a sequence.

    Note: will not terminate for infinite-sized collections.

    Overridden for efficiency.

    returns

    a sequence containing all elements of this linked list.

    Definition Classes
    SeqLike → GenSeqLike → TraversableOnceGenTraversableOnce
  195. def toSet [B >: A] : Set[B]

    Converts this linked list to a set.

    Converts this linked list to a set.

    Note: will not terminate for infinite-sized collections.

    returns

    a set containing all elements of this linked list.

    Definition Classes
    TraversableOnceGenTraversableOnce
  196. def toStream : Stream[A]

    Converts this linked list to a stream.

    Converts this linked list to a stream.

    Note: will not terminate for infinite-sized collections.

    returns

    a stream containing all elements of this linked list.

    Definition Classes
    IterableLikeTraversableLikeGenTraversableOnce
  197. 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
  198. 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.

    Note: will not terminate for infinite-sized collections.

    returns

    a Traversable containing all elements of this linked list.

    Definition Classes
    TraversableLikeTraversableOnceGenTraversableOnce
  199. def transform (f: (A) ⇒ A): LinkedListLike.this.type

    Applies a transformation function to all values contained in this sequence.

    Applies a transformation function to all values contained in this sequence. The transformation function produces new values from existing elements.

    f

    the transformation to apply

    returns

    the sequence itself.

    Definition Classes
    SeqLike
  200. 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.

    Note: will not terminate for infinite-sized collections.

    that

    the sequence to add.

    returns

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

    Attributes
    abstract
    Definition Classes
    SeqLike
  201. def union [B >: A, That] (that: GenSeq[B])(implicit bf: CanBuildFrom[This, 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.

    Note: will not terminate for infinite-sized collections.

    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.

    Note: will not terminate for infinite-sized collections.

    B

    the element type of the returned linked list.

    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 B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenSeqLike
  202. def union [B >: A, That] (that: Seq[B])(implicit bf: CanBuildFrom[This, B, That]): That

    Definition Classes
    GenSeqLike
    Annotations
    @bridge()
  203. def update (n: Int, x: A): Unit

    Replaces element at given index with a new value.

    Replaces element at given index with a new value.

    n

    the index of the element to replace.

    Definition Classes
    LinkedListLikeSeqLike
  204. 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 new linked list which is a copy of this linked list with the element at position index replaced by elem.

    Attributes
    abstract
    Definition Classes
    GenSeqLike
  205. def updated [B >: A, That] (index: Int, elem: B)(implicit bf: CanBuildFrom[This, 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. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.

    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 → GenSeqLike
  206. def view (from: Int, until: Int): SeqView[A, This]

    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
  207. def view : SeqView[A, This]

    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
  208. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  209. def wait (arg0: Long, arg1: Int): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  210. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  211. def withFilter (p: (A) ⇒ Boolean): FilterMonadic[A, This]

    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
  212. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[This, (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  213. def zip [B] (that: GenIterable[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 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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  214. def zip [A1 >: A, B, That] (that: GenIterable[B])(implicit bf: CanBuildFrom[This, (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 → GenIterableLike
  215. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[This, (A1, B), That]): That

    Definition Classes
    IterableLike
    Annotations
    @bridge()
  216. 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.

    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.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  217. def zipAll [B, A1 >: A, That] (that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[This, (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 → GenIterableLike
  218. 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 collection of type That containing pairs consisting of all elements of this linked list paired with their index. Indices start at 0.

    Attributes
    abstract
    Definition Classes
    GenIterableLike
  219. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[This, (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 → GenIterableLike
  220. def elements : Iterator[A]

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use iterator' instead

  221. 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
    Annotations
    @deprecated
    Deprecated

    use corresponds instead

  222. 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
    Annotations
    @deprecated
    Deprecated

    Use indexWhere(p) instead.

  223. 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
    Annotations
    @deprecated
    Deprecated

    use lastIndexWhere instead

  224. def first : A

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use head' instead

  225. def firstOption : Option[A]

    None if iterable is empty.

    None if iterable is empty.

    Definition Classes
    IterableLike
    Annotations
    @deprecated
    Deprecated

    use headOption' instead

  226. def projection : SeqView[A, This]

    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
    Annotations
    @deprecated
    Deprecated

    use view' instead

  227. def reversedElements : Iterator[A]

    Definition Classes
    SeqLike
    Annotations
    @deprecated
    Deprecated

    use reverseIterator' instead

Inherited from SeqLike[A, This]

Inherited from Cloneable[This]

Inherited from SeqLike[A, This]

Inherited from GenSeqLike[A, This]

Inherited from IterableLike[A, This]

Inherited from GenIterableLike[A, This]

Inherited from TraversableLike[A, This]

Inherited from GenTraversableLike[A, This]

Inherited from Parallelizable[A, ParSeq[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, This]

Inherited from HasNewBuilder[A, This]

Inherited from Equals

Inherited from AnyRef

Inherited from Any