Packages

object NonEmptySortedSet

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

Value Members

  1. implicit def NonEmptySortedSetCommutativeIdempotent[A](implicit aOrd: scala.math.Ordering[A]): Commutative[NonEmptySortedSet[A]] with Idempotent[NonEmptySortedSet[A]]

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

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

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

  3. implicit val NonEmptySortedSetDeriveEqual: DeriveEqual[NonEmptySortedSet]

    The DeriveEqual instance for NonEmptySortedSet.

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

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

  5. def apply[A](elem: A, others: A*)(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]
  6. def apply[A](elem: A, others: Iterable[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]
  7. def fromIterableOption[A](iterable: Iterable[A])(implicit ordering: scala.math.Ordering[A]): Option[NonEmptySortedSet[A]]

    Constructs a NonEmptySortedSet from an Iterable or None otherwise.

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

    Constructs a NonEmptyChunk from a NonEmptyList.

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

    Constructs a NonEmptySortedSet from a NonEmptyList.

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

    Constructs a NonEmptySortedSet from an element and SortedSet.

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

    Constructs a NonEmptySortedSet from a SortedSet or None otherwise.

  12. def single[A](head: A)(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Constructs a NonEmptySortedSet with the specified single value.

  13. implicit def toSet[A](nonEmptySet: NonEmptySortedSet[A]): Set[A]

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

  14. def unapply[A](arg: NonEmptySortedSet[A]): Some[(A, SortedSet[A])]
  15. def union[A](l: SortedSet[A], r: NonEmptySortedSet[A])(implicit ordering: scala.math.Ordering[A]): NonEmptySortedSet[A]

    Creates a NonEmptySortedSet containing elements from l and r

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

    Creates a NonEmptySortedSet containing elements from l and r