net.sf.phiweave.collection

ParallelSeq

class ParallelSeq[T] extends Seq[T]

go to: companion
Inherited
  1. Hide All
  2. Show all
  1. Seq
  2. SeqLike
  3. Iterable
  4. IterableLike
  5. Equals
  6. Traversable
  7. GenericTraversableTemplate
  8. TraversableLike
  9. TraversableOnce
  10. FilterMonadic
  11. HasNewBuilder
  12. PartialFunction
  13. Function1
  14. AnyRef
  15. Any
Visibility
  1. Public
  2. All

Instance constructors

  1. new ParallelSeq(seq: Seq[T])

Type Members

  1. type Self = Seq[T]

    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 >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: TraversableLike

  7. def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: SeqLike

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

    definition classes: TraversableOnce

  9. def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: SeqLike

  10. def :\[B](z: B)(op: (T, 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 andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]

    definition classes: PartialFunction → Function1

  17. def apply(idx: Int): T

    definition classes: ParallelSeq → SeqLike → Function1

  18. def asInstanceOf[T0]: T0

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

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

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

    returns

    the receiver object.

    attributes: final
    definition classes: Any

  19. def canEqual(that: Any): Boolean

    definition classes: IterableLike → Equals

  20. 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
    definition classes: AnyRef

  21. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: TraversableLike

  22. def companion: GenericCompanion[Seq[A][A]]

    definition classes: Seq → Iterable → Traversable → GenericTraversableTemplate

  23. def compose[A](g: (A) ⇒ Int): (A) ⇒ T

    definition classes: Function1

  24. def contains(elem: Any): Boolean

    definition classes: SeqLike

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

    definition classes: SeqLike

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

    definition classes: IterableLike → TraversableLike → TraversableOnce

  27. def copyToArray[B >: T](xs: Array[B]): Unit

    definition classes: TraversableOnce

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

    definition classes: TraversableOnce

  29. def copyToBuffer[B >: T](dest: Buffer[B]): Unit

    definition classes: TraversableOnce

  30. def corresponds[B](that: Seq[B])(p: (T, B) ⇒ Boolean): Boolean

    definition classes: SeqLike

  31. def count(p: (T) ⇒ Boolean): Int

    definition classes: TraversableOnce

  32. def diff[B >: T](that: Seq[B]): Seq[T]

    definition classes: SeqLike

  33. def distinct: Seq[T]

    definition classes: SeqLike

  34. def drop(n: Int): Seq[T]

    definition classes: TraversableLike

  35. def dropRight(n: Int): Seq[T]

    definition classes: IterableLike

  36. def dropWhile(p: (T) ⇒ Boolean): Seq[T]

    definition classes: TraversableLike

  37. def elements: Iterator[T]

    definition classes: IterableLike
      deprecated:

    1. use iterator' instead

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

    definition classes: SeqLike

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

  40. def equals(that: 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)).

    returns

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

    definition classes: SeqLike → Equals → AnyRef → Any

  41. def equalsWith[B](that: Seq[B])(f: (T, B) ⇒ Boolean): Boolean

    definition classes: SeqLike
      deprecated:

    1. use corresponds instead

  42. def exists(p: (T) ⇒ Boolean): Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce

  43. def filter(p: (T) ⇒ Boolean): Seq[T]

    definition classes: TraversableLike

  44. def filterNot(p: (T) ⇒ Boolean): Seq[T]

    definition classes: TraversableLike

  45. def finalize(): Unit

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

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

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

    attributes: protected
    definition classes: AnyRef

  46. def find(p: (T) ⇒ Boolean): Option[T]

    definition classes: IterableLike → TraversableLike → TraversableOnce

  47. def findIndexOf(p: (T) ⇒ Boolean): Int

    definition classes: SeqLike

  48. def findLastIndexOf(p: (T) ⇒ Boolean): Int

    definition classes: SeqLike
      deprecated:

    1. use lastIndexWhere instead

  49. def first: T

    definition classes: IterableLike
      deprecated:

    1. use head' instead

  50. def firstOption: Option[T]

    definition classes: IterableLike
      deprecated:

    1. use headOption' instead

  51. def flatMap[B, That](f: (T) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: TraversableLike → FilterMonadic

  52. def flatten[B](implicit asTraversable: (T) ⇒ Traversable[B]): Seq[B]

    definition classes: GenericTraversableTemplate

  53. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

    definition classes: TraversableOnce

  54. def foldRight[B](z: B)(op: (T, B) ⇒ B): B

    definition classes: IterableLike → TraversableOnce

  55. def forall(p: (T) ⇒ Boolean): Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce

  56. def foreach[U](f: (T) ⇒ U): Unit

    definition classes: ParallelSeq → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → FilterMonadic

  57. def genericBuilder[B]: Builder[B, Seq[B]]

    definition classes: GenericTraversableTemplate

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

  59. def groupBy[K](f: (T) ⇒ K): Map[K, Seq[T]]

    definition classes: TraversableLike

  60. def grouped(size: Int): Iterator[Seq[T]]

    definition classes: IterableLike

  61. def hasDefiniteSize: Boolean

    definition classes: TraversableLike → TraversableOnce

  62. 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: SeqLike → AnyRef → Any

  63. def head: T

    definition classes: IterableLike → TraversableLike

  64. def headOption: Option[T]

    definition classes: TraversableLike

  65. def indexOf[B >: T](elem: B, from: Int): Int

    definition classes: SeqLike

  66. def indexOf[B >: T](elem: B): Int

    definition classes: SeqLike

  67. def indexOfSlice[B >: T](that: Seq[B], from: Int): Int

    definition classes: SeqLike

  68. def indexOfSlice[B >: T](that: Seq[B]): Int

    definition classes: SeqLike

  69. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

    definition classes: SeqLike

  70. def indexWhere(p: (T) ⇒ Boolean): Int

    definition classes: SeqLike

  71. def indices: Range

    definition classes: SeqLike

  72. def init: Seq[T]

    definition classes: TraversableLike

  73. def intersect[B >: T](that: Seq[B]): Seq[T]

    definition classes: SeqLike

  74. def isDefinedAt(idx: Int): Boolean

    definition classes: SeqLike

  75. def isEmpty: Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce

  76. def isInstanceOf[T0]: Boolean

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

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

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

    returns

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

    attributes: final
    definition classes: Any

  77. def isTraversableAgain: Boolean

    attributes: final
    definition classes: TraversableLike → TraversableOnce

  78. def iterator: Iterator[T]

    definition classes: ParallelSeq → IterableLike

  79. def last: T

    definition classes: TraversableLike

  80. def lastIndexOf[B >: T](elem: B, end: Int): Int

    definition classes: SeqLike

  81. def lastIndexOf[B >: T](elem: B): Int

    definition classes: SeqLike

  82. def lastIndexOfSlice[B >: T](that: Seq[B], end: Int): Int

    definition classes: SeqLike

  83. def lastIndexOfSlice[B >: T](that: Seq[B]): Int

    definition classes: SeqLike

  84. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

    definition classes: SeqLike

  85. def lastIndexWhere(p: (T) ⇒ Boolean): Int

    definition classes: SeqLike

  86. def lastOption: Option[T]

    definition classes: TraversableLike

  87. def length: Int

    definition classes: ParallelSeq → SeqLike

  88. def lengthCompare(len: Int): Int

    definition classes: SeqLike

  89. def lift: (Int) ⇒ Option[T]

    definition classes: PartialFunction

  90. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: ParallelSeq → TraversableLike → FilterMonadic

  91. def max[B >: T](implicit cmp: Ordering[B]): T

    definition classes: TraversableOnce

  92. def min[B >: T](implicit cmp: Ordering[B]): T

    definition classes: TraversableOnce

  93. def mkString: String

    definition classes: TraversableOnce

  94. def mkString(sep: String): String

    definition classes: TraversableOnce

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

    definition classes: TraversableOnce

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

  97. def newBuilder: Builder[T, Seq[T]]

    attributes: protected[this]
    definition classes: GenericTraversableTemplate → HasNewBuilder

  98. def nonEmpty: Boolean

    definition classes: TraversableOnce

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

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

  101. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    definition classes: PartialFunction

  102. def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: SeqLike

  103. def partition(p: (T) ⇒ Boolean): (Seq[T], Seq[T])

    definition classes: TraversableLike

  104. def patch[B >: T, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: SeqLike

  105. def prefixLength(p: (T) ⇒ Boolean): Int

    definition classes: SeqLike

  106. def product[B >: T](implicit num: Numeric[B]): B

    definition classes: TraversableOnce

  107. def projection: SeqView[T, Seq[T]]

    definition classes: SeqLike → IterableLike
      deprecated:

    1. use view' instead

  108. def reduceLeft[B >: T](op: (B, T) ⇒ B): B

    definition classes: TraversableOnce

  109. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

    definition classes: TraversableOnce

  110. def reduceRight[B >: T](op: (T, B) ⇒ B): B

    definition classes: IterableLike → TraversableOnce

  111. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

    definition classes: TraversableOnce

  112. def repr: Seq[T]

    definition classes: TraversableLike

  113. def reverse: Seq[T]

    definition classes: SeqLike

  114. def reverseIterator: Iterator[T]

    definition classes: SeqLike

  115. def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: SeqLike

  116. def reversed: List[T]

    attributes: protected[this]
    definition classes: TraversableOnce

  117. def reversedElements: Iterator[T]

    definition classes: SeqLike
      deprecated:

    1. use reverseIterator' instead

  118. def sameElements[B >: T](that: Iterable[B]): Boolean

    definition classes: IterableLike

  119. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: TraversableLike

  120. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: TraversableLike

  121. def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

    definition classes: SeqLike

  122. def size: Int

    definition classes: SeqLike → TraversableOnce

  123. def slice(from: Int, until: Int): Seq[T]

    definition classes: IterableLike → TraversableLike

  124. def sliding[B >: T](size: Int, step: Int): Iterator[Seq[T]]

    definition classes: IterableLike

  125. def sliding[B >: T](size: Int): Iterator[Seq[T]]

    definition classes: IterableLike

  126. def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): Seq[T]

    definition classes: SeqLike

  127. def sortWith(lt: (T, T) ⇒ Boolean): Seq[T]

    definition classes: SeqLike

  128. def sorted[B >: T](implicit ord: Ordering[B]): Seq[T]

    definition classes: SeqLike

  129. def span(p: (T) ⇒ Boolean): (Seq[T], Seq[T])

    definition classes: TraversableLike

  130. def splitAt(n: Int): (Seq[T], Seq[T])

    definition classes: TraversableLike

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

    definition classes: SeqLike

  132. def startsWith[B](that: Seq[B], offset: Int): Boolean

    definition classes: SeqLike

  133. def stringPrefix: String

    definition classes: TraversableLike

  134. def sum[B >: T](implicit num: Numeric[B]): B

    definition classes: TraversableOnce

  135. def synchronized[T0](arg0: T0): T0

    attributes: final
    definition classes: AnyRef

  136. def tail: Seq[T]

    definition classes: TraversableLike

  137. def take(n: Int): Seq[T]

    definition classes: IterableLike → TraversableLike

  138. def takeRight(n: Int): Seq[T]

    definition classes: IterableLike

  139. def takeWhile(p: (T) ⇒ Boolean): Seq[T]

    definition classes: IterableLike → TraversableLike

  140. def thisCollection: Seq[T]

    attributes: protected[this]
    definition classes: SeqLike → IterableLike → TraversableLike

  141. def toArray[B >: T](implicit arg0: ClassManifest[B]): Array[B]

    definition classes: TraversableOnce

  142. def toBuffer[B >: T]: Buffer[B]

    definition classes: TraversableOnce

  143. def toCollection(repr: Seq[T]): Seq[T]

    attributes: protected[this]
    definition classes: SeqLike → IterableLike → TraversableLike

  144. def toIndexedSeq[B >: T]: IndexedSeq[B]

    definition classes: TraversableOnce

  145. def toIterable: Iterable[T]

    definition classes: IterableLike → TraversableOnce

  146. def toIterator: Iterator[T]

    definition classes: TraversableLike → TraversableOnce

  147. def toList: List[T]

    definition classes: TraversableOnce

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

    definition classes: TraversableOnce

  149. def toSeq: Seq[T]

    definition classes: SeqLike → IterableLike → TraversableOnce

  150. def toSet[B >: T]: Set[B]

    definition classes: TraversableOnce

  151. def toStream: Stream[T]

    definition classes: IterableLike → TraversableLike → TraversableOnce

  152. 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: SeqLike → TraversableLike → AnyRef → Any

  153. def toTraversable: Traversable[T]

    definition classes: TraversableLike → TraversableOnce

  154. def transpose[B](implicit asTraversable: (T) ⇒ Traversable[B]): Seq[Seq[B]]

    definition classes: GenericTraversableTemplate

  155. def union[B >: T, That](that: Seq[B])(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: SeqLike

  156. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (Seq[A1], Seq[A2])

    definition classes: GenericTraversableTemplate

  157. def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Seq[T], B, That]): That

    definition classes: SeqLike

  158. def view(from: Int, until: Int): SeqView[T, Seq[T]]

    definition classes: SeqLike → IterableLike → TraversableLike

  159. def view: SeqView[T, Seq[T]]

    definition classes: SeqLike → IterableLike → TraversableLike

  160. def wait(): Unit

    attributes: final
    definition classes: AnyRef

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

    attributes: final
    definition classes: AnyRef

  162. def wait(arg0: Long): Unit

    attributes: final
    definition classes: AnyRef

  163. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, Seq[T]]

    definition classes: TraversableLike → FilterMonadic

  164. def zip[A1 >: T, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Seq[T], (A1, B), That]): That

    definition classes: IterableLike

  165. def zipAll[B, A1 >: T, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Seq[T], (A1, B), That]): That

    definition classes: IterableLike

  166. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[Seq[T], (A1, Int), That]): That

    definition classes: IterableLike