ZNonEmptySet

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 def ZNonEmptySetAssociative[A, B](implicit ev: Associative[B]): Associative[ZNonEmptySet[A, B]]

   

   Derives a Associative[ZNonEmptySet[A, B]] given a Associative[B].

5. implicit def ZNonEmptySetCommutative[A, B](implicit ev: Commutative[B]): Commutative[ZNonEmptySet[A, B]]

   

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

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

   

   The Covariant instance for ZNonEmptySet.

7. implicit def ZNonEmptySetDebug[A, B](implicit arg0: Debug[A], arg1: Debug[B]): Debug[ZNonEmptySet[A, B]]

   

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

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

   

   The EqualF instance for ZNonEmptySet.

9. implicit def ZNonEmptySetEqual[A, B](implicit arg0: Equal[B], ev: Identity[Sum[B]]): Equal[ZNonEmptySet[A, B]]

   

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

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

10. implicit def ZNonEmptySetFlatten[B](implicit ev1: Commutative[Sum[B]], ev2: Commutative[Prod[B]]): AssociativeFlatten[[+x]ZNonEmptySet[x, B]]

    

    The IdentityFlatten instance for ZNonEmptySet.

11. implicit def ZNonEmptySetHash[A, B](implicit arg0: Hash[B], ev: Identity[Sum[B]]): Hash[ZNonEmptySet[A, B]]

    

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

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

12. implicit def ZNonEmptySetIdempotent[A, B](implicit ev: Idempotent[B]): Idempotent[ZNonEmptySet[A, B]]

    

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

13. implicit def ZNonEmptySetPartialOrd[A, B](implicit arg0: PartialOrd[B], ev: Identity[Sum[B]]): PartialOrd[ZNonEmptySet[A, B]]

    

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

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

    Definition Classes

    LowPriorityZNonEmptySetImplicits

14. def apply[A](a: A, as: A*): NonEmptyMultiSet[A]

    

    Constructs a set with the specified elements.

15. final def asInstanceOf[T0]: T0

    

    Definition Classes

    Any

16. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

17. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

18. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

19. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

20. 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 specified Iterable.

21. 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 specified Iterable. Returns None if empty.

22. 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 the Map and the measure of how many times a value occurs will be the keys value. Returns None if empty.

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

24. 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. Returns None if empty.

25. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

26. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

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

30. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

31. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

32. def toString(): String

    

    Definition Classes

    AnyRef → Any

33. implicit def toZSet[A, B](zNonEmptySet: ZNonEmptySet[A, B]): ZSet[A, B]

    

    Provides an implicit conversion from NonEmptySet to the Set for interoperability with Scala's collection library.

34. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

35. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

36. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )