net.sf.phiweave.common

DataSet

class DataSet extends Seq[GraphDescriptor] with DataSetAdapter

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

Instance constructors

  1. new DataSet(graphs: Seq[GraphDescriptor])

Type Members

  1. type Self = Seq[GraphDescriptor]

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

    definition classes: TraversableLike
  7. def +:[B >: GraphDescriptor, That](elem: B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  8. def /:[B](z: B)(op: (B, GraphDescriptor) ⇒ B): B

    definition classes: TraversableOnce
  9. def :+[B >: GraphDescriptor, That](elem: B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  10. def :\[B](z: B)(op: (GraphDescriptor, 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: (GraphDescriptor) ⇒ C): PartialFunction[Int, C]

    definition classes: PartialFunction → Function1
  17. def apply(index: Int): GraphDescriptor

    definition classes: DataSet → 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[GraphDescriptor, B])(implicit bf: CanBuildFrom[Seq[GraphDescriptor], 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) ⇒ GraphDescriptor

    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 >: GraphDescriptor](xs: Array[B], start: Int, len: Int): Unit

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

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

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

    definition classes: TraversableOnce
  30. def corresponds[B](that: Seq[B])(p: (GraphDescriptor, B) ⇒ Boolean): Boolean

    definition classes: SeqLike
  31. def count(p: (GraphDescriptor) ⇒ Boolean): Int

    definition classes: TraversableOnce
  32. def diff[B >: GraphDescriptor](that: Seq[B]): Seq[GraphDescriptor]

    definition classes: SeqLike
  33. def distinct: Seq[GraphDescriptor]

    definition classes: SeqLike
  34. def drop(n: Int): Seq[GraphDescriptor]

    definition classes: TraversableLike
  35. def dropRight(n: Int): Seq[GraphDescriptor]

    definition classes: IterableLike
  36. def dropWhile(p: (GraphDescriptor) ⇒ Boolean): Seq[GraphDescriptor]

    definition classes: TraversableLike
  37. def elements: Iterator[GraphDescriptor]

    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: (GraphDescriptor, B) ⇒ Boolean): Boolean

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

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

    definition classes: IterableLike → TraversableLike → TraversableOnce
  43. def filter(p: (GraphDescriptor) ⇒ Boolean): Seq[GraphDescriptor]

    definition classes: TraversableLike
  44. def filterNot(p: (GraphDescriptor) ⇒ Boolean): Seq[GraphDescriptor]

    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: (GraphDescriptor) ⇒ Boolean): Option[GraphDescriptor]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  47. def findIndexOf(p: (GraphDescriptor) ⇒ Boolean): Int

    definition classes: SeqLike
  48. def findLastIndexOf(p: (GraphDescriptor) ⇒ Boolean): Int

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  49. def first: GraphDescriptor

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

  50. def firstOption: Option[GraphDescriptor]

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

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

    definition classes: TraversableLike → FilterMonadic
  52. def flatten[B](implicit asTraversable: (GraphDescriptor) ⇒ Traversable[B]): Seq[B]

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

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

    definition classes: IterableLike → TraversableOnce
  55. def forall(p: (GraphDescriptor) ⇒ Boolean): Boolean

    definition classes: IterableLike → TraversableLike → TraversableOnce
  56. def foreach[U](f: (GraphDescriptor) ⇒ U): Unit

    definition classes: IterableLike → 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: (GraphDescriptor) ⇒ K): Map[K, Seq[GraphDescriptor]]

    definition classes: TraversableLike
  60. def grouped(size: Int): Iterator[Seq[GraphDescriptor]]

    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: GraphDescriptor

    definition classes: IterableLike → TraversableLike
  64. def headOption: Option[GraphDescriptor]

    definition classes: TraversableLike
  65. def indexOf[B >: GraphDescriptor](elem: B, from: Int): Int

    definition classes: SeqLike
  66. def indexOf[B >: GraphDescriptor](elem: B): Int

    definition classes: SeqLike
  67. def indexOfSlice[B >: GraphDescriptor](that: Seq[B], from: Int): Int

    definition classes: SeqLike
  68. def indexOfSlice[B >: GraphDescriptor](that: Seq[B]): Int

    definition classes: SeqLike
  69. def indexWhere(p: (GraphDescriptor) ⇒ Boolean, from: Int): Int

    definition classes: SeqLike
  70. def indexWhere(p: (GraphDescriptor) ⇒ Boolean): Int

    definition classes: SeqLike
  71. def indices: Range

    definition classes: SeqLike
  72. def init: Seq[GraphDescriptor]

    definition classes: TraversableLike
  73. def intersect[B >: GraphDescriptor](that: Seq[B]): Seq[GraphDescriptor]

    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[GraphDescriptor]

    definition classes: DataSet → IterableLike
  79. def jderror(unexpected: JEntity, expected: String, id: String): Nothing

    definition classes: JEntity
  80. def jelements: Iterator[JEntity]

    definition classes: JArrayBufferViewJArrayView
  81. def jpreget(x: GraphDescriptor): JEntity

    attributes: protected
    definition classes: JArrayBufferView
  82. def jserror(unserializable: String, id: String): Nothing

    definition classes: JEntity
  83. def last: GraphDescriptor

    definition classes: TraversableLike
  84. def lastIndexOf[B >: GraphDescriptor](elem: B, end: Int): Int

    definition classes: SeqLike
  85. def lastIndexOf[B >: GraphDescriptor](elem: B): Int

    definition classes: SeqLike
  86. def lastIndexOfSlice[B >: GraphDescriptor](that: Seq[B], end: Int): Int

    definition classes: SeqLike
  87. def lastIndexOfSlice[B >: GraphDescriptor](that: Seq[B]): Int

    definition classes: SeqLike
  88. def lastIndexWhere(p: (GraphDescriptor) ⇒ Boolean, end: Int): Int

    definition classes: SeqLike
  89. def lastIndexWhere(p: (GraphDescriptor) ⇒ Boolean): Int

    definition classes: SeqLike
  90. def lastOption: Option[GraphDescriptor]

    definition classes: TraversableLike
  91. def length: Int

    definition classes: DataSet → SeqLike
  92. def lengthCompare(len: Int): Int

    definition classes: SeqLike
  93. def lift: (Int) ⇒ Option[GraphDescriptor]

    definition classes: PartialFunction
  94. def map[B, That](f: (GraphDescriptor) ⇒ B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

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

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

    definition classes: TraversableOnce
  97. def mkString: String

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

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

    definition classes: TraversableOnce
  100. 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
  101. def newBuilder: Builder[GraphDescriptor, Seq[GraphDescriptor]]

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

    definition classes: TraversableOnce
  103. 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
  104. 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
  105. def observedAssignment: Array[Array[Int]]

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

    definition classes: PartialFunction
  107. def padTo[B >: GraphDescriptor, That](len: Int, elem: B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  108. def partition(p: (GraphDescriptor) ⇒ Boolean): (Seq[GraphDescriptor], Seq[GraphDescriptor])

    definition classes: TraversableLike
  109. def patch[B >: GraphDescriptor, That](from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  110. def pickSome(k: Int): DataSet

  111. def prefixLength(p: (GraphDescriptor) ⇒ Boolean): Int

    definition classes: SeqLike
  112. def print(buf: OutputBuffer, path: List[String], verbose: (JEntity, List[String]) ⇒ Boolean): Unit

    definition classes: JArrayViewJEntity
  113. def product[B >: GraphDescriptor](implicit num: Numeric[B]): B

    definition classes: TraversableOnce
  114. def projection: SeqView[GraphDescriptor, Seq[GraphDescriptor]]

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

  115. def reduceLeft[B >: GraphDescriptor](op: (B, GraphDescriptor) ⇒ B): B

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

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

    definition classes: IterableLike → TraversableOnce
  118. def reduceRightOption[B >: GraphDescriptor](op: (GraphDescriptor, B) ⇒ B): Option[B]

    definition classes: TraversableOnce
  119. def repr: Seq[GraphDescriptor]

    definition classes: TraversableLike
  120. def reverse: Seq[GraphDescriptor]

    definition classes: SeqLike
  121. def reverseIterator: Iterator[GraphDescriptor]

    definition classes: SeqLike
  122. def reverseMap[B, That](f: (GraphDescriptor) ⇒ B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  123. def reversed: List[GraphDescriptor]

    attributes: protected[this]
    definition classes: TraversableOnce
  124. def reversedElements: Iterator[GraphDescriptor]

    definition classes: SeqLike
      deprecated:
    1. use reverseIterator' instead

  125. def sameElements[B >: GraphDescriptor](that: Iterable[B]): Boolean

    definition classes: IterableLike
  126. def scanLeft[B, That](z: B)(op: (B, GraphDescriptor) ⇒ B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: TraversableLike
  127. def scanRight[B, That](z: B)(op: (GraphDescriptor, B) ⇒ B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: TraversableLike
  128. def segmentLength(p: (GraphDescriptor) ⇒ Boolean, from: Int): Int

    definition classes: SeqLike
  129. def size: Int

    definition classes: SeqLike → TraversableOnce
  130. def slice(from: Int, until: Int): DataSet

    definition classes: DataSet → IterableLike → TraversableLike
  131. def sliding[B >: GraphDescriptor](size: Int, step: Int): Iterator[Seq[GraphDescriptor]]

    definition classes: IterableLike
  132. def sliding[B >: GraphDescriptor](size: Int): Iterator[Seq[GraphDescriptor]]

    definition classes: IterableLike
  133. def sortBy[B](f: (GraphDescriptor) ⇒ B)(implicit ord: Ordering[B]): Seq[GraphDescriptor]

    definition classes: SeqLike
  134. def sortWith(lt: (GraphDescriptor, GraphDescriptor) ⇒ Boolean): Seq[GraphDescriptor]

    definition classes: SeqLike
  135. def sorted[B >: GraphDescriptor](implicit ord: Ordering[B]): Seq[GraphDescriptor]

    definition classes: SeqLike
  136. def span(p: (GraphDescriptor) ⇒ Boolean): (Seq[GraphDescriptor], Seq[GraphDescriptor])

    definition classes: TraversableLike
  137. def splitAt(n: Int): (Seq[GraphDescriptor], Seq[GraphDescriptor])

    definition classes: TraversableLike
  138. def startsWith[B](that: Seq[B]): Boolean

    definition classes: SeqLike
  139. def startsWith[B](that: Seq[B], offset: Int): Boolean

    definition classes: SeqLike
  140. def stringPrefix: String

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

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

    attributes: final
    definition classes: AnyRef
  143. def tail: Seq[GraphDescriptor]

    definition classes: TraversableLike
  144. def take(n: Int): Seq[GraphDescriptor]

    definition classes: IterableLike → TraversableLike
  145. def takeRight(n: Int): Seq[GraphDescriptor]

    definition classes: IterableLike
  146. def takeWhile(p: (GraphDescriptor) ⇒ Boolean): Seq[GraphDescriptor]

    definition classes: IterableLike → TraversableLike
  147. def thisCollection: Seq[GraphDescriptor]

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

    definition classes: TraversableOnce
  149. def toBuffer[B >: GraphDescriptor]: Buffer[B]

    definition classes: TraversableOnce
  150. def toCollection(repr: Seq[GraphDescriptor]): Seq[GraphDescriptor]

    attributes: protected[this]
    definition classes: SeqLike → IterableLike → TraversableLike
  151. def toIndexedSeq[B >: GraphDescriptor]: IndexedSeq[B]

    definition classes: TraversableOnce
  152. def toIterable: Iterable[GraphDescriptor]

    definition classes: IterableLike → TraversableOnce
  153. def toIterator: Iterator[GraphDescriptor]

    definition classes: TraversableLike → TraversableOnce
  154. def toList: List[GraphDescriptor]

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

    definition classes: TraversableOnce
  156. def toSeq: Seq[GraphDescriptor]

    definition classes: SeqLike → IterableLike → TraversableOnce
  157. def toSet[B >: GraphDescriptor]: Set[B]

    definition classes: TraversableOnce
  158. def toStream: Stream[GraphDescriptor]

    definition classes: IterableLike → TraversableLike → TraversableOnce
  159. 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: JArrayView → AnyRef → Any
  160. def toTraversable: Traversable[GraphDescriptor]

    definition classes: TraversableLike → TraversableOnce
  161. def transpose[B](implicit asTraversable: (GraphDescriptor) ⇒ Traversable[B]): Seq[Seq[B]]

    definition classes: GenericTraversableTemplate
  162. def union[B >: GraphDescriptor, That](that: Seq[B])(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  163. def unzip[A1, A2](implicit asPair: (GraphDescriptor) ⇒ (A1, A2)): (Seq[A1], Seq[A2])

    definition classes: GenericTraversableTemplate
  164. def updated[B >: GraphDescriptor, That](index: Int, elem: B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  165. def view(from: Int, until: Int): SeqView[GraphDescriptor, Seq[GraphDescriptor]]

    definition classes: SeqLike → IterableLike → TraversableLike
  166. def view: SeqView[GraphDescriptor, Seq[GraphDescriptor]]

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

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

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

    attributes: final
    definition classes: AnyRef
  170. def withFilter(p: (GraphDescriptor) ⇒ Boolean): FilterMonadic[GraphDescriptor, Seq[GraphDescriptor]]

    definition classes: TraversableLike → FilterMonadic
  171. def zip[A1 >: GraphDescriptor, B, That](that: Iterable[B])(implicit bf: CanBuildFrom[Seq[GraphDescriptor], (A1, B), That]): That

    definition classes: IterableLike
  172. def zipAll[B, A1 >: GraphDescriptor, That](that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Seq[GraphDescriptor], (A1, B), That]): That

    definition classes: IterableLike
  173. def zipWithIndex[A1 >: GraphDescriptor, That](implicit bf: CanBuildFrom[Seq[GraphDescriptor], (A1, Int), That]): That

    definition classes: IterableLike