Object/Trait

com.twitter.finagle

NameTree

Related Docs: trait NameTree | package finagle

Permalink

object NameTree

The NameTree object comprises NameTree types as well as binding and evaluation routines.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NameTree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

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

    Permalink

    A NameTree representing fallback; it is evaluated by picking the first nonnegative (evaluated) subtree.

  2. case class Leaf[+T](value: T) extends NameTree[T] with Product with Serializable

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

    Permalink

    A NameTree representing a weighted union of trees.

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

    NameTree gives no semantics to weights (they are interpreted higher in the stack) except to simplify away single-child Unions regardless of weight.

  4. case class Weighted[+T](weight: Double, tree: NameTree[T]) extends Product with Serializable

    Permalink

Value Members

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. object Alt extends Serializable

    Permalink
  5. object Empty extends NameTree[Nothing]

    Permalink

    An empty NameTree.

  6. object Fail extends NameTree[Nothing]

    Permalink

    A failing NameTree.

  7. object Neg extends NameTree[Nothing]

    Permalink

    A negative NameTree.

  8. object Union extends Serializable

    Permalink
  9. object Weighted extends Serializable

    Permalink
  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. def clone(): AnyRef

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

    Permalink
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  14. implicit def equiv[T]: Equiv[NameTree[T]]

    Permalink
  15. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  17. def hashCode(): Int

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

    Permalink
    Definition Classes
    Any
  19. def map[T, U](f: (T) ⇒ U)(tree: NameTree[T]): NameTree[U]

    Permalink

    Rewrite the paths in a tree for values defined by the given partial function.

  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. def read(s: String): NameTree[Path]

    Permalink

    Parse a NameTree from a string with concrete syntax

    Parse a NameTree from a string with concrete syntax

    tree       ::= name
                   weight '*' tree
                   tree '&' tree
                   tree '|' tree
                   '(' tree ')'
    
    name       ::= path | '!' | '~' | '$'
    
    weight     ::= [0-9]*\.?[0-9]+

    For example:

    /foo & /bar | /baz | $

    parses in to the NameTree

    Alt(Union(Leaf(Path(foo)),Leaf(Path(bar))),Leaf(Path(baz)),Empty)

    The production path is documented at Path.read.

    Exceptions thrown

    IllegalArgumentException when the string does not represent a valid name tree.

  24. def show[T](tree: NameTree[T])(implicit arg0: Showable[T]): String

    Permalink

    A string parseable by NameTree.read.

    A string parseable by NameTree.read.

    Annotations
    @tailrec()
  25. def simplify[T](tree: NameTree[T]): NameTree[T]

    Permalink

    Simplify the given NameTree, yielding a new NameTree which is evaluation-equivalent.

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

    Permalink
    Definition Classes
    AnyRef
  27. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped