edu.stanford.nlp.tmt.learn

Sharded

class Sharded [A] extends Iterable[A] with IterableLike[A, Sharded[A]]

A unified collection-like view of a set of shards, each of which is IterableLike. Calls to map, filter, reduce, foreach, etc., are evaluated with the help of a FutureTaskRunner. Note: callers should use the provided reduce method for a parallel reduction instead ofreduceLeft and reduceRight.

go to: companion
linear super types: Iterable[A], IterableLike[A, Sharded[A]], Equals, Traversable[A], GenericTraversableTemplate[A, Iterable], TraversableLike[A, Sharded[A]], TraversableOnce[A], FilterMonadic[A, Sharded[A]], HasNewBuilder[A, Sharded[A]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Sharded
  2. Iterable
  3. IterableLike
  4. Equals
  5. Traversable
  6. GenericTraversableTemplate
  7. TraversableLike
  8. TraversableOnce
  9. FilterMonadic
  10. HasNewBuilder
  11. AnyRef
  12. Any
Visibility
  1. Public
  2. All
Impl.
  1. Concrete
  2. Abstract

Instance constructors

  1. new Sharded (shards: List[List[A]])(implicit ft: FutureTaskRunner)

Type Members

  1. type Repr = Sharded[A]

  2. type Self = Sharded[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[Sharded[A], B, That]) : That

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

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

    definition classes: TraversableOnce
  9. 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
  10. 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
  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 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
  15. def canEqual (that: Any) : Boolean

    definition classes: IterableLike → Equals
  16. 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
  17. def collect [B, That] (pf: PartialFunction[A, B])(implicit bf: CanBuildFrom[Sharded[A], B, That]) : That

    definition classes: TraversableLike
  18. def companion : GenericCompanion[Iterable]

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

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

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

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

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

    definition classes: TraversableOnce
  24. def drop (n: Int) : Sharded[A]

    definition classes: TraversableLike
  25. def dropRight (n: Int) : Sharded[A]

    definition classes: IterableLike
  26. def dropWhile (p: (A) ⇒ Boolean) : Sharded[A]

    definition classes: TraversableLike
  27. def elements : Iterator[A]

    definition classes: IterableLike
      deprecated:
    1. use iterator' instead

  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: IterableLike → TraversableLike → TraversableOnce
  31. def filter (f: (A) ⇒ Boolean) : Repr

    definition classes: Sharded → TraversableLike
  32. def filterNot (p: (A) ⇒ Boolean) : Sharded[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 finalizeand non-local returns and exceptions, are all platform dependent.

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

    definition classes: IterableLike → TraversableLike → TraversableOnce
  35. def first : A

    definition classes: IterableLike
      deprecated:
    1. use head' instead

  36. def firstOption : Option[A]

    definition classes: IterableLike
      deprecated:
    1. use headOption' instead

  37. def flatMap [B, That] (f: (A) ⇒ Traversable[B])(implicit bf: CanBuildFrom[Sharded[A], B, That]) : That

    definition classes: TraversableLike → FilterMonadic
  38. def flatten [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : Iterable[B]

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

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

    definition classes: IterableLike → TraversableOnce
  41. def forall (p: (A) ⇒ Boolean) : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  42. def foreach [B] (f: (A) ⇒ B) : Unit

    definition classes: Sharded → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → FilterMonadic
  43. def foreachShard [B] (f: (List[A], Int) ⇒ B) : Unit

    Applies the given function to each shard.

    Applies the given function to each shard.

  44. implicit val ft : FutureTaskRunner

    attributes: implicit
  45. def genericBuilder [B] : Builder[B, Iterable[B]]

    definition classes: GenericTraversableTemplate
  46. 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
  47. def groupBy [K] (f: (A) ⇒ K) : Map[K, Sharded[A]]

    definition classes: TraversableLike
  48. def grouped (size: Int) : Iterator[Sharded[A]]

    definition classes: IterableLike
  49. def hasDefiniteSize : Boolean

    definition classes: TraversableLike → TraversableOnce
  50. 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
  51. def head : A

    definition classes: IterableLike → TraversableLike
  52. def headOption : Option[A]

    definition classes: TraversableLike
  53. def init : Sharded[A]

    definition classes: TraversableLike
  54. def isEmpty : Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  55. 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
  56. def isTraversableAgain : Boolean

    attributes: final
    definition classes: TraversableLike → TraversableOnce
  57. def iterator : Iterator[A]

    definition classes: Sharded → IterableLike
  58. def last : A

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

    definition classes: TraversableLike
  60. def map [B, That] (f: (A) ⇒ B)(implicit bf: CanBuildFrom[Repr, B, That]) : That

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

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

    definition classes: Sharded → TraversableOnce
  63. def mkString : String

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

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

    definition classes: TraversableOnce
  66. 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
  67. def newBuilder : NoBuilder[A]

    definition classes: Sharded → GenericTraversableTemplate → TraversableLike → HasNewBuilder
  68. def nonEmpty : Boolean

    definition classes: TraversableOnce
  69. 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
  70. 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
  71. def partition (p: (A) ⇒ Boolean) : (Sharded[A], Sharded[A])

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

    definition classes: Sharded → TraversableOnce
  73. def projection : IterableView[A, Sharded[A]]

    definition classes: IterableLike
      deprecated:
    1. use view' instead

  74. def reduce (op: (A, A) ⇒ A) : A

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

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

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

    definition classes: Sharded → IterableLike → TraversableOnce
  78. def reduceRightOption [B >: A] (op: (A, B) ⇒ B) : Option[B]

    definition classes: TraversableOnce
  79. def repr : Sharded[A]

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

    attributes: protected[this]
    definition classes: TraversableOnce
  81. def sameElements [B >: A] (that: Iterable[B]) : Boolean

    definition classes: IterableLike
  82. def scanLeft [B, That] (z: B)(op: (B, A) ⇒ B)(implicit bf: CanBuildFrom[Sharded[A], B, That]) : That

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

    definition classes: TraversableLike
  84. val shards : List[List[A]]

  85. def size : Int

    definition classes: Sharded → TraversableOnce
  86. def slice (from: Int, until: Int) : Sharded[A]

    definition classes: IterableLike → TraversableLike
  87. def sliding [B >: A] (size: Int, step: Int) : Iterator[Sharded[A]]

    definition classes: IterableLike
  88. def sliding [B >: A] (size: Int) : Iterator[Sharded[A]]

    definition classes: IterableLike
  89. def span (p: (A) ⇒ Boolean) : (Sharded[A], Sharded[A])

    definition classes: TraversableLike
  90. def splitAt (n: Int) : (Sharded[A], Sharded[A])

    definition classes: TraversableLike
  91. def stringPrefix : String

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

    definition classes: Sharded → TraversableOnce
  93. def synchronized [T0] (arg0: T0) : T0

    attributes: final
    definition classes: AnyRef
  94. def tail : Sharded[A]

    definition classes: TraversableLike
  95. def take (n: Int) : Sharded[A]

    definition classes: IterableLike → TraversableLike
  96. def takeRight (n: Int) : Sharded[A]

    definition classes: IterableLike
  97. def takeWhile (p: (A) ⇒ Boolean) : Sharded[A]

    definition classes: IterableLike → TraversableLike
  98. def thisCollection : Iterable[A]

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

    definition classes: TraversableOnce
  100. def toBuffer [B >: A] : Buffer[B]

    definition classes: TraversableOnce
  101. def toCollection (repr: Sharded[A]) : Iterable[A]

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

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

    definition classes: IterableLike → TraversableOnce
  104. def toIterator : Iterator[A]

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

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

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

    definition classes: IterableLike → TraversableOnce
  108. def toSet [B >: A] : Set[B]

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

    definition classes: IterableLike → TraversableLike → TraversableOnce
  110. 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: TraversableLike → AnyRef → Any
  111. def toTraversable : Traversable[A]

    definition classes: TraversableLike → TraversableOnce
  112. def transpose [B] (implicit asTraversable: (A) ⇒ Traversable[B]) : Iterable[Iterable[B]]

    definition classes: GenericTraversableTemplate
  113. def unzip [A1, A2] (implicit asPair: (A) ⇒ (A1, A2)) : (Iterable[A1], Iterable[A2])

    definition classes: GenericTraversableTemplate
  114. def view (from: Int, until: Int) : IterableView[A, Sharded[A]]

    definition classes: IterableLike → TraversableLike
  115. def view : IterableView[A, Sharded[A]]

    definition classes: IterableLike → TraversableLike
  116. def wait () : Unit

    attributes: final
    definition classes: AnyRef
  117. def wait (arg0: Long, arg1: Int) : Unit

    attributes: final
    definition classes: AnyRef
  118. def wait (arg0: Long) : Unit

    attributes: final
    definition classes: AnyRef
  119. def withFilter (p: (A) ⇒ Boolean) : FilterMonadic[A, Sharded[A]]

    definition classes: TraversableLike → FilterMonadic
  120. def zip [A1 >: A, B, That] (that: Iterable[B])(implicit bf: CanBuildFrom[Sharded[A], (A1, B), That]) : That

    definition classes: IterableLike
  121. def zipAll [B, A1 >: A, That] (that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Sharded[A], (A1, B), That]) : That

    definition classes: IterableLike
  122. def zipWithIndex [A1 >: A, That] (implicit bf: CanBuildFrom[Sharded[A], (A1, Int), That]) : That

    definition classes: IterableLike

Inherited from Iterable[A]

Inherited from IterableLike[A, Sharded[A]]

Inherited from Equals

Inherited from Traversable[A]

Inherited from GenericTraversableTemplate[A, Iterable]

Inherited from TraversableLike[A, Sharded[A]]

Inherited from TraversableOnce[A]

Inherited from FilterMonadic[A, Sharded[A]]

Inherited from HasNewBuilder[A, Sharded[A]]

Inherited from AnyRef

Inherited from Any