trait FoldableLaws[F[_]] extends UnorderedFoldableLaws[F]
Linear Supertypes
Known Subclasses
Ordering
- Alphabetic
- By Inheritance
Inherited
- FoldableLaws
- UnorderedFoldableLaws
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
-
implicit abstract
def
F: Foldable[F]
- Definition Classes
- FoldableLaws → UnorderedFoldableLaws
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]]
- def collectFirst_Ref[A, B](fa: F[A], pf: PartialFunction[A, B]): IsEq[Option[B]]
- def dropWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
-
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
-
def
existsLazy[A](fa: F[A]): Boolean
- Definition Classes
- UnorderedFoldableLaws
- def filter_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
-
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
. - def foldRef[A](fa: F[A])(implicit A: Monoid[A]): IsEq[A]
-
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]]
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[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]]
-
def
reduceLeftOptionConsistentWithReduceLeftToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]
reduceLeftOption
consistent withreduceLeftToOption
-
def
reduceRightOptionConsistentWithReduceRightToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]
reduceRightOption
consistent withreduceRightToOption
- def rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- 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
- Definition Classes
- AnyRef → Any
-
def
unorderedFoldConsistentWithUnorderedFoldMap[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): IsEq[A]
- Definition Classes
- UnorderedFoldableLaws
-
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( ... )