case class Tree[+T](value: T, children: Vector[Tree[T]]) extends Product with Serializable
- Source
- Tree.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Tree
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
Implicitly
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): (Tree[T], B)
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- val children: Vector[Tree[T]]
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate() @throws( ... )
- def contains[S >: T](t: S): Boolean
- def ensuring(cond: (Tree[T]) ⇒ Boolean, msg: ⇒ Any): Tree[T]
- def ensuring(cond: (Tree[T]) ⇒ Boolean): Tree[T]
- def ensuring(cond: Boolean, msg: ⇒ Any): Tree[T]
- def ensuring(cond: Boolean): Tree[T]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def foreach(f: (T) ⇒ Unit): Unit
- def formatted(fmtstr: String): String
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def map[S](f: (T) ⇒ S): Tree[S]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def postOrder: Vector[T]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def tails: Tree[Tree[T]]
-
def
toString(): String
- Definition Classes
- Tree → AnyRef → Any
- val value: T
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def zip[S](that: Tree[S]): Tree[(T, S)]
- def zipWithDepth: Tree[(T, Int)]
- def →[B](y: B): (Tree[T], B)
This is the API documentation for GAPT.
The main package is gapt.