Value Members

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

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

5.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

6.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

7.  def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

8.  def finalize(): Unit

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

9.  def fromAddrMetadata(metadata: Metadata): Option[ZkMetadata]

   Convert com.twitter.finagle.Addr.Metadata to an instance of ZkMetadata.

   Convert com.twitter.finagle.Addr.Metadata to an instance of ZkMetadata. If ZkMetadata is not present in metadata, return None.

10.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

11.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

13.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

14.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

15.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

16.  def shardHashOrdering(seed: Int): Ordering[Address]

    Orders a Finagle Address based on a deterministic hash of its shard id.

    Orders a Finagle Address based on a deterministic hash of its shard id.

    If shard id information is identical, either both lack metadata, both lack a shard id, or both have the same shard id, ordering is then computed by Address.hashOrdering.

    Note

    Avoiding collisions in this hash ordering where inputs are equal is an important property in keeping it deterministic. Thus, it uses a murmurhash under the hood which is known to not have collisions for 32-bit inputs. However, if the input collection does not have shard ids available, we fall back to Address.hashOrdering which may have some caveats to this.

    ,

    We do not consider ZkMetadata.metadata while comparing the Address and only ZkMetadata.shardId portion of the ZkMetadata is considered.

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

    Definition Classes

    AnyRef

18.  def toAddrMetadata(metadata: ZkMetadata): Metadata

    Convert ZkMetadata to an instance of com.twitter.finagle.Addr.Metadata.

19.  def toString(): String

    Definition Classes

    AnyRef → Any

20.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

22.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()