Class

org.opencypher.graphddl

GraphTypeDefinition

Related Doc: package graphddl

Permalink

case class GraphTypeDefinition(name: String, statements: List[GraphTypeStatement] = List.empty) extends GraphDdlAst with DdlStatement with Product with Serializable

Linear Supertypes
Serializable, Serializable, DdlStatement, GraphDdlAst, AbstractTreeNode[GraphDdlAst], TreeNode[GraphDdlAst], Traversable[GraphDdlAst], GenTraversable[GraphDdlAst], GenericTraversableTemplate[GraphDdlAst, Traversable], TraversableLike[GraphDdlAst, Traversable[GraphDdlAst]], GenTraversableLike[GraphDdlAst, Traversable[GraphDdlAst]], Parallelizable[GraphDdlAst, ParIterable[GraphDdlAst]], TraversableOnce[GraphDdlAst], GenTraversableOnce[GraphDdlAst], FilterMonadic[GraphDdlAst, Traversable[GraphDdlAst]], HasNewBuilder[GraphDdlAst, Traversable[GraphDdlAst]], Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphTypeDefinition
  2. Serializable
  3. Serializable
  4. DdlStatement
  5. GraphDdlAst
  6. AbstractTreeNode
  7. TreeNode
  8. Traversable
  9. GenTraversable
  10. GenericTraversableTemplate
  11. TraversableLike
  12. GenTraversableLike
  13. Parallelizable
  14. TraversableOnce
  15. GenTraversableOnce
  16. FilterMonadic
  17. HasNewBuilder
  18. Product
  19. Equals
  20. AnyRef
  21. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GraphTypeDefinition(name: String, statements: List[GraphTypeStatement] = List.empty)

    Permalink

Type Members

  1. type Self = Traversable[GraphDdlAst]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  2. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def ++[B >: GraphDdlAst, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  4. def ++:[B >: GraphDdlAst, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  5. def ++:[B >: GraphDdlAst, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike

  6. def /:[B](z: B)(op: (B, GraphDdlAst) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  7. def :\[B](z: B)(op: (GraphDdlAst, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  8. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  10. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  11. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce

  12. def aggregate[B](z: ⇒ B)(seqop: (B, GraphDdlAst) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  13. def argString: String

    Permalink
    Definition Classes
    TreeNode

  14. def args: Iterator[Any]

    Permalink
    Definition Classes
    TreeNode

  15. def arity: Int

    Permalink
    Definition Classes
    TreeNode

  16. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  17. val children: Array[GraphDdlAst]

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode

  18. final lazy val childrenAsSet: Set[GraphDdlAst]

    Permalink
    Definition Classes
    AbstractTreeNode

  19. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  20. def collect[B, That](pf: PartialFunction[GraphDdlAst, B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  21. def collectFirst[B](pf: PartialFunction[GraphDdlAst, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce

  22. def companion: GenericCompanion[Traversable]

    Permalink
    Definition Classes
    Traversable → GenTraversable → GenericTraversableTemplate

  23. final def containsChild(other: GraphDdlAst): Boolean

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode
    Annotations
    @inline()

  24. final def containsTree(other: GraphDdlAst): Boolean

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  26. def copyToArray[B >: GraphDdlAst](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  28. def copyToBuffer[B >: GraphDdlAst](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce

  29. def count(p: (GraphDdlAst) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  30. implicit def ct: ClassTag[GraphDdlAst]

    Permalink
    Attributes
    protected
    Definition Classes
    AbstractTreeNode → TreeNode

  31. def drop(n: Int): Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  32. def dropWhile(p: (GraphDdlAst) ⇒ Boolean): Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  33. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  34. def exists(p: (GraphDdlAst) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  35. def filter(p: (GraphDdlAst) ⇒ Boolean): Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  36. def filterNot(p: (GraphDdlAst) ⇒ Boolean): Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  37. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  38. def find(p: (GraphDdlAst) ⇒ Boolean): Option[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  39. def flatMap[B, That](f: (GraphDdlAst) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  40. def flatten[B](implicit asTraversable: (GraphDdlAst) ⇒ GenTraversableOnce[B]): Traversable[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  41. def fold[A1 >: GraphDdlAst](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  42. def foldLeft[B](z: B)(op: (B, GraphDdlAst) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  43. def foldRight[B](z: B)(op: (GraphDdlAst, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  44. def forall(p: (GraphDdlAst) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  45. final def foreach[O](f: (GraphDdlAst) ⇒ O): Unit

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
    Annotations
    @inline()

  46. def genericBuilder[B]: Builder[B, Traversable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate

  47. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  48. def groupBy[K](f: (GraphDdlAst) ⇒ K): Map[K, Traversable[GraphDdlAst]]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  49. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  50. final lazy val hashCode: Int

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode → AnyRef → Any

  51. def head: GraphDdlAst

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  52. def headOption: Option[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  53. final lazy val height: Int

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode

  54. def init: Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  55. def inits: Iterator[Traversable[GraphDdlAst]]

    Permalink
    Definition Classes
    TraversableLike

  56. def isEmpty: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  57. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  58. def isLeaf: Boolean

    Permalink
    Definition Classes
    TreeNode

  59. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce

  60. def last: GraphDdlAst

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  61. def lastOption: Option[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  62. final def map[O <: TreeNode[O]](f: (GraphDdlAst) ⇒ O)(implicit arg0: ClassTag[O]): O

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode
    Annotations
    @inline()

  63. def map[B, That](f: (GraphDdlAst) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic

  64. def max[B >: GraphDdlAst](implicit cmp: Ordering[B]): GraphDdlAst

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  65. def maxBy[B](f: (GraphDdlAst) ⇒ B)(implicit cmp: Ordering[B]): GraphDdlAst

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  66. def min[B >: GraphDdlAst](implicit cmp: Ordering[B]): GraphDdlAst

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  67. def minBy[B](f: (GraphDdlAst) ⇒ B)(implicit cmp: Ordering[B]): GraphDdlAst

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  68. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  69. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  71. val name: String

    Permalink

  72. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  73. def newBuilder: Builder[GraphDdlAst, Traversable[GraphDdlAst]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder

  74. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  75. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  76. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  77. def par: ParIterable[GraphDdlAst]

    Permalink
    Definition Classes
    Parallelizable

  78. def parCombiner: Combiner[GraphDdlAst, ParIterable[GraphDdlAst]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike → Parallelizable

  79. def partition(p: (GraphDdlAst) ⇒ Boolean): (Traversable[GraphDdlAst], Traversable[GraphDdlAst])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  80. def pretty: String

    Permalink
    Definition Classes
    TreeNode

  81. def product[B >: GraphDdlAst](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  82. def reduce[A1 >: GraphDdlAst](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  83. def reduceLeft[B >: GraphDdlAst](op: (B, GraphDdlAst) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce

  84. def reduceLeftOption[B >: GraphDdlAst](op: (B, GraphDdlAst) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  85. def reduceOption[A1 >: GraphDdlAst](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  86. def reduceRight[B >: GraphDdlAst](op: (GraphDdlAst, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  87. def reduceRightOption[B >: GraphDdlAst](op: (GraphDdlAst, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  88. def repr: Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  89. def reversed: List[GraphDdlAst]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce

  90. def rewrite(f: PartialFunction[GraphDdlAst, GraphDdlAst]): GraphDdlAst

    Permalink
    Definition Classes
    TreeNode

  91. def rewriteTopDown(f: PartialFunction[GraphDdlAst, GraphDdlAst]): GraphDdlAst

    Permalink
    Definition Classes
    TreeNode

  92. def scan[B >: GraphDdlAst, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  93. def scanLeft[B, That](z: B)(op: (B, GraphDdlAst) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  94. def scanRight[B, That](z: B)(op: (GraphDdlAst, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  95. def seq: Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce

  96. def show(): Unit

    Permalink
    Definition Classes
    TreeNode

  97. final lazy val size: Int

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode → GenTraversableLike → TraversableOnce → GenTraversableOnce

  98. def slice(from: Int, until: Int): Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  99. def span(p: (GraphDdlAst) ⇒ Boolean): (Traversable[GraphDdlAst], Traversable[GraphDdlAst])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  100. def splitAt(n: Int): (Traversable[GraphDdlAst], Traversable[GraphDdlAst])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  101. val statements: List[GraphTypeStatement]

    Permalink

  102. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  103. def sum[B >: GraphDdlAst](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  104. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  105. def tail: Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  106. def tails: Iterator[Traversable[GraphDdlAst]]

    Permalink
    Definition Classes
    TraversableLike

  107. def take(n: Int): Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  108. def takeWhile(p: (GraphDdlAst) ⇒ Boolean): Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike

  109. def thisCollection: Traversable[GraphDdlAst]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  110. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, GraphDdlAst, Col[GraphDdlAst]]): Col[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce

  111. def toArray[B >: GraphDdlAst](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  112. def toBuffer[B >: GraphDdlAst]: Buffer[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  113. def toCollection(repr: Traversable[GraphDdlAst]): Traversable[GraphDdlAst]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike

  114. def toIndexedSeq: IndexedSeq[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  115. def toIterable: Iterable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  116. def toIterator: Iterator[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce

  117. def toList: List[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

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

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  119. def toSeq: Seq[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  120. def toSet[B >: GraphDdlAst]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  121. def toStream: Stream[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableOnce

  122. def toString(): String

    Permalink
    Definition Classes
    TreeNode → TraversableLike → AnyRef → Any

  123. def toTraversable: Traversable[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )

  124. def toVector: Vector[GraphDdlAst]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce

  125. def transform[O](f: (GraphDdlAst, List[O]) ⇒ O): O

    Permalink
    Definition Classes
    TreeNode

  126. def transpose[B](implicit asTraversable: (GraphDdlAst) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  127. def tt: scala.reflect.api.JavaUniverse.TypeTag[GraphDdlAst]

    Permalink
    Attributes
    protected
    Definition Classes
    AbstractTreeNode → TreeNode

  128. def unzip[A1, A2](implicit asPair: (GraphDdlAst) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  129. def unzip3[A1, A2, A3](implicit asTriple: (GraphDdlAst) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate

  130. def view(from: Int, until: Int): TraversableView[GraphDdlAst, Traversable[GraphDdlAst]]

    Permalink
    Definition Classes
    TraversableLike

  131. def view: TraversableView[GraphDdlAst, Traversable[GraphDdlAst]]

    Permalink
    Definition Classes
    TraversableLike

  132. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  134. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  135. def withFilter(p: (GraphDdlAst) ⇒ Boolean): FilterMonadic[GraphDdlAst, Traversable[GraphDdlAst]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic

  136. def withNewChildren(newChildren: Array[GraphDdlAst]): GraphDdlAst

    Permalink
    Definition Classes
    AbstractTreeNode → TreeNode
    Annotations
    @inline()

Inherited from Serializable

Inherited from Serializable

Inherited from DdlStatement

Inherited from GraphDdlAst

Inherited from AbstractTreeNode[GraphDdlAst]

Inherited from TreeNode[GraphDdlAst]

Inherited from Traversable[GraphDdlAst]

Inherited from GenTraversable[GraphDdlAst]

Inherited from GenericTraversableTemplate[GraphDdlAst, Traversable]

Inherited from TraversableLike[GraphDdlAst, Traversable[GraphDdlAst]]

Inherited from GenTraversableLike[GraphDdlAst, Traversable[GraphDdlAst]]

Inherited from Parallelizable[GraphDdlAst, ParIterable[GraphDdlAst]]

Inherited from TraversableOnce[GraphDdlAst]

Inherited from GenTraversableOnce[GraphDdlAst]

Inherited from FilterMonadic[GraphDdlAst, Traversable[GraphDdlAst]]

Inherited from HasNewBuilder[GraphDdlAst, Traversable[GraphDdlAst]]

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped