Remove 'inline'

libraries/stdlib/src/kotlin/JUtilJVM.kt

@@ -3,38 +3,38 @@ package kotlin
 import java.util.*
 
 /** Returns a new ArrayList with a variable number of initial elements */
-public inline fun arrayListOf<T>(vararg values: T) : ArrayList<T> = values.toCollection(ArrayList<T>(values.size))
+public fun arrayListOf<T>(vararg values: T) : ArrayList<T> = values.toCollection(ArrayList<T>(values.size))
 
 deprecated("Use arrayListOf() instead")
-public inline fun arrayList<T>(vararg values: T) : ArrayList<T> = arrayListOf(*values)
+public fun arrayList<T>(vararg values: T) : ArrayList<T> = arrayListOf(*values)
 
 /** Returns a new LinkedList with a variable number of initial elements */
-public inline fun linkedListOf<T>(vararg values: T) : LinkedList<T>  = values.toCollection(LinkedList<T>())
+public fun linkedListOf<T>(vararg values: T) : LinkedList<T>  = values.toCollection(LinkedList<T>())
 
 deprecated("Use linkedListOf() instead")
-public inline fun linkedList<T>(vararg values: T) : LinkedList<T>  = linkedListOf(*values)
+public fun linkedList<T>(vararg values: T) : LinkedList<T>  = linkedListOf(*values)
 
 /** Returns a new HashSet with a variable number of initial elements */
-public inline fun hashSetOf<T>(vararg values: T) : HashSet<T> = values.toCollection(HashSet<T>(values.size))
+public fun hashSetOf<T>(vararg values: T) : HashSet<T> = values.toCollection(HashSet<T>(values.size))
 
 deprecated("Use hashSetOf() instead")
-public inline fun hashSet<T>(vararg values: T) : HashSet<T> = hashSetOf(*values)
+public fun hashSet<T>(vararg values: T) : HashSet<T> = hashSetOf(*values)
 
 /**
  * Returns a new [[SortedSet]] with the initial elements
  */
-public inline fun sortedSetOf<T>(vararg values: T) : TreeSet<T> = values.toCollection(TreeSet<T>())
+public fun sortedSetOf<T>(vararg values: T) : TreeSet<T> = values.toCollection(TreeSet<T>())
 
 deprecated("Use sortedSetOf() instead")
-public inline fun sortedSet<T>(vararg values: T) : TreeSet<T> = sortedSetOf(*values)
+public fun sortedSet<T>(vararg values: T) : TreeSet<T> = sortedSetOf(*values)
 
 /**
  * Returns a new [[SortedSet]] with the given *comparator* and the initial elements
  */
-public inline fun sortedSetOf<T>(comparator: Comparator<T>, vararg values: T) : TreeSet<T> = values.toCollection(TreeSet<T>(comparator))
+public fun sortedSetOf<T>(comparator: Comparator<T>, vararg values: T) : TreeSet<T> = values.toCollection(TreeSet<T>(comparator))
 
 deprecated("Use sortedSetOf() instead")
-public inline fun sortedSet<T>(comparator: Comparator<T>, vararg values: T) : TreeSet<T> = sortedSetOf(comparator, *values)
+public fun sortedSet<T>(comparator: Comparator<T>, vararg values: T) : TreeSet<T> = sortedSetOf(comparator, *values)
 
 /**
  * Returns a new [[HashMap]] populated with the given tuple values where the first value in each tuple
@@ -42,7 +42,7 @@ public inline fun sortedSet<T>(comparator: Comparator<T>, vararg values: T) : Tr
  *
  * @includeFunctionBody ../../test/MapTest.kt createUsingTuples
  */
-public inline fun <K,V> hashMapOf(vararg values: Pair<K,V>): HashMap<K,V> {
+public fun <K,V> hashMapOf(vararg values: Pair<K,V>): HashMap<K,V> {
     val answer = HashMap<K,V>(values.size)
     /**
         TODO replace by this simpler call when we can pass vararg values into other methods
@@ -55,7 +55,7 @@ public inline fun <K,V> hashMapOf(vararg values: Pair<K,V>): HashMap<K,V> {
 }
 
 deprecated("Use hashMapOf() instead")
-public inline fun <K,V> hashMap(vararg values: Pair<K,V>): HashMap<K,V> = hashMapOf(*values)
+public fun <K,V> hashMap(vararg values: Pair<K,V>): HashMap<K,V> = hashMapOf(*values)
 
 /**
  * Returns a new [[SortedMap]] populated with the given tuple values where the first value in each tuple
@@ -63,7 +63,7 @@ public inline fun <K,V> hashMap(vararg values: Pair<K,V>): HashMap<K,V> = hashMa
  *
  * @includeFunctionBody ../../test/MapTest.kt createSortedMap
  */
-public inline fun <K,V> sortedMapOf(vararg values: Pair<K, V>): SortedMap<K,V> {
+public fun <K,V> sortedMapOf(vararg values: Pair<K, V>): SortedMap<K,V> {
     val answer = TreeMap<K,V>()
     /**
         TODO replace by this simpler call when we can pass vararg values into other methods
@@ -76,7 +76,7 @@ public inline fun <K,V> sortedMapOf(vararg values: Pair<K, V>): SortedMap<K,V> {
 }
 
 deprecated("Use sortedMapOf() instead")
-public inline fun <K,V> sortedMap(vararg values: Pair<K, V>): SortedMap<K,V> = sortedMapOf(*values)
+public fun <K,V> sortedMap(vararg values: Pair<K, V>): SortedMap<K,V> = sortedMapOf(*values)
 
 /**
  * Returns a new [[LinkedHashMap]] populated with the given tuple values where the first value in each tuple
@@ -85,7 +85,7 @@ public inline fun <K,V> sortedMap(vararg values: Pair<K, V>): SortedMap<K,V> = s
  *
  * @includeFunctionBody ../../test/MapTest.kt createLinkedMap
  */
-public inline fun <K,V> linkedMapOf(vararg values: Pair<K, V>): LinkedHashMap<K,V> {
+public fun <K,V> linkedMapOf(vararg values: Pair<K, V>): LinkedHashMap<K,V> {
     val answer = LinkedHashMap<K,V>(values.size)
     /**
         TODO replace by this simpler call when we can pass vararg values into other methods
@@ -98,8 +98,8 @@ public inline fun <K,V> linkedMapOf(vararg values: Pair<K, V>): LinkedHashMap<K,
 }
 
 deprecated("Use linkedMapOf() instead")
-public inline fun <K,V> linkedMap(vararg values: Pair<K, V>): LinkedHashMap<K,V> = linkedMapOf(*values)
+public fun <K,V> linkedMap(vararg values: Pair<K, V>): LinkedHashMap<K,V> = linkedMapOf(*values)
 
 /** Returns the Set if its not null otherwise returns the empty set */
-public inline fun <T> Set<T>?.orEmpty() : Set<T>
+public fun <T> Set<T>?.orEmpty() : Set<T>
     = if (this != null) this else Collections.EMPTY_SET as Set<T>