Correctly indent upper bound separator in the generated stdlib code
This commit is contained in:
@@ -1212,7 +1212,7 @@ public actual fun CharArray.sort(): Unit {
|
||||
* Sorts the array in-place according to the natural order of its elements.
|
||||
*/
|
||||
@kotlin.internal.InlineOnly
|
||||
public actual inline fun <T: Comparable<T>> Array<out T>.sort(): Unit {
|
||||
public actual inline fun <T : Comparable<T>> Array<out T>.sort(): Unit {
|
||||
@Suppress("UNCHECKED_CAST")
|
||||
(this as Array<Any?>).sort()
|
||||
}
|
||||
@@ -1387,7 +1387,7 @@ public actual fun CharArray.toTypedArray(): Array<Char> {
|
||||
/**
|
||||
* Returns a [SortedSet][java.util.SortedSet] of all elements.
|
||||
*/
|
||||
public fun <T: Comparable<T>> Array<out T>.toSortedSet(): java.util.SortedSet<T> {
|
||||
public fun <T : Comparable<T>> Array<out T>.toSortedSet(): java.util.SortedSet<T> {
|
||||
return toCollection(java.util.TreeSet<T>())
|
||||
}
|
||||
|
||||
|
||||
@@ -39,7 +39,7 @@ public actual fun <T> MutableList<T>.reverse(): Unit {
|
||||
/**
|
||||
* Returns a [SortedSet][java.util.SortedSet] of all elements.
|
||||
*/
|
||||
public fun <T: Comparable<T>> Iterable<T>.toSortedSet(): java.util.SortedSet<T> {
|
||||
public fun <T : Comparable<T>> Iterable<T>.toSortedSet(): java.util.SortedSet<T> {
|
||||
return toCollection(java.util.TreeSet<T>())
|
||||
}
|
||||
|
||||
|
||||
@@ -18,7 +18,7 @@ import kotlin.comparisons.*
|
||||
* If values are equal, returns the first one.
|
||||
*/
|
||||
@SinceKotlin("1.1")
|
||||
public actual fun <T: Comparable<T>> maxOf(a: T, b: T): T {
|
||||
public actual fun <T : Comparable<T>> maxOf(a: T, b: T): T {
|
||||
return if (a >= b) a else b
|
||||
}
|
||||
|
||||
@@ -80,7 +80,7 @@ public actual inline fun maxOf(a: Double, b: Double): Double {
|
||||
* Returns the greater of three values.
|
||||
*/
|
||||
@SinceKotlin("1.1")
|
||||
public actual fun <T: Comparable<T>> maxOf(a: T, b: T, c: T): T {
|
||||
public actual fun <T : Comparable<T>> maxOf(a: T, b: T, c: T): T {
|
||||
return maxOf(a, maxOf(b, c))
|
||||
}
|
||||
|
||||
@@ -143,7 +143,7 @@ public actual inline fun maxOf(a: Double, b: Double, c: Double): Double {
|
||||
* If values are equal, returns the first one.
|
||||
*/
|
||||
@SinceKotlin("1.1")
|
||||
public actual fun <T: Comparable<T>> minOf(a: T, b: T): T {
|
||||
public actual fun <T : Comparable<T>> minOf(a: T, b: T): T {
|
||||
return if (a <= b) a else b
|
||||
}
|
||||
|
||||
@@ -205,7 +205,7 @@ public actual inline fun minOf(a: Double, b: Double): Double {
|
||||
* Returns the smaller of three values.
|
||||
*/
|
||||
@SinceKotlin("1.1")
|
||||
public actual fun <T: Comparable<T>> minOf(a: T, b: T, c: T): T {
|
||||
public actual fun <T : Comparable<T>> minOf(a: T, b: T, c: T): T {
|
||||
return minOf(a, minOf(b, c))
|
||||
}
|
||||
|
||||
|
||||
@@ -40,7 +40,7 @@ public fun <C : MutableCollection<in R>, R> Sequence<*>.filterIsInstanceTo(desti
|
||||
*
|
||||
* The operation is _terminal_.
|
||||
*/
|
||||
public fun <T: Comparable<T>> Sequence<T>.toSortedSet(): java.util.SortedSet<T> {
|
||||
public fun <T : Comparable<T>> Sequence<T>.toSortedSet(): java.util.SortedSet<T> {
|
||||
return toCollection(java.util.TreeSet<T>())
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user