GraphDdlAst

Instance Constructors

new GraphDdlAst()

Type Members

type Self = Traversable[GraphDdlAst]

Attributes
protected[this]
Definition Classes
TraversableLike
class WithFilter extends FilterMonadic[A, Repr]

Definition Classes
TraversableLike

Abstract Value Members

abstract def canEqual(that: Any): Boolean

Definition Classes
Equals
abstract def productArity: Int

Definition Classes
Product
abstract def productElement(n: Int): Any

Definition Classes
Product

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def ++[B >: GraphDdlAst, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def ++:[B >: GraphDdlAst, That](that: Traversable[B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

Definition Classes
TraversableLike
def ++:[B >: GraphDdlAst, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

Definition Classes
TraversableLike
def /:[B](z: B)(op: (B, GraphDdlAst) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def :\[B](z: B)(op: (GraphDdlAst, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addString(b: StringBuilder): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, sep: String): StringBuilder

Definition Classes
TraversableOnce
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Definition Classes
TraversableOnce
def aggregate[B](z: ⇒ B)(seqop: (B, GraphDdlAst) ⇒ B, combop: (B, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def argString: String

Definition Classes
TreeNode
def args: Iterator[Any]

Definition Classes
TreeNode
def arity: Int

Definition Classes
TreeNode
final def asInstanceOf[T0]: T0

Definition Classes
Any
val children: Array[GraphDdlAst]

Definition Classes
AbstractTreeNode → TreeNode
final lazy val childrenAsSet: Set[GraphDdlAst]

Definition Classes
AbstractTreeNode
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect[B, That](pf: PartialFunction[GraphDdlAst, B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def collectFirst[B](pf: PartialFunction[GraphDdlAst, B]): Option[B]

Definition Classes
TraversableOnce
def companion: GenericCompanion[Traversable]

Definition Classes
Traversable → GenTraversable → GenericTraversableTemplate
final def containsChild(other: GraphDdlAst): Boolean

Definition Classes
AbstractTreeNode → TreeNode
Annotations
@inline()
final def containsTree(other: GraphDdlAst): Boolean

Definition Classes
AbstractTreeNode → TreeNode
Annotations
@inline()
def copyToArray[B >: GraphDdlAst](xs: Array[B], start: Int, len: Int): Unit

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def copyToArray[B >: GraphDdlAst](xs: Array[B]): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToArray[B >: GraphDdlAst](xs: Array[B], start: Int): Unit

Definition Classes
TraversableOnce → GenTraversableOnce
def copyToBuffer[B >: GraphDdlAst](dest: Buffer[B]): Unit

Definition Classes
TraversableOnce
def count(p: (GraphDdlAst) ⇒ Boolean): Int

Definition Classes
TraversableOnce → GenTraversableOnce
implicit def ct: ClassTag[GraphDdlAst]

Attributes
protected
Definition Classes
AbstractTreeNode → TreeNode
def drop(n: Int): Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def dropWhile(p: (GraphDdlAst) ⇒ Boolean): Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def exists(p: (GraphDdlAst) ⇒ Boolean): Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def filter(p: (GraphDdlAst) ⇒ Boolean): Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def filterNot(p: (GraphDdlAst) ⇒ Boolean): Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(p: (GraphDdlAst) ⇒ Boolean): Option[GraphDdlAst]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def flatMap[B, That](f: (GraphDdlAst) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def flatten[B](implicit asTraversable: (GraphDdlAst) ⇒ GenTraversableOnce[B]): Traversable[B]

Definition Classes
GenericTraversableTemplate
def fold[A1 >: GraphDdlAst](z: A1)(op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def foldLeft[B](z: B)(op: (B, GraphDdlAst) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def foldRight[B](z: B)(op: (GraphDdlAst, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def forall(p: (GraphDdlAst) ⇒ Boolean): Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
final def foreach[O](f: (GraphDdlAst) ⇒ O): Unit

Definition Classes
AbstractTreeNode → TreeNode → GenericTraversableTemplate → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
Annotations
@inline()
def genericBuilder[B]: Builder[B, Traversable[B]]

Definition Classes
GenericTraversableTemplate
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def groupBy[K](f: (GraphDdlAst) ⇒ K): Map[K, Traversable[GraphDdlAst]]

Definition Classes
TraversableLike → GenTraversableLike
def hasDefiniteSize: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
final lazy val hashCode: Int

Definition Classes
AbstractTreeNode → TreeNode → AnyRef → Any
def head: GraphDdlAst

Definition Classes
TraversableLike → GenTraversableLike
def headOption: Option[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
final lazy val height: Int

Definition Classes
AbstractTreeNode → TreeNode
def init: Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def inits: Iterator[Traversable[GraphDdlAst]]

Definition Classes
TraversableLike
def isEmpty: Boolean

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isLeaf: Boolean

Definition Classes
TreeNode
final def isTraversableAgain: Boolean

Definition Classes
TraversableLike → GenTraversableLike → GenTraversableOnce
def last: GraphDdlAst

Definition Classes
TraversableLike → GenTraversableLike
def lastOption: Option[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
final def map[O <: TreeNode[O]](f: (GraphDdlAst) ⇒ O)(implicit arg0: ClassTag[O]): O

Definition Classes
AbstractTreeNode → TreeNode
Annotations
@inline()
def map[B, That](f: (GraphDdlAst) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike → FilterMonadic
def max[B >: GraphDdlAst](implicit cmp: Ordering[B]): GraphDdlAst

Definition Classes
TraversableOnce → GenTraversableOnce
def maxBy[B](f: (GraphDdlAst) ⇒ B)(implicit cmp: Ordering[B]): GraphDdlAst

Definition Classes
TraversableOnce → GenTraversableOnce
def min[B >: GraphDdlAst](implicit cmp: Ordering[B]): GraphDdlAst

Definition Classes
TraversableOnce → GenTraversableOnce
def minBy[B](f: (GraphDdlAst) ⇒ B)(implicit cmp: Ordering[B]): GraphDdlAst

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString: String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(sep: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
def mkString(start: String, sep: String, end: String): String

Definition Classes
TraversableOnce → GenTraversableOnce
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def newBuilder: Builder[GraphDdlAst, Traversable[GraphDdlAst]]

Attributes
protected[this]
Definition Classes
GenericTraversableTemplate → HasNewBuilder
def nonEmpty: Boolean

Definition Classes
TraversableOnce → GenTraversableOnce
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def par: ParIterable[GraphDdlAst]

Definition Classes
Parallelizable
def parCombiner: Combiner[GraphDdlAst, ParIterable[GraphDdlAst]]

Attributes
protected[this]
Definition Classes
TraversableLike → Parallelizable
def partition(p: (GraphDdlAst) ⇒ Boolean): (Traversable[GraphDdlAst], Traversable[GraphDdlAst])

Definition Classes
TraversableLike → GenTraversableLike
def pretty: String

Definition Classes
TreeNode
def product[B >: GraphDdlAst](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
def productIterator: Iterator[Any]

Definition Classes
Product
def productPrefix: String

Definition Classes
Product
def reduce[A1 >: GraphDdlAst](op: (A1, A1) ⇒ A1): A1

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceLeft[B >: GraphDdlAst](op: (B, GraphDdlAst) ⇒ B): B

Definition Classes
TraversableOnce
def reduceLeftOption[B >: GraphDdlAst](op: (B, GraphDdlAst) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceOption[A1 >: GraphDdlAst](op: (A1, A1) ⇒ A1): Option[A1]

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRight[B >: GraphDdlAst](op: (GraphDdlAst, B) ⇒ B): B

Definition Classes
TraversableOnce → GenTraversableOnce
def reduceRightOption[B >: GraphDdlAst](op: (GraphDdlAst, B) ⇒ B): Option[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def repr: Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def reversed: List[GraphDdlAst]

Attributes
protected[this]
Definition Classes
TraversableOnce
def rewrite(f: PartialFunction[GraphDdlAst, GraphDdlAst]): GraphDdlAst

Definition Classes
TreeNode
def rewriteTopDown(f: PartialFunction[GraphDdlAst, GraphDdlAst]): GraphDdlAst

Definition Classes
TreeNode
def scan[B >: GraphDdlAst, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanLeft[B, That](z: B)(op: (B, GraphDdlAst) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

Definition Classes
TraversableLike → GenTraversableLike
def scanRight[B, That](z: B)(op: (GraphDdlAst, B) ⇒ B)(implicit bf: CanBuildFrom[Traversable[GraphDdlAst], B, That]): That

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.
def seq: Traversable[GraphDdlAst]

Definition Classes
Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
def show(): Unit

Definition Classes
TreeNode
final lazy val size: Int

Definition Classes
AbstractTreeNode → TreeNode → GenTraversableLike → TraversableOnce → GenTraversableOnce
def slice(from: Int, until: Int): Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def span(p: (GraphDdlAst) ⇒ Boolean): (Traversable[GraphDdlAst], Traversable[GraphDdlAst])

Definition Classes
TraversableLike → GenTraversableLike
def splitAt(n: Int): (Traversable[GraphDdlAst], Traversable[GraphDdlAst])

Definition Classes
TraversableLike → GenTraversableLike
def stringPrefix: String

Definition Classes
TraversableLike → GenTraversableLike
def sum[B >: GraphDdlAst](implicit num: Numeric[B]): B

Definition Classes
TraversableOnce → GenTraversableOnce
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def tails: Iterator[Traversable[GraphDdlAst]]

Definition Classes
TraversableLike
def take(n: Int): Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def takeWhile(p: (GraphDdlAst) ⇒ Boolean): Traversable[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableLike
def thisCollection: Traversable[GraphDdlAst]

Attributes
protected[this]
Definition Classes
TraversableLike
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, GraphDdlAst, Col[GraphDdlAst]]): Col[GraphDdlAst]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
def toArray[B >: GraphDdlAst](implicit arg0: ClassTag[B]): Array[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toBuffer[B >: GraphDdlAst]: Buffer[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toCollection(repr: Traversable[GraphDdlAst]): Traversable[GraphDdlAst]

Attributes
protected[this]
Definition Classes
TraversableLike
def toIndexedSeq: IndexedSeq[GraphDdlAst]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterable: Iterable[GraphDdlAst]

Definition Classes
TraversableOnce → GenTraversableOnce
def toIterator: Iterator[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableOnce
def toList: List[GraphDdlAst]

Definition Classes
TraversableOnce → GenTraversableOnce
def toMap[T, U](implicit ev: <:<[GraphDdlAst, (T, U)]): Map[T, U]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSeq: Seq[GraphDdlAst]

Definition Classes
TraversableOnce → GenTraversableOnce
def toSet[B >: GraphDdlAst]: Set[B]

Definition Classes
TraversableOnce → GenTraversableOnce
def toStream: Stream[GraphDdlAst]

Definition Classes
TraversableLike → GenTraversableOnce
def toString(): String

Definition Classes
TreeNode → TraversableLike → AnyRef → Any
def toTraversable: Traversable[GraphDdlAst]

Definition Classes
TraversableLike → TraversableOnce → GenTraversableOnce
Annotations
@deprecatedOverriding( ... , "2.11.0" )
def toVector: Vector[GraphDdlAst]

Definition Classes
TraversableOnce → GenTraversableOnce
def transform[O](f: (GraphDdlAst, List[O]) ⇒ O): O

Definition Classes
TreeNode
def transpose[B](implicit asTraversable: (GraphDdlAst) ⇒ GenTraversableOnce[B]): Traversable[Traversable[B]]

Definition Classes
GenericTraversableTemplate
Annotations
@migration
Migration
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
def tt: scala.reflect.api.JavaUniverse.TypeTag[GraphDdlAst]

Attributes
protected
Definition Classes
AbstractTreeNode → TreeNode
def unzip[A1, A2](implicit asPair: (GraphDdlAst) ⇒ (A1, A2)): (Traversable[A1], Traversable[A2])

Definition Classes
GenericTraversableTemplate
def unzip3[A1, A2, A3](implicit asTriple: (GraphDdlAst) ⇒ (A1, A2, A3)): (Traversable[A1], Traversable[A2], Traversable[A3])

Definition Classes
GenericTraversableTemplate
def view(from: Int, until: Int): TraversableView[GraphDdlAst, Traversable[GraphDdlAst]]

Definition Classes
TraversableLike
def view: TraversableView[GraphDdlAst, Traversable[GraphDdlAst]]

Definition Classes
TraversableLike
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (GraphDdlAst) ⇒ Boolean): FilterMonadic[GraphDdlAst, Traversable[GraphDdlAst]]

Definition Classes
TraversableLike → FilterMonadic
def withNewChildren(newChildren: Array[GraphDdlAst]): GraphDdlAst

Definition Classes
AbstractTreeNode → TreeNode
Annotations
@inline()

Related Docs: object GraphDdlAst | package graphddl

abstract class GraphDdlAst extends AbstractTreeNode[GraphDdlAst]

Instance Constructors

new GraphDdlAst()

Type Members

type Self = Traversable[GraphDdlAst]

class WithFilter extends FilterMonadic[A, Repr]

Abstract Value Members

abstract def canEqual(that: Any): Boolean

abstract def productArity: Int

abstract def productElement(n: Int): Any

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

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

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

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

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

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

final def ==(arg0: Any): Boolean

def addString(b: StringBuilder): StringBuilder

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

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

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

def argString: String

def args: Iterator[Any]

def arity: Int

final def asInstanceOf[T0]: T0

val children: Array[GraphDdlAst]

final lazy val childrenAsSet: Set[GraphDdlAst]

def clone(): AnyRef

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

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

def companion: GenericCompanion[Traversable]

final def containsChild(other: GraphDdlAst): Boolean

final def containsTree(other: GraphDdlAst): Boolean

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

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

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

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

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

implicit def ct: ClassTag[GraphDdlAst]

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

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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

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

def finalize(): Unit

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

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

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

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

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

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

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

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

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

final def getClass(): Class[_]

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

def hasDefiniteSize: Boolean

final lazy val hashCode: Int

def head: GraphDdlAst

def headOption: Option[GraphDdlAst]

final lazy val height: Int

def init: Traversable[GraphDdlAst]

def inits: Iterator[Traversable[GraphDdlAst]]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isLeaf: Boolean

final def isTraversableAgain: Boolean

def last: GraphDdlAst

def lastOption: Option[GraphDdlAst]

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

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

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

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

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