trait UnorderedFoldable[F[_]] extends Serializable
UnorderedFoldable
is like a Foldable
for unordered containers.
- Alphabetic
- By Inheritance
- UnorderedFoldable
- Serializable
- Serializable
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
getClass(): Class[_]
- Definition Classes
- Any
- abstract def unorderedFoldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
##(): Int
- Definition Classes
- Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
equals(arg0: Any): Boolean
- Definition Classes
- Any
-
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
. -
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
. -
def
hashCode(): Int
- Definition Classes
- Any
-
def
isEmpty[A](fa: F[A]): Boolean
Returns true if there are no elements.
Returns true if there are no elements. Otherwise false.
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def nonEmpty[A](fa: F[A]): Boolean
-
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.
-
def
toString(): String
- Definition Classes
- Any
- def unorderedFold[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): A