case class Alt[+T](trees: NameTree[T]*) extends NameTree[T] with ForCaseClass with Product with Serializable
A NameTree representing fallback; it is evaluated by picking the first nonnegative (evaluated) subtree.
- Alphabetic
- By Inheritance
- Alt
- Serializable
- Product
- Equals
- ForCaseClass
- CachedHashCode
- NameTree
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def computeHashCode: Int
How
hashCode
is computed.How
hashCode
is computed.- Attributes
- protected
- Definition Classes
- ForCaseClass → CachedHashCode
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def eval[U >: T]: Option[Set[U]]
Evaluate this NameTree with the default evaluation strategy.
Evaluate this NameTree with the default evaluation strategy. A tree is evaluated recursively, Alt nodes are evaluated by selecting its first nonnegative child.
- Definition Classes
- NameTree
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def hashCode(): Int
- Definition Classes
- CachedHashCode → AnyRef → Any
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def map[U](f: (T) => U): NameTree[U]
Use
f
to map a T-typed NameTree to a U-typed one.Use
f
to map a T-typed NameTree to a U-typed one.- Definition Classes
- NameTree
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def show(implicit showable: Showable[T]): String
A parseable representation of the name tree; a NameTree is recovered from this string by NameTree.read.
A parseable representation of the name tree; a NameTree is recovered from this string by NameTree.read.
- Definition Classes
- NameTree
- def simplified: NameTree[T]
A simplified version of this NameTree -- the returned name tree is equivalent vis-à-vis evaluation.
A simplified version of this NameTree -- the returned name tree is equivalent vis-à-vis evaluation. The returned name also represents a fixpoint; in other words:
tree.simplified == tree.simplified.simplified
- Definition Classes
- NameTree
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- Alt → AnyRef → Any
- val trees: NameTree[T]*
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()