trait TraverseLaws[F[_]] extends FunctorLaws[F] with FoldableLaws[F] with UnorderedTraverseLaws[F]
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- TraverseLaws
- UnorderedTraverseLaws
- FoldableLaws
- UnorderedFoldableLaws
- FunctorLaws
- InvariantLaws
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
-
implicit abstract
def
F: Traverse[F]
- Definition Classes
- TraverseLaws → UnorderedTraverseLaws → FoldableLaws → UnorderedFoldableLaws → FunctorLaws → InvariantLaws
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collectFirstSome_Ref[A, B](fa: F[A], f: (A) ⇒ Option[B]): IsEq[Option[B]]
- Definition Classes
- FoldableLaws
-
def
collectFirst_Ref[A, B](fa: F[A], pf: PartialFunction[A, B]): IsEq[Option[B]]
- Definition Classes
- FoldableLaws
-
def
covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]
- Definition Classes
- FunctorLaws
-
def
covariantIdentity[A](fa: F[A]): IsEq[F[A]]
- Definition Classes
- FunctorLaws
-
def
dropWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
- Definition Classes
- FoldableLaws
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
existsConsistentWithFind[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
- Definition Classes
- FoldableLaws
-
def
existsLazy[A](fa: F[A]): Boolean
- Definition Classes
- UnorderedFoldableLaws
-
def
filter_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
- Definition Classes
- FoldableLaws
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
foldMIdentity[A, B](fa: F[A], b: B, f: (B, A) ⇒ B): IsEq[B]
Monadic folding with identity monad is analogous to
foldLeft
.Monadic folding with identity monad is analogous to
foldLeft
.- Definition Classes
- FoldableLaws
- def foldMapDerived[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Monoid[B]): IsEq[B]
-
def
foldRef[A](fa: F[A])(implicit A: Monoid[A]): IsEq[A]
- Definition Classes
- FoldableLaws
-
def
forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
- Definition Classes
- UnorderedFoldableLaws
-
def
forallEmpty[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
If
F[A]
is empty, forall must return true.If
F[A]
is empty, forall must return true.- Definition Classes
- UnorderedFoldableLaws
-
def
forallLazy[A](fa: F[A]): Boolean
- Definition Classes
- UnorderedFoldableLaws
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getRef[A](fa: F[A], idx: Long): IsEq[Option[A]]
- Definition Classes
- FoldableLaws
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]
- Definition Classes
- InvariantLaws
-
def
invariantIdentity[A](fa: F[A]): IsEq[F[A]]
- Definition Classes
- InvariantLaws
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
- Definition Classes
- FoldableLaws
- def mapWithIndexRef[A, B](fa: F[A], f: (A, Int) ⇒ B): IsEq[F[B]]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nonEmptyRef[A](fa: F[A]): IsEq[Boolean]
- Definition Classes
- UnorderedFoldableLaws
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orderedConsistency[A](x: F[A], y: F[A])(implicit arg0: Eq[A], ev: Eq[F[A]]): IsEq[List[A]]
- Definition Classes
- FoldableLaws
-
def
reduceLeftOptionConsistentWithReduceLeftToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]
reduceLeftOption
consistent withreduceLeftToOption
reduceLeftOption
consistent withreduceLeftToOption
- Definition Classes
- FoldableLaws
-
def
reduceRightOptionConsistentWithReduceRightToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]
reduceRightOption
consistent withreduceRightToOption
reduceRightOption
consistent withreduceRightToOption
- Definition Classes
- FoldableLaws
-
def
rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
- Definition Classes
- FoldableLaws
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
takeWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
- Definition Classes
- FoldableLaws
-
def
toListRef[A](fa: F[A]): IsEq[List[A]]
- Definition Classes
- FoldableLaws
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def traverseIdentity[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
- def traverseOrderConsistent[A](fa: F[A]): IsEq[Option[A]]
- def traverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (A) ⇒ N[B])(implicit N: Applicative[N], M: Applicative[M]): IsEq[(M[F[B]], N[F[B]])]
- def traverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (B) ⇒ N[C])(implicit N: Applicative[N], M: Applicative[M]): IsEq[Nested[M, N, F[C]]]
- def traverseWithIndexMRef[G[_], A, B](fa: F[A], f: (A, Int) ⇒ G[B])(implicit G: Monad[G]): IsEq[G[F[B]]]
-
def
unorderedFoldConsistentWithUnorderedFoldMap[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): IsEq[A]
- Definition Classes
- UnorderedFoldableLaws
-
def
unorderedSequenceConsistent[A, G[_]](fga: F[G[A]])(implicit arg0: CommutativeApplicative[G]): IsEq[G[F[A]]]
- Definition Classes
- UnorderedTraverseLaws
-
def
unorderedTraverseIdentity[A, B](fa: F[A])(f: (A) ⇒ B)(implicit ev: Functor[F]): IsEq[F[B]]
- Definition Classes
- UnorderedTraverseLaws
-
def
unorderedTraverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (A) ⇒ N[B])(implicit N: CommutativeApplicative[N], M: CommutativeApplicative[M]): IsEq[(M[F[B]], N[F[B]])]
- Definition Classes
- UnorderedTraverseLaws
-
def
unorderedTraverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (B) ⇒ N[C])(implicit N: CommutativeApplicative[N], M: CommutativeApplicative[M]): IsEq[Nested[M, N, F[C]]]
- Definition Classes
- UnorderedTraverseLaws
-
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
- @native() @throws( ... )
- def zipWithIndexRef[A, B](fa: F[A], f: ((A, Int)) ⇒ B): IsEq[F[B]]