NameTree

Name trees represent a composite T-typed name whose interpretation is subject to evaluation rules. Typically, a Namer is used to provide evaluation context for these trees.

com.twitter.finagle.NameTree.Union nodes represent the union of several trees; a destination is reached by load-balancing over the sub-trees.
Alt nodes represent a fail-over relationship between several trees; the first successful tree is picked as the destination. When the tree-list is empty, Alt-nodes evaluate to Empty.
A Leaf represents a T-typed leaf node;
A Neg represents a negative location; no destination exists here.
Finally, Empty trees represent an empty location: it exists but is uninhabited at this time.

Linear Supertypes

AnyRef, Any

Known Subclasses

Alt, Empty, Fail, Leaf, Neg, Union

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[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

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

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

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

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

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

A parseable representation of the name tree; a NameTree is recovered from this string by NameTree.read.
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
```
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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( ... )

Related Docs: object NameTree | package finagle

sealed trait NameTree[+T] extends AnyRef

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def eval[U >: T]: Option[Set[U]]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[U](f: (T) ⇒ U): NameTree[U]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def show(implicit showable: Showable[T]): String

def simplified: NameTree[T]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped