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. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. implicit lazy val MultiSetForEach: ForEach[MultiSet]

    The ForEach instance for MultiSet.

  5. 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].

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

    The Covariant instance for ZSet.

  7. 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].

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

    The EqualF instance for ZSet.

  9. 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.

  10. 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.

  11. 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].

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

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

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

    The IdentityFlatten instance for ZSet.

  14. 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
  15. def apply[A](as: A*): ZSet[A, Int]

    Constructs a set with the specified elements.

  16. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  17. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  18. val empty: ZSet[Nothing, Nothing]

    The empty set.

  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  21. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  22. 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.

  23. 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.

  24. 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.

  25. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  26. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  27. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  28. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  31. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  32. def toString(): String
    Definition Classes
    AnyRef → Any
  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  34. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  35. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()

Inherited from AnyRef

Inherited from Any

Ungrouped