quasar
fp
package
fp
Linear Supertypes
DebugOps
,
ProcessOps
,
JsonOps
,
PartialFunctionOps
,
ListMapInstances
,
AnyRef
,
Any
Ordering
Alphabetic
By Inheritance
Inherited
fp
DebugOps
ProcessOps
JsonOps
PartialFunctionOps
ListMapInstances
AnyRef
Any
Hide All
Show All
Visibility
Public
All
Type Members
type
EndoK
[
F
[
X
]
]
=
NaturalTransformation
[
F
,
F
]
type
NTComp
[
F
[
X
]
,
G
[
Y
]
]
=
NaturalTransformation
[
F
, [A]
G
[
F
[
A
]]]
implicit
class
PFOps
[
A
,
B
]
extends
AnyRef
Definition Classes
PartialFunctionOps
implicit
class
PrOps
[
F
[
_
]
,
O
]
extends
AnyRef
Definition Classes
ProcessOps
implicit
class
ProcessOfTaskOps
[
O
]
extends
AnyRef
Definition Classes
ProcessOps
class
SeqW
[
A
]
extends
AnyRef
Definition Classes
ListMapInstances
implicit
class
TaskOps
[
A
]
extends
AnyRef
Definition Classes
ProcessOps
implicit final
class
ToDebugOps
[
A
]
extends
AnyRef
Definition Classes
DebugOps
Value Members
implicit
def
ListMapEqual
[
A
,
B
]
(
implicit
arg0:
Equal
[
A
]
,
arg1:
Equal
[
B
]
)
:
Equal
[
slamdata.Predef.ListMap
[
A
,
B
]]
Definition Classes
ListMapInstances
implicit
def
TraverseListMap
[
K
]
:
Traverse
[[β$0$]
ListMap
[
K
,
β$0$
]] with
IsEmpty
[[β$1$]
ListMap
[
K
,
β$1$
]]
Definition Classes
ListMapInstances
def
applyCoEnvFrom
[
T
[
_
[
_
]
]
,
F
[
_
]
,
A
]
(
modify: (
T
[[γ$20$]
CoEnv
[
A
,
F
,
γ$20$
]]) ⇒
T
[[γ$21$]
CoEnv
[
A
,
F
,
γ$21$
]]
)
(
implicit
arg0:
BirecursiveT
[
T
]
,
arg1:
Functor
[
F
]
)
: (
Free
[
F
,
A
]) ⇒
Free
[
F
,
A
]
def
applyFrom
[
A
,
B
]
(
bij:
Bijection
[
A
,
B
]
)
(
modify: (
B
) ⇒
B
)
: (
A
) ⇒
A
def
coenvBijection
[
T
[
_
[
_
]
]
,
F
[
_
]
,
A
]
(
implicit
arg0:
BirecursiveT
[
T
]
,
arg1:
Functor
[
F
]
)
:
Bijection
[
Free
[
F
,
A
],
T
[[γ$17$]
CoEnv
[
A
,
F
,
γ$17$
]]]
def
coenvPrism
[
F
[
_
]
,
A
]
:
PrismNT
[[γ$4$]
CoEnv
[
A
,
F
,
γ$4$
],
F
]
implicit
def
constEqual
[
A
]
(
implicit
arg0:
Equal
[
A
]
)
:
Delay
[
Equal
, [β$13$]
Const
[
A
,
β$13$
]]
implicit
def
constShow
[
A
]
(
implicit
arg0:
Show
[
A
]
)
:
Delay
[
Show
, [β$15$]
Const
[
A
,
β$15$
]]
implicit
def
coproductEqual
[
F
[
_
]
,
G
[
_
]
]
(
implicit
F:
Delay
[
Equal
,
F
]
,
G:
Delay
[
Equal
,
G
]
)
:
Delay
[
Equal
, [γ$9$]
Coproduct
[
F
,
G
,
γ$9$
]]
implicit
def
coproductShow
[
F
[
_
]
,
G
[
_
]
]
(
implicit
F:
Delay
[
Show
,
F
]
,
G:
Delay
[
Show
,
G
]
)
:
Delay
[
Show
, [γ$11$]
Coproduct
[
F
,
G
,
γ$11$
]]
def
decodeJson
[
A
]
(
text:
slamdata.Predef.String
)
(
implicit
DA:
DecodeJson
[
A
]
)
:
\/
[
slamdata.Predef.String
,
A
]
Definition Classes
JsonOps
def
evalNT
[
F
[
_
]
,
S
]
(
initial:
S
)
(
implicit
arg0:
Monad
[
F
]
)
:
~>
[[γ$7$]
IndexedStateT
[
F
,
S
,
S
,
γ$7$
],
F
]
implicit
def
finEqual
[
N <:
Succ
[_]
]
:
Equal
[
Fin
[
N
]]
implicit
def
finShow
[
N <:
Succ
[_]
]
:
Show
[
Fin
[
N
]]
def
idPrism
[
F
[
_
]
]
:
PrismNT
[
F
,
F
]
def
ignore
[
A
]
(
a:
A
)
:
slamdata.Predef.Unit
def
injR
[
T
[
_
[
_
]
]
,
F
[
_
]
,
G
[
_
]
]
(
orig:
T
[
F
]
)
(
implicit
arg0:
BirecursiveT
[
T
]
,
arg1:
Functor
[
F
]
,
arg2:
Functor
[
G
]
,
F:
:<:
[
F
,
G
]
)
:
T
[
G
]
def
liftCo
[
T
[
_
[
_
]
]
,
F
[
_
]
,
A
,
B
]
(
f: (
F
[
B
]) ⇒
CoEnv
[
A
,
F
,
B
]
)
: (
CoEnv
[
A
,
F
,
B
]) ⇒
CoEnv
[
A
,
F
,
B
]
def
liftCoM
[
T
[
_
[
_
]
]
,
M
[
_
]
,
F
[
_
]
,
A
,
B
]
(
f: (
F
[
B
]) ⇒
M
[
CoEnv
[
A
,
F
,
B
]]
)
(
implicit
arg0:
Applicative
[
M
]
)
: (
CoEnv
[
A
,
F
,
B
]) ⇒
M
[
CoEnv
[
A
,
F
,
B
]]
def
liftFF
[
F
[
_
]
,
G
[
_
]
,
A
]
(
orig: (
F
[
A
]) ⇒
F
[
A
]
)
(
implicit
F:
:<:
[
F
,
G
]
)
: (
G
[
A
]) ⇒
G
[
A
]
def
liftFFTrans
[
F
[
_
]
,
G
[
_
]
,
A
]
(
prism:
PrismNT
[
G
,
F
]
)
(
f: (
F
[
A
]) ⇒
slamdata.Predef.Option
[
F
[
A
]]
)
: (
G
[
A
]) ⇒
slamdata.Predef.Option
[
G
[
A
]]
def
liftFG
[
F
[
_
]
,
G
[
_
]
,
A
]
(
orig: (
F
[
A
]) ⇒
G
[
A
]
)
(
implicit
F:
:<:
[
F
,
G
]
)
: (
G
[
A
]) ⇒
G
[
A
]
def
liftFGM
[
M
[
_
]
,
F
[
_
]
,
G
[
_
]
,
A
]
(
orig: (
F
[
A
]) ⇒
M
[
G
[
A
]]
)
(
implicit
arg0:
Monad
[
M
]
,
F:
:<:
[
F
,
G
]
)
: (
G
[
A
]) ⇒
M
[
G
[
A
]]
def
liftFGTrans
[
F
[
_
]
,
G
[
_
]
,
A
]
(
prism:
PrismNT
[
G
,
F
]
)
(
f: (
F
[
A
]) ⇒
slamdata.Predef.Option
[
G
[
A
]]
)
: (
G
[
A
]) ⇒
slamdata.Predef.Option
[
G
[
A
]]
def
liftMT
[
F
[
_
]
,
G
[
_
[
_
]
,
_
]
]
(
implicit
arg0:
Monad
[
F
]
,
arg1:
MonadTrans
[
G
]
)
:
~>
[
F
, [β$4$]
G
[
F
,
β$4$
]]
def
liftR
[
T
[
_
[
_
]
]
,
F
[
_
]
,
G
[
_
]
]
(
orig: (
T
[
F
]) ⇒
T
[
F
]
)
(
implicit
arg0:
BirecursiveT
[
T
]
,
arg1:
Traverse
[
F
]
,
arg2:
Traverse
[
G
]
,
F:
:<:
[
F
,
G
]
)
: (
T
[
G
]) ⇒
T
[
G
]
val
minspace
:
PrettyParams
Definition Classes
JsonOps
val
multiline
:
PrettyParams
Definition Classes
JsonOps
implicit
def
natEqual
[
N <:
Nat
]
:
Equal
[
N
]
implicit
def
natShow
[
N <:
Nat
]
:
Show
[
N
]
def
optional
[
A
]
(
cur:
ACursor
)
(
implicit
arg0:
DecodeJson
[
A
]
)
:
DecodeResult
[
slamdata.Predef.Option
[
A
]]
Definition Classes
JsonOps
def
orElse
[
A
]
(
cur:
ACursor
,
default: ⇒
A
)
(
implicit
arg0:
DecodeJson
[
A
]
)
:
DecodeResult
[
A
]
Definition Classes
JsonOps
def
pointNT
[
F
[
_
]
]
(
implicit
arg0:
Applicative
[
F
]
)
:
~>
[
scalaz.Scalaz.Id
,
F
]
def
prjR
[
T
[
_
[
_
]
]
,
F
[
_
]
,
G
[
_
]
]
(
orig:
T
[
G
]
)
(
implicit
arg0:
BirecursiveT
[
T
]
,
arg1:
Traverse
[
F
]
,
arg2:
Traverse
[
G
]
,
F:
:<:
[
F
,
G
]
)
:
slamdata.Predef.Option
[
T
[
F
]]
def
reflNT
[
F
[
_
]
]
:
~>
[
F
,
F
]
implicit
def
seqW
[
A
]
(
xs:
slamdata.Predef.Seq
[
A
]
)
:
SeqW
[
A
]
Definition Classes
ListMapInstances
implicit
def
sizedEqual
[
A
,
N <:
Nat
]
(
implicit
arg0:
Equal
[
A
]
)
:
Equal
[
Sized
[
A
,
N
]]
implicit
def
sizedShow
[
A
,
N <:
Nat
]
(
implicit
arg0:
Show
[
A
]
)
:
Show
[
Sized
[
A
,
N
]]
implicit
val
symbolOrder
:
Order
[
slamdata.Predef.Symbol
]
implicit
val
symbolShow
:
Show
[
slamdata.Predef.Symbol
]
Inherited from
DebugOps
Inherited from
ProcessOps
Inherited from
JsonOps
Inherited from
PartialFunctionOps
Inherited from
ListMapInstances
Inherited from
AnyRef
Inherited from
Any
Ungrouped
