net.sf.phiweave.common

DataSetBuilder

class DataSetBuilder extends ArrayBuffer[GraphDescriptor] with DataSetBuilderAdapter

Inherited
  1. Hide All
  2. Show all
  1. DataSetBuilderAdapter
  2. JArrayBufferMutable
  3. JArrayMutable
  4. JText
  5. JEntity
  6. ArrayBuffer
  7. ResizableArray
  8. IndexedSeq
  9. IndexedSeq
  10. Builder
  11. IndexedSeqOptimized
  12. IndexedSeqOptimized
  13. IndexedSeqLike
  14. IndexedSeqLike
  15. Buffer
  16. BufferLike
  17. Cloneable
  18. Subtractable
  19. Scriptable
  20. Shrinkable
  21. Growable
  22. Seq
  23. Seq
  24. SeqLike
  25. PartialFunction
  26. Function1
  27. Iterable
  28. Iterable
  29. IterableLike
  30. Equals
  31. Traversable
  32. Mutable
  33. Traversable
  34. GenericTraversableTemplate
  35. TraversableLike
  36. TraversableOnce
  37. FilterMonadic
  38. HasNewBuilder
  39. AnyRef
  40. Any
Visibility
  1. Public
  2. All

Instance constructors

  1. new DataSetBuilder(model: ModelLike, ins: InputStream)

  2. new DataSetBuilder(model: ModelLike)

Type Members

  1. type Self = ArrayBuffer[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 +(elem1: GraphDescriptor, elem2: GraphDescriptor, elems: GraphDescriptor*): ArrayBuffer[GraphDescriptor]

    definition classes: BufferLike
      deprecated:
    1. Use ++= instead if you intend to add by side effect to an existing collection. Use clone() ++=' if you intend to create a new collection.

  7. def +(elem: GraphDescriptor): ArrayBuffer[GraphDescriptor]

    definition classes: BufferLike
      deprecated:
    1. Use += instead if you intend to add by side effect to an existing collection. Use clone() +=' if you intend to create a new collection.

  8. def ++(that: Iterable[GraphDescriptor]): DataSetBuilder

  9. def ++(xs: TraversableOnce[GraphDescriptor]): ArrayBuffer[GraphDescriptor]

    definition classes: BufferLike
  10. def ++[B >: GraphDescriptor, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[ArrayBuffer[GraphDescriptor], B, That]): That

    definition classes: TraversableLike
  11. def ++:(xs: Traversable[GraphDescriptor]): ArrayBuffer[GraphDescriptor]

    attributes: final
    definition classes: BufferLike
      deprecated:
    1. use ++=: instead

  12. def ++=(xs: TraversableOnce[GraphDescriptor]): ArrayBuffer[GraphDescriptor]

    definition classes: ArrayBuffer → Growable
  13. def ++=(src: Array[GraphDescriptor], start: Int, len: Int): Unit

    definition classes: BufferLike
      deprecated:
    1. replace by: buf ++= src.view(start, end)

  14. def ++=:(xs: TraversableOnce[GraphDescriptor]): ArrayBuffer[GraphDescriptor]

    definition classes: ArrayBuffer → BufferLike
  15. def +:(elem: GraphDescriptor): ArrayBuffer[GraphDescriptor]

    attributes: final
    definition classes: BufferLike
      deprecated:
    1. use +=:' instead

  16. def +:[B >: GraphDescriptor, That](elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  17. def +=(elem: GraphDescriptor): ArrayBuffer[GraphDescriptor]

    definition classes: ArrayBuffer → Builder → BufferLike → Growable
  18. def +=(elem1: GraphDescriptor, elem2: GraphDescriptor, elems: GraphDescriptor*): Growable[GraphDescriptor]

    definition classes: Growable
  19. def +=:(elem: GraphDescriptor): ArrayBuffer[GraphDescriptor]

    definition classes: ArrayBuffer → BufferLike
  20. def -(elem1: GraphDescriptor, elem2: GraphDescriptor, elems: GraphDescriptor*): ArrayBuffer[GraphDescriptor]

    definition classes: BufferLike → Subtractable
  21. def -(elem: GraphDescriptor): ArrayBuffer[GraphDescriptor]

    definition classes: BufferLike → Subtractable
  22. def --(xs: TraversableOnce[GraphDescriptor]): ArrayBuffer[GraphDescriptor]

    definition classes: BufferLike → Subtractable
  23. def --=(xs: TraversableOnce[GraphDescriptor]): Shrinkable[GraphDescriptor]

    definition classes: Shrinkable
  24. def -=(x: GraphDescriptor): ArrayBuffer[GraphDescriptor]

    definition classes: BufferLike → Shrinkable
  25. def -=(elem1: GraphDescriptor, elem2: GraphDescriptor, elems: GraphDescriptor*): Shrinkable[GraphDescriptor]

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

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

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

    definition classes: TraversableOnce
  29. def <<(cmd: Message[GraphDescriptor]): Unit

    definition classes: BufferLike → Scriptable
  30. 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
  31. 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
  32. def addString(b: StringBuilder): StringBuilder

    definition classes: TraversableOnce
  33. def addString(b: StringBuilder, sep: String): StringBuilder

    definition classes: TraversableOnce
  34. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    definition classes: TraversableOnce
  35. def andThen[C](k: (GraphDescriptor) ⇒ C): PartialFunction[Int, C]

    definition classes: PartialFunction → Function1
  36. def append(elems: GraphDescriptor*): Unit

    definition classes: BufferLike
  37. def appendAll(xs: TraversableOnce[GraphDescriptor]): Unit

    definition classes: BufferLike
  38. def apply(idx: Int): GraphDescriptor

    definition classes: ResizableArray → SeqLike → Function1
  39. var array: Array[AnyRef]

    attributes: protected
    definition classes: ResizableArray
  40. 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
  41. def canEqual(that: Any): Boolean

    definition classes: IterableLike → Equals
  42. def clear(): Unit

    definition classes: ArrayBuffer → Builder → BufferLike → Growable
  43. def clone(): ArrayBuffer[GraphDescriptor]

    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.

    definition classes: ArrayBuffer → Cloneable → AnyRef
  44. def collect[B, That](pf: PartialFunction[GraphDescriptor, B])(implicit bf: CanBuildFrom[ArrayBuffer[GraphDescriptor], B, That]): That

    definition classes: TraversableLike
  45. def companion: GenericCompanion[ArrayBuffer[A][A]]

    definition classes: ArrayBuffer → ResizableArray → IndexedSeq → IndexedSeq → Buffer → Seq → Seq → Iterable → Iterable → Traversable → Traversable → GenericTraversableTemplate
  46. def compose[A](g: (A) ⇒ Int): (A) ⇒ GraphDescriptor

    definition classes: Function1
  47. def contains(elem: Any): Boolean

    definition classes: SeqLike
  48. def containsSlice[B](that: Seq[B]): Boolean

    definition classes: SeqLike
  49. def copy(m: Int, n: Int, len: Int): Unit

    attributes: protected
    definition classes: ResizableArray
  50. def copyToArray[B >: GraphDescriptor](xs: Array[B], start: Int, len: Int): Unit

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

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

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

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

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

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

    definition classes: SeqLike
  57. def distinct: ArrayBuffer[GraphDescriptor]

    definition classes: SeqLike
  58. def drop(n: Int): ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → TraversableLike
  59. def dropRight(n: Int): ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → IterableLike
  60. def dropWhile(p: (GraphDescriptor) ⇒ Boolean): ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → TraversableLike
  61. def elements: Iterator[GraphDescriptor]

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

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

    definition classes: IndexedSeqOptimized → SeqLike
  63. def ensureSize(n: Int): Unit

    attributes: protected
    definition classes: ResizableArray
  64. 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
  65. 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
  66. def equalsWith[B](that: Seq[B])(f: (GraphDescriptor, B) ⇒ Boolean): Boolean

    definition classes: SeqLike
      deprecated:
    1. use corresponds instead

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

    definition classes: IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce
  68. def filter(p: (GraphDescriptor) ⇒ Boolean): ArrayBuffer[GraphDescriptor]

    definition classes: TraversableLike
  69. def filterNot(p: (GraphDescriptor) ⇒ Boolean): ArrayBuffer[GraphDescriptor]

    definition classes: TraversableLike
  70. 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
  71. def find(p: (GraphDescriptor) ⇒ Boolean): Option[GraphDescriptor]

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

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

    definition classes: SeqLike
      deprecated:
    1. use lastIndexWhere instead

  74. def first: GraphDescriptor

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

  75. def firstOption: Option[GraphDescriptor]

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

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

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

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

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

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

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

    definition classes: ResizableArray → IndexedSeqOptimized → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → FilterMonadic
  82. def genericBuilder[B]: Builder[B, ArrayBuffer[B]]

    definition classes: GenericTraversableTemplate
  83. 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
  84. def groupBy[K](f: (GraphDescriptor) ⇒ K): Map[K, ArrayBuffer[GraphDescriptor]]

    definition classes: TraversableLike
  85. def grouped(size: Int): Iterator[ArrayBuffer[GraphDescriptor]]

    definition classes: IterableLike
  86. def hasDefiniteSize: Boolean

    definition classes: TraversableLike → TraversableOnce
  87. 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
  88. def head: GraphDescriptor

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

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

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

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

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

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

    definition classes: IndexedSeqOptimized → SeqLike
  95. def indexWhere(p: (GraphDescriptor) ⇒ Boolean): Int

    definition classes: SeqLike
  96. def indices: Range

    definition classes: SeqLike
  97. def init: ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → TraversableLike
  98. val initialSize: Int

    attributes: protected
    definition classes: ArrayBuffer → ResizableArray
  99. def insert(n: Int, elems: GraphDescriptor*): Unit

    definition classes: BufferLike
  100. def insertAll(n: Int, seq: Traversable[GraphDescriptor]): Unit

    definition classes: ArrayBuffer → BufferLike
  101. def intersect[B >: GraphDescriptor](that: Seq[B]): ArrayBuffer[GraphDescriptor]

    definition classes: SeqLike
  102. def isDefinedAt(idx: Int): Boolean

    definition classes: SeqLike
  103. def isEmpty: Boolean

    definition classes: IndexedSeqOptimized → IterableLike → TraversableLike → TraversableOnce
  104. 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
  105. def isTraversableAgain: Boolean

    attributes: final
    definition classes: TraversableLike → TraversableOnce
  106. def iterator: Iterator[GraphDescriptor]

    definition classes: IndexedSeqLike → IterableLike
  107. def jadd(value: JEntity): Unit

    definition classes: JArrayBufferMutableJArrayMutable
  108. def jderror(unexpected: JEntity, expected: String, id: String): Nothing

    definition classes: JEntity
  109. def jnew(): JEntity

  110. def jpreadd(x: JEntity): GraphDescriptor

    definition classes: DataSetBuilderAdapterJArrayBufferMutable
  111. def jserror(unserializable: String, id: String): Nothing

    definition classes: JEntity
  112. def last: GraphDescriptor

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

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

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

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

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

    definition classes: IndexedSeqOptimized → SeqLike
  118. def lastIndexWhere(p: (GraphDescriptor) ⇒ Boolean): Int

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

    definition classes: TraversableLike
  120. def length: Int

    definition classes: ResizableArray → SeqLike
  121. def lengthCompare(len: Int): Int

    definition classes: IndexedSeqOptimized → SeqLike
  122. def lift: (Int) ⇒ Option[GraphDescriptor]

    definition classes: PartialFunction
  123. def map(f: (GraphDescriptor) ⇒ GraphDescriptor): DataSetBuilder

  124. def map[B, That](f: (GraphDescriptor) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[GraphDescriptor], B, That]): That

    definition classes: TraversableLike → FilterMonadic
  125. def mapResult[NewTo](f: (ArrayBuffer[GraphDescriptor]) ⇒ NewTo): Builder[GraphDescriptor, NewTo]

    definition classes: Builder
  126. def max[B >: GraphDescriptor](implicit cmp: Ordering[B]): GraphDescriptor

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

    definition classes: TraversableOnce
  128. def mkSet(model: Model): DataSet

  129. def mkString: String

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

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

    definition classes: TraversableOnce
  132. val model: ModelLike

  133. 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
  134. def newBuilder: Builder[GraphDescriptor, ArrayBuffer[GraphDescriptor]]

    attributes: protected[this]
    definition classes: GenericTraversableTemplate → HasNewBuilder
  135. def newGraph(): GraphBuilder

    definition classes: DataSetBuilderDataSetBuilderAdapter
  136. def nonEmpty: Boolean

    definition classes: TraversableOnce
  137. 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
  138. 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
  139. def orElse[A1 <: Int, B1 >: GraphDescriptor](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

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

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

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

    definition classes: SeqLike
  143. def prefixLength(p: (GraphDescriptor) ⇒ Boolean): Int

    definition classes: SeqLike
  144. def prepend(elems: GraphDescriptor*): Unit

    definition classes: BufferLike
  145. def prependAll(xs: TraversableOnce[GraphDescriptor]): Unit

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

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

    definition classes: TraversableOnce
  148. def projection: SeqView[GraphDescriptor, ArrayBuffer[GraphDescriptor]]

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

  149. def readOnly: Seq[GraphDescriptor]

    definition classes: BufferLike
  150. def reduceLeft[B >: GraphDescriptor](op: (B, GraphDescriptor) ⇒ B): B

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

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

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

    definition classes: TraversableOnce
  154. def reduceToSize(sz: Int): Unit

    definition classes: ResizableArray
  155. def remove(n: Int): GraphDescriptor

    definition classes: ArrayBuffer → BufferLike
  156. def remove(n: Int, count: Int): Unit

    definition classes: ArrayBuffer → BufferLike
  157. def repr: ArrayBuffer[GraphDescriptor]

    definition classes: TraversableLike
  158. def result(): ArrayBuffer[GraphDescriptor]

    definition classes: ArrayBuffer → Builder
  159. def reverse: ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → SeqLike
  160. def reverseIterator: Iterator[GraphDescriptor]

    definition classes: IndexedSeqOptimized → SeqLike
  161. def reverseMap[B, That](f: (GraphDescriptor) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[GraphDescriptor], B, That]): That

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

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

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

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

    definition classes: IndexedSeqOptimized → IterableLike
  165. def scanLeft[B, That](z: B)(op: (B, GraphDescriptor) ⇒ B)(implicit bf: CanBuildFrom[ArrayBuffer[GraphDescriptor], B, That]): That

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

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

    definition classes: IndexedSeqOptimized → SeqLike
  168. def shuffle(): Unit

  169. def size: Int

    definition classes: SeqLike → TraversableOnce
  170. var size0: Int

    attributes: protected
    definition classes: ResizableArray
  171. def sizeHint(len: Int): Unit

    definition classes: ArrayBuffer → Builder
  172. def sizeHint(coll: scala.collection.TraversableLike[_, _], delta: Int): Unit

    definition classes: Builder
  173. def sizeHintBounded(size: Int, boundingColl: scala.collection.TraversableLike[_, _]): Unit

    definition classes: Builder
  174. def slice(from: Int, until: Int): DataSetBuilder

    definition classes: DataSetBuilder → IndexedSeqOptimized → IterableLike → TraversableLike
  175. def sliding[B >: GraphDescriptor](size: Int, step: Int): Iterator[ArrayBuffer[GraphDescriptor]]

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

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

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

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

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

    definition classes: IndexedSeqOptimized → TraversableLike
  181. def split(selectedPart: Int, numParts: Int): (DataSetBuilder, DataSetBuilder)

  182. def splitAt(n: Int): (ArrayBuffer[GraphDescriptor], ArrayBuffer[GraphDescriptor])

    definition classes: IndexedSeqOptimized → TraversableLike
  183. def startsWith[B](that: Seq[B], offset: Int): Boolean

    definition classes: IndexedSeqOptimized → SeqLike
  184. def startsWith[B](that: Seq[B]): Boolean

    definition classes: SeqLike
  185. def stringPrefix: String

    definition classes: ArrayBuffer → BufferLike → TraversableLike
  186. def sum[B >: GraphDescriptor](implicit num: Numeric[B]): B

    definition classes: TraversableOnce
  187. def swap(a: Int, b: Int): Unit

    attributes: protected
    definition classes: ResizableArray
  188. def synchronized[T0](arg0: T0): T0

    attributes: final
    definition classes: AnyRef
  189. def tail: ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → TraversableLike
  190. def take(n: Int): ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → IterableLike → TraversableLike
  191. def takeRight(n: Int): ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → IterableLike
  192. def takeWhile(p: (GraphDescriptor) ⇒ Boolean): ArrayBuffer[GraphDescriptor]

    definition classes: IndexedSeqOptimized → IterableLike → TraversableLike
  193. def thisCollection: IndexedSeq[GraphDescriptor]

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

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

    definition classes: TraversableOnce
  196. def toCollection(repr: ArrayBuffer[GraphDescriptor]): IndexedSeq[GraphDescriptor]

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

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

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

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

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

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

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

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

    definition classes: IterableLike → TraversableLike → TraversableOnce
  205. 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: DataSetBuilder → SeqLike → Function1 → TraversableLike → AnyRef → Any
  206. def toTraversable: Traversable[GraphDescriptor]

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

    definition classes: GenericTraversableTemplate
  208. def treeDecomposition(opts: Options): DataSetBuilder

  209. def trimEnd(n: Int): Unit

    definition classes: BufferLike
  210. def trimStart(n: Int): Unit

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

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

    definition classes: GenericTraversableTemplate
  213. def update(idx: Int, elem: GraphDescriptor): Unit

    definition classes: ResizableArray → IndexedSeqLike → Seq
  214. def updated[B >: GraphDescriptor, That](index: Int, elem: B)(implicit bf: CanBuildFrom[ArrayBuffer[GraphDescriptor], B, That]): That

    definition classes: SeqLike
  215. def view(from: Int, until: Int): IndexedSeqView[GraphDescriptor, ArrayBuffer[GraphDescriptor]]

    definition classes: IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  216. def view: IndexedSeqView[GraphDescriptor, ArrayBuffer[GraphDescriptor]]

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

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

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

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

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

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

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

    definition classes: IndexedSeqOptimized → IterableLike