scala.math.Ordering.String: Object with StringOrdering0.8977666
scala-library scala.math.Ordering.String
Doc ·
scala.math.Ordering.String.<init>(): String$0.8977281
scala-library scala.math.Ordering.String.<init>
Doc ·
scalaz.std.StringInstances.stringInstance.toScalaOrdering: Ordering[String]0.883548
note

Order.fromScalaOrdering(toScalaOrdering).order(x, y)

this.order(x, y)

scalaz-core_2.11 scalaz.std.StringInstances.stringInstance.toScalaOrdering
Doc ·
scala.math.Ordering.String.reverse: Ordering[String]0.883548

Return the opposite ordering of this one.

scala-library scala.math.Ordering.String.reverse
Doc ·
StringOrdering.reverse: Ordering[String]0.8455005

Return the opposite ordering of this one.

scala-library scala.math.Ordering.StringOrdering.reverse
Doc ·
Fractional[T].reverse: Ordering[T]0.5622313

Return the opposite ordering of this one.

scala-library scala.math.Fractional.reverse
Doc ·
Integral[T].reverse: Ordering[T]0.5622313

Return the opposite ordering of this one.

scala-library scala.math.Integral.reverse
Doc ·
Numeric[T].reverse: Ordering[T]0.5622313

Return the opposite ordering of this one.

scala-library scala.math.Numeric.reverse
Doc ·
Ordering[T].reverse: Ordering[T]0.5622313

Return the opposite ordering of this one.

scala-library scala.math.Ordering.reverse
Doc ·
OptionOrdering[T].reverse: Ordering[Option[T]]0.5399402

Return the opposite ordering of this one.

scala-library scala.math.Ordering.OptionOrdering.reverse
Doc ·
BufferedLineIterator.to[Col](implicit CanBuildFrom[Nothing, String, Col[String]]): Col[String]0.6996277

Converts this traversable or iterator into another by copying all elements.

typeParams
Col

The collection type to build.

returns

a new collection containing all elements of this traversable or iterator.

scala-library scala.io.BufferedSource.BufferedLineIterator.to
Doc ·
LineIterator.to[Col](implicit CanBuildFrom[Nothing, String, Col[String]]): Col[String]0.6996277

Converts this traversable or iterator into another by copying all elements.

typeParams
Col

The collection type to build.

returns

a new collection containing all elements of this traversable or iterator.

scala-library scala.io.Source.LineIterator.to
Doc ·
MatchIterator.to[Col](implicit CanBuildFrom[Nothing, String, Col[String]]): Col[String]0.6996277

Converts this traversable or iterator into another by copying all elements.

typeParams
Col

The collection type to build.

returns

a new collection containing all elements of this traversable or iterator.

scala-library scala.util.matching.Regex.MatchIterator.to
Doc ·
JPropertiesWrapper.to[Col](implicit CanBuildFrom[Nothing, (String, String), Col[(String, String)]]): Col[(String, String)]0.63748974

Converts this mutable map into another by copying all elements.

typeParams
Col

The collection type to build.

returns

a new collection containing all elements of this mutable map.

scala-library scala.collection.convert.Wrappers.JPropertiesWrapper.to
Doc ·
SystemProperties.to[Col](implicit CanBuildFrom[Nothing, (String, String), Col[(String, String)]]): Col[(String, String)]0.63748974

Converts this mutable map into another by copying all elements.

typeParams
Col

The collection type to build.

returns

a new collection containing all elements of this mutable map .

scala-library scala.sys.SystemProperties.to
Doc ·
scala.math.Ordering.apply[T](implicit Ordering[T]): Ordering[T]0.5839277
scala-library scala.math.Ordering.apply
Doc ·
scala.math.Ordering.comparatorToOrdering[A](implicit Comparator[A]): Ordering[A]0.5839277
scala-library scala.math.Ordering.comparatorToOrdering
Doc ·
scala.math.Ordering.Implicits.seqDerivedOrdering[CC <: scala.collection.Seq[X], T](implicit Ordering[T]): Ordering[CC[T]]0.5839277

Not in the standard scope due to the potential for divergence: For instance implicitly[Ordering[Any]] diverges in its presence.

scala-library scala.math.Ordering.Implicits.seqDerivedOrdering
Doc ·
scala.math.Ordering.ordered[A](implicit (A) => Comparable[A]): Ordering[A]0.5789628

This would conflict with all the nice implicit Orderings available, but thanks to the magic of prioritized implicits via subclassing we can make Ordered[A] => Ordering[A] only turn up if nothing else works. Since Ordered[A] extends Comparable[A] anyway, we can throw in some Java interop too.

scala-library scala.math.Ordering.ordered
Doc ·
SortedSet[A].ordering: Ordering[A]0.5622313
scala-library scala.collection.SortedSet.ordering
Doc ·
SortedSet[A].ordering: Ordering[A]0.5622313
scala-library scala.collection.immutable.SortedSet.ordering
Doc ·
TreeSet[A].ordering: Ordering[A]0.5622313
scala-library scala.collection.immutable.TreeSet.ordering
Doc ·
SortedSet[A].ordering: Ordering[A]0.5622313
scala-library scala.collection.mutable.SortedSet.ordering
Doc ·
TreeSet[A].ordering: Ordering[A]0.5622313
scala-library scala.collection.mutable.TreeSet.ordering
Doc ·
SortedMap[A, B].ordering: Ordering[A]0.5399402
scala-library scala.collection.SortedMap.ordering
Doc ·
SortedSetLike[A, This].ordering: Ordering[A]0.5399402
scala-library scala.collection.SortedSetLike.ordering
Doc ·
SortedMap[A, B].ordering: Ordering[A]0.5399402
scala-library scala.collection.immutable.SortedMap.ordering
Doc ·
TreeMap[A, B].ordering: Ordering[A]0.5399402
scala-library scala.collection.immutable.TreeMap.ordering
Doc ·
Sorted[K, This].ordering: Ordering[K]0.5399402
scala-library scala.collection.generic.Sorted.ordering
Doc ·
SortedMapLike[A, B, This].ordering: Ordering[A]0.5193492
scala-library scala.collection.SortedMapLike.ordering
Doc ·
OptionOrdering[T].optionOrdering: Ordering[T]0.5622313
scala-library scala.math.Ordering.OptionOrdering.optionOrdering
Doc ·
Enum[F].toScalaOrdering: Ordering[F]0.5622313
note

Order.fromScalaOrdering(toScalaOrdering).order(x, y)

this.order(x, y)

scalaz-core_2.11 scalaz.Enum.toScalaOrdering
Doc ·
Order[F].toScalaOrdering: Ordering[F]0.5622313
note

Order.fromScalaOrdering(toScalaOrdering).order(x, y)

this.order(x, y)

scalaz-core_2.11 scalaz.Order.toScalaOrdering
Doc ·
IsomorphismOrder[F, G].toScalaOrdering: Ordering[F]0.5399402
note

Order.fromScalaOrdering(toScalaOrdering).order(x, y)

this.order(x, y)

scalaz-core_2.11 scalaz.IsomorphismOrder.toScalaOrdering
Doc ·
PriorityQueue[A].ord: Ordering[A]0.5622313
scala-library scala.collection.mutable.PriorityQueue.ord
Doc ·
PriorityQueueProxy[A].ord: Ordering[A]0.5622313
scala-library scala.collection.mutable.PriorityQueueProxy.ord
Doc ·
SynchronizedPriorityQueue[A].ord: Ordering[A]0.5622313
scala-library scala.collection.mutable.SynchronizedPriorityQueue.ord
Doc ·
scala.math.Ordering.Iterable[T](implicit Ordering[T]): Ordering[Iterable[T]]0.5599198
scala-library scala.math.Ordering.Iterable
Doc ·
LowPriorityOrderingImplicits.comparatorToOrdering[A](implicit Comparator[A]): Ordering[A]0.5599198
scala-library scala.math.LowPriorityOrderingImplicits.comparatorToOrdering
Doc ·
ExtraImplicits.seqDerivedOrdering[CC <: scala.collection.Seq[X], T](implicit Ordering[T]): Ordering[CC[T]]0.5599198

Not in the standard scope due to the potential for divergence: For instance implicitly[Ordering[Any]] diverges in its presence.

scala-library scala.math.Ordering.ExtraImplicits.seqDerivedOrdering
Doc ·
scala.math.Ordering.Option[T](implicit Ordering[T]): Ordering[Option[T]]0.5599198
scala-library scala.math.Ordering.Option
Doc ·
LowPriorityOrderingImplicits.ordered[A](implicit (A) => Comparable[A]): Ordering[A]0.55535305

This would conflict with all the nice implicit Orderings available, but thanks to the magic of prioritized implicits via subclassing we can make Ordered[A] => Ordering[A] only turn up if nothing else works. Since Ordered[A] extends Comparable[A] anyway, we can throw in some Java interop too.

scala-library scala.math.LowPriorityOrderingImplicits.ordered
Doc ·
scalaz.std.AllInstances.orderingMonoid[A]: Object with Monoid[Ordering[A]]0.55378383
scalaz-core_2.11 scalaz.std.AllInstances.orderingMonoid
Doc ·
scalaz.std.math.ordering.orderingMonoid[A]: Object with Monoid[Ordering[A]]0.55378383
scalaz-core_2.11 scalaz.std.math.ordering.orderingMonoid
Doc ·
scalaz.Scalaz.orderingMonoid[A]: Object with Monoid[Ordering[A]]0.55378383
scalaz-core_2.11 scalaz.Scalaz.orderingMonoid
Doc ·
NumericPLens[S, N].copy$default$2: Numeric0.5447999
scalaz-core_2.11 scalaz.PLensInstances.NumericPLens.copy$default$2
Doc ·
FractionalPLens[S, F].copy$default$2: Fractional0.5447648
scalaz-core_2.11 scalaz.PLensInstances.FractionalPLens.copy$default$2
Doc ·
IntegralPLens[S, I].copy$default$2: Integral0.5447648
scalaz-core_2.11 scalaz.PLensInstances.IntegralPLens.copy$default$2
Doc ·
NumericLensFamily[S1, S2, N].copy$default$2: Numeric0.5232
scalaz-core_2.11 scalaz.LensInstances.NumericLensFamily.copy$default$2
Doc ·
FractionalLensFamily[S1, S2, F].copy$default$2: Fractional0.5231662
scalaz-core_2.11 scalaz.LensInstances.FractionalLensFamily.copy$default$2
Doc ·
IntegralLensFamily[S1, S2, I].copy$default$2: Integral0.5231662
scalaz-core_2.11 scalaz.LensInstances.IntegralLensFamily.copy$default$2
Doc ·
scala.Enumeration.ValueOrdering.on[U]((U) => Value): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.Enumeration.ValueOrdering.on
Doc ·
scala.concurrent.duration.Deadline.DeadlineIsOrdered.on[U]((U) => Deadline): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.concurrent.duration.Deadline.DeadlineIsOrdered.on
Doc ·
scala.concurrent.duration.Duration.DurationIsOrdered.on[U]((U) => Duration): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.concurrent.duration.Duration.DurationIsOrdered.on
Doc ·
scala.concurrent.duration.FiniteDuration.FiniteDurationIsOrdered.on[U]((U) => FiniteDuration): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.concurrent.duration.FiniteDuration.FiniteDurationIsOrdered.on
Doc ·
scala.math.Numeric.BigIntIsIntegral.on[U]((U) => BigInt): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.BigIntIsIntegral.on
Doc ·
scala.math.Numeric.IntIsIntegral.on[U]((U) => Int): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.IntIsIntegral.on
Doc ·
scala.math.Numeric.ShortIsIntegral.on[U]((U) => Short): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.ShortIsIntegral.on
Doc ·
scala.math.Numeric.ByteIsIntegral.on[U]((U) => Byte): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.ByteIsIntegral.on
Doc ·
scala.math.Numeric.CharIsIntegral.on[U]((U) => Char): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.CharIsIntegral.on
Doc ·
scala.math.Numeric.LongIsIntegral.on[U]((U) => Long): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.LongIsIntegral.on
Doc ·
scala.math.Numeric.FloatIsFractional.on[U]((U) => Float): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.FloatIsFractional.on
Doc ·
scala.math.Numeric.FloatAsIfIntegral.on[U]((U) => Float): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.FloatAsIfIntegral.on
Doc ·
scala.math.Numeric.BigDecimalIsFractional.on[U]((U) => BigDecimal): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.BigDecimalIsFractional.on
Doc ·
scala.math.Numeric.BigDecimalAsIfIntegral.on[U]((U) => BigDecimal): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.BigDecimalAsIfIntegral.on
Doc ·
scala.math.Numeric.DoubleIsFractional.on[U]((U) => Double): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.DoubleIsFractional.on
Doc ·
scala.math.Numeric.DoubleAsIfIntegral.on[U]((U) => Double): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.DoubleAsIfIntegral.on
Doc ·
scala.math.Ordering.Unit.on[U]((U) => Unit): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Unit.on
Doc ·
scala.math.Ordering.Boolean.on[U]((U) => Boolean): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Boolean.on
Doc ·
scala.math.Ordering.Byte.on[U]((U) => Byte): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Byte.on
Doc ·
scala.math.Ordering.Char.on[U]((U) => Char): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Char.on
Doc ·
scala.math.Ordering.Short.on[U]((U) => Short): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Short.on
Doc ·
scala.math.Ordering.Int.on[U]((U) => Int): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Int.on
Doc ·
scala.math.Ordering.Long.on[U]((U) => Long): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Long.on
Doc ·
scala.math.Ordering.Float.on[U]((U) => Float): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Float.on
Doc ·
scala.math.Ordering.Double.on[U]((U) => Double): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.Double.on
Doc ·
scala.math.Ordering.BigInt.on[U]((U) => BigInt): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.BigInt.on
Doc ·
scala.math.Ordering.BigDecimal.on[U]((U) => BigDecimal): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.BigDecimal.on
Doc ·
scala.math.Ordering.String.on[U]((U) => String): Ordering[U]0.5399402

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Ordering.String.on
Doc ·
scala.math.Ordering.Tuple2[T1, T2](implicit Ordering[T1], implicit Ordering[T2]): Ordering[(T1, T2)]0.53359354
scala-library scala.math.Ordering.Tuple2
Doc ·
AllInstances.orderingMonoid[A]: Object with Monoid[Ordering[A]]0.53092116
scalaz-core_2.11 scalaz.std.AllInstances.orderingMonoid
Doc ·
OrderingInstances.orderingMonoid[A]: Object with Monoid[Ordering[A]]0.53092116
scalaz-core_2.11 scalaz.std.math.OrderingInstances.orderingMonoid
Doc ·
NumericPLens[S, N].num: Numeric[N]0.5232
scalaz-core_2.11 scalaz.PLensInstances.NumericPLens.num
Doc ·
IntegralPLens[S, I].ig: Integral[I]0.5231662
scalaz-core_2.11 scalaz.PLensInstances.IntegralPLens.ig
Doc ·
FractionalPLens[S, F].frac: Fractional[F]0.5231662
scalaz-core_2.11 scalaz.PLensInstances.FractionalPLens.frac
Doc ·
BigIntIsIntegral.on[U]((U) => BigInt): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.BigIntIsIntegral.on
Doc ·
IntIsIntegral.on[U]((U) => Int): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.IntIsIntegral.on
Doc ·
ShortIsIntegral.on[U]((U) => Short): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.ShortIsIntegral.on
Doc ·
ByteIsIntegral.on[U]((U) => Byte): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.ByteIsIntegral.on
Doc ·
CharIsIntegral.on[U]((U) => Char): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.CharIsIntegral.on
Doc ·
LongIsIntegral.on[U]((U) => Long): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.LongIsIntegral.on
Doc ·
FloatIsConflicted.on[U]((U) => Float): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.FloatIsConflicted.on
Doc ·
FloatIsFractional.on[U]((U) => Float): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.FloatIsFractional.on
Doc ·
FloatAsIfIntegral.on[U]((U) => Float): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.FloatAsIfIntegral.on
Doc ·
DoubleIsConflicted.on[U]((U) => Double): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.DoubleIsConflicted.on
Doc ·
DoubleIsFractional.on[U]((U) => Double): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.DoubleIsFractional.on
Doc ·
DoubleAsIfIntegral.on[U]((U) => Double): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.DoubleAsIfIntegral.on
Doc ·
BigDecimalIsConflicted.on[U]((U) => BigDecimal): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.BigDecimalIsConflicted.on
Doc ·
BigDecimalIsFractional.on[U]((U) => BigDecimal): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.BigDecimalIsFractional.on
Doc ·
BigDecimalAsIfIntegral.on[U]((U) => BigDecimal): Ordering[U]0.5193492

Given f, a function from U into T, creates an Ordering[U] whose compare function is equivalent to:

def compare(x:U, y:U) = Ordering[T].compare(f(x), f(y))
scala-library scala.math.Numeric.BigDecimalAsIfIntegral.on
Doc ·