# TraverseLaw

#### trait TraverseLaw extends FunctorLaw

Source
Traverse.scala
Linear Supertypes
Traverse.FunctorLaw, AnyRef, Any
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. TraverseLaw
2. FunctorLaw
3. AnyRef
4. Any
1. Hide All
2. Show all
Visibility
1. Public
2. All

### Value Members

1. #### final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
2. #### final def !=(arg0: Any): Boolean

Definition Classes
Any
3. #### final def ##(): Int

Definition Classes
AnyRef → Any
4. #### final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
5. #### final def ==(arg0: Any): Boolean

Definition Classes
Any
6. #### final def asInstanceOf[T0]: T0

Definition Classes
Any
7. #### def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
8. #### def composite[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ C)(implicit FC: Equal[F[C]]): Boolean

A series of maps may be freely rewritten as a single map on a composed function.

A series of maps may be freely rewritten as a single map on a composed function.

Definition Classes
FunctorLaw
9. #### final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
10. #### def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
11. #### def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
12. #### final def getClass(): Class[_]

Definition Classes
AnyRef → Any
13. #### def hashCode(): Int

Definition Classes
AnyRef → Any
14. #### def identity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean

The identity function, lifted, is a no-op.

The identity function, lifted, is a no-op.

Definition Classes
FunctorLaw
15. #### def identityTraverse[A, B](fa: F[A], f: (A) ⇒ B)(implicit FB: Equal[F[B]]): Boolean

Traversal through the scalaz.Id effect is equivalent to `Functor#map`

16. #### final def isInstanceOf[T0]: Boolean

Definition Classes
Any
17. #### def naturality[N[_], M[_], A](nat: ~>[M, N])(fma: F[M[A]])(implicit N: Applicative[N], M: Applicative[M], NFA: Equal[N[F[A]]]): Boolean

nat

A natural transformation from `M` to `N` for which these properties hold: `(a: A) => nat(Applicative[M].pure[A](a)) === Applicative[M].point[A](a)` `(f: M[A => B], ma: M[A]) => nat(Applicative[M].ap(ma)(f)) === Applicative[N].ap(nat(ma))(nat(f))`

18. #### final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
19. #### final def notify(): Unit

Definition Classes
AnyRef
20. #### final def notifyAll(): Unit

Definition Classes
AnyRef
21. #### def parallelFusion[N[_], M[_], A, B](fa: F[A], amb: (A) ⇒ M[B], anb: (A) ⇒ N[B])(implicit N: Applicative[N], M: Applicative[M], MN: Equal[(M[F[B]], N[F[B]])]): Boolean

Two independent effects can be fused into a single effect, their product.

22. #### def purity[G[_], A](fa: F[A])(implicit G: Applicative[G], GFA: Equal[G[F[A]]]): Boolean

Traversal with the `point` function is the same as applying the `point` function directly

23. #### def sequentialFusion[N[_], M[_], A, B, C](fa: F[A], amb: (A) ⇒ M[B], bnc: (B) ⇒ N[C])(implicit N: Applicative[N], M: Applicative[M], MN: Equal[M[N[F[C]]]]): Boolean

Two sequentially dependent effects can be fused into one, their composition

24. #### final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
25. #### def toString(): String

Definition Classes
AnyRef → Any
26. #### final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
27. #### final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
28. #### final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )