Packages

object ZSet extends LowPriorityZSetImplicits

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ZSet
  2. LowPriorityZSetImplicits
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. implicit lazy val MultiSetForEach: ForEach[MultiSet]

    The ForEach instance for MultiSet.

  2. implicit def ZSetCommutative[A, B](implicit ev: Commutative[B]): Commutative[ZSet[A, B]] with Identity[ZSet[A, B]]

    Derives a Commutative[ZSet[A, B]] given a Commutative[B].

  3. implicit def ZSetCovariant[B](implicit ev: Commutative[Sum[B]]): Covariant[[+x]ZSet[x, B]]

    The Covariant instance for ZSet.

  4. implicit def ZSetDebug[A, B](implicit arg0: Debug[A], arg1: Debug[B]): Debug[ZSet[A, B]]

    Derives a Debug[ZSet[A, B]] given a Debug[A] and Debug[B].

  5. implicit def ZSetDeriveEqual[B](implicit arg0: Equal[B], ev: Identity[Sum[B]]): DeriveEqual[[+x]ZSet[x, B]]

    The EqualF instance for ZSet.

  6. implicit def ZSetEqual[A, B](implicit ev1: Equal[B], ev: Identity[Sum[B]]): Equal[ZSet[A, B]]

    Derives an Equal[ZSet[A, B]] given an Equal[B].

    Derives an Equal[ZSet[A, B]] given an Equal[B]. Due to the limitations of Scala's Map, this uses object equality on the keys.

  7. implicit def ZSetHash[A, B](implicit arg0: Hash[B], ev: Identity[Sum[B]]): Hash[ZSet[A, B]]

    Derives a Hash[ZSet[A, B]] given a Hash[B].

    Derives a Hash[ZSet[A, B]] given a Hash[B]. Due to the limitations of Scala's Map, this uses object equality on the keys.

  8. implicit def ZSetIdempotent[A, B](implicit ev: Idempotent[B]): Idempotent[ZSet[A, B]] with Identity[ZSet[A, B]]

    Derives a Idempotent[ZSet[A, B]] given a Idempotent[B].

  9. implicit def ZSetIdentity[A, B](implicit ev: Associative[B]): Identity[ZSet[A, B]]

    Derives a Identity[ZSet[A, B]] given a Identity[B].

  10. implicit def ZSetIdentityFlatten[B](implicit ev1: Commutative[Sum[B]], ev2: Commutative[Prod[B]]): IdentityFlatten[[+x]ZSet[x, B]]

    The IdentityFlatten instance for ZSet.

  11. implicit def ZSetPartialOrd[A, B](implicit arg0: PartialOrd[B], ev: Identity[Sum[B]]): PartialOrd[ZSet[A, B]]

    Derives a PartialOrd[ZSet[A, B]] given a PartialOrd[B].

    Derives a PartialOrd[ZSet[A, B]] given a PartialOrd[B]. Due to the limitations of Scala's Map, this uses object equality on the keys.

    Definition Classes
    LowPriorityZSetImplicits
  12. def apply[A](as: A*): ZSet[A, Int]

    Constructs a set with the specified elements.

  13. val empty: ZSet[Nothing, Nothing]

    The empty set.

  14. def fromIterable[A](iterable: Iterable[A]): MultiSet[A]

    Constructs a set from the specified Iterable.

    Constructs a set from the specified Iterable. The measure of how many times a value occurs in the set will be an integer representing how many times the value occurred in the specified Iterable.

  15. def fromMap[A, B](map: Map[A, B]): ZSet[A, B]

    Constructs a set from the specified Map.

    Constructs a set from the specified Map. The values will be the keys in the Map and the measure of how many times a value occurs will be the keys value.

  16. def fromSet[A](set: Set[A]): ZSet[A, Boolean]

    Constructs a set from the specified Set.

    Constructs a set from the specified Set. The measure of how many times a value occurs in the set will be a boolean representing whether a value occurs at all.