ZSet

zio.prelude.ZSet
See theZSet companion class

Attributes

Companion
class
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
ZSet.type

Members list

Value members

Concrete methods

def apply[A](as: A*): ZSet[A, Int]

Constructs a set with the specified elements.

Constructs a set with the specified elements.

Attributes

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.

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.

Attributes

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

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.

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.

Attributes

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

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.

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.

Attributes

Concrete fields

val empty: ZSet[Nothing, Nothing]

The empty set.

The empty set.

Attributes

Implicits

Implicits

implicit lazy val MultiSetForEach: ForEach[MultiSet]

The ForEach instance for MultiSet.

The ForEach instance for MultiSet.

Attributes

implicit def ZSetCommutative[A, B](implicit ev: Commutative[B]): Commutative[ZSet[A, B]] & Identity[ZSet[A, B]]

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

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

Attributes

implicit def ZSetCovariant[B](implicit ev: Commutative[subtypeF.Type[B]]): Covariant[{ type lambda = ZSet; }#<none>]

The Covariant instance for ZSet.

The Covariant instance for ZSet.

Attributes

implicit def ZSetDebug[A : Debug, B : Debug]: Debug[ZSet[A, B]]

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

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

Attributes

implicit def ZSetDeriveEqual[B : Equal](implicit evidence$1: Equal[B], ev: Identity[subtypeF.Type[B]]): DeriveEqual[{ type lambda = ZSet; }#<none>]

The EqualF instance for ZSet.

The EqualF instance for ZSet.

Attributes

implicit def ZSetEqual[A, B](implicit ev1: Equal[B], ev: Identity[subtypeF.Type[B]]): Equal[ZSet[A, 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.

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.

Attributes

implicit def ZSetHash[A, B : Hash](implicit evidence$1: Hash[B], ev: Identity[subtypeF.Type[B]]): Hash[ZSet[A, 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.

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.

Attributes

implicit def ZSetIdempotent[A, B](implicit ev: Idempotent[B]): Idempotent[ZSet[A, B]] & Identity[ZSet[A, B]]

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

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

Attributes

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

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

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

Attributes

implicit def ZSetIdentityFlatten[B](implicit ev1: Commutative[subtypeF.Type[B]], ev2: Commutative[subtypeF.Type[B]]): IdentityFlatten[{ type lambda = ZSet; }#<none>]

The IdentityFlatten instance for ZSet.

The IdentityFlatten instance for ZSet.

Attributes

Inherited implicits

implicit def ZSetPartialOrd[A, B : PartialOrd](implicit evidence$1: PartialOrd[B], ev: Identity[subtypeF.Type[B]]): PartialOrd[ZSet[A, 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.

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.

Attributes

Inherited from:
LowPriorityZSetImplicits