/*
 * Copyright 2019-2023 Chair of Geoinformatics, Technical University of Munich
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package io.rtron.std

/**
 * Returns a list without consecutive elements which have the same return by the given [selector] function.
 *
 * @receiver the base list for which the consecutive duplicates according to the [selector] are being removed
 * @param selector if the resulting elements of the selector is equal, the duplicates are being removed
 * @return list without consecutive duplicates
 */
inline fun <T, K> Iterable<T>.distinctConsecutiveBy(crossinline selector: (T) -> K): List<T> {
    if (this is Collection && isEmpty()) return emptyList()
    if (this.count() == 1) return this.toList()

    return this.toList().filterWindowed(listOf(true, false)) { selector(it[0]) == selector(it[1]) } + this.last()
}

/**
 * Returns a list without consecutive elements which have the same return by the given [selector] function.
 * The operation is performed enclosing around the list, meaning that the selector(lastElement) ==
 * selector(firstElement) is also evaluated.
 *
 * @receiver the base list for which the consecutive duplicates according to the [selector] are being removed
 * @param selector if the resulting elements of the selector is equal, the duplicates are being removed
 * @return list without consecutive duplicates (also potentially enclosing duplicates)
 */
inline fun <T, K> Iterable<T>.distinctConsecutiveEnclosingBy(crossinline selector: (T) -> K): List<T> {
    if (this is Collection && isEmpty()) return emptyList()
    if (this.count() == 1) return this.toList()

    return this.toList().filterWindowedEnclosing(listOf(true, false)) { selector(it[0]) == selector(it[1]) }
}

/**
 * Returns a list sorted according to natural sort order of the value returned by specified [selector] function by
 * filtering all unsorted elements.
 */
inline fun <T, K : Comparable<K>> Iterable<T>.filterToSortingBy(crossinline selector: (T) -> K): List<T> =
    this.filterToSorting { first, second -> selector(first) <= selector(second) }

/**
 * Returns a list strictly sorted according to natural sort order of the value returned by specified [selector] function by
 * filtering all unsorted elements.
 */
inline fun <T, K : Comparable<K>> Iterable<T>.filterToStrictSortingBy(crossinline selector: (T) -> K): List<T> =
    this.filterToSorting { first, second -> selector(first) < selector(second) }

/**
 * Returns a list sorted descending according to natural sort order of the value returned by specified [selector]
 * function by filtering all unsorted elements.
 */
inline fun <T, K : Comparable<K>> Iterable<T>.filterToStrictSortingByDescending(crossinline selector: (T) -> K): List<T> =
    this.filterToSorting { first, second -> selector(first) > selector(second) }

/**
 * Returns a sorted list according to the [predicate] by filtering all unsorted elements.
 *
 * Example: Strict ordering
 * Given a list: 1, 3, 2, 4
 * Predicate: first < second
 * Returning list: 1, 3, 4 (2 was dropped, since 3 < 2 is false)
 *
 * @receiver iterable to be filtered
 * @param predicate comparison function
 * @return filtered list without the unsorted elements
 */
inline fun <T> Iterable<T>.filterToSorting(predicate: (first: T, second: T) -> Boolean): List<T> {
    if (this is Collection && isEmpty()) return emptyList()

    var threshold = this.first()
    val list = arrayListOf(this.first())

    for (element in this) {
        if (predicate(threshold, element)) {
            list.add(element)
            threshold = element
        }
    }
    return list
}

/**
 * Creates a sequence of lists with [size], iterating through the (receiver) sequence.
 *
 * @receiver the base sequence used to generate the sublists of [size]
 * @param size the size of the sublists to be returned
 * @param step the number of elements to move on
 * @return the sequence of sublists
 */
fun <T> Sequence<T>.windowedEnclosing(size: Int, step: Int = 1): Sequence<List<T>> =
    (this + this.take(size - 1)).windowed(size, step)

/**
 * Returns true, if all lists have the same number of elements.
 *
 * @receiver first list used for comparing the sizes of the lists
 * @param others other lists used for the size comparison
 * @return true, if all lists have the same size
 */
fun <T, K> Collection<T>.hasSameSizeAs(vararg others: Collection<K>) = others.all { it.size == this.size }

/**
 * Returns a list containing only elements where the pair of it and its successor matches the given [predicate].
 * The last element is always included.
 */
inline fun <T> Iterable<T>.filterWithNext(crossinline predicate: (a: T, b: T) -> Boolean): List<T> {
    if (this is Collection && isEmpty()) return emptyList()
    if (this.count() == 1) return this.toList()

    return this.zipWithNext().filter { predicate(it.first, it.second) }.map { it.first } + this.last()
}

/**
 * Returns a list containing only elements where the pair of it and its successor (including the enclosing pair) matches the given [predicate].
 */
inline fun <T> Iterable<T>.filterWithNextEnclosing(crossinline predicate: (a: T, b: T) -> Boolean): List<T> {
    if (this is Collection && isEmpty()) return emptyList()
    if (this.count() == 1) return this.toList()

    return this.zipWithNextEnclosing().filter { predicate(it.first, it.second) }.map { it.first }
}

/**
 * Returns true, if at least one consecutively following pair matches the [predicate].
 */
inline fun <T> Iterable<T>.anyWithNext(crossinline predicate: (a: T, b: T) -> Boolean): Boolean =
    this.zipWithNext().any { predicate(it.first, it.second) }

/**
 * Returns true, if at least one consecutively  following pair (including the enclosing pair) matches the [predicate].
 */
inline fun <T> Iterable<T>.anyWithNextEnclosing(crossinline predicate: (a: T, b: T) -> Boolean): Boolean =
    this.zipWithNextEnclosing().any { predicate(it.first, it.second) }

/**
 * Returns true, if no consecutively following pair matches the [predicate].
 */
inline fun <T> Iterable<T>.noneWithNext(crossinline predicate: (a: T, b: T) -> Boolean): Boolean =
    this.zipWithNext().none { predicate(it.first, it.second) }

/**
 * Returns true, if no consecutively following pair (including the enclosing pair) matches the [predicate].
 */
inline fun <T> Iterable<T>.noneWithNextEnclosing(crossinline predicate: (a: T, b: T) -> Boolean): Boolean =
    this.zipWithNextEnclosing().none { predicate(it.first, it.second) }

/*
 * Copyright 2019-2023 Chair of Geoinformatics, Technical University of Munich
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package io.rtron.std

/**
 * Returns a list without consecutive elements which have the same return by the given [selector] function.
 *
 * @receiver the base list for which the consecutive duplicates according to the [selector] are being removed
 * @param selector if the resulting elements of the selector is equal, the duplicates are being removed
 * @return list without consecutive duplicates
 */
inline fun <T, K> Iterable<T>.distinctConsecutiveBy(crossinline selector: (T) -> K): List<T> {
    if (this is Collection && isEmpty()) return emptyList()
    if (this.count() == 1) return this.toList()

    return this.toList().filterWindowed(listOf(true, false)) { selector(it[0]) == selector(it[1]) } + this.last()
}

/**
 * Returns a list without consecutive elements which have the same return by the given [selector] function.
 * The operation is performed enclosing around the list, meaning that the selector(lastElement) ==
 * selector(firstElement) is also evaluated.
 *
 * @receiver the base list for which the consecutive duplicates according to the [selector] are being removed
 * @param selector if the resulting elements of the selector is equal, the duplicates are being removed
 * @return list without consecutive duplicates (also potentially enclosing duplicates)
 */
inline fun <T, K> Iterable<T>.distinctConsecutiveEnclosingBy(crossinline selector: (T) -> K): List<T> {
    if (this is Collection && isEmpty()) return emptyList()
    if (this.count() == 1) return this.toList()

    return this.toList().filterWindowedEnclosing(listOf(true, false)) { selector(it[0]) == selector(it[1]) }
}

/**
 * Returns a list sorted according to natural sort order of the value returned by specified [selector] function by
 * filtering all unsorted elements.
 */
inline fun <T, K : Comparable<K>> Iterable<T>.filterToSortingBy(crossinline selector: (T) -> K): List<T> =
    this.filterToSorting { first, second -> selector(first) <= selector(second) }

/**
 * Returns a list strictly sorted according to natural sort order of the value returned by specified [selector] function by
 * filtering all unsorted elements.
 */
inline fun <T, K : Comparable<K>> Iterable<T>.filterToStrictSortingBy(crossinline selector: (T) -> K): List<T> =
    this.filterToSorting { first, second -> selector(first) < selector(second) }

/**
 * Returns a list sorted descending according to natural sort order of the value returned by specified [selector]
 * function by filtering all unsorted elements.
 */
inline fun <T, K : Comparable<K>> Iterable<T>.filterToStrictSortingByDescending(crossinline selector: (T) -> K): List<T> =
    this.filterToSorting { first, second -> selector(first) > selector(second) }

/**
 * Returns a sorted list according to the [predicate] by filtering all unsorted elements.
 *
 * Example: Strict ordering
 * Given a list: 1, 3, 2, 4
 * Predicate: first < second
 * Returning list: 1, 3, 4 (2 was dropped, since 3 < 2 is false)
 *
 * @receiver iterable to be filtered
 * @param predicate comparison function
 * @return filtered list without the unsorted elements
 */
inline fun <T> Iterable<T>.filterToSorting(predicate: (first: T, second: T) -> Boolean): List<T> {
    if (this is Collection && isEmpty()) return emptyList()

    var threshold = this.first()
    val list = arrayListOf(this.first())

    for (element in this) {
        if (predicate(threshold, element)) {
            list.add(element)
            threshold = element
        }
    }
    return list
}

/**
 * Creates a sequence of lists with [size], iterating through the (receiver) sequence.
 *
 * @receiver the base sequence used to generate the sublists of [size]
 * @param size the size of the sublists to be returned
 * @param step the number of elements to move on
 * @return the sequence of sublists
 */
fun <T> Sequence<T>.windowedEnclosing(size: Int, step: Int = 1): Sequence<List<T>> =
    (this + this.take(size - 1)).windowed(size, step)

/**
 * Returns true, if all lists have the same number of elements.
 *
 * @receiver first list used for comparing the sizes of the lists
 * @param others other lists used for the size comparison
 * @return true, if all lists have the same size
 */
fun <T, K> Collection<T>.hasSameSizeAs(vararg others: Collection<K>) = others.all { it.size == this.size }

/**
 * Returns a list containing only elements where the pair of it and its successor matches the given [predicate].
 * The last element is always included.
 */
inline fun <T> Iterable<T>.filterWithNext(crossinline predicate: (a: T, b: T) -> Boolean): List<T> {
    if (this is Collection && isEmpty()) return emptyList()
    if (this.count() == 1) return this.toList()

    return this.zipWithNext().filter { predicate(it.first, it.second) }.map { it.first } + this.last()
}

/**
 * Returns a list containing only elements where the pair of it and its successor (including the enclosing pair) matches the given [predicate].
 */
inline fun <T> Iterable<T>.filterWithNextEnclosing(crossinline predicate: (a: T, b: T) -> Boolean): List<T> {
    if (this is Collection && isEmpty()) return emptyList()
    if (this.count() == 1) return this.toList()

    return this.zipWithNextEnclosing().filter { predicate(it.first, it.second) }.map { it.first }
}

/**
 * Returns true, if at least one consecutively following pair matches the [predicate].
 */
inline fun <T> Iterable<T>.anyWithNext(crossinline predicate: (a: T, b: T) -> Boolean): Boolean =
    this.zipWithNext().any { predicate(it.first, it.second) }

/**
 * Returns true, if at least one consecutively  following pair (including the enclosing pair) matches the [predicate].
 */
inline fun <T> Iterable<T>.anyWithNextEnclosing(crossinline predicate: (a: T, b: T) -> Boolean): Boolean =
    this.zipWithNextEnclosing().any { predicate(it.first, it.second) }

/**
 * Returns true, if no consecutively following pair matches the [predicate].
 */
inline fun <T> Iterable<T>.noneWithNext(crossinline predicate: (a: T, b: T) -> Boolean): Boolean =
    this.zipWithNext().none { predicate(it.first, it.second) }

/**
 * Returns true, if no consecutively following pair (including the enclosing pair) matches the [predicate].
 */
inline fun <T> Iterable<T>.noneWithNextEnclosing(crossinline predicate: (a: T, b: T) -> Boolean): Boolean =
    this.zipWithNextEnclosing().none { predicate(it.first, it.second) }
