scalax.io

LongTraversable

trait LongTraversable[+A] extends Traversable[A] with GenericTraversableTemplate[A, LongTraversable] with LongTraversableLike[A, LongTraversable[A]]

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
LongTraversable[A]
Linear Supertypes
LongTraversableLike[A, LongTraversable[A]], Traversable[A], GenTraversable[A], GenericTraversableTemplate[A, LongTraversable], TraversableLike[A, LongTraversable[A]], GenTraversableLike[A, LongTraversable[A]], Parallelizable[A, ParIterable[A]], TraversableOnce[A], GenTraversableOnce[A], FilterMonadic[A, LongTraversable[A]], HasNewBuilder[A, scalax.io.LongTraversable[A] @scala.annotation.unchecked.uncheckedVariance], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LongTraversable
  2. LongTraversableLike
  3. Traversable
  4. GenTraversable
  5. GenericTraversableTemplate
  6. TraversableLike
  7. GenTraversableLike
  8. Parallelizable
  9. TraversableOnce
  10. GenTraversableOnce
  11. FilterMonadic
  12. HasNewBuilder
  13. AnyRef
  14. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type Self = LongTraversable[A]

    Attributes
    protected
    Definition Classes
    TraversableLike
  2. class WithFilter extends FilterMonadic[A, Repr]

    Definition Classes
    TraversableLike

Abstract Value Members

  1. abstract def context: ResourceContext

    Definition Classes
    LongTraversableLike
  2. abstract def iterator: CloseableIterator[A]

    Attributes
    protected[scalax.io]
    Definition Classes
    LongTraversableLike

Concrete Value Members

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

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

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

    Definition Classes
    AnyRef → Any
  4. def ++[B >: A, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[LongTraversable[A], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  5. def ++:[B >: A, That](that: Traversable[B])(implicit bf: CanBuildFrom[LongTraversable[A], B, That]): That

    Definition Classes
    LongTraversableLike → TraversableLike
  6. def ++:[B >: A, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[LongTraversable[A], B, That]): That

    Definition Classes
    TraversableLike
  7. def /:[B](z: B)(op: (B, A) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  8. def :\[B](z: B)(op: (A, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  9. final def ==(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  11. def addString(b: StringBuilder): StringBuilder

    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder

    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: B)(seqop: (B, A) ⇒ B, combop: (B, B) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. 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.

    Definition Classes
    LongTraversableLike
    Exceptions thrown
    `IndexOutOfBoundsException`

    if idx does not satisfy 0 <= idx < length.

  16. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  17. def async(implicit executionContext: ExecutionContext = scalax.io.executionContext): AsyncLongTraversable[A]

  18. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  19. def collect[B, That](pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[LongTraversable[A], B, That]): That

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  20. def collectFirst[B](pf: PartialFunction[A, B]): Option[B]

    Definition Classes
    TraversableOnce
  21. def companion: GenericCompanion[LongTraversable]

    Definition Classes
    LongTraversable → Traversable → GenTraversable → GenericTraversableTemplate
  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.

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

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

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

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

    Definition Classes
    TraversableOnce → GenTraversableOnce
  31. def drop(n: Int): LongTraversable[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  32. def dropWhile(p: (A) ⇒ Boolean): LongTraversable[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  33. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  34. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  35. def exists(p: (A) ⇒ Boolean): Boolean

    Definition Classes
    LongTraversableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  36. def filter(p: (A) ⇒ Boolean): LongTraversable[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  37. def filterNot(p: (A) ⇒ Boolean): LongTraversable[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  38. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  39. def find(p: (A) ⇒ Boolean): Option[A]

    Definition Classes
    LongTraversableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  40. def flatMap[B, That](f: (A) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[LongTraversable[A], B, That]): That

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike → FilterMonadic
  41. def flatten[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LongTraversable[B]

    Definition Classes
    GenericTraversableTemplate
  42. def fold[A1 >: A](z: A1)(op: (A1, A1) ⇒ A1): A1

    Definition Classes
    TraversableOnce → GenTraversableOnce
  43. def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  44. def foldRight[B](z: B)(op: (A, B) ⇒ B): B

    Definition Classes
    LongTraversableLike → TraversableOnce → GenTraversableOnce
  45. def forall(p: (A) ⇒ Boolean): Boolean

    Definition Classes
    LongTraversableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def force: LongTraversable[A]

    Definition Classes
    LongTraversableLongTraversableLike
  47. def foreach[U](f: (A) ⇒ U): Unit

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  48. def genericBuilder[B]: Builder[B, LongTraversable[B]]

    Definition Classes
    GenericTraversableTemplate
  49. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  50. def groupBy[K](f: (A) ⇒ K): Map[K, LongTraversable[A]]

    Definition Classes
    TraversableLike → GenTraversableLike
  51. def grouped[That](size: Int)(implicit bf: CanBuildFrom[LongTraversable[A], Seq[A], That]): That

    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.

    Definition Classes
    LongTraversableLike
  52. def hasDefiniteSize: Boolean

    Definition Classes
    LongTraversableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  53. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  54. def head: A

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  55. def headOption: Option[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  56. def indexOf(elem: A, from: Int): Int

    [use case]

    [use case]
    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.

    Definition Classes
    LongTraversableLike
    Full Signature

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

  57. def indexOf(elem: A): Int

    [use case]

    [use case]
    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.

    Definition Classes
    LongTraversableLike
    Full Signature

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

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

    Definition Classes
    LongTraversableLike
  59. 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.

    Definition Classes
    LongTraversableLike
  60. 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.

    Definition Classes
    LongTraversableLike
  61. def indexWhere(p: (A) ⇒ Boolean): Long

    Definition Classes
    LongTraversableLike
  62. def init: LongTraversable[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  63. def inits: Iterator[LongTraversable[A]]

    Definition Classes
    TraversableLike
  64. def isDefinedAt(idx: Long): Boolean

    Definition Classes
    LongTraversableLike
  65. def isEmpty: Boolean

    Definition Classes
    LongTraversableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  66. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  67. final def isTraversableAgain: Boolean

    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  68. def last: A

    Definition Classes
    TraversableLike → GenTraversableLike
  69. def lastIndexOf(elem: A, end: Int): Int

    [use case]

    [use case]
    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.

    Definition Classes
    LongTraversableLike
    Full Signature

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

  70. def lastIndexOf(elem: A): Int

    [use case]

    [use case]
    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.

    Definition Classes
    LongTraversableLike
    Full Signature

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

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

    Definition Classes
    LongTraversableLike
  72. 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.

    Definition Classes
    LongTraversableLike
  73. def lastOption: Option[A]

    Definition Classes
    TraversableLike → GenTraversableLike
  74. def lcount(p: (A) ⇒ Boolean): Long

    Definition Classes
    LongTraversableLike
  75. def ldrop(n: Long): LongTraversable[A]

    The long equivalent of Traversable.

    The long equivalent of Traversable.drop

    Definition Classes
    LongTraversableLike
  76. 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 scalax.io.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 scalax.io.Continue or scalax.io.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 scalax.io.FoldResult which was returned by op

    Definition Classes
    LongTraversableLike
  77. 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

    Definition Classes
    LongTraversableLike
  78. def lslice(from: Long, until: Long): LongTraversable[A]

    Definition Classes
    LongTraversableLike
  79. def lsplitAt(n: Long): (LongTraversable[A], LongTraversable[A])

    The long equivalent of Traversable.

    The long equivalent of Traversable.splitAt

    Definition Classes
    LongTraversableLike
  80. def ltake(n: Long): LongTraversable[A]

    The long equivalent of Traversable.

    The long equivalent of Traversable.take

    Definition Classes
    LongTraversableLike
  81. def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[LongTraversable[A], B, That]): That

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike → FilterMonadic
  82. def max[B >: A](implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnce → GenTraversableOnce
  83. def maxBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnce → GenTraversableOnce
  84. def min[B >: A](implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnce → GenTraversableOnce
  85. def minBy[B](f: (A) ⇒ B)(implicit cmp: Ordering[B]): A

    Definition Classes
    TraversableOnce → GenTraversableOnce
  86. def mkString: String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  87. def mkString(sep: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  88. def mkString(start: String, sep: String, end: String): String

    Definition Classes
    TraversableOnce → GenTraversableOnce
  89. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  90. def newBuilder: LongTraversableBuilder[A, LongTraversable[A]]

    Attributes
    protected[this]
    Definition Classes
    LongTraversable → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  91. def nonEmpty: Boolean

    Definition Classes
    TraversableOnce → GenTraversableOnce
  92. final def notify(): Unit

    Definition Classes
    AnyRef
  93. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  94. def par: ParIterable[A]

    Definition Classes
    Parallelizable
  95. def parCombiner: Combiner[A, ParIterable[A]]

    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable
  96. def partition(p: (A) ⇒ Boolean): (LongTraversable[A], LongTraversable[A])

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  97. 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.

    Definition Classes
    LongTraversableLike
  98. def processor: CloseableIteratorProcessor[A]

    Create a processor that provides an API for declaring a processing pipeline of this LongTraversable in a very flexible way.

    Create a processor that provides an API for declaring a processing pipeline of this LongTraversable in a very flexible way.

    returns

    a processor for processing a LongTraversable

    Definition Classes
    LongTraversableLike
  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
    LongTraversableLike → TraversableOnce → GenTraversableOnce
  105. def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  106. def repr: LongTraversable[A]

    Definition Classes
    TraversableLike → GenTraversableLike
  107. def reversed: List[A]

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

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

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

    Definition Classes
    TraversableLike → GenTraversableLike
  111. def scanLeft[B, That](z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[LongTraversable[A], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
  112. def scanRight[B, That](z: B)(op: (A, B) ⇒ B)(implicit bf: CanBuildFrom[LongTraversable[A], B, That]): That

    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  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.

    Definition Classes
    LongTraversableLike
  114. def seq: Traversable[A]

    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  115. def size: Int

    Definition Classes
    LongTraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  116. def slice(from: Int, until: Int): LongTraversable[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  117. def sliding[That](size: Int, step: Int = 1)(implicit bf: CanBuildFrom[LongTraversable[A], Seq[A], That]): That

    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.

    Definition Classes
    LongTraversableLike
  118. def span(p: (A) ⇒ Boolean): (LongTraversable[A], LongTraversable[A])

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  119. def splitAt(n: Int): (LongTraversable[A], LongTraversable[A])

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  120. 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.

    Definition Classes
    LongTraversableLike
  121. 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.

    Definition Classes
    LongTraversableLike
  122. 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.

    Definition Classes
    LongTraversableLike
  123. 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.

    Definition Classes
    LongTraversableLike
  124. def stringPrefix: String

    Definition Classes
    TraversableLike → GenTraversableLike
  125. def sum[B >: A](implicit num: Numeric[B]): B

    Definition Classes
    TraversableOnce → GenTraversableOnce
  126. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  127. def tail: LongTraversable[A]

    Definition Classes
    TraversableLike → GenTraversableLike
  128. def tails: Iterator[LongTraversable[A]]

    Definition Classes
    TraversableLike
  129. def take(n: Int): LongTraversable[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  130. def takeWhile(p: (A) ⇒ Boolean): LongTraversable[A]

    Definition Classes
    LongTraversableLike → TraversableLike → GenTraversableLike
  131. def thisCollection: LongTraversable[A]

    Attributes
    protected[this]
    Definition Classes
    LongTraversableLike → TraversableLike
  132. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, A, Col[A]]): Col[A]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  133. def toArray[B >: A](implicit arg0: ClassTag[B]): Array[B]

    Definition Classes
    LongTraversableLike → TraversableOnce → GenTraversableOnce
  134. def toBuffer[B >: A]: Buffer[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  135. def toCollection(repr: LongTraversable[A]): LongTraversable[A]

    Attributes
    protected[this]
    Definition Classes
    LongTraversableLike → TraversableLike
  136. def toIndexedSeq: IndexedSeq[A]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  137. def toIterable: Iterable[A]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  138. def toIterator: Iterator[A]

    Definition Classes
    TraversableLike → GenTraversableOnce
  139. def toList: List[A]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  140. def toMap[T, U](implicit ev: <:<[A, (T, U)]): Map[T, U]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  141. def toSeq: Seq[A]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  142. def toSet[B >: A]: Set[B]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  143. def toStream: Stream[A]

    Definition Classes
    TraversableLike → GenTraversableOnce
  144. def toString(): String

    Definition Classes
    LongTraversable → TraversableLike → AnyRef → Any
  145. def toTraversable: Traversable[A]

    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  146. def toVector: Vector[A]

    Definition Classes
    TraversableOnce → GenTraversableOnce
  147. def transpose[B](implicit asTraversable: (A) ⇒ GenTraversableOnce[B]): LongTraversable[LongTraversable[B]]

    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  148. def unzip[A1, A2](implicit asPair: (A) ⇒ (A1, A2)): (LongTraversable[A1], LongTraversable[A2])

    Definition Classes
    GenericTraversableTemplate
  149. def unzip3[A1, A2, A3](implicit asTriple: (A) ⇒ (A1, A2, A3)): (LongTraversable[A1], LongTraversable[A2], LongTraversable[A3])

    Definition Classes
    GenericTraversableTemplate
  150. def view(from: Int, until: Int): TraversableView[A, LongTraversable[A]]

    Definition Classes
    TraversableLike
  151. def view: TraversableView[A, LongTraversable[A]]

    Definition Classes
    TraversableLike
  152. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()
  155. def withFilter(p: (A) ⇒ Boolean): FilterMonadic[A, LongTraversable[A]]

    Definition Classes
    TraversableLike → FilterMonadic
  156. def withIterator[U](f: (CloseableIterator[A]) ⇒ U): U

    Use the underlying iterator for this traversable.

    Use the underlying iterator for this traversable.

    Definition Classes
    LongTraversableLike
    Exceptions thrown
    AssertionError

    if the iterator is returned

    Note

    withIterator catches all exceptions and calls the error handler to handle the exceptions So exceptions must not be thrown in f as control flow exceptions.

    ,

    If the iterator is returned from this block an exception will be thrown because the iterator is invalid outside of this block and the behaviour is undefined

  157. def zip[B, A1 >: A, That](that: LongTraversable[B])(implicit bf: LongTraversableBuilder[(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.

    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 $coll and that. The length of the returned collection is the minimum of the lengths of this $coll and that.

    Definition Classes
    LongTraversableLike
  158. def zip[B, A1 >: A, That](that: Iterable[B])(implicit bf: LongTraversableBuilder[(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.

    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 $coll and that. The length of the returned collection is the minimum of the lengths of this $coll and that.

    Definition Classes
    LongTraversableLike
  159. def zipAll[B, A1 >: A, That](that: LongTraversable[B], thisElem: A1, thatElem: B)(implicit bf: LongTraversableBuilder[(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

    B

    the type of the second half of the returned pairs

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this $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.

    Definition Classes
    LongTraversableLike
  160. def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: LongTraversableBuilder[(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

    B

    the type of the second half of the returned pairs

    that

    the iterable providing the second half of each result pair

    thisElem

    the element to be used to fill up the result if this $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.

    Definition Classes
    LongTraversableLike
  161. def zipWithIndex: <error>

    [use case]

    [use case]
    returns

    A new $coll containing pairs consisting of all elements of this $coll paired with their index. Indices start at 0.

    Definition Classes
    LongTraversableLike
    Full Signature

    def zipWithIndex[A1 >: A, That](implicit bf: LongTraversableBuilder[(A1, Int), That]): That

    Example:
    1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))

Deprecated Value Members

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

    Definition Classes
    GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) use fold instead

Inherited from LongTraversableLike[A, LongTraversable[A]]

Inherited from Traversable[A]

Inherited from GenTraversable[A]

Inherited from GenericTraversableTemplate[A, LongTraversable]

Inherited from TraversableLike[A, LongTraversable[A]]

Inherited from GenTraversableLike[A, LongTraversable[A]]

Inherited from Parallelizable[A, ParIterable[A]]

Inherited from TraversableOnce[A]

Inherited from GenTraversableOnce[A]

Inherited from FilterMonadic[A, LongTraversable[A]]

Inherited from HasNewBuilder[A, scalax.io.LongTraversable[A] @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyRef

Inherited from Any

Ungrouped