sealed
trait
Priority[+P, +F] extends AnyRef
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
bimap[P2, F2](f1: (P) ⇒ P2)(f2: (F) ⇒ F2): Priority[P2, F2]
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
fold[B](f1: (P) ⇒ B)(f2: (F) ⇒ B): B
-
final
def
getClass(): Class[_]
-
def
getFallback: Option[F]
-
def
getPreferred: Option[P]
-
def
hashCode(): Int
-
def
isFallback: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isPreferred: Boolean
-
def
join[U >: P with F]: U
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toEither: Either[P, F]
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Priority is a type class for prioritized implicit search.
This type class will attempt to provide an implicit instance of
P
(the preferred type). If that type is not available it will fallback toF
(the fallback type). If neither type is available then aPriority[P, F]
instance will not be available.This type can be useful for problems where multiple algorithms can be used, depending on the type classes available.