object ZNonEmptySet extends LowPriorityZNonEmptySetImplicits
- Alphabetic
- By Inheritance
- ZNonEmptySet
- LowPriorityZNonEmptySetImplicits
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Value Members
- implicit def ZNonEmptySetAssociative[A, B](implicit ev: Associative[B]): Associative[ZNonEmptySet[A, B]]
Derives a
Associative[ZNonEmptySet[A, B]]
given aAssociative[B]
. - implicit def ZNonEmptySetCommutative[A, B](implicit ev: Commutative[B]): Commutative[ZNonEmptySet[A, B]]
Derives a
Commutative[ZNonEmptySet[A, B]]
given aCommutative[B]
. - implicit def ZNonEmptySetCovariant[B](implicit ev: Commutative[Sum[B]]): Covariant[[+x]ZNonEmptySet[x, B]]
The
Covariant
instance forZNonEmptySet
. - implicit def ZNonEmptySetDebug[A, B](implicit arg0: Debug[A], arg1: Debug[B]): Debug[ZNonEmptySet[A, B]]
Derives a
Debug[ZNonEmptySet[A, B]]
given aDebug[A]
andDebug[B]
. - implicit def ZNonEmptySetDeriveEqual[B](implicit arg0: Equal[B], ev: Identity[Sum[B]]): DeriveEqual[[+x]ZNonEmptySet[x, B]]
The
EqualF
instance forZNonEmptySet
. - implicit def ZNonEmptySetEqual[A, B](implicit arg0: Equal[B], ev: Identity[Sum[B]]): Equal[ZNonEmptySet[A, B]]
Derives an
Equal[ZNonEmptySet[A, B]]
given anEqual[B]
.Derives an
Equal[ZNonEmptySet[A, B]]
given anEqual[B]
. Due to the limitations of Scala'sMap
, this uses object equality on the keys. - implicit def ZNonEmptySetFlatten[B](implicit ev1: Commutative[Sum[B]], ev2: Commutative[Prod[B]]): AssociativeFlatten[[+x]ZNonEmptySet[x, B]]
The
IdentityFlatten
instance forZNonEmptySet
. - implicit def ZNonEmptySetHash[A, B](implicit arg0: Hash[B], ev: Identity[Sum[B]]): Hash[ZNonEmptySet[A, B]]
Derives a
Hash[ZNonEmptySet[A, B]]
given aHash[B]
.Derives a
Hash[ZNonEmptySet[A, B]]
given aHash[B]
. Due to the limitations of Scala'sMap
, this uses object equality on the keys. - implicit def ZNonEmptySetIdempotent[A, B](implicit ev: Idempotent[B]): Idempotent[ZNonEmptySet[A, B]]
Derives a
Idempotent[ZNonEmptySet[A, B]]
given aIdempotent[B]
. - implicit def ZNonEmptySetPartialOrd[A, B](implicit arg0: PartialOrd[B], ev: Identity[Sum[B]]): PartialOrd[ZNonEmptySet[A, B]]
Derives a
PartialOrd[ZNonEmptySet[A, B]]
given aPartialOrd[B]
.Derives a
PartialOrd[ZNonEmptySet[A, B]]
given aPartialOrd[B]
. Due to the limitations of Scala'sMap
, this uses object equality on the keys.- Definition Classes
- LowPriorityZNonEmptySetImplicits
- def apply[A](a: A, as: A*): NonEmptyMultiSet[A]
Constructs a set with the specified elements.
- def fromIterable[A](head: A, tail: Iterable[A]): NonEmptyMultiSet[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 fromIterableOption[A](elems: Iterable[A]): Option[NonEmptyMultiSet[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
. ReturnsNone
if empty. - def fromMapOption[A, B](map: Map[A, B]): Option[ZNonEmptySet[A, B]]
Constructs a set from the specified
Map
.Constructs a set from the specified
Map
. The values will be the keys in theMap
and the measure of how many times a value occurs will be the keys value. ReturnsNone
if empty. - def fromNonEmptyChunk[A](nonEmptyChunk: NonEmptyChunk[A]): NonEmptyMultiSet[A]
Constructs a set from the specified
NonEmptyChunk
.Constructs a set from the specified
NonEmptyChunk
. 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 fromNonEmptySet[A](set: NonEmptySet[A]): ZNonEmptySet[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. - def fromSetOption[A](set: Set[A]): Option[ZNonEmptySet[A, Boolean]]
Constructs a
NonEmptyMultiSet
, where, by definition, each element is present exactly once.Constructs a
NonEmptyMultiSet
, where, by definition, each element is present exactly once. ReturnsNone
if empty. - implicit def toZSet[A, B](zNonEmptySet: ZNonEmptySet[A, B]): ZSet[A, B]
Provides an implicit conversion from
NonEmptySet
to theSet
for interoperability with Scala's collection library.