class
HeapBalancer[Req, Rep] extends ServiceFactory[Req, Rep]
Instance Constructors
-
new
HeapBalancer(factories: Var[Set[ServiceFactory[Req, Rep]]], statsReceiver: StatsReceiver = ..., emptyException: Throwable = ..., rng: Random = new scala.util.Random())
Type Members
-
case class
Node(factory: ServiceFactory[Req, Rep], load: Int, index: Int, downq: Node = null) extends Product with Serializable
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
andThen[A](g: (Future[Service[Req, Rep]]) ⇒ A): (ClientConnection) ⇒ A
-
-
final
def
apply(): Future[Service[Req, Rep]]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
close(deadline: Time): Future[Unit]
-
def
close(after: Duration): Future[Unit]
-
final
def
close(): Future[Unit]
-
def
compose[A](g: (A) ⇒ ClientConnection): (A) ⇒ Future[Service[Req, Rep]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
flatMap[Req1, Rep1](f: (Service[Req, Rep]) ⇒ Future[Service[Req1, Rep1]]): ServiceFactory[Req1, Rep1]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
isAvailable: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[Req1, Rep1](f: (Service[Req, Rep]) ⇒ Service[Req1, Rep1]): ServiceFactory[Req1, Rep1]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
final
def
toService: Service[Req, Rep]
-
val
toString: String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Deprecated Value Members
-
final
def
make(): Future[Service[Req, Rep]]
Inherited from Closable
Inherited from AnyRef
Inherited from Any
An efficient load balancer that operates on Groups.