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.

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.

go to: companion
linear super types: LongTraversableLike[A, LongTraversable[A]], Traversable[A], GenericTraversableTemplate[A, LongTraversable], TraversableLike[A, LongTraversable[A]], Parallelizable[A, ParIterable[A]], TraversableOnce[A], FilterMonadic[A, LongTraversable[A]], HasNewBuilder[A, LongTraversable[A]], AnyRef, Any
known subclasses: LongTraversableViewLike, LongTraversableView, TakenWhile, Filtered, Appended, FlatMapped, Mapped, LSliced, Forced, EmptyView, Transformed, DroppedWhile, LineTraversable
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. LongTraversable
  2. LongTraversableLike
  3. Traversable
  4. GenericTraversableTemplate
  5. TraversableLike
  6. Parallelizable
  7. TraversableOnce
  8. FilterMonadic
  9. HasNewBuilder
  10. AnyRef
  11. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Type Members

  1. type Self = LongTraversable[A]

    attributes: protected
    definition classes: TraversableLike

Value Members

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

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

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

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

    arg0

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

    returns

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

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

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

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

    attributes: final
    definition classes: AnyRef
  6. def ++ [B >: A, That] ( that : TraversableOnce[B] )(implicit bf : CanBuildFrom[LongTraversable[A], B, That] ) : That

    definition classes: TraversableLike
  7. def ++: [B >: A, That] ( that : Traversable[B] )(implicit bf : CanBuildFrom[LongTraversable[A], B, That] ) : That

    definition classes: TraversableLike
  8. def ++: [B >: A, That] ( that : TraversableOnce[B] )(implicit bf : CanBuildFrom[LongTraversable[A], B, That] ) : That

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

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

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

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

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

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

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

    arg0

    the object to compare against this object for equality.

    returns

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

    attributes: final
    definition classes: Any
  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 asInstanceOf [T0] : T0

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

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

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the 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 typed.

    returns

    the receiver object.

    attributes: final
    definition classes: Any
  17. def clone () : AnyRef

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

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

    The default implementation of the clone method is platform dependent.

    returns

    a copy of the receiver object.

    attributes: protected[lang]
    definition classes: AnyRef
    annotations: @throws()
  18. def collect [B, That] ( pf : PartialFunction[A, B] )(implicit bf : CanBuildFrom[LongTraversable[A], B, That] ) : That

    definition classes: TraversableLike
  19. def collectFirst [B] ( pf : PartialFunction[A, B] ) : Option[B]

    definition classes: TraversableOnce
  20. def companion : GenericCompanion[LongTraversable]

    definition classes: LongTraversable → Traversable → GenericTraversableTemplate
  21. def copyToArray [B >: A] ( xs : Array[B] , start : Int , len : Int ) : Unit

    definition classes: TraversableLike → TraversableOnce
  22. def copyToArray [B >: A] ( xs : Array[B] ) : Unit

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

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

    definition classes: TraversableOnce
  25. def count ( p : (A) ⇒ Boolean ) : Int

    definition classes: TraversableOnce
  26. def drop ( n : Int ) : LongTraversable[A]

    definition classes: TraversableLike
  27. def dropWhile ( p : (A) ⇒ Boolean ) : LongTraversable[A]

    definition classes: TraversableLike
  28. def eq ( arg0 : AnyRef ) : Boolean

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

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

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

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

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

    arg0

    the object to compare against this object for reference equality.

    returns

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

    attributes: final
    definition classes: AnyRef
  29. def equals ( arg0 : Any ) : Boolean

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    This method is used to compare the receiver object (this) with the argument object (arg0) for equivalence.

    The default implementations of this method is an [http://en.wikipedia.org/wiki/Equivalence_relation equivalence relation]: * It is reflexive: for any instance x of type Any, x.equals(x) should return true. * It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true. * It is transitive: for any instances x, y, and z of type AnyRef if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

    If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is often necessary to override hashCode to ensure that objects that are "equal" (o1.equals(o2) returns true) hash to the same scala.Int (o1.hashCode.equals(o2.hashCode)).

    arg0

    the object to compare against this object for equality.

    returns

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

    definition classes: AnyRef → Any
  30. def exists ( p : (A) ⇒ Boolean ) : Boolean

    definition classes: TraversableLike → TraversableOnce
  31. def filter ( p : (A) ⇒ Boolean ) : LongTraversable[A]

    definition classes: TraversableLike
  32. def filterNot ( p : (A) ⇒ Boolean ) : LongTraversable[A]

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

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

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

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

    attributes: protected[lang]
    definition classes: AnyRef
    annotations: @throws()
  34. def find ( p : (A) ⇒ Boolean ) : Option[A]

    definition classes: TraversableLike → TraversableOnce
  35. def flatMap [B, That] ( f : (A) ⇒ TraversableOnce[B] )(implicit bf : CanBuildFrom[LongTraversable[A], B, That] ) : That

    definition classes: TraversableLike → FilterMonadic
  36. def flatten [B] (implicit asTraversable : (A) ⇒ TraversableOnce[B] ) : LongTraversable[B]

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

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

    definition classes: TraversableOnce
  39. def forall ( p : (A) ⇒ Boolean ) : Boolean

    definition classes: TraversableLike → TraversableOnce
  40. def foreach [U] ( f : (A) ⇒ U ) : Unit

    attributes: abstract
    definition classes: GenericTraversableTemplate
  41. def genericBuilder [B] : Builder[B, LongTraversable[B]]

    definition classes: GenericTraversableTemplate
  42. def getClass () : java.lang.Class[_]

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

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

    The nature of the representation is platform dependent.

    returns

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

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

    definition classes: TraversableLike
  44. def hasDefiniteSize : Boolean

    definition classes: LongTraversableLike → TraversableLike → TraversableOnce
  45. def hashCode () : Int

    Returns a hash code value for the object.

    Returns a hash code value for the object.

    The default hashing algorithm is platform dependent.

    Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

    returns

    the hash code value for the object.

    definition classes: AnyRef → Any
  46. def head : A

    definition classes: TraversableLike
  47. def headOption : Option[A]

    definition classes: TraversableLike
  48. def init : LongTraversable[A]

    definition classes: TraversableLike
  49. def inits : Iterator[LongTraversable[A]]

    definition classes: TraversableLike
  50. def isEmpty : Boolean

    definition classes: TraversableLike → TraversableOnce
  51. def isInstanceOf [T0] : Boolean

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

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

    Note that the test result of the test is modulo Scala's erasure semantics. Therefore the 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 requested typed.

    returns

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

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

    attributes: final
    definition classes: TraversableLike → TraversableOnce
  53. def last : A

    definition classes: TraversableLike
  54. def lastOption : Option[A]

    definition classes: TraversableLike
  55. def lcount ( p : (A) ⇒ Boolean ) : Long

    definition classes: LongTraversableLike
  56. def ldrop ( n : Long ) : LongTraversable[A]

    The long equivalent of Traversable.

    The long equivalent of Traversable.drop

    definition classes: LongTraversableLike
  57. 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

    definition classes: LongTraversableLike
  58. 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
  59. def lslice ( from : Long , until : Long ) : LongTraversable[A]

    The long equivalent of Traversable.

    The long equivalent of Traversable.slice

    definition classes: LongTraversableLike
  60. def lsplitAt ( n : Long ) : (LongTraversable[A], LongTraversable[A])

    The long equivalent of Traversable.

    The long equivalent of Traversable.splitAt

    definition classes: LongTraversableLike
  61. def ltake ( n : Long ) : LongTraversable[A]

    The long equivalent of Traversable.

    The long equivalent of Traversable.take

    definition classes: LongTraversableLike
  62. def lview ( from : Long , until : Long ) : LongTraversableView[A, LongTraversable[A]]

    The long equivalent of Traversable.

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

    definition classes: LongTraversableLike
  63. def map [B, That] ( f : (A) ⇒ B )(implicit bf : CanBuildFrom[LongTraversable[A], B, That] ) : That

    definition classes: TraversableLike → FilterMonadic
  64. def max [B >: A] (implicit cmp : Ordering[B] ) : A

    definition classes: TraversableOnce
  65. def maxBy [B] ( f : (A) ⇒ B )(implicit cmp : Ordering[B] ) : A

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

    definition classes: TraversableOnce
  67. def minBy [B] ( f : (A) ⇒ B )(implicit cmp : Ordering[B] ) : A

    definition classes: TraversableOnce
  68. def mkString : String

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

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

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

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

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

    arg0

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

    returns

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

    attributes: final
    definition classes: AnyRef
  72. def newBuilder : Builder[A, LongTraversable[A]]

    attributes: protected[this]
    definition classes: GenericTraversableTemplate → HasNewBuilder
  73. def nonEmpty : Boolean

    definition classes: TraversableOnce
  74. 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
  75. 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
  76. def par : ParIterable[A]

    definition classes: Parallelizable → Parallelizable
  77. def parCombiner : Combiner[A, ParIterable[A]]

    attributes: protected[this]
    definition classes: TraversableLike → Parallelizable
  78. def partition ( p : (A) ⇒ Boolean ) : (LongTraversable[A], LongTraversable[A])

    definition classes: TraversableLike
  79. def product [B >: A] (implicit num : Numeric[B] ) : B

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

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

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

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

    definition classes: TraversableOnce
  84. def repr : LongTraversable[A]

    definition classes: TraversableLike
  85. def reversed : List[A]

    attributes: protected[this]
    definition classes: TraversableOnce
  86. def scanLeft [B, That] ( z : B )( op : (B, A) ⇒ B )(implicit bf : CanBuildFrom[LongTraversable[A], B, That] ) : That

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

    definition classes: TraversableLike
    annotations: @migration()
  88. def seq : TraversableOnce[A]

    definition classes: TraversableOnce
  89. def size : Int

    definition classes: TraversableOnce
  90. def slice ( from : Int , until : Int ) : LongTraversable[A]

    The long equivalent of count in Traversable.

    The long equivalent of count in Traversable.

    definition classes: LongTraversableLike → TraversableLike
  91. def span ( p : (A) ⇒ Boolean ) : (LongTraversable[A], LongTraversable[A])

    definition classes: TraversableLike
  92. def splitAt ( n : Int ) : (LongTraversable[A], LongTraversable[A])

    definition classes: TraversableLike
  93. def stringPrefix : String

    definition classes: TraversableLike
  94. def sum [B >: A] (implicit num : Numeric[B] ) : B

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

    attributes: final
    definition classes: AnyRef
  96. def tail : LongTraversable[A]

    definition classes: TraversableLike
  97. def tails : Iterator[LongTraversable[A]]

    definition classes: TraversableLike
  98. def take ( n : Int ) : LongTraversable[A]

    definition classes: TraversableLike
  99. def takeWhile ( p : (A) ⇒ Boolean ) : LongTraversable[A]

    definition classes: TraversableLike
  100. def thisCollection : LongTraversable[A]

    attributes: protected[this]
    definition classes: LongTraversableLike → TraversableLike
  101. def toArray [B >: A] (implicit arg0 : ClassManifest[B] ) : Array[B]

    definition classes: LongTraversableLike → TraversableOnce
  102. def toBuffer [B >: A] : Buffer[B]

    definition classes: TraversableOnce
  103. def toCollection ( repr : LongTraversable[A] ) : LongTraversable[A]

    attributes: protected[this]
    definition classes: LongTraversableLike → TraversableLike
  104. def toIndexedSeq [B >: A] : IndexedSeq[B]

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

    definition classes: TraversableOnce
  106. def toIterator : Iterator[A]

    definition classes: TraversableLike → TraversableOnce
  107. def toList : List[A]

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

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

    definition classes: TraversableOnce
  110. def toSet [B >: A] : Set[B]

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

    definition classes: TraversableLike → TraversableOnce
  112. def toString () : String

    Returns a string representation of the object.

    Returns a string representation of the object.

    The default representation is platform dependent.

    returns

    a string representation of the object.

    definition classes: LongTraversable → TraversableLike → AnyRef → Any
  113. def toTraversable : Traversable[A]

    definition classes: TraversableLike → TraversableOnce
  114. def transpose [B] (implicit asTraversable : (A) ⇒ TraversableOnce[B] ) : LongTraversable[LongTraversable[B]]

    definition classes: GenericTraversableTemplate
    annotations: @migration()
  115. def unzip [A1, A2] (implicit asPair : (A) ⇒ (A1, A2) ) : (LongTraversable[A1], LongTraversable[A2])

    definition classes: GenericTraversableTemplate
  116. def unzip3 [A1, A2, A3] (implicit asTriple : (A) ⇒ (A1, A2, A3) ) : (LongTraversable[A1], LongTraversable[A2], LongTraversable[A3])

    definition classes: GenericTraversableTemplate
  117. def view ( from : Int , until : Int ) : LongTraversableView[A, LongTraversable[A]]

    definition classes: LongTraversableLike → TraversableLike
  118. def view : LongTraversableView[A, LongTraversable[A]]

    definition classes: LongTraversableLike → TraversableLike
  119. def wait () : Unit

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  120. def wait ( arg0 : Long , arg1 : Int ) : Unit

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  121. def wait ( arg0 : Long ) : Unit

    attributes: final
    definition classes: AnyRef
    annotations: @throws()
  122. def withFilter ( p : (A) ⇒ Boolean ) : FilterMonadic[A, LongTraversable[A]]

    definition classes: TraversableLike → FilterMonadic

Inherited from LongTraversableLike[A, LongTraversable[A]]

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, LongTraversable]

Inherited from TraversableLike[A, LongTraversable[A]]

Inherited from Parallelizable[A, ParIterable[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, LongTraversable[A]]

Inherited from HasNewBuilder[A, LongTraversable[A]]

Inherited from AnyRef

Inherited from Any