scalaz
TheseT
final
case class
TheseT
[
F
[
_
]
,
A
,
B
]
(
run:
F
[
\&/
[
A
,
B
]]
)
extends
Product
with
Serializable
Source
TheseT.scala
Linear Supertypes
Serializable
,
Serializable
,
Product
,
Equals
,
AnyRef
,
Any
Ordering
Alphabetic
By inheritance
Inherited
TheseT
Serializable
Serializable
Product
Equals
AnyRef
Any
Hide All
Show all
Learn more about member selection
Visibility
Public
All
Instance Constructors
new
TheseT
(
run:
F
[
\&/
[
A
,
B
]]
)
Value Members
final
def
!=
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
!=
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
final
def
##
()
:
Int
Definition Classes
AnyRef → Any
def
&&&
[
AA >:
A
,
C
]
(
t:
TheseT
[
F
,
AA
,
C
]
)
(
implicit
M:
Semigroup
[
AA
]
,
F:
Apply
[
F
]
)
:
TheseT
[
F
,
AA
, (
B
,
C
)]
final
def
==
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
==
(
arg0:
Any
)
:
Boolean
Definition Classes
Any
def
a
(
implicit
F:
Functor
[
F
]
)
:
OptionT
[
F
,
A
]
def
append
[
AA >:
A
,
BB >:
B
]
(
that: ⇒
TheseT
[
F
,
AA
,
BB
]
)
(
implicit
F:
Apply
[
F
]
,
SA:
Semigroup
[
AA
]
,
SB:
Semigroup
[
BB
]
)
:
TheseT
[
F
,
AA
,
BB
]
final
def
asInstanceOf
[
T0
]
:
T0
Definition Classes
Any
def
b
(
implicit
F:
Functor
[
F
]
)
:
OptionT
[
F
,
B
]
def
bimap
[
C
,
D
]
(
f: (
A
) ⇒
C
,
g: (
B
) ⇒
D
)
(
implicit
F:
Functor
[
F
]
)
:
TheseT
[
F
,
C
,
D
]
def
bitraverse
[
G
[
_
]
,
C
,
D
]
(
f: (
A
) ⇒
G
[
C
]
,
g: (
B
) ⇒
G
[
D
]
)
(
implicit
F:
Traverse
[
F
]
,
G:
Applicative
[
G
]
)
:
G
[
TheseT
[
F
,
C
,
D
]]
def
clone
()
:
AnyRef
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
eq
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
def
exists
(
p: (
B
) ⇒
Boolean
)
(
implicit
F:
Functor
[
F
]
)
:
F
[
Boolean
]
def
finalize
()
:
Unit
Attributes
protected[
java.lang
]
Definition Classes
AnyRef
Annotations
@throws
(
classOf[java.lang.Throwable]
)
def
flatMap
[
AA >:
A
,
C
]
(
f: (
B
) ⇒
TheseT
[
F
,
AA
,
C
]
)
(
implicit
M:
Monad
[
F
]
,
S:
Semigroup
[
AA
]
)
:
TheseT
[
F
,
AA
,
C
]
def
flatMapF
[
AA >:
A
,
C
]
(
f: (
B
) ⇒
F
[
\&/
[
AA
,
C
]]
)
(
implicit
M:
Monad
[
F
]
,
S:
Semigroup
[
AA
]
)
:
TheseT
[
F
,
AA
,
C
]
def
fold
[
X
]
(
s: (
A
) ⇒
X
,
t: (
B
) ⇒
X
,
q: (
A
,
B
) ⇒
X
)
(
implicit
F:
Functor
[
F
]
)
:
F
[
X
]
def
foldRight
[
Z
]
(
z: ⇒
Z
)
(
f: (
B
, ⇒
Z
) ⇒
Z
)
(
implicit
F:
Foldable
[
F
]
)
:
Z
def
forall
(
p: (
B
) ⇒
Boolean
)
(
implicit
F:
Functor
[
F
]
)
:
F
[
Boolean
]
final
def
getClass
()
:
Class
[_]
Definition Classes
AnyRef → Any
def
getOrElse
(
default: ⇒
B
)
(
implicit
F:
Functor
[
F
]
)
:
F
[
B
]
def
isBoth
(
implicit
F:
Functor
[
F
]
)
:
F
[
Boolean
]
final
def
isInstanceOf
[
T0
]
:
Boolean
Definition Classes
Any
def
isThat
(
implicit
F:
Functor
[
F
]
)
:
F
[
Boolean
]
def
isThis
(
implicit
F:
Functor
[
F
]
)
:
F
[
Boolean
]
def
leftMap
[
C
]
(
f: (
A
) ⇒
C
)
(
implicit
F:
Functor
[
F
]
)
:
TheseT
[
F
,
C
,
B
]
def
map
[
C
]
(
f: (
B
) ⇒
C
)
(
implicit
F:
Functor
[
F
]
)
:
TheseT
[
F
,
A
,
C
]
def
mapT
[
G
[
_
]
,
C
,
D
]
(
f: (
F
[
\&/
[
A
,
B
]]) ⇒
G
[
\&/
[
C
,
D
]]
)
:
TheseT
[
G
,
C
,
D
]
final
def
ne
(
arg0:
AnyRef
)
:
Boolean
Definition Classes
AnyRef
final
def
notify
()
:
Unit
Definition Classes
AnyRef
final
def
notifyAll
()
:
Unit
Definition Classes
AnyRef
def
onlyBoth
(
implicit
F:
Functor
[
F
]
)
:
OptionT
[
F
, (
A
,
B
)]
def
onlyThat
(
implicit
F:
Functor
[
F
]
)
:
OptionT
[
F
,
B
]
def
onlyThis
(
implicit
F:
Functor
[
F
]
)
:
OptionT
[
F
,
A
]
def
onlyThisOrThat
(
implicit
F:
Functor
[
F
]
)
:
OptionT
[
F
,
\/
[
A
,
B
]]
def
pad
(
implicit
F:
Functor
[
F
]
)
:
F
[(
Option
[
A
],
Option
[
B
])]
val
run
:
F
[
\&/
[
A
,
B
]]
def
show
(
implicit
SA:
Show
[
A
]
,
SB:
Show
[
B
]
,
F:
Functor
[
F
]
)
:
F
[
Cord
]
def
swap
(
implicit
F:
Functor
[
F
]
)
:
TheseT
[
F
,
B
,
A
]
def
swapped
[
AA
,
BB
]
(
k: (
\&/
[
B
,
A
]) ⇒
\&/
[
BB
,
AA
]
)
(
implicit
F:
Functor
[
F
]
)
:
TheseT
[
F
,
AA
,
BB
]
final
def
synchronized
[
T0
]
(
arg0: ⇒
T0
)
:
T0
Definition Classes
AnyRef
def
toList
(
implicit
F:
Functor
[
F
]
)
:
ListT
[
F
,
B
]
def
traverse
[
G
[
_
]
,
AA >:
A
,
D
]
(
g: (
B
) ⇒
G
[
D
]
)
(
implicit
F:
Traverse
[
F
]
,
G:
Applicative
[
G
]
)
:
G
[
TheseT
[
F
,
AA
,
D
]]
def
unary_~
(
implicit
F:
Functor
[
F
]
)
:
TheseT
[
F
,
B
,
A
]
def
valueOr
[
BB >:
B
]
(
x: (
A
) ⇒
BB
)
(
implicit
M:
Semigroup
[
BB
]
,
F:
Functor
[
F
]
)
:
F
[
BB
]
final
def
wait
()
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
,
arg1:
Int
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
final
def
wait
(
arg0:
Long
)
:
Unit
Definition Classes
AnyRef
Annotations
@throws
(
...
)
def
|
(
default: ⇒
B
)
(
implicit
F:
Functor
[
F
]
)
:
F
[
B
]
def
~
[
AA
,
BB
]
(
k: (
\&/
[
B
,
A
]) ⇒
\&/
[
BB
,
AA
]
)
(
implicit
F:
Functor
[
F
]
)
:
TheseT
[
F
,
AA
,
BB
]
Inherited from
Serializable
Inherited from
Serializable
Inherited from
Product
Inherited from
Equals
Inherited from
AnyRef
Inherited from
Any
Ungrouped