final class SetOps[A] extends AnyVal
Ordering
- Alphabetic
- By Inheritance
Inherited
- SetOps
- AnyVal
- Any
- Hide All
- Show All
Visibility
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
##(): Int
- Definition Classes
- Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
getClass(): Class[_ <: AnyVal]
- Definition Classes
- AnyVal → Any
-
def
groupByNes[B](f: (A) ⇒ B)(implicit B: Order[B]): SortedMap[B, NonEmptySet[A]]
Groups elements inside this
SortedSetaccording to theOrderof the keys produced by the given mapping function.Groups elements inside this
SortedSetaccording to theOrderof the keys produced by the given mapping function.scala> import cats.data.NonEmptySet scala> import scala.collection.immutable.{SortedMap, SortedSet} scala> import cats.implicits._ scala> val sortedSet = SortedSet(12, -2, 3, -5) scala> val expectedResult = SortedMap(false -> NonEmptySet.of(-5, -2), true -> NonEmptySet.of(3, 12)) scala> sortedSet.groupByNes(_ >= 0) === expectedResult res0: Boolean = true
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
toNes: Option[NonEmptySet[A]]
Returns an Option of NonEmptySet from a SortedSet
Returns an Option of NonEmptySet from a SortedSet
Example:
scala> import scala.collection.immutable.SortedSet scala> import cats.data.NonEmptySet scala> import cats.implicits._ scala> val result1: SortedSet[Int] = SortedSet(1, 2) scala> result1.toNes res0: Option[NonEmptySet[Int]] = Some(TreeSet(1, 2)) scala> val result2: SortedSet[Int] = SortedSet.empty[Int] scala> result2.toNes res1: Option[NonEmptySet[Int]] = None
-
def
toString(): String
- Definition Classes
- Any