com.twitter.finagle.NameTree

Union

case class Union[+T](trees: NameTree[T]*) extends NameTree[T] with Product with Serializable

A NameTree representing a union of trees. It is evaluated by returning the union of atoms of its (recursively evaluated) children. When all children are negative, the Union itself evaluates negative.

Linear Supertypes
Serializable, Serializable, Product, Equals, NameTree[T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Union
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. NameTree
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Union(trees: NameTree[T]*)

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  9. 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
  10. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  12. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  13. 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
  14. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  15. final def notify(): Unit

    Definition Classes
    AnyRef
  16. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  17. def show(implicit showable: Showable[T]): String

    A parsable representation of the name tree; a NameTree is recovered from this string by NameTree.read.

    A parsable representation of the name tree; a NameTree is recovered from this string by NameTree.read.

    Definition Classes
    NameTree
  18. 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
  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  20. def toString(): String

    Definition Classes
    Union → AnyRef → Any
  21. val trees: NameTree[T]*

  22. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from NameTree[T]

Inherited from AnyRef

Inherited from Any

Ungrouped