Object/Class

zio.prelude

NonEmptySortedSet

Related Docs: class NonEmptySortedSet | package prelude

Permalink

object NonEmptySortedSet

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NonEmptySortedSet
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. implicit def NonEmptySortedSetCommutativeIdempotent[A](implicit aOrd: scala.math.Ordering[A]): Commutative[NonEmptySortedSet[A]] with Idempotent[NonEmptySortedSet[A]]

    Permalink

    The Commutative and Idempotent (and thus Associative) instance for NonEmptySortedSet.

  5. implicit def NonEmptySortedSetDebug[A](implicit arg0: Debug[A]): Debug[NonEmptySortedSet[A]]

    Permalink

    Derives a Debug[NonEmptySortedSet[A]] given a Debug[A].

  6. implicit val NonEmptySortedSetDeriveEqual: DeriveEqual[NonEmptySortedSet]

    Permalink

    The DeriveEqual instance for NonEmptySortedSet.

  7. implicit def NonEmptySortedSetHashPartialOrd[A]: Hash[NonEmptySortedSet[A]] with PartialOrd[NonEmptySortedSet[A]]

    Permalink

    Derives a Hash[NonEmptySortedSet[A]] and PartialOrd[NonEmptySortedSet[A]] (and thus Equal[NonEmptyList[A]]) instance.

  8. def apply[A](elem: A, others: A*)(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Permalink
  9. def apply[A](elem: A, others: Iterable[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Permalink
  10. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  11. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. def fromIterableOption[A](iterable: Iterable[A])(implicit ordering: scala.math.Ordering[A]): Option[NonEmptySortedSet[A]]

    Permalink

    Constructs a NonEmptySortedSet from an Iterable or None otherwise.

  16. def fromNonEmptyChunk[A](elems: NonEmptyChunk[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Permalink

    Constructs a NonEmptyChunk from a NonEmptyList.

  17. def fromNonEmptyList[A](elems: NonEmptyList[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Permalink

    Constructs a NonEmptySortedSet from a NonEmptyList.

  18. def fromSet[A](elem: A, others: SortedSet[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Permalink

    Constructs a NonEmptySortedSet from an element and SortedSet.

  19. def fromSetOption[A](set: SortedSet[A])(implicit ordering: scala.math.Ordering[A]): Option[NonEmptySortedSet[A]]

    Permalink

    Constructs a NonEmptySortedSet from a SortedSet or None otherwise.

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

    Permalink
    Definition Classes
    AnyRef → Any
  21. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  22. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  23. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  24. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  26. def single[A](head: A)(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Permalink

    Constructs a NonEmptySortedSet with the specified single value.

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

    Permalink
    Definition Classes
    AnyRef
  28. implicit def toSet[A](nonEmptySet: NonEmptySortedSet[A]): Set[A]

    Permalink

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

  29. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  30. def unapply[A](arg: NonEmptySortedSet[A]): Some[(A, SortedSet[A])]

    Permalink
  31. def union[A](l: SortedSet[A], r: NonEmptySortedSet[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Permalink

    Creates a NonEmptySortedSet containing elements from l and r

  32. def union[A](l: NonEmptySortedSet[A], r: SortedSet[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Permalink

    Creates a NonEmptySortedSet containing elements from l and r

  33. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped