trait UnorderedFoldable[F[_]] extends Serializable

UnorderedFoldable is like a Foldable for unordered containers.

Annotations
@implicitNotFound( ... )
Linear Supertypes
Serializable, Serializable, Any
Known Subclasses
Foldable, NonEmptyReducible, NonEmptyTraverse, Reducible, Traverse, UnorderedTraverse
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UnorderedFoldable
  2. Serializable
  3. Serializable
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def getClass(): Class[_]
    Definition Classes
    Any
  2. abstract def unorderedFoldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    Any
  2. final def ##(): Int
    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def count[A](fa: F[A])(p: (A) ⇒ Boolean): Long

    Count the number of elements in the structure that satisfy the given predicate.

    Count the number of elements in the structure that satisfy the given predicate.

    For example:

    scala> import cats.implicits._
scala> val map1 = Map[Int, String]()
scala> val p1: String => Boolean = _.length > 0
scala> UnorderedFoldable[Map[Int, *]].count(map1)(p1)
res0: Long = 0

scala> val map2 = Map(1 -> "hello", 2 -> "world", 3 -> "!")
scala> val p2: String => Boolean = _.length > 1
scala> UnorderedFoldable[Map[Int, *]].count(map2)(p2)
res1: Long = 2
    Annotations
    @noop()
  6. def equals(arg0: Any): Boolean
    Definition Classes
    Any
  7. def exists[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Check whether at least one element satisfies the predicate.

    Check whether at least one element satisfies the predicate.

    If there are no elements, the result is false.

  8. def forall[A](fa: F[A])(p: (A) ⇒ Boolean): Boolean

    Check whether all elements satisfy the predicate.

    Check whether all elements satisfy the predicate.

    If there are no elements, the result is true.

  9. def hashCode(): Int
    Definition Classes
    Any
  10. def isEmpty[A](fa: F[A]): Boolean

    Returns true if there are no elements.

    Returns true if there are no elements. Otherwise false.

  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. def nonEmpty[A](fa: F[A]): Boolean
  13. def size[A](fa: F[A]): Long

    The size of this UnorderedFoldable.

    The size of this UnorderedFoldable.

    This is overridden in structures that have more efficient size implementations (e.g. Vector, Set, Map).

    Note: will not terminate for infinite-sized collections.

  14. def toString(): String
    Definition Classes
    Any
  15. def unorderedFold[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): A

Inherited from Serializable

Inherited from Serializable

Inherited from Any

Ungrouped