UnorderedTraverse

abstract def unorderedFoldMap[A, B](fa: F[A])(f: (A) ⇒ B)(implicit arg0: CommutativeMonoid[B]): B

abstract def unorderedTraverse[G[_], A, B](sa: F[A])(f: (A) ⇒ G[B])(implicit arg0: CommutativeApplicative[G]): G[F[B]]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

Check whether at least one element satisfies the predicate.

def finalize(): Unit

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

Check whether all elements satisfy the predicate.

final def getClass(): Class[_]

def hashCode(): Int

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

Returns true if there are no elements.

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

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

final def notify(): Unit

final def notifyAll(): Unit

def size[A](fa: F[A]): Long

The size of this UnorderedFoldable.

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

def toString(): String

def unorderedFold[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): A

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit