Added orx-no-clear
This commit is contained in:
edwin
@@ -1,353 +1,352 @@
|
||||
package org.openrndr.extra.kdtree
|
||||
|
||||
import kotlinx.coroutines.experimental.CoroutineScope
|
||||
import kotlinx.coroutines.experimental.GlobalScope
|
||||
import kotlinx.coroutines.experimental.launch
|
||||
import kotlinx.coroutines.experimental.runBlocking
|
||||
import org.openrndr.math.IntVector2
|
||||
import org.openrndr.math.Vector2
|
||||
import org.openrndr.math.Vector3
|
||||
import org.openrndr.math.Vector4
|
||||
import java.util.*
|
||||
import java.util.concurrent.atomic.AtomicInteger
|
||||
import kotlin.IllegalStateException
|
||||
|
||||
/** built-in mapper for [Vector2] */
|
||||
fun vector2Mapper(v: Vector2, dimension: Int): Double {
|
||||
return when (dimension) {
|
||||
0 -> v.x
|
||||
else -> v.y
|
||||
}
|
||||
}
|
||||
|
||||
fun intVector2Mapper(v: IntVector2, dimension: Int): Double {
|
||||
return when (dimension) {
|
||||
0 -> v.x.toDouble()
|
||||
else -> v.y.toDouble()
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/** built-in mapper for [Vector3] */
|
||||
fun vector3Mapper(v: Vector3, dimension: Int): Double {
|
||||
return when (dimension) {
|
||||
0 -> v.x
|
||||
1 -> v.y
|
||||
else -> v.y
|
||||
}
|
||||
}
|
||||
|
||||
/** built-in mapper for [Vector4] */
|
||||
fun vector4Mapper(v: Vector4, dimension: Int): Double {
|
||||
return when (dimension) {
|
||||
0 -> v.x
|
||||
1 -> v.y
|
||||
2 -> v.z
|
||||
else -> v.w
|
||||
}
|
||||
}
|
||||
|
||||
class KDTreeNode<T> {
|
||||
var parent: KDTreeNode<T>? = null
|
||||
var median: Double = 0.0
|
||||
var dimension: Int = 0
|
||||
var children: Array<KDTreeNode<T>?> = arrayOfNulls(2)
|
||||
var item: T? = null
|
||||
|
||||
internal val isLeaf: Boolean
|
||||
get() = children[0] == null && children[1] == null
|
||||
|
||||
override fun toString(): String {
|
||||
return "KDTreeNode{" +
|
||||
"median=" + median +
|
||||
", item=" + item +
|
||||
", dimension=" + dimension +
|
||||
", children=" + Arrays.toString(children) +
|
||||
|
||||
"} " + super.toString()
|
||||
}
|
||||
}
|
||||
|
||||
fun <T> insertItem(root: KDTreeNode<T>, item: T, mapper: (T, Int) -> Double): KDTreeNode<T> {
|
||||
return if (root.isLeaf) {
|
||||
root.item = item
|
||||
root
|
||||
} else {
|
||||
if (mapper(item, root.dimension) < root.median) {
|
||||
insertItem(root.children[0] ?: throw IllegalStateException("left is null"), item, mapper)
|
||||
} else {
|
||||
insertItem(root.children[1] ?: throw IllegalStateException("right is null"), item, mapper)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fun <T> buildKDTree(items: MutableList<T>, dimensions: Int, mapper: (T, Int) -> Double): KDTreeNode<T> {
|
||||
val root = KDTreeNode<T>()
|
||||
|
||||
val start = System.currentTimeMillis()
|
||||
fun <T> buildTreeTask(scope: CoroutineScope, node: KDTreeNode<T>, items: MutableList<T>, dimensions: Int, levels: Int, mapper: (T, Int) -> Double): KDTreeNode<T> {
|
||||
|
||||
if (items.size > 0) {
|
||||
val dimension = levels % dimensions
|
||||
val values = ArrayList<T>()
|
||||
for (item in items) {
|
||||
values.add(item)
|
||||
}
|
||||
|
||||
node.dimension = dimension
|
||||
val median = selectNth(items, items.size / 2) { mapper(it, dimension) }
|
||||
|
||||
val leftItems = mutableListOf<T>()
|
||||
val rightItems = mutableListOf<T>()
|
||||
|
||||
node.median = mapper(median, dimension)
|
||||
node.item = median
|
||||
for (item in items) {
|
||||
if (item === median) {
|
||||
continue
|
||||
}
|
||||
if (mapper(item, dimension) < node.median) {
|
||||
leftItems.add(item)
|
||||
} else {
|
||||
rightItems.add(item)
|
||||
}
|
||||
}
|
||||
|
||||
// validate split
|
||||
if (leftItems.size + rightItems.size + 1 != items.size) {
|
||||
throw IllegalStateException("left: ${leftItems.size}, right: ${rightItems.size}, items: ${items.size}")
|
||||
}
|
||||
|
||||
if (leftItems.size > 0) {
|
||||
node.children[0] = KDTreeNode()
|
||||
node.children[0]?.let {
|
||||
it.parent = node
|
||||
|
||||
scope.launch {
|
||||
buildTreeTask(scope, it, leftItems, dimensions, levels + 1, mapper)
|
||||
}
|
||||
}
|
||||
}
|
||||
if (rightItems.size > 0) {
|
||||
node.children[1] = KDTreeNode()
|
||||
node.children[1]?.let {
|
||||
it.parent = node
|
||||
scope.launch {
|
||||
buildTreeTask(scope, it, rightItems, dimensions, levels + 1, mapper)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return node
|
||||
}
|
||||
|
||||
val job = GlobalScope.launch {
|
||||
buildTreeTask(this, root, items, dimensions, 0, mapper)
|
||||
}
|
||||
runBlocking {
|
||||
job.join()
|
||||
}
|
||||
println("building took ${System.currentTimeMillis()-start}ms")
|
||||
return root
|
||||
}
|
||||
|
||||
|
||||
private fun <T> sqrDistance(left: T, right: T, dimensions: Int, mapper: (T, Int) -> Double): Double {
|
||||
var distance = 0.0
|
||||
|
||||
for (i in 0 until dimensions) {
|
||||
val d = mapper(left, i) - mapper(right, i)
|
||||
distance += d * d
|
||||
}
|
||||
return distance
|
||||
}
|
||||
|
||||
fun <T> findAllNodes(root: KDTreeNode<T>): List<KDTreeNode<T>> {
|
||||
val stack = Stack<KDTreeNode<T>>()
|
||||
val all = ArrayList<KDTreeNode<T>>()
|
||||
stack.empty()
|
||||
stack.push(root)
|
||||
while (!stack.isEmpty()) {
|
||||
val node = stack.pop()
|
||||
// if (node.item != null /*&& !visited.contains(node.children[1])*/) {
|
||||
all.add(node)
|
||||
// }
|
||||
|
||||
if (node.children[0] != null /*&&!visited.contains(node.children[0])*/) {
|
||||
stack.push(node.children[0])
|
||||
}
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
}
|
||||
}
|
||||
return all
|
||||
}
|
||||
|
||||
|
||||
fun <T> findNearest(root: KDTreeNode<T>, item: T, dimensions: Int, mapper: (T, Int) -> Double): T? {
|
||||
var nearest = java.lang.Double.POSITIVE_INFINITY
|
||||
var nearestArg: KDTreeNode<T>? = null
|
||||
|
||||
fun nearest(node: KDTreeNode<T>?, item: T) {
|
||||
if (node != null) {
|
||||
|
||||
if (node.item == null) {
|
||||
println(node)
|
||||
}
|
||||
|
||||
val route: Int = if (mapper(item, node.dimension) < node.median) {
|
||||
nearest(node.children[0], item)
|
||||
0
|
||||
} else {
|
||||
nearest(node.children[1], item)
|
||||
1
|
||||
}
|
||||
|
||||
val distance = sqrDistance(item, node.item
|
||||
?: throw IllegalStateException("item is null"), dimensions, mapper)
|
||||
if (distance < nearest) {
|
||||
nearest = distance
|
||||
nearestArg = node
|
||||
}
|
||||
|
||||
|
||||
val d = Math.abs(node.median - mapper(item, node.dimension))
|
||||
if (d * d < nearest) {
|
||||
nearest(node.children[1 - route], item)
|
||||
}
|
||||
}
|
||||
}
|
||||
nearest(root, item)
|
||||
return nearestArg?.item
|
||||
}
|
||||
|
||||
fun <T> insert(root: KDTreeNode<T>, item: T, dimensions: Int, mapper: (T, Int) -> Double): KDTreeNode<T> {
|
||||
val stack = Stack<KDTreeNode<T>>()
|
||||
stack.push(root)
|
||||
|
||||
dive@ while (true) {
|
||||
|
||||
val node = stack.peek()
|
||||
|
||||
val value = mapper(item, node.dimension)
|
||||
|
||||
if (value < node.median) {
|
||||
if (node.children[0] != null) {
|
||||
stack.push(node.children[0])
|
||||
} else {
|
||||
// sit here
|
||||
node.children[0] = KDTreeNode()
|
||||
node.children[0]?.item = item
|
||||
node.children[0]?.dimension = (node.dimension + 1) % dimensions
|
||||
node.children[0]?.median = mapper(item, (node.dimension + 1) % dimensions)
|
||||
node.children[0]?.parent = node
|
||||
return node.children[0] ?: throw IllegalStateException("child is null")
|
||||
}
|
||||
} else {
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
} else {
|
||||
// sit here
|
||||
node.children[1] = KDTreeNode()
|
||||
node.children[1]?.item = item
|
||||
node.children[1]?.dimension = (node.dimension + 1) % dimensions
|
||||
node.children[1]?.median = mapper(item, (node.dimension + 1) % dimensions)
|
||||
node.children[1]?.parent = node
|
||||
return node.children[1] ?: throw IllegalStateException("child is null")
|
||||
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fun <T> remove(toRemove: KDTreeNode<T>, mapper: (T, Int) -> Double): KDTreeNode<T>? {
|
||||
// trivial case
|
||||
if (toRemove.isLeaf) {
|
||||
val p = toRemove.parent
|
||||
if (p != null) {
|
||||
when {
|
||||
p.children[0] === toRemove -> p.children[0] = null
|
||||
p.children[1] === toRemove -> p.children[1] = null
|
||||
else -> {
|
||||
// broken!
|
||||
}
|
||||
}
|
||||
} else {
|
||||
toRemove.item = null
|
||||
}
|
||||
} else {
|
||||
val stack = Stack<KDTreeNode<T>>()
|
||||
|
||||
var branch = 0
|
||||
|
||||
if (toRemove.children[0] != null) {
|
||||
stack.push(toRemove.children[0])
|
||||
branch = 0
|
||||
} else {
|
||||
stack.push(toRemove.children[1])
|
||||
branch = 1
|
||||
}
|
||||
|
||||
var minValue: Double = java.lang.Double.POSITIVE_INFINITY
|
||||
var maxValue: Double = java.lang.Double.NEGATIVE_INFINITY
|
||||
var minArg: KDTreeNode<T>? = null
|
||||
var maxArg: KDTreeNode<T>? = null
|
||||
|
||||
while (!stack.isEmpty()) {
|
||||
val node = stack.pop() ?: throw RuntimeException("null on stack")
|
||||
|
||||
val value = mapper(node.item ?: throw IllegalStateException("item is null"), toRemove.dimension)
|
||||
|
||||
if (value < minValue) {
|
||||
minValue = value
|
||||
minArg = node
|
||||
}
|
||||
|
||||
if (value > maxValue) {
|
||||
maxValue = value
|
||||
maxArg = node
|
||||
}
|
||||
|
||||
if (node.dimension != toRemove.dimension) {
|
||||
if (node.children[0] != null) {
|
||||
stack.push(node.children[0])
|
||||
}
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
}
|
||||
} else {
|
||||
if (branch == 1) {
|
||||
if (node.children[0] != null) {
|
||||
stack.push(node.children[0])
|
||||
} else {
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
}
|
||||
}
|
||||
}
|
||||
if (branch == 0) {
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
} else {
|
||||
if (node.children[0] != null) {
|
||||
stack.push(node.children[0])
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
if (branch == 1) {
|
||||
toRemove.item = minArg?.item
|
||||
toRemove.median = mapper(minArg?.item ?: throw IllegalStateException("minArg is null"), toRemove.dimension)
|
||||
remove(minArg, mapper)
|
||||
}
|
||||
if (branch == 0) {
|
||||
toRemove.item = maxArg?.item
|
||||
toRemove.median = mapper(maxArg?.item ?: throw IllegalStateException("maxArg is null"), toRemove.dimension)
|
||||
remove(maxArg, mapper)
|
||||
}
|
||||
}
|
||||
return null
|
||||
}
|
||||
package org.openrndr.extra.kdtree
|
||||
|
||||
import kotlinx.coroutines.CoroutineScope
|
||||
import kotlinx.coroutines.GlobalScope
|
||||
import kotlinx.coroutines.launch
|
||||
import kotlinx.coroutines.runBlocking
|
||||
import org.openrndr.math.IntVector2
|
||||
import org.openrndr.math.Vector2
|
||||
import org.openrndr.math.Vector3
|
||||
import org.openrndr.math.Vector4
|
||||
import java.util.*
|
||||
import kotlin.IllegalStateException
|
||||
|
||||
/** built-in mapper for [Vector2] */
|
||||
fun vector2Mapper(v: Vector2, dimension: Int): Double {
|
||||
return when (dimension) {
|
||||
0 -> v.x
|
||||
else -> v.y
|
||||
}
|
||||
}
|
||||
|
||||
fun intVector2Mapper(v: IntVector2, dimension: Int): Double {
|
||||
return when (dimension) {
|
||||
0 -> v.x.toDouble()
|
||||
else -> v.y.toDouble()
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
/** built-in mapper for [Vector3] */
|
||||
fun vector3Mapper(v: Vector3, dimension: Int): Double {
|
||||
return when (dimension) {
|
||||
0 -> v.x
|
||||
1 -> v.y
|
||||
else -> v.y
|
||||
}
|
||||
}
|
||||
|
||||
/** built-in mapper for [Vector4] */
|
||||
fun vector4Mapper(v: Vector4, dimension: Int): Double {
|
||||
return when (dimension) {
|
||||
0 -> v.x
|
||||
1 -> v.y
|
||||
2 -> v.z
|
||||
else -> v.w
|
||||
}
|
||||
}
|
||||
|
||||
class KDTreeNode<T> {
|
||||
var parent: KDTreeNode<T>? = null
|
||||
var median: Double = 0.0
|
||||
var dimension: Int = 0
|
||||
var children: Array<KDTreeNode<T>?> = arrayOfNulls(2)
|
||||
var item: T? = null
|
||||
|
||||
internal val isLeaf: Boolean
|
||||
get() = children[0] == null && children[1] == null
|
||||
|
||||
override fun toString(): String {
|
||||
return "KDTreeNode{" +
|
||||
"median=" + median +
|
||||
", item=" + item +
|
||||
", dimension=" + dimension +
|
||||
", children=" + Arrays.toString(children) +
|
||||
|
||||
"} " + super.toString()
|
||||
}
|
||||
}
|
||||
|
||||
fun <T> insertItem(root: KDTreeNode<T>, item: T, mapper: (T, Int) -> Double): KDTreeNode<T> {
|
||||
return if (root.isLeaf) {
|
||||
root.item = item
|
||||
root
|
||||
} else {
|
||||
if (mapper(item, root.dimension) < root.median) {
|
||||
insertItem(root.children[0] ?: throw IllegalStateException("left is null"), item, mapper)
|
||||
} else {
|
||||
insertItem(root.children[1] ?: throw IllegalStateException("right is null"), item, mapper)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fun <T> buildKDTree(items: MutableList<T>, dimensions: Int, mapper: (T, Int) -> Double): KDTreeNode<T> {
|
||||
val root = KDTreeNode<T>()
|
||||
|
||||
val start = System.currentTimeMillis()
|
||||
fun <T> buildTreeTask(scope: CoroutineScope, node: KDTreeNode<T>, items: MutableList<T>, dimensions: Int, levels: Int, mapper: (T, Int) -> Double): KDTreeNode<T> {
|
||||
|
||||
if (items.size > 0) {
|
||||
val dimension = levels % dimensions
|
||||
val values = ArrayList<T>()
|
||||
for (item in items) {
|
||||
values.add(item)
|
||||
}
|
||||
|
||||
node.dimension = dimension
|
||||
val median = selectNth(items, items.size / 2) { mapper(it, dimension) }
|
||||
|
||||
val leftItems = mutableListOf<T>()
|
||||
val rightItems = mutableListOf<T>()
|
||||
|
||||
node.median = mapper(median, dimension)
|
||||
node.item = median
|
||||
for (item in items) {
|
||||
if (item === median) {
|
||||
continue
|
||||
}
|
||||
if (mapper(item, dimension) < node.median) {
|
||||
leftItems.add(item)
|
||||
} else {
|
||||
rightItems.add(item)
|
||||
}
|
||||
}
|
||||
|
||||
// validate split
|
||||
if (leftItems.size + rightItems.size + 1 != items.size) {
|
||||
throw IllegalStateException("left: ${leftItems.size}, right: ${rightItems.size}, items: ${items.size}")
|
||||
}
|
||||
|
||||
if (leftItems.size > 0) {
|
||||
node.children[0] = KDTreeNode()
|
||||
node.children[0]?.let {
|
||||
it.parent = node
|
||||
|
||||
scope.launch {
|
||||
buildTreeTask(scope, it, leftItems, dimensions, levels + 1, mapper)
|
||||
}
|
||||
}
|
||||
}
|
||||
if (rightItems.size > 0) {
|
||||
node.children[1] = KDTreeNode()
|
||||
node.children[1]?.let {
|
||||
it.parent = node
|
||||
scope.launch {
|
||||
buildTreeTask(scope, it, rightItems, dimensions, levels + 1, mapper)
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
return node
|
||||
}
|
||||
|
||||
val job = GlobalScope.launch {
|
||||
buildTreeTask(this, root, items, dimensions, 0, mapper)
|
||||
}
|
||||
runBlocking {
|
||||
job.join()
|
||||
}
|
||||
println("building took ${System.currentTimeMillis()-start}ms")
|
||||
return root
|
||||
}
|
||||
|
||||
|
||||
private fun <T> sqrDistance(left: T, right: T, dimensions: Int, mapper: (T, Int) -> Double): Double {
|
||||
var distance = 0.0
|
||||
|
||||
for (i in 0 until dimensions) {
|
||||
val d = mapper(left, i) - mapper(right, i)
|
||||
distance += d * d
|
||||
}
|
||||
return distance
|
||||
}
|
||||
|
||||
fun <T> findAllNodes(root: KDTreeNode<T>): List<KDTreeNode<T>> {
|
||||
val stack = Stack<KDTreeNode<T>>()
|
||||
val all = ArrayList<KDTreeNode<T>>()
|
||||
stack.empty()
|
||||
stack.push(root)
|
||||
while (!stack.isEmpty()) {
|
||||
val node = stack.pop()
|
||||
// if (node.item != null /*&& !visited.contains(node.children[1])*/) {
|
||||
all.add(node)
|
||||
// }
|
||||
|
||||
if (node.children[0] != null /*&&!visited.contains(node.children[0])*/) {
|
||||
stack.push(node.children[0])
|
||||
}
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
}
|
||||
}
|
||||
return all
|
||||
}
|
||||
|
||||
|
||||
fun <T> findNearest(root: KDTreeNode<T>, item: T, dimensions: Int, mapper: (T, Int) -> Double): T? {
|
||||
var nearest = java.lang.Double.POSITIVE_INFINITY
|
||||
var nearestArg: KDTreeNode<T>? = null
|
||||
|
||||
fun nearest(node: KDTreeNode<T>?, item: T) {
|
||||
if (node != null) {
|
||||
|
||||
if (node.item == null) {
|
||||
println(node)
|
||||
}
|
||||
|
||||
val route: Int = if (mapper(item, node.dimension) < node.median) {
|
||||
nearest(node.children[0], item)
|
||||
0
|
||||
} else {
|
||||
nearest(node.children[1], item)
|
||||
1
|
||||
}
|
||||
|
||||
val distance = sqrDistance(item, node.item
|
||||
?: throw IllegalStateException("item is null"), dimensions, mapper)
|
||||
if (distance < nearest) {
|
||||
nearest = distance
|
||||
nearestArg = node
|
||||
}
|
||||
|
||||
|
||||
val d = Math.abs(node.median - mapper(item, node.dimension))
|
||||
if (d * d < nearest) {
|
||||
nearest(node.children[1 - route], item)
|
||||
}
|
||||
}
|
||||
}
|
||||
nearest(root, item)
|
||||
return nearestArg?.item
|
||||
}
|
||||
|
||||
fun <T> insert(root: KDTreeNode<T>, item: T, dimensions: Int, mapper: (T, Int) -> Double): KDTreeNode<T> {
|
||||
val stack = Stack<KDTreeNode<T>>()
|
||||
stack.push(root)
|
||||
|
||||
dive@ while (true) {
|
||||
|
||||
val node = stack.peek()
|
||||
|
||||
val value = mapper(item, node.dimension)
|
||||
|
||||
if (value < node.median) {
|
||||
if (node.children[0] != null) {
|
||||
stack.push(node.children[0])
|
||||
} else {
|
||||
// sit here
|
||||
node.children[0] = KDTreeNode()
|
||||
node.children[0]?.item = item
|
||||
node.children[0]?.dimension = (node.dimension + 1) % dimensions
|
||||
node.children[0]?.median = mapper(item, (node.dimension + 1) % dimensions)
|
||||
node.children[0]?.parent = node
|
||||
return node.children[0] ?: throw IllegalStateException("child is null")
|
||||
}
|
||||
} else {
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
} else {
|
||||
// sit here
|
||||
node.children[1] = KDTreeNode()
|
||||
node.children[1]?.item = item
|
||||
node.children[1]?.dimension = (node.dimension + 1) % dimensions
|
||||
node.children[1]?.median = mapper(item, (node.dimension + 1) % dimensions)
|
||||
node.children[1]?.parent = node
|
||||
return node.children[1] ?: throw IllegalStateException("child is null")
|
||||
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fun <T> remove(toRemove: KDTreeNode<T>, mapper: (T, Int) -> Double): KDTreeNode<T>? {
|
||||
// trivial case
|
||||
if (toRemove.isLeaf) {
|
||||
val p = toRemove.parent
|
||||
if (p != null) {
|
||||
when {
|
||||
p.children[0] === toRemove -> p.children[0] = null
|
||||
p.children[1] === toRemove -> p.children[1] = null
|
||||
else -> {
|
||||
// broken!
|
||||
}
|
||||
}
|
||||
} else {
|
||||
toRemove.item = null
|
||||
}
|
||||
} else {
|
||||
val stack = Stack<KDTreeNode<T>>()
|
||||
|
||||
var branch = 0
|
||||
|
||||
if (toRemove.children[0] != null) {
|
||||
stack.push(toRemove.children[0])
|
||||
branch = 0
|
||||
} else {
|
||||
stack.push(toRemove.children[1])
|
||||
branch = 1
|
||||
}
|
||||
|
||||
var minValue: Double = java.lang.Double.POSITIVE_INFINITY
|
||||
var maxValue: Double = java.lang.Double.NEGATIVE_INFINITY
|
||||
var minArg: KDTreeNode<T>? = null
|
||||
var maxArg: KDTreeNode<T>? = null
|
||||
|
||||
while (!stack.isEmpty()) {
|
||||
val node = stack.pop() ?: throw RuntimeException("null on stack")
|
||||
|
||||
val value = mapper(node.item ?: throw IllegalStateException("item is null"), toRemove.dimension)
|
||||
|
||||
if (value < minValue) {
|
||||
minValue = value
|
||||
minArg = node
|
||||
}
|
||||
|
||||
if (value > maxValue) {
|
||||
maxValue = value
|
||||
maxArg = node
|
||||
}
|
||||
|
||||
if (node.dimension != toRemove.dimension) {
|
||||
if (node.children[0] != null) {
|
||||
stack.push(node.children[0])
|
||||
}
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
}
|
||||
} else {
|
||||
if (branch == 1) {
|
||||
if (node.children[0] != null) {
|
||||
stack.push(node.children[0])
|
||||
} else {
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
}
|
||||
}
|
||||
}
|
||||
if (branch == 0) {
|
||||
if (node.children[1] != null) {
|
||||
stack.push(node.children[1])
|
||||
} else {
|
||||
if (node.children[0] != null) {
|
||||
stack.push(node.children[0])
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
if (branch == 1) {
|
||||
toRemove.item = minArg?.item
|
||||
toRemove.median = mapper(minArg?.item ?: throw IllegalStateException("minArg is null"), toRemove.dimension)
|
||||
remove(minArg, mapper)
|
||||
}
|
||||
if (branch == 0) {
|
||||
toRemove.item = maxArg?.item
|
||||
toRemove.median = mapper(maxArg?.item ?: throw IllegalStateException("maxArg is null"), toRemove.dimension)
|
||||
remove(maxArg, mapper)
|
||||
}
|
||||
}
|
||||
return null
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user