Packages

  • package root
    Definition Classes
    root
  • package com
    Definition Classes
    root
  • package twitter

    Start with com.twitter.finagle.

    Definition Classes
    com
  • package finagle

    Finagle is an extensible RPC system.

    Finagle is an extensible RPC system.

    Services are represented by class com.twitter.finagle.Service. Clients make use of com.twitter.finagle.Service objects while servers implement them.

    Finagle contains a number of protocol implementations; each of these implement Client and/or com.twitter.finagle.Server. For example, Finagle's HTTP implementation, com.twitter.finagle.Http (in package finagle-http), exposes both.

    Thus a simple HTTP server is built like this:

    import com.twitter.finagle.{Http, Service}
    import com.twitter.finagle.http.{Request, Response}
    import com.twitter.util.{Await, Future}
    
    val service = new Service[Request, Response] {
      def apply(req: Request): Future[Response] =
        Future.value(Response())
    }
    val server = Http.server.serve(":8080", service)
    Await.ready(server)

    We first define a service to which requests are dispatched. In this case, the service returns immediately with a HTTP 200 OK response, and with no content.

    This service is then served via the Http protocol on TCP port 8080. Finally we wait for the server to stop serving.

    We can now query our web server:

    % curl -D - localhost:8080
    HTTP/1.1 200 OK

    Building an HTTP client is also simple. (Note that type annotations are added for illustration.)

    import com.twitter.finagle.{Http, Service}
    import com.twitter.finagle.http.{Request, Response}
    import com.twitter.util.{Future, Return, Throw}
    
    val client: Service[Request, Response] = Http.client.newService("localhost:8080")
    val f: Future[Response] = client(Request()).respond {
      case Return(rep) =>
        printf("Got HTTP response %s\n", rep)
      case Throw(exc) =>
        printf("Got error %s\n", exc)
    }

    Http.client.newService("localhost:8080") constructs a new com.twitter.finagle.Service instance connected to localhost TCP port 8080. We then issue a HTTP/1.1 GET request to URI "/". The service returns a com.twitter.util.Future representing the result of the operation. We listen to this future, printing an appropriate message when the response arrives.

    The Finagle homepage contains useful documentation and resources for using Finagle.

    Definition Classes
    twitter
  • package addr
    Definition Classes
    finagle
  • package builder
    Definition Classes
    finagle
  • package client
    Definition Classes
    finagle
  • package context
    Definition Classes
    finagle
  • package core
    Definition Classes
    finagle
  • package dispatch
    Definition Classes
    finagle
  • package exp

    Package exp contains experimental code.

    Package exp contains experimental code. This can be removed or stabilized (moved elsewhere) at any time.

    Definition Classes
    finagle
  • package factory
    Definition Classes
    finagle
  • package filter
    Definition Classes
    finagle
  • package http
    Definition Classes
    finagle
  • package http2
    Definition Classes
    finagle
  • package liveness
    Definition Classes
    finagle
  • package loadbalancer

    This package implements client side load balancing algorithms.

    This package implements client side load balancing algorithms.

    As an end-user, see the Balancers API to create instances which can be used to configure a Finagle client with various load balancing strategies.

    As an implementor, each algorithm gets its own subdirectory and is exposed via the Balancers object. Several convenient traits are provided which factor out common behavior and can be mixed in (i.e. Balancer, DistributorT, NodeT, and Updating).

    Definition Classes
    finagle
  • package memcached
    Definition Classes
    finagle
  • package mux

    Package mux implements a generic RPC multiplexer with a rich protocol.

    Package mux implements a generic RPC multiplexer with a rich protocol. Mux is itself encoding independent, so it is meant to use as the transport for other RPC systems (eg. thrift). In OSI terminology, it is a pure session layer.

    In the below description, all numeric values are unsigned and in big-endian byte order. The schema size:4 body:10 defines the field size to be 4 bytes, followed by 10 bytes of the field body. The schema key~4 defines the field key to be defined by 4 bytes interpreted as the size of the field, followed by that many bytes comprising the field itself--it is shorthand for keysize:4 key:keysize. Groups are denoted by parenthesis; * denotes repetition of the previous schema 0 or more times, while {n} indicates repetition exactly n times. Unspecified sizes consume the rest of the frame: they may be specified only as the last field in the message.

    All strings in Mux are Utf-8 encoded, and are never null-terminated.

    Message framing

    Messages in mux are framed with a 4-byte big-endian size header, followed by 1 byte describing the message type and a 3-byte tag; or, diagrammatically: size:4 type:1 tag:3. The remainder of the frame (size-4 bytes) contains the body. Its format depends on the message type, documented below.

    Tag 0 designates a "marker" T message that expects no reply. Some messages may be split into an ordered sequence of fragments. Tag MSB=0 denotes the last message in such a sequence, making the tag namespace 23 bits. The tag is otherwise arbitrary, and is chosen by the sender of the T message.

    Currently, only Tdispatch and Rdispatch messages may be split into an ordered sequence of fragments. TdispatchError message ends a Tdispatch sequence and an Rerr ends an Rdispatch sequence.

    Message types, interpreted as a two's complement, 1-byte integer are numbered as follows: positive numbers are T-messages; their negative complement is the corresponding R message. T-messages greater than 63 (correspondingly R-messages smaller than -63) are session messages. The message number -128 is reserved for Rerr. All other messages are application messages. Middle boxes may forward application messages indiscriminately. Because of an early implementation bug, two aliases exist: 127 is Rerr, and -62 is Tdiscarded.

    The protocol is full duplex: both the server and client may send T messages initiating an exchange.

    Exchanges

    Messages are designated as "T messages" or "R messages", T and R being stand-ins for transmit and receive. A T message initiates an exchange and is assigned a free tag by the sender. A reply is either an R message of the same type (Rx replies to Tx for some x), or an Rerr, indicating a session layer error. R messages are matched to their T messages by tag, and the reply concludes the exchange and frees the tag for future use. Implementations should reuse small tag numbers.

    Messages

    size:4 Tinit:1 tag:3 version:2 (key~4 value~4)* reinitializes a session. Clients typically send this at the beginning of the session. When doing so, the sender may issue no more T messages until the corresponding size:4 Rinit:1 tag:3 version:2 (key~4 value~4)* has been received. After the Rinit was received, all connection state has been reset (outstanding tags are invalidated) and the stream is resumed according to the newly negotiated parameters. Prior to the first Tinit, the session operates at version 1. Rinit's version field is the accepted version of the session (which may be lower than the one requested by Tinit).

    size:4 Treq:1 tag:3 n:1 (key:1 value~1){n} body: initiates the request described by its body. The request body is delivered to the application. The request header contains a number of key-value pairs that describe request metadata.

    Keys for Treq messages are as follows:

    1. traceid: a 24-byte value describing the full Dapper trace id assigned by the client. The value's format is spanid:8 parentid:8 traceid:8.

    2. traceflag: a bitmask describing trace flags. Currently, the only defined flag is bit 0 which enables "debug mode", asking the server to force trace sampling.

    size:4 Tdispatch:1 tag:3 nctx:2 (ckey~2 cval~2){nc} dst~2 nd:2 (from~2 to~2){nd} body: implements destination dispatch. Tdispatch messages carry a set of keyed request contexts, followed by a logical destination encoded as a UTF-8 string. A delegation table follows describing rewrite rules that apply to this request.

    size:4 Rreq:1 tag:3 status:1 body: replies to a request. Status codes are as follows: 0=OK; the body contains the reply. 1=ERROR; the body contains a string describing the error. 2=NACK; a negative acknowledgment, the body contains a string describing the reason.

    size:4 Rdispatch:1 tag:3 status:1 nctx:2 (key~2 value~2){nctx} body: replies to a Tdispatch request. Status codes are as in Rreq. Replies can include request contexts. MuxFailure flags are currently sent via Rdispatch contexts under the "MuxFailure" key. See the MuxFailure flags section below.

    size:4 Rerr:1 tag:3 why: indicates that the corresponding T message produced an error. Rerr is specifically for server errors: the server failed to interpret or act on the message. The body carries a string describing the error.

    size:4 Tdrain:1 tag:3 is a request sent by the server telling the client to stop sending new requests. A client acknowledges this with an Rdrain message.

    size:4 Tping:1 tag:3 is sent by either party to check the liveness of its peer; these should be responded to immediately with a Rping message.

    size:4 Tdiscarded:1 tag:3 discard_tag:3 why: is a marker message and therefore has a tag value of 0. discard_tag indicates the tag of the Tdispatch to be discarded by the client. This can be used as a hint for early termination. Why is a string describing why the request was discarded. Note that it does *not* free the server from the obligation of replying to the original Treq.

    size:4 Tlease:1 tag:3 unit:1 howmuch:8 is a marker message indicating that a lease has been issued for howmuch units. As a marker message, its tag value must be 0. Unit '0' is reserved for duration in milliseconds. Whenever a lease has not been issued, a client can assume it holds an indefinite lease. Adhering to the lease is optional, but the server may reject requests or provide degraded service should the lease expire. This is used by servers to implement features like garbage collection avoidance.

    MuxFailure Flags

    Failure flags are read and written as an 8 byte integer. Unrecognized flags will be ignored silently, but should all be considered reserved for future use.

    Flag Value Meaning Restartable 1 << 0 Request is safe to re-issue Rejected 1 << 1 Request was rejected/Nacked by the server NonRetryable 1 << 2 Request should not be retried

    Security

    TLS is supported via three mechanisms: - Explicit and exclusive TLS. This pathway involves requiring the establishment of TLS immediately after establishing the socket connection. This is configured by adding TLS configuration to the client or server and not configuring opportunistic TLS or TLS snooping (see below).

    - Negotiated Opportunistic TLS. This pathway involves starting the connection as cleartext and the client and server subsequently negotiate a TLS level via the handshake. Based on that handshake the connection is either left as cleartext or upgraded to TLS. This is configured by adding TLS configuration and also configuring an opportunistic TLS level but not configuring TLS snooping.

    In this pathway there are three configuration options:

    • Off signals that TLS is not supported by this peer
    • Desired signals that TLS is preferred but not required by this peer
    • Required signals that this peer will only allow the session to continue over TLS

    - TLS snooping. This pathway allows a server to use TLS either by performing a TLS handshake immediately after the socket is established or by starting the session as cleartext or using the negotiated pathway described above. If the session is started as a TLS session the headers that drive the opportunistic TLS pathway are ignored.

    Note that the server may still require TLS but leaves the option to start TLS immediately after establishing the socket or starting cleartext and requiring TLS via the opportunistic TLS pathway described above.

    Definition Classes
    finagle
  • package mysql
    Definition Classes
    finagle
  • package namer
    Definition Classes
    finagle
  • package naming
    Definition Classes
    finagle
  • package netty4

    Package netty4 implements the bottom finagle primitives: com.twitter.finagle.Server and a client transport in terms of the netty4 event loop.

    Package netty4 implements the bottom finagle primitives: com.twitter.finagle.Server and a client transport in terms of the netty4 event loop.

    Definition Classes
    finagle
  • package offload
    Definition Classes
    finagle
  • package param

    Defines common com.twitter.finagle.Stack.Param's shared between finagle clients and servers.

    Defines common com.twitter.finagle.Stack.Param's shared between finagle clients and servers.

    Definition Classes
    finagle
  • package partitioning
    Definition Classes
    finagle
  • package pool
    Definition Classes
    finagle
  • package pushsession
    Definition Classes
    finagle
  • package redis
    Definition Classes
    finagle
  • package scribe
    Definition Classes
    finagle
  • package server
    Definition Classes
    finagle
  • package serverset2
    Definition Classes
    finagle
  • package service
    Definition Classes
    finagle
  • package ssl
    Definition Classes
    finagle
  • package stats
    Definition Classes
    finagle
  • package thrift

    Please use the new interface, com.twitter.finagle.Thrift, for constructing Thrift clients and servers.

    Deprecation

    Please use the new interface, com.twitter.finagle.Thrift, for constructing Thrift clients and servers.

    Thrift codecs

    We provide client and server protocol support for the framed protocol. The public implementations are defined on the Thrift object:

    The type of the server codec is Service[Array[Byte], Array[Byte]] and the client codecs are Service[ThriftClientRequest, Array[Byte]]. The service provided is that of a "transport" of thrift messages (requests and replies) according to the protocol chosen. This is why the client codecs need to have access to a thrift ProtocolFactory.

    These transports are used by the services produced by the finagle thrift codegenerator.

    val service: Service[ThriftClientRequest, Array[Byte]] = ClientBuilder()
      .hosts("foobar.com:123")
      .stack(Thrift.client)
      .build()
    
    // Wrap the raw Thrift transport in a Client decorator. The client
    // provides a convenient procedural interface for accessing the Thrift
    // server.
    val client = new Hello.ServiceToClient(service, protocolFactory)

    In this example, Hello is the thrift interface, and the inner class ServiceToClient is provided by the finagle thrift code generator.

    Definition Classes
    finagle
  • package thriftmux
    Definition Classes
    finagle
  • package toggle
    Definition Classes
    finagle
  • package tracing
    Definition Classes
    finagle
  • package transport
    Definition Classes
    finagle
  • package tunable
    Definition Classes
    finagle
  • package util
    Definition Classes
    finagle
  • package zipkin
    Definition Classes
    finagle
  • package zookeeper
    Definition Classes
    finagle
  • AbstractFailureFlags
  • AbstractNamer
  • AbstractResolver
  • Addr
  • Address
  • Addresses
  • Addrs
  • Announcement
  • Announcer
  • AnnouncerForumInvalid
  • AnnouncerNotFoundException
  • ApiException
  • Backoff
  • CanStackFrom
  • CancelledConnectionException
  • CancelledRequestException
  • ChannelBufferUsageException
  • ChannelClosedException
  • ChannelException
  • ChannelWriteException
  • Client
  • ClientConnection
  • ClientParamsInjector
  • ConnectionFailedException
  • ConnectionRefusedException
  • Dentry
  • DroppedWriteException
  • Dtab
  • DtabBuilder
  • DtabFlags
  • FactoryToService
  • FailResolver
  • FailedFastException
  • Failure
  • FailureFlags
  • Filter
  • FinagleInit
  • FixedInetResolver
  • GlobalRequestTimeoutException
  • Group
  • HasRemoteInfo
  • Http
  • HttpRichClient
  • InconsistentStateException
  • IndividualRequestTimeoutException
  • InetResolver
  • JavaFailureFlags
  • LabelledGroup
  • ListeningServer
  • Memcached
  • MemcachedRichClient
  • MultipleAnnouncersPerSchemeException
  • MultipleResolversPerSchemeException
  • MutableGroup
  • Mux
  • Mysql
  • MysqlRichClient
  • Name
  • NameTree
  • Namer
  • Names
  • NegResolver
  • NilResolver
  • NoBrokersAvailableException
  • NotServableException
  • NullServer
  • Path
  • ProxyAnnouncement
  • ProxyConnectException
  • ReadTimedOutException
  • Redis
  • RedisRichClient
  • RefusedByRateLimiter
  • RequestException
  • RequestTimeoutException
  • Resolver
  • ResolverAddressInvalid
  • ResolverNotFoundException
  • Resolvers
  • Server
  • ServerErrorMonitor
  • Service
  • ServiceClosedException
  • ServiceException
  • ServiceFactory
  • ServiceFactoryProxy
  • ServiceFactoryWrapper
  • ServiceNamer
  • ServiceNotAvailableException
  • ServiceProxy
  • ServiceReturnedToPoolException
  • ServiceTimeoutException
  • ShardNotAvailableException
  • SimpleFilter
  • SourcedException
  • SslException
  • SslVerificationFailedException
  • Stack
  • StackBuilder
  • StackParams
  • StackTransformer
  • Stackable
  • Stacks
  • Status
  • StreamClosedException
  • Thrift
  • ThriftMux
  • TimeoutException
  • TooManyConcurrentRequestsException
  • TooManyWaitersException
  • TransportException
  • UnknownChannelException
  • WriteException
  • WriteTimedOutException
  • stack

case class Dtab(dentries0: IndexedSeq[Dentry]) extends DtabBase with Product with Serializable

A Dtab--short for delegation table--comprises a sequence of delegation rules. Together, these describe how to bind a com.twitter.finagle.Path to a set of com.twitter.finagle.Addr. com.twitter.finagle.naming.DefaultInterpreter implements the default binding strategy.

See also

The user guide for further details.

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Dtab
  2. Serializable
  3. Serializable
  4. Product
  5. DtabBase
  6. IndexedSeq
  7. IndexedSeqLike
  8. Seq
  9. SeqLike
  10. GenSeq
  11. GenSeqLike
  12. Iterable
  13. IterableLike
  14. Equals
  15. GenIterable
  16. GenIterableLike
  17. Traversable
  18. GenTraversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. GenTraversableLike
  22. Parallelizable
  23. TraversableOnce
  24. GenTraversableOnce
  25. FilterMonadic
  26. HasNewBuilder
  27. PartialFunction
  28. Function1
  29. AnyRef
  30. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Dtab(dentries0: IndexedSeq[Dentry])

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = IndexedSeq[Dentry]
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(dentry: Dentry): Dtab

    Construct a new Dtab with the given delegation entry appended.

    Construct a new Dtab with the given delegation entry appended.

    Definition Classes
    DtabBase
  4. def ++(dtab: Dtab): Dtab

    Construct a new Dtab with the given dtab appended.

    Construct a new Dtab with the given dtab appended.

    Definition Classes
    DtabBase
  5. def ++[B >: Dentry, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  6. def ++:[B >: Dentry, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike
  7. def ++:[B >: Dentry, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike
  8. def +:[B >: Dentry, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  9. def :+[B >: Dentry, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  10. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def addString(b: StringBuilder): StringBuilder
    Definition Classes
    TraversableOnce
  12. def addString(b: StringBuilder, sep: String): StringBuilder
    Definition Classes
    TraversableOnce
  13. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
    Definition Classes
    TraversableOnce
  14. def aggregate[B](z: ⇒ B)(seqop: (B, Dentry) ⇒ B, combop: (B, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  15. def andThen[C](k: (Dentry) ⇒ C): PartialFunction[Int, C]
    Definition Classes
    PartialFunction → Function1
  16. def append(dentry: Dentry): Dtab

    Java API for '+'

    Java API for '+'

    Definition Classes
    DtabBase
  17. def apply(i: Int): Dentry
    Definition Classes
    DtabBase → SeqLike → GenSeqLike → Function1
  18. def applyOrElse[A1 <: Int, B1 >: Dentry](x: A1, default: (A1) ⇒ B1): B1
    Definition Classes
    PartialFunction
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def canEqual(that: Any): Boolean
    Definition Classes
    IterableLike → Equals
  21. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  22. def collect[B, That](pf: PartialFunction[Dentry, B])(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  23. def collectFirst[B](pf: PartialFunction[Dentry, B]): Option[B]
    Definition Classes
    TraversableOnce
  24. def combinations(n: Int): Iterator[IndexedSeq[Dentry]]
    Definition Classes
    SeqLike
  25. def companion: GenericCompanion[IndexedSeq]
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  26. def compose[A](g: (A) ⇒ Int): (A) ⇒ Dentry
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  27. def concat(dtab: Dtab): Dtab

    Java API for '++'

    Java API for '++'

    Definition Classes
    DtabBase
  28. def contains[A1 >: Dentry](elem: A1): Boolean
    Definition Classes
    SeqLike
  29. def containsSlice[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike
  30. def copyToArray[B >: Dentry](xs: Array[B], start: Int, len: Int): Unit
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  31. def copyToArray[B >: Dentry](xs: Array[B]): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  32. def copyToArray[B >: Dentry](xs: Array[B], start: Int): Unit
    Definition Classes
    TraversableOnce → GenTraversableOnce
  33. def copyToBuffer[B >: Dentry](dest: Buffer[B]): Unit
    Definition Classes
    TraversableOnce
  34. def corresponds[B](that: GenSeq[B])(p: (Dentry, B) ⇒ Boolean): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  35. def count(p: (Dentry) ⇒ Boolean): Int
    Definition Classes
    TraversableOnce → GenTraversableOnce
  36. val dentries0: IndexedSeq[Dentry]
    Definition Classes
    Dtab → DtabBase
  37. def diff[B >: Dentry](that: GenSeq[B]): IndexedSeq[Dentry]
    Definition Classes
    SeqLike → GenSeqLike
  38. def distinct: IndexedSeq[Dentry]
    Definition Classes
    SeqLike → GenSeqLike
  39. def drop(n: Int): IndexedSeq[Dentry]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  40. def dropRight(n: Int): IndexedSeq[Dentry]
    Definition Classes
    IterableLike
  41. def dropWhile(p: (Dentry) ⇒ Boolean): IndexedSeq[Dentry]
    Definition Classes
    TraversableLike → GenTraversableLike
  42. def endsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  43. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  44. def equals(that: Any): Boolean
    Definition Classes
    GenSeqLike → Equals → Any
  45. def exists(p: (Dentry) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  46. def filter(p: (Dentry) ⇒ Boolean): IndexedSeq[Dentry]
    Definition Classes
    TraversableLike → GenTraversableLike
  47. def filterNot(p: (Dentry) ⇒ Boolean): IndexedSeq[Dentry]
    Definition Classes
    TraversableLike → GenTraversableLike
  48. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  49. def find(p: (Dentry) ⇒ Boolean): Option[Dentry]
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  50. def flatMap[B, That](f: (Dentry) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  51. def flatten[B](implicit asTraversable: (Dentry) ⇒ GenTraversableOnce[B]): IndexedSeq[B]
    Definition Classes
    GenericTraversableTemplate
  52. def fold[A1 >: Dentry](z: A1)(op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  53. def foldLeft[B](z: B)(op: (B, Dentry) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  54. def foldRight[B](z: B)(op: (Dentry, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  55. def forall(p: (Dentry) ⇒ Boolean): Boolean
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  56. def foreach[U](f: (Dentry) ⇒ U): Unit
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  57. def genericBuilder[B]: Builder[B, IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
  58. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  59. def groupBy[K](f: (Dentry) ⇒ K): Map[K, IndexedSeq[Dentry]]
    Definition Classes
    TraversableLike → GenTraversableLike
  60. def grouped(size: Int): Iterator[IndexedSeq[Dentry]]
    Definition Classes
    IterableLike
  61. def hasDefiniteSize: Boolean
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  62. def hashCode(): Int
    Definition Classes
    IndexedSeqLike → GenSeqLike → Any
  63. def head: Dentry
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  64. def headOption: Option[Dentry]
    Definition Classes
    TraversableLike → GenTraversableLike
  65. def indexOf[B >: Dentry](elem: B, from: Int): Int
    Definition Classes
    GenSeqLike
  66. def indexOf[B >: Dentry](elem: B): Int
    Definition Classes
    GenSeqLike
  67. def indexOfSlice[B >: Dentry](that: GenSeq[B], from: Int): Int
    Definition Classes
    SeqLike
  68. def indexOfSlice[B >: Dentry](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  69. def indexWhere(p: (Dentry) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  70. def indexWhere(p: (Dentry) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  71. def indices: Range
    Definition Classes
    SeqLike
  72. def init: IndexedSeq[Dentry]
    Definition Classes
    TraversableLike → GenTraversableLike
  73. def inits: Iterator[IndexedSeq[Dentry]]
    Definition Classes
    TraversableLike
  74. def intersect[B >: Dentry](that: GenSeq[B]): IndexedSeq[Dentry]
    Definition Classes
    SeqLike → GenSeqLike
  75. def isDefinedAt(idx: Int): Boolean
    Definition Classes
    GenSeqLike
  76. def isEmpty: Boolean
    Definition Classes
    DtabBase → SeqLike → IterableLike → GenericTraversableTemplate → TraversableLike → TraversableOnce → GenTraversableOnce
  77. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  78. final def isTraversableAgain: Boolean
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  79. def iterator: Iterator[Dentry]
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  80. def last: Dentry
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def lastIndexOf[B >: Dentry](elem: B, end: Int): Int
    Definition Classes
    GenSeqLike
  82. def lastIndexOf[B >: Dentry](elem: B): Int
    Definition Classes
    GenSeqLike
  83. def lastIndexOfSlice[B >: Dentry](that: GenSeq[B], end: Int): Int
    Definition Classes
    SeqLike
  84. def lastIndexOfSlice[B >: Dentry](that: GenSeq[B]): Int
    Definition Classes
    SeqLike
  85. def lastIndexWhere(p: (Dentry) ⇒ Boolean, end: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  86. def lastIndexWhere(p: (Dentry) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  87. def lastOption: Option[Dentry]
    Definition Classes
    TraversableLike → GenTraversableLike
  88. def length: Int
    Definition Classes
    DtabBase → SeqLike → GenSeqLike
  89. def lengthCompare(len: Int): Int
    Definition Classes
    SeqLike
  90. def lift: (Int) ⇒ Option[Dentry]
    Definition Classes
    PartialFunction
  91. def lookup(path: Path): NameTree[Name.Path]

    Lookup the given path with this dtab.

    Lookup the given path with this dtab.

    Definition Classes
    DtabBase
  92. def map[B, That](f: (Dentry) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  93. def max[B >: Dentry](implicit cmp: Ordering[B]): Dentry
    Definition Classes
    TraversableOnce → GenTraversableOnce
  94. def maxBy[B](f: (Dentry) ⇒ B)(implicit cmp: Ordering[B]): Dentry
    Definition Classes
    TraversableOnce → GenTraversableOnce
  95. def min[B >: Dentry](implicit cmp: Ordering[B]): Dentry
    Definition Classes
    TraversableOnce → GenTraversableOnce
  96. def minBy[B](f: (Dentry) ⇒ B)(implicit cmp: Ordering[B]): Dentry
    Definition Classes
    TraversableOnce → GenTraversableOnce
  97. def mkString: String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  98. def mkString(sep: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  99. def mkString(start: String, sep: String, end: String): String
    Definition Classes
    TraversableOnce → GenTraversableOnce
  100. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  101. def newBuilder: Builder[Dentry, IndexedSeq[Dentry]]
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  102. def nonEmpty: Boolean
    Definition Classes
    TraversableOnce → GenTraversableOnce
  103. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  104. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  105. def orElse[A1 <: Int, B1 >: Dentry](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
    Definition Classes
    PartialFunction
  106. def padTo[B >: Dentry, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  107. def par: ParSeq[Dentry]
    Definition Classes
    Parallelizable
  108. def parCombiner: Combiner[Dentry, ParSeq[Dentry]]
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  109. def partition(p: (Dentry) ⇒ Boolean): (IndexedSeq[Dentry], IndexedSeq[Dentry])
    Definition Classes
    TraversableLike → GenTraversableLike
  110. def patch[B >: Dentry, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  111. def permutations: Iterator[IndexedSeq[Dentry]]
    Definition Classes
    SeqLike
  112. def prefixLength(p: (Dentry) ⇒ Boolean): Int
    Definition Classes
    GenSeqLike
  113. def print(printer: PrintWriter): Unit

    Print a pretty representation of this Dtab.

    Print a pretty representation of this Dtab.

    Definition Classes
    DtabBase
  114. def product[B >: Dentry](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  115. def reduce[A1 >: Dentry](op: (A1, A1) ⇒ A1): A1
    Definition Classes
    TraversableOnce → GenTraversableOnce
  116. def reduceLeft[B >: Dentry](op: (B, Dentry) ⇒ B): B
    Definition Classes
    TraversableOnce
  117. def reduceLeftOption[B >: Dentry](op: (B, Dentry) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  118. def reduceOption[A1 >: Dentry](op: (A1, A1) ⇒ A1): Option[A1]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  119. def reduceRight[B >: Dentry](op: (Dentry, B) ⇒ B): B
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  120. def reduceRightOption[B >: Dentry](op: (Dentry, B) ⇒ B): Option[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  121. def repr: IndexedSeq[Dentry]
    Definition Classes
    TraversableLike → GenTraversableLike
  122. def reverse: IndexedSeq[Dentry]
    Definition Classes
    SeqLike → GenSeqLike
  123. def reverseIterator: Iterator[Dentry]
    Definition Classes
    SeqLike
  124. def reverseMap[B, That](f: (Dentry) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  125. def reversed: List[Dentry]
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  126. def runWith[U](action: (Dentry) ⇒ U): (Int) ⇒ Boolean
    Definition Classes
    PartialFunction
  127. def sameElements[B >: Dentry](that: GenIterable[B]): Boolean
    Definition Classes
    IterableLike → GenIterableLike
  128. def scan[B >: Dentry, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  129. def scanLeft[B, That](z: B)(op: (B, Dentry) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
  130. def scanRight[B, That](z: B)(op: (Dentry, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

  131. def segmentLength(p: (Dentry) ⇒ Boolean, from: Int): Int
    Definition Classes
    SeqLike → GenSeqLike
  132. def seq: IndexedSeq[Dentry]
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  133. def show: String
    Definition Classes
    DtabBase
  134. def simplified: Dtab

    Simplify the Dtab.

    Simplify the Dtab. This returns a functionally equivalent Dtab whose destination name trees have been simplified. The returned Dtab is equivalent with respect to evaluation.

    Definition Classes
    DtabBase
    To do

    dedup equivalent entries so that only the last entry is retained

    collapse entries with common prefixes

  135. def size: Int
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  136. def sizeHintIfCheap: Int
    Attributes
    protected[collection]
    Definition Classes
    IndexedSeqLike → GenTraversableOnce
  137. def slice(from: Int, until: Int): IndexedSeq[Dentry]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  138. def sliding(size: Int, step: Int): Iterator[IndexedSeq[Dentry]]
    Definition Classes
    IterableLike
  139. def sliding(size: Int): Iterator[IndexedSeq[Dentry]]
    Definition Classes
    IterableLike
  140. def sortBy[B](f: (Dentry) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[Dentry]
    Definition Classes
    SeqLike
  141. def sortWith(lt: (Dentry, Dentry) ⇒ Boolean): IndexedSeq[Dentry]
    Definition Classes
    SeqLike
  142. def sorted[B >: Dentry](implicit ord: Ordering[B]): IndexedSeq[Dentry]
    Definition Classes
    SeqLike
  143. def span(p: (Dentry) ⇒ Boolean): (IndexedSeq[Dentry], IndexedSeq[Dentry])
    Definition Classes
    TraversableLike → GenTraversableLike
  144. def splitAt(n: Int): (IndexedSeq[Dentry], IndexedSeq[Dentry])
    Definition Classes
    TraversableLike → GenTraversableLike
  145. def startsWith[B](that: GenSeq[B], offset: Int): Boolean
    Definition Classes
    SeqLike → GenSeqLike
  146. def startsWith[B](that: GenSeq[B]): Boolean
    Definition Classes
    GenSeqLike
  147. def stringPrefix: String
    Definition Classes
    TraversableLike → GenTraversableLike
  148. def stripPrefix(prefix: Dtab): Dtab

    Efficiently removes prefix prefix from dtab.

    Efficiently removes prefix prefix from dtab.

    Definition Classes
    DtabBase
  149. def sum[B >: Dentry](implicit num: Numeric[B]): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
  150. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  151. def tail: IndexedSeq[Dentry]
    Definition Classes
    TraversableLike → GenTraversableLike
  152. def tails: Iterator[IndexedSeq[Dentry]]
    Definition Classes
    TraversableLike
  153. def take(n: Int): IndexedSeq[Dentry]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  154. def takeRight(n: Int): IndexedSeq[Dentry]
    Definition Classes
    IterableLike
  155. def takeWhile(p: (Dentry) ⇒ Boolean): IndexedSeq[Dentry]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  156. def thisCollection: IndexedSeq[Dentry]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  157. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Dentry, Col[Dentry]]): Col[Dentry]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  158. def toArray[B >: Dentry](implicit arg0: ClassTag[B]): Array[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def toBuffer[A1 >: Dentry]: Buffer[A1]
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  160. def toCollection(repr: IndexedSeq[Dentry]): IndexedSeq[Dentry]
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  161. def toIndexedSeq: IndexedSeq[Dentry]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def toIterable: Iterable[Dentry]
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  163. def toIterator: Iterator[Dentry]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  164. def toList: List[Dentry]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. def toMap[T, U](implicit ev: <:<[Dentry, (T, U)]): Map[T, U]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  166. def toSeq: Seq[Dentry]
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  167. def toSet[B >: Dentry]: Set[B]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  168. def toStream: Stream[Dentry]
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  169. def toString(): String
    Definition Classes
    DtabBase → SeqLike → TraversableLike → Function1 → AnyRef → Any
  170. def toTraversable: Traversable[Dentry]
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  171. def toVector: Vector[Dentry]
    Definition Classes
    TraversableOnce → GenTraversableOnce
  172. def transpose[B](implicit asTraversable: (Dentry) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

  173. def union[B >: Dentry, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  174. def unzip[A1, A2](implicit asPair: (Dentry) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])
    Definition Classes
    GenericTraversableTemplate
  175. def unzip3[A1, A2, A3](implicit asTriple: (Dentry) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])
    Definition Classes
    GenericTraversableTemplate
  176. def updated[B >: Dentry, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], B, That]): That
    Definition Classes
    SeqLike → GenSeqLike
  177. def view(from: Int, until: Int): SeqView[Dentry, IndexedSeq[Dentry]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  178. def view: SeqView[Dentry, IndexedSeq[Dentry]]
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  179. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  180. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  181. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  182. def withFilter(p: (Dentry) ⇒ Boolean): FilterMonadic[Dentry, IndexedSeq[Dentry]]
    Definition Classes
    TraversableLike → FilterMonadic
  183. def zip[A1 >: Dentry, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[Dentry], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  184. def zipAll[B, A1 >: Dentry, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[Dentry], (A1, B), That]): That
    Definition Classes
    IterableLike → GenIterableLike
  185. def zipWithIndex[A1 >: Dentry, That](implicit bf: CanBuildFrom[IndexedSeq[Dentry], (A1, Int), That]): That
    Definition Classes
    IterableLike → GenIterableLike

Deprecated Value Members

  1. def /:[B](z: B)(op: (B, Dentry) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldLeft instead of /:

  2. def :\[B](z: B)(op: (Dentry, B) ⇒ B): B
    Definition Classes
    TraversableOnce → GenTraversableOnce
    Annotations
    @deprecated
    Deprecated

    (Since version 2.12.10) Use foldRight instead of :\

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from DtabBase

Inherited from IndexedSeq[Dentry]

Inherited from Seq[Dentry]

Inherited from SeqLike[Dentry, IndexedSeq[Dentry]]

Inherited from GenSeq[Dentry]

Inherited from GenSeqLike[Dentry, IndexedSeq[Dentry]]

Inherited from Iterable[Dentry]

Inherited from IterableLike[Dentry, IndexedSeq[Dentry]]

Inherited from Equals

Inherited from GenIterable[Dentry]

Inherited from Traversable[Dentry]

Inherited from GenTraversable[Dentry]

Inherited from Parallelizable[Dentry, ParSeq[Dentry]]

Inherited from TraversableOnce[Dentry]

Inherited from GenTraversableOnce[Dentry]

Inherited from HasNewBuilder[Dentry, IndexedSeq[com.twitter.finagle.Dentry] @scala.annotation.unchecked.uncheckedVariance]

Inherited from PartialFunction[Int, Dentry]

Inherited from (Int) ⇒ Dentry

Inherited from AnyRef

Inherited from Any

Ungrouped