sealed
trait
Identity[A] extends Equals with IdentitySugar[A]
Abstract Value Members
-
abstract
def
value: A
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
/==(a: A)(implicit e: Equal[A]): Boolean
-
def
<&>[B](b: ⇒ B): :&:[A, B]
-
def
<===>(a: A)(implicit m: MetricSpace[A]): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
===(a: A)(implicit e: Equal[A]): Boolean
-
def
??(d: ⇒ A)(implicit ev: <:<[Null, A]): A
-
def
?|?(a: A)(implicit o: Order[A]): Ordering
-
final
def
asInstanceOf[T0]: T0
-
def
assert_===[B](b: B)(implicit e: Equal[A], s: Show[A], ev: <:<[B, A]): Unit
-
def
assert_≟[B](b: B)(implicit e: Equal[A], s: Show[A], ev: <:<[B, A]): Unit
-
def
canEqual(o: Any): Boolean
-
def
clone(): AnyRef
-
def
cons[M](m: M)(implicit r: Reducer[A, M]): M
-
def
constantState[S](s: ⇒ S): State[S, A]
-
final
def
doWhile(f: (A) ⇒ A, p: (A) ⇒ Boolean): A
-
def
dual: Dual[A]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equal[A](f: (A, A) ⇒ Boolean): Equal[A]
-
def
equalA[A]: Equal[A]
-
def
equalBy[A, B](f: (A) ⇒ B)(implicit arg0: Equal[B]): Equal[A]
-
def
equals(o: Any): Boolean
-
-
def
failNel[X]: ValidationNEL[A, X]
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
gt(a: A)(implicit o: Order[A]): Boolean
-
def
gte(a: A)(implicit o: Order[A]): Boolean
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
iterate[M[_]](f: (A) ⇒ A)(implicit p: Pure[M], m: Monoid[M[A]]): M[A]
-
def
leaf: Tree[A]
-
def
left[B]: Either[A, B]
-
def
logger[L]: Logger[L, A]
-
def
lt(a: A)(implicit o: Order[A]): Boolean
-
def
lte(a: A)(implicit o: Order[A]): Boolean
-
def
mapply[F[_], B](f: F[(A) ⇒ B])(implicit ftr: Functor[F]): F[B]
-
def
matchOrZero[B](pf: PartialFunction[A, B])(implicit arg0: Zero[B]): B
-
def
max(a: A)(implicit o: Order[A]): A
-
def
min(a: A)(implicit o: Order[A]): A
-
final
def
ne(arg0: AnyRef): Boolean
-
def
node(subForest: Tree[A]*): Tree[A]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
ok: Value[A]
-
def
pair: (A, A)
-
def
print(implicit s: Show[A]): Unit
-
def
println(implicit s: Show[A]): Unit
-
def
pure[F[_]](implicit p: Pure[F]): F[A]
-
def
pureUnit[M[_], N](implicit m: Pure[M], r: Reducer[A, N]): M[N]
-
def
repeat[M[_]](implicit p: Pure[M], m: Monoid[M[A]]): M[A]
-
def
replicate[M[_]](n: Int, f: (A) ⇒ A = a => a)(implicit p: Pure[M], m: Monoid[M[A]]): M[A]
-
def
right[B]: Either[B, A]
-
def
set[W](w: W): Writer[W, A]
-
def
show(implicit s: Show[A]): List[Char]
-
def
shows(implicit s: Show[A]): String
-
def
snoc[C](c: C)(implicit r: Reducer[C, A]): A
-
def
some: Option[A]
-
def
squared: (A, A)
-
def
state[S]: State[S, A]
-
def
success[X]: Validation[X, A]
-
def
successNel[X]: ValidationNEL[X, A]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
text(implicit s: Show[A]): Text
-
def
toString(): String
-
def
unfold[M[_], B](f: (A) ⇒ Option[(B, A)])(implicit p: Pure[M], m: Monoid[M[B]]): M[B]
-
def
unfoldTree[B](f: (A) ⇒ (B, () ⇒ Stream[A])): Tree[B]
-
def
unfoldTreeM[B, M[_]](f: (A) ⇒ M[(B, Stream[A])])(implicit m: Monad[M]): M[Tree[B]]
-
def
unit[M](implicit r: Reducer[A, M]): M
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
whileDo(f: (A) ⇒ A, p: (A) ⇒ Boolean): A
-
-
def
zipper: Zipper[A]
-
def
|+|(a: ⇒ A)(implicit s: Semigroup[A]): A
-
def
|>[B](f: (A) ⇒ B): B
-
def
η[F[_]](implicit p: Pure[F]): F[A]
-
def
σ: Dual[A]
-
def
≟(a: A)(implicit e: Equal[A]): Boolean
-
def
≠(a: A)(implicit e: Equal[A]): Boolean
-
def
⊹(a: ⇒ A)(implicit s: Semigroup[A]): A
Inherited from AnyRef
Inherited from Any