All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.cqfn.diktat.ruleset.utils.PositionInTextLocator.kt Maven / Gradle / Ivy

There is a newer version: 1.2.5
Show newest version
/**
 * Code to create fast mapping of text offset tol ine and column numbers
 * fixme: this code is copy-pasted from ktlint. Change it
 */

package org.cqfn.diktat.ruleset.utils

internal typealias LineAndColumn = Pair

@Suppress(
    "MISSING_KDOC_ON_FUNCTION",
    "KDOC_WITHOUT_PARAM_TAG",
    "KDOC_WITHOUT_RETURN_TAG"
)
private class SegmentTree(sortedArray: IntArray) {
    private val segments: List = sortedArray
        .dropLast(1)
        .mapIndexed { index: Int, element: Int ->
            Segment(element, sortedArray[index + 1] - 1)
        }

    init {
        require(sortedArray.size > 1) { "At least two data points are required" }
        sortedArray.reduce { current, next ->
            require(current <= next) { "Data points are not sorted (ASC)" }
            next
        }
    }

    fun get(index: Int): Segment = segments[index]

    fun indexOf(index: Int): Int = binarySearch(index, 0, segments.size - 1)

    private fun binarySearch(
        compareElement: Int,
        left: Int,
        right: Int
    ): Int = when {
        left > right -> -1
        else -> {
            val index = left + (right - left) / 2
            val midElement = segments[index]
            if (compareElement < midElement.left) {
                binarySearch(compareElement, left, index - 1)
            } else {
                if (midElement.right < compareElement) binarySearch(compareElement, index + 1, right) else index
            }
        }
    }
}

@Suppress("KDOC_NO_CONSTRUCTOR_PROPERTY")
private data class Segment(
    val left: Int,
    val right: Int
)

/**
 * Calculate position in text - line and column based on offset from the text start.
 *
 * @param text a piece of text
 * @return mapping function from offset to line and column number
 */
internal fun buildPositionInTextLocator(text: String): (offset: Int) -> LineAndColumn {
    val textLength = text.length
    val identifierArray: ArrayList = ArrayList()
    var endOfLineIndex = -1

    do {
        identifierArray.add(endOfLineIndex + 1)
        endOfLineIndex = text.indexOf('\n', endOfLineIndex + 1)
    } while (endOfLineIndex != -1)

    identifierArray.add(textLength + if (identifierArray.last() == textLength) 1 else 0)

    val segmentTree = SegmentTree(identifierArray.toIntArray())

    return { offset ->
        val line = segmentTree.indexOf(offset)
        if (line != -1) {
            val column = offset - segmentTree.get(line).left
            line + 1 to column + 1
        } else {
            1 to 1
        }
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy