mirror of
https://github.com/jlengrand/kotlin.git
synced 2026-05-08 15:53:19 +00:00
Add test and check that iterator over UInt folds to a simple for-loop
This commit is contained in:
116
compiler/testData/codegen/box/inlineClasses/UIntArraySortExample.kt
vendored
Normal file
116
compiler/testData/codegen/box/inlineClasses/UIntArraySortExample.kt
vendored
Normal file
@@ -0,0 +1,116 @@
|
||||
// !LANGUAGE: +InlineClasses
|
||||
|
||||
inline class UInt(private val value: Int) : Comparable<UInt> {
|
||||
companion object {
|
||||
private const val INT_MASK = 0xffffffffL
|
||||
}
|
||||
|
||||
fun asInt(): Int = value
|
||||
|
||||
fun toLong(): Long = value.toLong() and INT_MASK
|
||||
|
||||
override fun compareTo(other: UInt): Int =
|
||||
flip().compareTo(other.flip())
|
||||
|
||||
override fun toString(): String {
|
||||
return toLong().toString()
|
||||
}
|
||||
|
||||
private fun flip(): Int =
|
||||
value xor Int.MIN_VALUE
|
||||
}
|
||||
|
||||
inline class UIntArray(private val intArray: IntArray) {
|
||||
val size: Int get() = intArray.size
|
||||
|
||||
operator fun get(index: Int): UInt = UInt(intArray[index])
|
||||
|
||||
operator fun set(index: Int, value: UInt) {
|
||||
intArray[index] = value.asInt()
|
||||
}
|
||||
|
||||
operator fun iterator(): UIntIterator = UIntIterator(intArray.iterator())
|
||||
}
|
||||
|
||||
inline class UIntIterator(private val intIterator: IntIterator) : Iterator<UInt> {
|
||||
override fun next(): UInt {
|
||||
return UInt(intIterator.next())
|
||||
}
|
||||
|
||||
override fun hasNext(): Boolean {
|
||||
return intIterator.hasNext()
|
||||
}
|
||||
}
|
||||
|
||||
fun uIntArrayOf(vararg u: Int): UIntArray = UIntArray(u)
|
||||
|
||||
fun UIntArray.swap(i: Int, j: Int) {
|
||||
this[j] = this[i].also { this[i] = this[j] }
|
||||
}
|
||||
|
||||
fun UIntArray.quickSort() {
|
||||
quickSort(0, size - 1)
|
||||
}
|
||||
|
||||
private fun UIntArray.quickSort(l: Int, r: Int) {
|
||||
if (l < r) {
|
||||
val q = partition(l, r)
|
||||
quickSort(l, q - 1)
|
||||
quickSort(q + 1, r)
|
||||
}
|
||||
}
|
||||
|
||||
private fun UIntArray.partition(l: Int, r: Int): Int {
|
||||
val m = this[(l + r) / 2]
|
||||
var i = l
|
||||
var j = r
|
||||
while (i <= j) {
|
||||
while (this[i] < m) i++
|
||||
while (this[j] > m) j--
|
||||
if (i <= j)
|
||||
swap(i++, j--)
|
||||
}
|
||||
|
||||
return i
|
||||
}
|
||||
|
||||
fun check(array: UIntArray, resultAsInt: String, resultAsInner: String) {
|
||||
val actualAsInt = StringBuilder()
|
||||
val actualAsInner = StringBuilder()
|
||||
for (n in array) {
|
||||
actualAsInt.append("${n.asInt()} ")
|
||||
actualAsInner.append(n.toString() + " ")
|
||||
}
|
||||
|
||||
if (actualAsInt.toString() != resultAsInt) {
|
||||
throw IllegalStateException("wrong result as int (actual): $actualAsInt ; expected: $resultAsInt")
|
||||
}
|
||||
|
||||
if (actualAsInner.toString() != resultAsInner) {
|
||||
throw IllegalStateException("wrong result as inner (actual): $actualAsInner ; expected: $resultAsInner")
|
||||
}
|
||||
}
|
||||
|
||||
fun box(): String {
|
||||
val a1 = uIntArrayOf(1, 2, 3)
|
||||
a1.quickSort()
|
||||
|
||||
check(a1, "1 2 3 ", "1 2 3 ")
|
||||
|
||||
val a2 = uIntArrayOf(-1)
|
||||
a2.quickSort()
|
||||
|
||||
check(a2, "-1 ", "4294967295 ")
|
||||
|
||||
val a3 = uIntArrayOf(-1, 1, 0)
|
||||
a3.quickSort()
|
||||
|
||||
check(a3, "0 1 -1 ", "0 1 4294967295 ")
|
||||
|
||||
val a4 = uIntArrayOf(-1, Int.MAX_VALUE)
|
||||
a4.quickSort()
|
||||
|
||||
check(a4, "${Int.MAX_VALUE} -1 ", "2147483647 4294967295 ")
|
||||
|
||||
return "OK"
|
||||
}
|
||||
Reference in New Issue
Block a user