generated._Maps.kt Maven / Gradle / Ivy
@file:kotlin.jvm.JvmMultifileClass
@file:kotlin.jvm.JvmName("MapsKt")
package kotlin
//
// NOTE THIS FILE IS AUTO-GENERATED by the GenerateStandardLib.kt
// See: https://github.com/JetBrains/kotlin/tree/master/libraries/stdlib
//
import java.util.*
import java.util.Collections // TODO: it's temporary while we have java.util.Collections in js
/**
* Returns a [List] containing all key-value pairs.
*/
public fun Map.toList(): List> {
val result = ArrayList>(size())
for (item in this)
result.add(item.key to item.value)
return result
}
/**
* Returns a single list of all elements yielded from results of [transform] function being invoked on each entry of original map.
*/
public inline fun Map.flatMap(transform: (Map.Entry) -> Iterable): List {
return flatMapTo(ArrayList(), transform)
}
/**
* Appends all elements yielded from results of [transform] function being invoked on each entry of original map, to the given [destination].
*/
public inline fun > Map.flatMapTo(destination: C, transform: (Map.Entry) -> Iterable): C {
for (element in this) {
val list = transform(element)
destination.addAll(list)
}
return destination
}
/**
* Returns a list containing the results of applying the given [transform] function
* to each entry in the original map.
*/
public inline fun Map.map(transform: (Map.Entry) -> R): List {
return mapTo(ArrayList(size()), transform)
}
/**
* Applies the given [transform] function to each entry and its index in the original map
* and appends the results to the given [destination].
*/
@Deprecated("Use entries.mapIndexedTo instead.", ReplaceWith("this.entries.mapIndexedTo(destination, transform)"))
public inline fun > Map.mapIndexedTo(destination: C, transform: (Int, Map.Entry) -> R): C {
var index = 0
for (item in this)
destination.add(transform(index++, item))
return destination
}
/**
* Returns a list containing only the non-null results of applying the given [transform] function
* to each entry in the original map.
*/
public inline fun Map.mapNotNull(transform: (Map.Entry) -> R?): List {
return mapNotNullTo(ArrayList(), transform)
}
/**
* Applies the given [transform] function to each entry in the original map
* and appends only the non-null results to the given [destination].
*/
public inline fun > Map.mapNotNullTo(destination: C, transform: (Map.Entry) -> R?): C {
forEach { element -> transform(element)?.let { destination.add(it) } }
return destination
}
/**
* Applies the given [transform] function to each entry of the original map
* and appends the results to the given [destination].
*/
public inline fun > Map.mapTo(destination: C, transform: (Map.Entry) -> R): C {
for (item in this)
destination.add(transform(item))
return destination
}
/**
* Returns `true` if all entrys match the given [predicate].
*/
public inline fun Map.all(predicate: (Map.Entry) -> Boolean): Boolean {
for (element in this) if (!predicate(element)) return false
return true
}
/**
* Returns `true` if map has at least one entry.
*/
public fun Map.any(): Boolean {
for (element in this) return true
return false
}
/**
* Returns `true` if at least one entry matches the given [predicate].
*/
public inline fun Map.any(predicate: (Map.Entry) -> Boolean): Boolean {
for (element in this) if (predicate(element)) return true
return false
}
/**
* Returns the number of entrys in this map.
*/
public fun Map.count(): Int {
return size()
}
/**
* Returns the number of entrys matching the given [predicate].
*/
public inline fun Map.count(predicate: (Map.Entry) -> Boolean): Int {
var count = 0
for (element in this) if (predicate(element)) count++
return count
}
/**
* Performs the given [operation] on each entry.
*/
public inline fun Map.forEach(operation: (Map.Entry) -> Unit): Unit {
for (element in this) operation(element)
}
/**
* Returns the first map entry yielding the largest value of the given function or `null` if there are no entries.
*/
public inline fun > Map.maxBy(f: (Map.Entry) -> R): Map.Entry? {
val iterator = iterator()
if (!iterator.hasNext()) return null
var maxElem = iterator.next()
var maxValue = f(maxElem)
while (iterator.hasNext()) {
val e = iterator.next()
val v = f(e)
if (maxValue < v) {
maxElem = e
maxValue = v
}
}
return maxElem
}
/**
* Returns the first map entry yielding the smallest value of the given function or `null` if there are no entries.
*/
public inline fun > Map.minBy(f: (Map.Entry) -> R): Map.Entry? {
val iterator = iterator()
if (!iterator.hasNext()) return null
var minElem = iterator.next()
var minValue = f(minElem)
while (iterator.hasNext()) {
val e = iterator.next()
val v = f(e)
if (minValue > v) {
minElem = e
minValue = v
}
}
return minElem
}
/**
* Returns `true` if the map has no entrys.
*/
public fun Map.none(): Boolean {
for (element in this) return false
return true
}
/**
* Returns `true` if no entrys match the given [predicate].
*/
public inline fun Map.none(predicate: (Map.Entry) -> Boolean): Boolean {
for (element in this) if (predicate(element)) return false
return true
}
/**
* Returns a sequence from the given collection.
*/
public fun Map.asSequence(): Sequence> {
return object : Sequence> {
override fun iterator(): Iterator> {
return [email protected]()
}
}
}