0.8977666**scala.math.Ordering.String**:*Object*with*StringOrdering*- scala-library scala.math.Ordering.StringDoc ·

0.8455005*StringOrdering*.**reverse**:*Ordering*[*String*]Return the opposite ordering of this one.

scala-library scala.math.Ordering.StringOrdering.reverseDoc ·

0.5622313*Fractional*[*T*].**reverse**:*Ordering*[*T*]Return the opposite ordering of this one.

scala-library scala.math.Fractional.reverseDoc ·

0.5622313*Integral*[*T*].**reverse**:*Ordering*[*T*]Return the opposite ordering of this one.

scala-library scala.math.Integral.reverseDoc ·

0.5622313*Numeric*[*T*].**reverse**:*Ordering*[*T*]Return the opposite ordering of this one.

scala-library scala.math.Numeric.reverseDoc ·

0.5622313*Ordering*[*T*].**reverse**:*Ordering*[*T*]Return the opposite ordering of this one.

scala-library scala.math.Ordering.reverseDoc ·

0.5399402*OptionOrdering*[*T*].**reverse**:*Ordering*[*Option*[*T*]]Return the opposite ordering of this one.

scala-library scala.math.Ordering.OptionOrdering.reverseDoc ·

0.6996277*BufferedLineIterator*.**to**[*Col*](implicit*CanBuildFrom*[*Nothing*,*String*,*Col*[*String*]]):*Col*[*String*]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.toDoc ·

0.6996277*LineIterator*.**to**[*Col*](implicit*CanBuildFrom*[*Nothing*,*String*,*Col*[*String*]]):*Col*[*String*]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.toDoc ·

0.6996277*MatchIterator*.**to**[*Col*](implicit*CanBuildFrom*[*Nothing*,*String*,*Col*[*String*]]):*Col*[*String*]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.toDoc ·

0.63748974*JPropertiesWrapper*.**to**[*Col*](implicit*CanBuildFrom*[*Nothing*, (*String*,*String*),*Col*[(*String*,*String*)]]):*Col*[(*String*,*String*)]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.toDoc ·

0.63748974*SystemProperties*.**to**[*Col*](implicit*CanBuildFrom*[*Nothing*, (*String*,*String*),*Col*[(*String*,*String*)]]):*Col*[(*String*,*String*)]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.toDoc ·

0.5839277**scala.math.Ordering.comparatorToOrdering**[*A*](implicit*Comparator*[*A*]):*Ordering*[*A*]- scala-library scala.math.Ordering.comparatorToOrderingDoc ·

0.5839277**scala.math.Ordering.Implicits.seqDerivedOrdering**[*CC <: scala.collection.Seq[X]*,*T*](implicit*Ordering*[*T*]):*Ordering*[*CC*[*T*]]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.seqDerivedOrderingDoc ·

0.5789628**scala.math.Ordering.ordered**[*A*](implicit (*A*) =>*Comparable*[*A*]):*Ordering*[*A*]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.orderedDoc ·

0.5622313*SortedSet*[*A*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.immutable.SortedSet.orderingDoc ·

0.5622313*TreeSet*[*A*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.immutable.TreeSet.orderingDoc ·

0.5622313*SortedSet*[*A*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.mutable.SortedSet.orderingDoc ·

0.5622313*TreeSet*[*A*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.mutable.TreeSet.orderingDoc ·

0.5399402*SortedMap*[*A*,*B*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.SortedMap.orderingDoc ·

0.5399402*SortedSetLike*[*A*,*This*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.SortedSetLike.orderingDoc ·

0.5399402*SortedMap*[*A*,*B*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.immutable.SortedMap.orderingDoc ·

0.5399402*TreeMap*[*A*,*B*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.immutable.TreeMap.orderingDoc ·

0.5399402*Sorted*[*K*,*This*].**ordering**:*Ordering*[*K*]- scala-library scala.collection.generic.Sorted.orderingDoc ·

0.5193492*SortedMapLike*[*A*,*B*,*This*].**ordering**:*Ordering*[*A*]- scala-library scala.collection.SortedMapLike.orderingDoc ·

0.5622313*OptionOrdering*[*T*].**optionOrdering**:*Ordering*[*T*]- scala-library scala.math.Ordering.OptionOrdering.optionOrderingDoc ·

0.5622313*Enum*[*F*].**toScalaOrdering**:*Ordering*[*F*]- note
`Order.fromScalaOrdering(toScalaOrdering).order(x, y)`

`this.order(x, y)`

scalaz-core_2.11 scalaz.Enum.toScalaOrderingDoc ·

0.5622313*Order*[*F*].**toScalaOrdering**:*Ordering*[*F*]- note
`Order.fromScalaOrdering(toScalaOrdering).order(x, y)`

`this.order(x, y)`

scalaz-core_2.11 scalaz.Order.toScalaOrderingDoc ·

0.5399402*IsomorphismOrder*[*F*,*G*].**toScalaOrdering**:*Ordering*[*F*]- note
`Order.fromScalaOrdering(toScalaOrdering).order(x, y)`

`this.order(x, y)`

scalaz-core_2.11 scalaz.IsomorphismOrder.toScalaOrderingDoc ·

0.5622313*PriorityQueue*[*A*].**ord**:*Ordering*[*A*]- scala-library scala.collection.mutable.PriorityQueue.ordDoc ·

0.5622313*PriorityQueueProxy*[*A*].**ord**:*Ordering*[*A*]- scala-library scala.collection.mutable.PriorityQueueProxy.ordDoc ·

0.5622313*SynchronizedPriorityQueue*[*A*].**ord**:*Ordering*[*A*]- scala-library scala.collection.mutable.SynchronizedPriorityQueue.ordDoc ·

0.5599198*LowPriorityOrderingImplicits*.**comparatorToOrdering**[*A*](implicit*Comparator*[*A*]):*Ordering*[*A*]- scala-library scala.math.LowPriorityOrderingImplicits.comparatorToOrderingDoc ·

0.5599198*ExtraImplicits*.**seqDerivedOrdering**[*CC <: scala.collection.Seq[X]*,*T*](implicit*Ordering*[*T*]):*Ordering*[*CC*[*T*]]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.seqDerivedOrderingDoc ·

0.55535305*LowPriorityOrderingImplicits*.**ordered**[*A*](implicit (*A*) =>*Comparable*[*A*]):*Ordering*[*A*]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.orderedDoc ·

0.55378383**scalaz.std.AllInstances.orderingMonoid**[*A*]:*Object*with*Monoid*[*Ordering*[*A*]]- scalaz-core_2.11 scalaz.std.AllInstances.orderingMonoidDoc ·

0.5447999*NumericPLens*[*S*,*N*].**copy$default$2**:*Numeric*- scalaz-core_2.11 scalaz.PLensInstances.NumericPLens.copy$default$2Doc ·

0.5447648*FractionalPLens*[*S*,*F*].**copy$default$2**:*Fractional*- scalaz-core_2.11 scalaz.PLensInstances.FractionalPLens.copy$default$2Doc ·

0.5447648*IntegralPLens*[*S*,*I*].**copy$default$2**:*Integral*- scalaz-core_2.11 scalaz.PLensInstances.IntegralPLens.copy$default$2Doc ·

0.5232*NumericLensFamily*[*S1*,*S2*,*N*].**copy$default$2**:*Numeric*- scalaz-core_2.11 scalaz.LensInstances.NumericLensFamily.copy$default$2Doc ·

0.5231662*FractionalLensFamily*[*S1*,*S2*,*F*].**copy$default$2**:*Fractional*- scalaz-core_2.11 scalaz.LensInstances.FractionalLensFamily.copy$default$2Doc ·

0.5231662*IntegralLensFamily*[*S1*,*S2*,*I*].**copy$default$2**:*Integral*- scalaz-core_2.11 scalaz.LensInstances.IntegralLensFamily.copy$default$2Doc ·

0.5399402**scala.Enumeration.ValueOrdering.on**[*U*]((*U*) =>*Value*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.concurrent.duration.Deadline.DeadlineIsOrdered.on**[*U*]((*U*) =>*Deadline*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.concurrent.duration.Duration.DurationIsOrdered.on**[*U*]((*U*) =>*Duration*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.concurrent.duration.FiniteDuration.FiniteDurationIsOrdered.on**[*U*]((*U*) =>*FiniteDuration*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.BigIntIsIntegral.on**[*U*]((*U*) =>*BigInt*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.IntIsIntegral.on**[*U*]((*U*) =>*Int*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.ShortIsIntegral.on**[*U*]((*U*) =>*Short*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.ByteIsIntegral.on**[*U*]((*U*) =>*Byte*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.CharIsIntegral.on**[*U*]((*U*) =>*Char*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.LongIsIntegral.on**[*U*]((*U*) =>*Long*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.FloatIsFractional.on**[*U*]((*U*) =>*Float*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.FloatAsIfIntegral.on**[*U*]((*U*) =>*Float*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.BigDecimalIsFractional.on**[*U*]((*U*) =>*BigDecimal*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.BigDecimalAsIfIntegral.on**[*U*]((*U*) =>*BigDecimal*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.DoubleIsFractional.on**[*U*]((*U*) =>*Double*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Numeric.DoubleAsIfIntegral.on**[*U*]((*U*) =>*Double*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Unit.on**[*U*]((*U*) =>*Unit*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Boolean.on**[*U*]((*U*) =>*Boolean*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Byte.on**[*U*]((*U*) =>*Byte*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Char.on**[*U*]((*U*) =>*Char*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Short.on**[*U*]((*U*) =>*Short*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Int.on**[*U*]((*U*) =>*Int*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Long.on**[*U*]((*U*) =>*Long*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Float.on**[*U*]((*U*) =>*Float*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.Double.on**[*U*]((*U*) =>*Double*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.BigInt.on**[*U*]((*U*) =>*BigInt*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.BigDecimal.on**[*U*]((*U*) =>*BigDecimal*):*Ordering*[*U*]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.onDoc ·

0.5399402**scala.math.Ordering.String.on**[*U*]((*U*) =>*String*):*Ordering*[*U*]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.onDoc ·

0.53092116*AllInstances*.**orderingMonoid**[*A*]:*Object*with*Monoid*[*Ordering*[*A*]]- scalaz-core_2.11 scalaz.std.AllInstances.orderingMonoidDoc ·

0.53092116*OrderingInstances*.**orderingMonoid**[*A*]:*Object*with*Monoid*[*Ordering*[*A*]]- scalaz-core_2.11 scalaz.std.math.OrderingInstances.orderingMonoidDoc ·

0.5232*NumericPLens*[*S*,*N*].**num**:*Numeric*[*N*]- scalaz-core_2.11 scalaz.PLensInstances.NumericPLens.numDoc ·

0.5231662*IntegralPLens*[*S*,*I*].**ig**:*Integral*[*I*]- scalaz-core_2.11 scalaz.PLensInstances.IntegralPLens.igDoc ·

0.5231662*FractionalPLens*[*S*,*F*].**frac**:*Fractional*[*F*]- scalaz-core_2.11 scalaz.PLensInstances.FractionalPLens.fracDoc ·

0.5193492*BigIntIsIntegral*.**on**[*U*]((*U*) =>*BigInt*):*Ordering*[*U*]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.onDoc ·

0.5193492*IntIsIntegral*.**on**[*U*]((*U*) =>*Int*):*Ordering*[*U*]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.onDoc ·

0.5193492*ShortIsIntegral*.**on**[*U*]((*U*) =>*Short*):*Ordering*[*U*]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.onDoc ·

0.5193492*ByteIsIntegral*.**on**[*U*]((*U*) =>*Byte*):*Ordering*[*U*]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.onDoc ·

0.5193492*CharIsIntegral*.**on**[*U*]((*U*) =>*Char*):*Ordering*[*U*]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.onDoc ·

0.5193492*LongIsIntegral*.**on**[*U*]((*U*) =>*Long*):*Ordering*[*U*]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.onDoc ·

0.5193492*FloatIsConflicted*.**on**[*U*]((*U*) =>*Float*):*Ordering*[*U*]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.onDoc ·

0.5193492*FloatIsFractional*.**on**[*U*]((*U*) =>*Float*):*Ordering*[*U*]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.onDoc ·

0.5193492*FloatAsIfIntegral*.**on**[*U*]((*U*) =>*Float*):*Ordering*[*U*]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.onDoc ·

0.5193492*DoubleIsConflicted*.**on**[*U*]((*U*) =>*Double*):*Ordering*[*U*]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.onDoc ·

0.5193492*DoubleIsFractional*.**on**[*U*]((*U*) =>*Double*):*Ordering*[*U*]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.onDoc ·

0.5193492*DoubleAsIfIntegral*.**on**[*U*]((*U*) =>*Double*):*Ordering*[*U*]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.onDoc ·

0.5193492*BigDecimalIsConflicted*.**on**[*U*]((*U*) =>*BigDecimal*):*Ordering*[*U*]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.onDoc ·

0.5193492*BigDecimalIsFractional*.**on**[*U*]((*U*) =>*BigDecimal*):*Ordering*[*U*]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.onDoc ·

0.5193492*BigDecimalAsIfIntegral*.**on**[*U*]((*U*) =>*BigDecimal*):*Ordering*[*U*]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.onDoc ·