scalax.io

LongTraversableLike

trait LongTraversableLike [+A, +Repr <: LongTraversableLike[A, Repr]] extends TraversableLike[A, Repr]

A traversable for use on very large datasets which cannot be indexed with Ints but instead require Longs for indexing.

This trait adds methods for accessing the extra portions of the dataset.

Self Type
LongTraversableLike[A, Repr]
Linear Supertypes
TraversableLike[A, Repr], GenTraversableLike[A, Repr], Parallelizable[A, ParIterable[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, Repr], HasNewBuilder[A, Repr], AnyRef, Any
Known Subclasses
Appended, ByteResourceTraversable, DroppedWhile, EmptyView, Filtered, FlatMapped, Forced, LSliced, LineTraversable, LongTraversable, LongTraversableView, LongTraversableViewLike, Mapped, TakenWhile, Transformed, Zipped, ZippedAll
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. LongTraversableLike
  2. TraversableLike
  3. GenTraversableLike
  4. Parallelizable
  5. TraversableOnce
  6. GenTraversableOnce
  7. FilterMonadic
  8. HasNewBuilder
  9. AnyRef
  10. Any
Visibility
  1. Public
  2. All

Type Members

  1. type Self = Repr

    Attributes
    protected
    Definition Classes
    TraversableLike

Abstract Value Members

  1. def iterator : CloseableIterator[A]

    Attributes
    protected[io] abstract

  2. def newBuilder : Builder[A, Repr]

    Attributes
    protected[this] abstract
    Definition Classes
    TraversableLike → HasNewBuilder

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

    Attributes
    final
    Definition Classes
    Any

  3. def ## (): Int

    Attributes
    final
    Definition Classes
    AnyRef → Any

  4. def ++ [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike
    Annotations
    @bridge()

  5. def ++ [B >: A, That] (that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  6. def ++: [B >: A, That] (that: Traversable[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike

  7. def ++: [B >: A, That] (that: TraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike

  8. def /: [B] (z: B)(op: (B, A) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  9. def /:\ [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    GenTraversableOnce

  10. def :\ [B] (z: B)(op: (A, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  11. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  12. def == (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  13. def addString (b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce

  14. def addString (b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce

  15. def addString (b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce

  16. def aggregate [B] (z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  17. def apply (idx: Long): A

    Selects an element by its index in the $coll.

    Selects an element by its index in the $coll.

    idx

    The index to select.

    returns

    the element of this $coll at index idx, where 0 indicates the first element.

  18. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  19. def clone (): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  20. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  21. def collectFirst [B] (pf: PartialFunction[A, B]): Option[B]

    Definition Classes
    TraversableOnce

  22. def containsSlice [B] (that: Seq[B], start: Long): Boolean

    Tests whether this $coll contains a given sequence as a slice.

    Tests whether this $coll contains a given sequence as a slice. $mayNotTerminateInf

    that

    the sequence to test

    returns

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

  23. def containsSlice [B] (that: Seq[B]): Boolean

    Tests whether this $coll contains a given sequence as a slice.

    Tests whether this $coll contains a given sequence as a slice. $mayNotTerminateInf

    that

    the sequence to test

    returns

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

  24. def copyToArray [B >: A] (xs: Array[B], start: Int, len: Int): Unit

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  25. def copyToArray [B >: A] (xs: Array[B]): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  26. def copyToArray [B >: A] (xs: Array[B], start: Int): Unit

    Definition Classes
    TraversableOnce → GenTraversableOnce

  27. def copyToBuffer [B >: A] (dest: Buffer[B]): Unit

    Definition Classes
    TraversableOnce

  28. def corresponds [B] (that: LongTraversable[B])(p: (A, B) ⇒ Boolean): Boolean

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

    Tests whether every element of this $coll 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 $coll and y of that, otherwise false.

  29. def corresponds [B] (that: Seq[B])(p: (A, B) ⇒ Boolean): Boolean

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

    Tests whether every element of this $coll 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 $coll and y of that, otherwise false.

  30. def count (p: (A) ⇒ Boolean): Int

    Definition Classes
    TraversableOnce → GenTraversableOnce

  31. def drop (n: Int): Repr

    Definition Classes
    TraversableLike → GenTraversableLike

  32. def dropWhile (p: (A) ⇒ Boolean): Repr

    Definition Classes
    TraversableLike → GenTraversableLike

  33. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  34. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  36. def filter (p: (A) ⇒ Boolean): Repr

    Definition Classes
    TraversableLike → GenTraversableLike

  37. def filterNot (p: (A) ⇒ Boolean): Repr

    Definition Classes
    TraversableLike → GenTraversableLike

  38. def finalize (): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()

  39. def find (p: (A) ⇒ Boolean): Option[A]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  40. def flatMap [B, That] (f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  41. def fold [A1 >: A] (z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

  42. def foldLeft [B] (z: B)(op: (B, A) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  43. def foldRight [B] (z: B)(op: (A, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  44. def forall (p: (A) ⇒ Boolean): Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  45. def foreach [U] (f: (A) ⇒ U): Unit

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic

  46. def getClass (): java.lang.Class[_]

    Attributes
    final
    Definition Classes
    AnyRef → Any

  47. def groupBy [K] (f: (A) ⇒ K): Map[K, Repr]

    Definition Classes
    TraversableLike → GenTraversableLike

  48. def grouped (size: Int): LongTraversable[Seq[A]]

    Partitions the data into fixed size blocks (same as sliding(size,size).

    Partitions the data into fixed size blocks (same as sliding(size,size).

    size

    the number of elements per group

    returns

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

  49. def hasDefiniteSize : Boolean

    Definition Classes
    LongTraversableLike → TraversableLike → TraversableOnce → GenTraversableOnce

  50. def hashCode (): Int

    Definition Classes
    AnyRef → Any

  51. def head : A

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike

  52. def headOption : Option[A]

    Definition Classes
    LongTraversableLike → TraversableLike

  53. def indexOf (elem: A, from: Int): Int

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

    [use case]

    Finds index of first occurrence of some value in this $coll 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 $coll that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract

  54. def indexOf [B >: A] (elem: B, from: Long): Long

    Finds index of first occurrence of some value in this $coll after or at some start index.

    Finds index of first occurrence of some value in this $coll after or at some start index.

    $mayNotTerminateInf

    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 $coll that is equal (wrt ==) to elem, or -1, if none exists.

  55. def indexOf (elem: A): Int

    [use case] Finds index of first occurrence of some value in this $coll.

    [use case]

    Finds index of first occurrence of some value in this $coll.

    elem

    the element value to search for.

    returns

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

    Attributes
    abstract

  56. def indexOf [B >: A] (elem: B): Long

    Finds index of first occurrence of some value in this $coll.

    Finds index of first occurrence of some value in this $coll.

    $mayNotTerminateInf

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

  57. def indexOfSlice [B >: A] (that: Seq[B], from: Long): Long

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

    Finds first index after or at a start index where this $coll contains a given sequence as a slice. $mayNotTerminateInf

    that

    the sequence to test

    from

    the start index

    returns

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

  58. def indexOfSlice [B >: A] (that: Seq[B]): Long

    Finds first index where this $coll contains a given sequence as a slice.

    Finds first index where this $coll contains a given sequence as a slice. $mayNotTerminateInf

    that

    the sequence to test

    returns

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

  59. def indexWhere (p: (A) ⇒ Boolean, from: Long): Long

    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.

    $mayNotTerminateInf

    p

    the predicate used to test elements.

    from

    the start index

    returns

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

  60. def indexWhere (p: (A) ⇒ Boolean): Long

  61. def init : Repr

    Definition Classes
    TraversableLike

  62. def inits : Iterator[Repr]

    Definition Classes
    TraversableLike

  63. def isDefinedAt (idx: Long): Boolean

  64. def isEmpty : Boolean

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  65. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  66. def isTraversableAgain : Boolean

    Attributes
    final
    Definition Classes
    GenTraversableLike → GenTraversableOnce

  67. def last : A

    Definition Classes
    TraversableLike

  68. def lastIndexOf (elem: A, end: Int): Int

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

    [use case]

    Finds index of last occurrence of some value in this $coll 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 $coll that is equal (wrt ==) to elem, or -1, if none exists.

    Attributes
    abstract

  69. def lastIndexOf [B >: A] (elem: B, end: Long): Long

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

    Finds index of last occurrence of some value in this $coll 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 $coll that is equal (wrt ==) to elem, or -1, if none exists.

  70. def lastIndexOf (elem: A): Int

    [use case] Finds index of last occurrence of some value in this $coll.

    [use case]

    Finds index of last occurrence of some value in this $coll.

    elem

    the element value to search for.

    returns

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

    Attributes
    abstract

  71. def lastIndexOf [B >: A] (elem: B): Long

    Finds index of last occurrence of some value in this $coll.

    Finds index of last occurrence of some value in this $coll.

    $willNotTerminateInf

    B

    the type of the element elem.

    elem

    the element value to search for.

    returns

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

  72. def lastIndexWhere (p: (A) ⇒ Boolean, end: Long): Long

    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.

    Always takes linear time and traverses entire traversal

    p

    the predicate used to test elements.

    returns

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

  73. def lastIndexWhere (p: (A) ⇒ Boolean): Long

    Finds index of last element satisfying some predicate.

    Finds index of last element satisfying some predicate.

    $willNotTerminateInf

    p

    the predicate used to test elements.

    returns

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

  74. def lastOption : Option[A]

    Definition Classes
    TraversableLike

  75. def lcount (p: (A) ⇒ Boolean): Long

  76. def ldrop (n: Long): Repr

    The long equivalent of Traversable.

    The long equivalent of Traversable.drop

  77. def limitFold [U] (init: U)(op: (U, A) ⇒ FoldResult[U]): U

    A foldLeft operation that can be terminated without processing the entire collection.

    A foldLeft operation that can be terminated without processing the entire collection.

    Unlike a normal fold, the function passed to limitFold returns a FoldResult which both provides the value that is to be passed to the next stage of the fold as well as represents if the fold should continue or terminate.

    init

    the value to seed the operation with. IE the value that is passed as the accumulator for the first value of the fold operation

    op

    the operation that combines the current and previous versions. The input is the (acc,next) where acc is the result from the previous call and next is the next value in the collection to be processed. The return value of the op is Either Continue or End indicating if the process should continue to next element or terminate, returning the value contained in the result object

    returns

    the last value contained in the FoldResult which was returned by op

  78. def lsize : Long

    The long equivalent of Traversable.

    The long equivalent of Traversable.size

    NOT recommended for use since it might trigger a full traversal of the traversable

  79. def lslice (from: Long, until: Long): Repr

    The long equivalent of Traversable.

    The long equivalent of Traversable.slice

  80. def lsplitAt (n: Long): (Repr, Repr)

    The long equivalent of Traversable.

    The long equivalent of Traversable.splitAt

  81. def ltake (n: Long): Repr

    The long equivalent of Traversable.

    The long equivalent of Traversable.take

  82. def lview (from: Long, until: Long): LongTraversableView[A, Repr]

    The long equivalent of Traversable.

    The long equivalent of Traversable.view(from,to)

  83. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  84. def max [B >: A] (implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnce → GenTraversableOnce

  85. def maxBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnce → GenTraversableOnce

  86. def min [B >: A] (implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnce → GenTraversableOnce

  87. def minBy [B] (f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnce → GenTraversableOnce

  88. def mkString : String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  89. def mkString (sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  90. def mkString (start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce

  91. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  92. def nonEmpty : Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce

  93. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  94. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  95. def par : ParIterable[A]

    Definition Classes
    Parallelizable

  96. def parCombiner : Combiner[A, ParIterable[A]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  97. def partition (p: (A) ⇒ Boolean): (Repr, Repr)

    Definition Classes
    TraversableLike → GenTraversableLike

  98. def prefixLength (p: (A) ⇒ Boolean): Long

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

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

    p

    the predicate used to test elements.

    returns

    the length of the longest prefix of this $coll such that every element of the segment satisfies the predicate p.

  99. def product [B >: A] (implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  100. def reduce [A1 >: A] (op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Definition Classes
    TraversableOnce

  102. def reduceLeftOption [B >: A] (op: (B, A) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  103. def reduceOption [A1 >: A] (op: (A1, A1) ⇒ A1): Option[A1]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  104. def reduceRight [B >: A] (op: (A, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  105. def reduceRightOption [B >: A] (op: (A, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  106. def repr : Repr

    Definition Classes
    TraversableLike → GenTraversableLike

  107. def reversed : List[A]

    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  108. def sameElements [B >: A] (that: LongTraversable[B]): Boolean

  109. def sameElements [B >: A] (that: Iterable[B]): Boolean

  110. def scan [B >: A, That] (z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  111. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike

  112. def scanRight [B, That] (z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

  113. def segmentLength (p: (A) ⇒ Boolean, from: Long = 0): Long

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

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

    p

    the predicate used to test elements.

    from

    the index where the search starts.

    returns

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

  114. def size : Int

    Definition Classes
    LongTraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce

  115. def slice (from: Int, until: Int): Repr

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike

  116. def sliding (size: Int, step: Int = 1): LongTraversable[Seq[A]]

    Groups elements in fixed size blocks by passing a "sliding window" over them.

    Groups elements in fixed size blocks by passing a "sliding window" over them.

    This is based on Iterator#sliding but does not return an iterator to ensure that a resource is not left open.

    size

    the number of elements per group

    step

    the distance between the first elements of successive groups (defaults to 1)

    returns

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

  117. def span (p: (A) ⇒ Boolean): (Repr, Repr)

    Definition Classes
    TraversableLike → GenTraversableLike

  118. def splitAt (n: Int): (Repr, Repr)

    Definition Classes
    TraversableLike → GenTraversableLike

  119. def startsWith [B] (that: Seq[B]): Boolean

    Tests whether this $coll starts with the given sequence.

    Tests whether this $coll starts with the given sequence.

    that

    the sequence to test

    returns

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

  120. def startsWith [B] (that: Seq[B], offset: Long): Boolean

    Tests whether this $coll contains the given sequence at a given index.

    Tests whether this $coll 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 $coll at index offset, otherwise false.

  121. def startsWith [B] (that: LongTraversable[B]): Boolean

    Tests whether this $coll starts with the given sequence.

    Tests whether this $coll starts with the given sequence.

    that

    the sequence to test

    returns

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

  122. def startsWith [B] (that: LongTraversable[B], offset: Long): Boolean

    Tests whether this $coll contains the given sequence at a given index.

    Tests whether this $coll 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 $coll at index offset, otherwise false.

  123. def stringPrefix : String

    Definition Classes
    TraversableLike → GenTraversableLike

  124. def sum [B >: A] (implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce

  125. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef

  126. def tail : Repr

    Definition Classes
    TraversableLike → GenTraversableLike

  127. def tails : Iterator[Repr]

    Definition Classes
    TraversableLike

  128. def take (n: Int): Repr

    Definition Classes
    TraversableLike → GenTraversableLike

  129. def takeWhile (p: (A) ⇒ Boolean): Repr

    Definition Classes
    TraversableLike → GenTraversableLike

  130. def thisCollection : LongTraversable[A]

    Attributes
    protected[this]
    Definition Classes
    LongTraversableLike → TraversableLike

  131. def toArray [B >: A] (implicit arg0: ClassManifest[B]): Array[B]

    Definition Classes
    LongTraversableLike → TraversableOnce → GenTraversableOnce

  132. def toBuffer [B >: A] : Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  133. def toCollection (repr: Repr): LongTraversable[A]

    Attributes
    protected[this]
    Definition Classes
    LongTraversableLike → TraversableLike

  134. def toIndexedSeq [B >: A] : IndexedSeq[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  135. def toIterable : Iterable[A]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  136. def toIterator : Iterator[A]

    Definition Classes
    TraversableLike → GenTraversableOnce

  137. def toList : List[A]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  138. def toMap [T, U] (implicit ev: <:<[A, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  139. def toSeq : Seq[A]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  140. def toSet [B >: A] : Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce

  141. def toStream : Stream[A]

    Definition Classes
    TraversableLike → GenTraversableOnce

  142. def toString (): String

    Definition Classes
    TraversableLike → AnyRef → Any

  143. def toTraversable : Traversable[A]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  144. def view (from: Int, until: Int): LongTraversableView[A, Repr]

    Definition Classes
    LongTraversableLike → TraversableLike

  145. def view : LongTraversableView[A, Repr]

    Definition Classes
    LongTraversableLike → TraversableLike

  146. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  147. def wait (arg0: Long, arg1: Int): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  148. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  149. def withFilter (p: (A) ⇒ Boolean): FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike → FilterMonadic

  150. def zip [A1 >: A, B, That] (that: LongTraversable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That

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

    Returns a $coll formed from this $coll 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

    $zipthatinfo

    that

    The iterable providing the second half of each result pair

    bf

    $zipbfinfo

    returns

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

  151. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That

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

    Returns a $coll formed from this $coll 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

    $zipthatinfo

    that

    The iterable providing the second half of each result pair

    bf

    $zipbfinfo

    returns

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

  152. def zipAll [B, A1 >: A, That] (that: LongTraversable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That

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

    Returns a $coll formed from this $coll 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.

    $orderDependent

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this $coll is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this $coll.

    returns

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

  153. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Repr, (A1, B), That]): That

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

    Returns a $coll formed from this $coll 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.

    $orderDependent

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this $coll is shorter than that.

    thatElem

    the element to be used to fill up the result if that is shorter than this $coll.

    returns

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

  154. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[Repr, (A1, Int), That]): That

    Zips this $coll with its indices.

    Zips this $coll with its indices.

    $orderDependent

    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 $coll paired with their index. Indices start at 0.

Inherited from TraversableLike[A, Repr]

Inherited from GenTraversableLike[A, Repr]

Inherited from Parallelizable[A, ParIterable[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, Repr]

Inherited from HasNewBuilder[A, Repr]

Inherited from AnyRef

Inherited from Any