James Strachan
96 lines
2.6 KiB
Kotlin
96 lines
2.6 KiB
Kotlin
package std.util
|
|
|
|
import java.util.*
|
|
|
|
/** Returns the size of the collection */
|
|
val Collection<*>.size : Int
|
|
get() = size()
|
|
|
|
/** Returns true if this collection is empty */
|
|
val Collection<*>.empty : Boolean
|
|
get() = isEmpty()
|
|
|
|
/** Returns a new ArrayList with a variable number of initial elements */
|
|
inline fun arrayList<T>(vararg values: T) : ArrayList<T> = values.to(ArrayList<T>(values.size))
|
|
|
|
/** Returns a new LinkedList with a variable number of initial elements */
|
|
inline fun linkedList<T>(vararg values: T) : LinkedList<T> = values.to(LinkedList<T>())
|
|
|
|
/** Returns a new HashSet with a variable number of initial elements */
|
|
inline fun hashSet<T>(vararg values: T) : HashSet<T> = values.to(HashSet<T>(values.size))
|
|
|
|
inline fun <K,V> hashMap(): HashMap<K,V> = HashMap<K,V>()
|
|
|
|
inline fun <K,V> sortedMap(): SortedMap<K,V> = TreeMap<K,V>()
|
|
|
|
|
|
val Collection<*>.indices : IntRange
|
|
get() = 0..size-1
|
|
|
|
inline fun <T> java.util.Collection<T>.toArray() : Array<T> {
|
|
val answer = Array<T>(this.size)
|
|
var idx = 0
|
|
for (elem in this)
|
|
answer[idx++] = elem
|
|
return answer as Array<T>
|
|
}
|
|
|
|
/** TODO these functions don't work when they generate the Array<T> versions when they are in JavaIterables */
|
|
inline fun <in T: java.lang.Comparable<T>> java.lang.Iterable<T>.toSortedList() : List<T> = toList().sort()
|
|
|
|
inline fun <in T: java.lang.Comparable<T>> java.lang.Iterable<T>.toSortedList(comparator: java.util.Comparator<T>) : List<T> = toList().sort(comparator)
|
|
|
|
|
|
|
|
// List APIs
|
|
|
|
inline fun <in T: java.lang.Comparable<T>> List<T>.sort() : List<T> {
|
|
Collections.sort(this)
|
|
return this
|
|
}
|
|
|
|
inline fun <in T: java.lang.Comparable<T>> List<T>.sort(comparator: java.util.Comparator<T>) : List<T> {
|
|
Collections.sort(this, comparator)
|
|
return this
|
|
}
|
|
|
|
/** Converts the nullable List into an empty List if its null */
|
|
inline fun <T> java.util.List<T>?.notNull() : List<T>
|
|
= if (this != null) this else Collections.EMPTY_LIST as List<T>
|
|
|
|
/**
|
|
TODO figure out necessary variance/generics ninja stuff... :)
|
|
inline fun <in T> List<T>.sort(transform: fun(T) : java.lang.Comparable<*>) : List<T> {
|
|
val comparator = java.util.Comparator<T>() {
|
|
fun compare(o1: T, o2: T): Int {
|
|
val v1 = transform(o1)
|
|
val v2 = transform(o2)
|
|
if (v1 == v2) {
|
|
return 0
|
|
} else {
|
|
return v1.compareTo(v2)
|
|
}
|
|
}
|
|
}
|
|
answer.sort(comparator)
|
|
}
|
|
*/
|
|
|
|
val <T> List<T>.head : T?
|
|
get() = this.get(0)
|
|
|
|
val <T> List<T>.first : T?
|
|
get() = this.head
|
|
|
|
val <T> List<T>.tail : T?
|
|
get() {
|
|
val s = this.size
|
|
return if (s > 0) this.get(s - 1) else null
|
|
}
|
|
|
|
val <T> List<T>.last : T?
|
|
get() = this.tail
|
|
|
|
|
|
|