Substitute To
for From
and From
for To
in the type F[To, From]
, given that F
is a type constructor of two arguments.
Substitute To
for From
and From
for To
in the type F[To, From]
, given that F
is a type constructor of two arguments. Essentially swaps To
and From
in ftf
's type.
Equivalent in power to each of substituteCo and substituteContra.
This method is impossible to implement without throw
ing or otherwise "cheating" unless From = To
, so it ensures that this really represents a type equality.
ftf
, $sameDiff
If From = To
and To = C
, then From = C
(equality is transitive)
Coerce a From
into a To
.
Coerce a From
into a To
. This is guaranteed to be the identity function.
This method is often called implicitly as an implicit A =:= B
doubles as an implicit view A => B
.
If From = To
and C = From
, then C = To
(equality is transitive)
If From = To
then To = From
(equality is symmetric)
Lift this evidence over any type constructor F
.
Lift this evidence over any type constructor F
.
Lift this evidence over the type constructor F
, but flipped.
Lift this evidence over the type constructor F
, but flipped.
Substitute the From
in the type F[From]
, where F
is any type constructor, for To
.
Substitute the From
in the type F[From]
, where F
is any type constructor, for To
.
Equivalent in power to each of substituteBoth and substituteContra.
This method is impossible to implement without throw
ing or otherwise "cheating" unless From = To
, so it ensures that this really represents a type equality.
ff
, $sameDiff
Substitute the To
in the type F[To]
, where F
is any type constructor, for From
.
Substitute the To
in the type F[To]
, where F
is any type constructor, for From
.
Equivalent in power to each of substituteBoth and substituteCo.
This method is impossible to implement without throw
ing or otherwise "cheating" unless From = To
, so it ensures that this really represents a type equality.
ft
, $sameDiff
If From <: To
and To <: C
, then From <: C
(subtyping is transitive)
If From <: To
and To <: C
, then From <: C
(subtyping is transitive)
Composes two instances of Function1
in a new Function1
, with this function applied first.
Composes two instances of Function1
in a new Function1
, with this function applied first.
the result type of function g
a function R => A
a new function f
such that f(x) == g(apply(x))
If From <: To
and C <: From
, then C <: To
(subtyping is transitive)
If From <: To
and C <: From
, then C <: To
(subtyping is transitive)
Composes two instances of Function1
in a new Function1
, with this function applied last.
Composes two instances of Function1
in a new Function1
, with this function applied last.
the type to which function g
can be applied
a function A => T1
a new function f
such that f(x) == apply(g(x))
Returns a string representation of the object.
Returns a string representation of the object.
The default representation is platform dependent.
Attributesa string representation of the object.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4