NonEmptyTraverseLaws

implicit abstract def F: NonEmptyTraverse[F]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collectFirstSome_Ref[A, B](fa: F[A], f: (A) ⇒ Option[B]): IsEq[Option[B]]

def collectFirst_Ref[A, B](fa: F[A], pf: PartialFunction[A, B]): IsEq[Option[B]]

def covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]

def covariantIdentity[A](fa: F[A]): IsEq[F[A]]

def dropWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def existsConsistentWithFind[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

def existsLazy[A](fa: F[A]): Boolean

def filter_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]

def finalize(): Unit

def foldMIdentity[A, B](fa: F[A], b: B, f: (B, A) ⇒ B): IsEq[B]

Monadic folding with identity monad is analogous to foldLeft.

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]

def foldRightLazy[A](fa: F[A]): Boolean

def forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

def forallEmpty[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

If F[A] is empty, forall must return true.

def forallLazy[A](fa: F[A]): Boolean

final def getClass(): Class[_]

def getRef[A](fa: F[A], idx: Long): IsEq[Option[A]]

def hashCode(): Int

def invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]

def invariantIdentity[A](fa: F[A]): IsEq[F[A]]

final def isInstanceOf[T0]: Boolean

def leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]

def mapWithIndexRef[A, B](fa: F[A], f: (A, Int) ⇒ B): IsEq[F[B]]

final def ne(arg0: AnyRef): Boolean

def nonEmptyRef[A](fa: F[A]): IsEq[Boolean]

def nonEmptyTraverseIdentity[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]

def nonEmptyTraverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (A) ⇒ N[B])(implicit N: Apply[N], M: Apply[M]): IsEq[(M[F[B]], N[F[B]])]

def nonEmptyTraverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (B) ⇒ N[C])(implicit N: Apply[N], M: Apply[M]): IsEq[Nested[M, N, F[C]]]

final def notify(): Unit

final def notifyAll(): Unit

def orderedConsistency[A](x: F[A], y: F[A])(implicit arg0: Eq[A], ev: Eq[F[A]]): IsEq[List[A]]

def reduceLeftOptionConsistentWithReduceLeftToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]

reduceLeftOption consistent with reduceLeftToOption

def reduceLeftToConsistentWithReduceMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]

def reduceMapDerived[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]

def reduceReduceLeftConsistent[B](fa: F[B])(implicit B: Semigroup[B]): IsEq[B]

def reduceRightConsistentWithReduceRightOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]

def reduceRightOptionConsistentWithReduceRightToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]

reduceRightOption consistent with reduceRightToOption

def reduceRightToConsistentWithReduceMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]

def reduceRightToConsistentWithReduceRightToOption[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[Option[B]]

def rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]

def sequenceConsistent[G[_], A](fa: F[G[A]])(implicit arg0: Applicative[G]): IsEq[G[Unit]]

def sizeConsistent[A](fa: F[A]): IsEq[Long]

final def synchronized[T0](arg0: ⇒ T0): T0

def takeWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]

def toListRef[A](fa: F[A]): IsEq[List[A]]

def toString(): String

def traverseConsistent[G[_], A, B](fa: F[A], f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): IsEq[G[Unit]]

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]

def unorderedSequenceConsistent[A, G[_]](fga: F[G[A]])(implicit arg0: CommutativeApplicative[G]): IsEq[G[F[A]]]

def unorderedTraverseIdentity[A, B](fa: F[A])(f: (A) ⇒ B)(implicit ev: Functor[F]): IsEq[F[B]]

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]])]

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]]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def zipWithIndexRef[A, B](fa: F[A], f: ((A, Int)) ⇒ B): IsEq[F[B]]