Implicitly converts (at compile-time) a value of type F[T, A] to
F[T, B] if there is a valid inference A ==> B.
Implicitly converts (at compile-time) a value of type F[T, A] to
F[T, B] if there is a valid inference A ==> B. If the
inference is invalid, compilation fails.
Example:
scala> import eu.timepit.refined.api.Refined | import eu.timepit.refined.auto.{ autoInfer, autoRefineV } | import eu.timepit.refined.numeric.Greater scala> val x: Int Refined Greater[W.`5`.T] = 100 scala> x: Int Refined Greater[W.`0`.T] res0: Int Refined Greater[W.`0`.T] = 100
Implicitly tags (at compile-time) a value of type T with P if t
satisfies the predicate P.
Implicitly tags (at compile-time) a value of type T with P if t
satisfies the predicate P. If it does not satisfy the predicate,
compilation fails.
This is an implicit version of refineMT.
Implicitly wraps (at compile-time) a value of type T in
api.Refined[T, P] if t satisfies the predicate P.
Implicitly wraps (at compile-time) a value of type T in
api.Refined[T, P] if t satisfies the predicate P. If it does
not satisfy the predicate, compilation fails.
This is an implicit version of refineMV.
Implicitly unwraps the T from a value of type F[T, P] using the
api.RefType instance of F.
Implicitly unwraps the T from a value of type F[T, P] using the
api.RefType instance of F. This allows a F[T, P] to be
used as it were a subtype of T.
Example:
scala> import eu.timepit.refined.api.Refined | import eu.timepit.refined.auto.{ autoRefineV, autoUnwrap } | import eu.timepit.refined.numeric.Positive scala> def plusOne(i: Int): Int = i + 1 | val x: Int Refined Positive = 42 // converts x implicitly to an Int: scala> plusOne(x) res0: Int = 43
Note: This conversion is not needed if F[T, _] <: T holds (which
is the case for shapeless.tag.@@, for example).
Module that provides automatic refinements and automatic conversions between refined types (refinement subtyping) at compile-time.