object ZSet extends LowPriorityZSetImplicits
- Alphabetic
 - By Inheritance
 
- ZSet
 - LowPriorityZSetImplicits
 - AnyRef
 - Any
 
- Hide All
 - Show All
 
- Public
 - Protected
 
Value Members
-   final  def !=(arg0: Any): Boolean
- Definition Classes
 - AnyRef → Any
 
 -   final  def ##: Int
- Definition Classes
 - AnyRef → Any
 
 -   final  def ==(arg0: Any): Boolean
- Definition Classes
 - AnyRef → Any
 
 -   implicit  lazy val MultiSetForEach: ForEach[MultiSet]
The
ForEachinstance forMultiSet. -   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 aCommutative[B]. -   implicit  def ZSetCovariant[B](implicit ev: Commutative[Sum[B]]): Covariant[[+x]ZSet[x, B]]
The
Covariantinstance forZSet. -   implicit  def ZSetDebug[A, B](implicit arg0: Debug[A], arg1: Debug[B]): Debug[ZSet[A, B]]
Derives a
Debug[ZSet[A, B]]given aDebug[A]andDebug[B]. -   implicit  def ZSetDeriveEqual[B](implicit arg0: Equal[B], ev: Identity[Sum[B]]): DeriveEqual[[+x]ZSet[x, B]]
The
EqualFinstance forZSet. -   implicit  def ZSetEqual[A, B](implicit ev1: Equal[B], ev: Identity[Sum[B]]): Equal[ZSet[A, B]]
Derives an
Equal[ZSet[A, B]]given anEqual[B].Derives an
Equal[ZSet[A, B]]given anEqual[B]. Due to the limitations of Scala'sMap, this uses object equality on the keys. -   implicit  def ZSetHash[A, B](implicit arg0: Hash[B], ev: Identity[Sum[B]]): Hash[ZSet[A, B]]
Derives a
Hash[ZSet[A, B]]given aHash[B].Derives a
Hash[ZSet[A, B]]given aHash[B]. Due to the limitations of Scala'sMap, this uses object equality on the keys. -   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 aIdempotent[B]. -   implicit  def ZSetIdentity[A, B](implicit ev: Associative[B]): Identity[ZSet[A, B]]
Derives a
Identity[ZSet[A, B]]given aIdentity[B]. -   implicit  def ZSetIdentityFlatten[B](implicit ev1: Commutative[Sum[B]], ev2: Commutative[Prod[B]]): IdentityFlatten[[+x]ZSet[x, B]]
The
IdentityFlatteninstance forZSet. -   implicit  def ZSetPartialOrd[A, B](implicit arg0: PartialOrd[B], ev: Identity[Sum[B]]): PartialOrd[ZSet[A, B]]
Derives a
PartialOrd[ZSet[A, B]]given aPartialOrd[B].Derives a
PartialOrd[ZSet[A, B]]given aPartialOrd[B]. Due to the limitations of Scala'sMap, this uses object equality on the keys.- Definition Classes
 - LowPriorityZSetImplicits
 
 -    def apply[A](as: A*): ZSet[A, Int]
Constructs a set with the specified elements.
 -   final  def asInstanceOf[T0]: T0
- Definition Classes
 - Any
 
 -    def clone(): AnyRef
- Attributes
 - protected[lang]
 - Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.CloneNotSupportedException]) @native()
 
 -    val empty: ZSet[Nothing, Nothing]
The empty set.
 -   final  def eq(arg0: AnyRef): Boolean
- Definition Classes
 - AnyRef
 
 -    def equals(arg0: AnyRef): Boolean
- Definition Classes
 - AnyRef → Any
 
 -    def finalize(): Unit
- Attributes
 - protected[lang]
 - Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.Throwable])
 
 -    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 specifiedIterable. -    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 theMapand the measure of how many times a value occurs will be the keys value. -    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. -   final  def getClass(): Class[_ <: AnyRef]
- Definition Classes
 - AnyRef → Any
 - Annotations
 - @native()
 
 -    def hashCode(): Int
- Definition Classes
 - AnyRef → Any
 - Annotations
 - @native()
 
 -   final  def isInstanceOf[T0]: Boolean
- Definition Classes
 - Any
 
 -   final  def ne(arg0: AnyRef): Boolean
- Definition Classes
 - AnyRef
 
 -   final  def notify(): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @native()
 
 -   final  def notifyAll(): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @native()
 
 -   final  def synchronized[T0](arg0: => T0): T0
- Definition Classes
 - AnyRef
 
 -    def toString(): String
- Definition Classes
 - AnyRef → Any
 
 -   final  def wait(): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.InterruptedException])
 
 -   final  def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.InterruptedException])
 
 -   final  def wait(arg0: Long): Unit
- Definition Classes
 - AnyRef
 - Annotations
 - @throws(classOf[java.lang.InterruptedException]) @native()