class
SearchingReadableStore[-K, +V] extends ReadableStore[K, V]
Instance Constructors
-
new
SearchingReadableStore(stores: Seq[ReadableStore[K, V]])(pred: (Option[V]) ⇒ Boolean)
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
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
close(): Unit
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
get(k: K): Future[Option[V]]
-
final
def
getClass(): java.lang.Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
multiGet[K1 <: K](ks: Set[K1]): Map[K1, Future[Option[V]]]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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 Closeable
Inherited from AnyRef
Inherited from Any
Returns a ReadableStore that attempts reads out of the supplied Seq[ReadableStore] in order and returns the first non-exceptional value that satisfies the supplied predicate.
multiGet attempts a full multiGet of the first store, then follows up on missing or failed keys with individual gets to the underlying stores (as failures for each key can happen at different times).