Fixed kwargs getting lost on sort and sorted functions

Author: JennaSys

transcrypt/modules/copy/__init__.js

@@ -1,5 +1,5 @@
-export function __copy(isDeep, obj) {
-    var result;
+function __copy(isDeep, obj) {
+    let result;
 
     // Handle primitives
     if (obj === null || typeof obj !== "object") return obj;
@@ -14,7 +14,7 @@ export function __copy(isDeep, obj) {
     // Handle Array
     if (obj instanceof Array) {
         result = [];
-        for (var i = 0, len = obj.length; i < len; i++) {
+        for (let i = 0, len = obj.length; i < len; i++) {
             result[i] = isDeep ? __copy(isDeep, obj[i]) : obj[i];
         }
         return result;
@@ -23,7 +23,7 @@ export function __copy(isDeep, obj) {
     // Handle Object
     if (obj instanceof Object) {
         result = {};
-        for (var attr in obj) {
+        for (let attr in obj) {
             if (obj.hasOwnProperty(attr)) result[attr] = isDeep ? __copy(isDeep, obj[attr]) : obj[attr];
         }
         return result;

transcrypt/modules/org/transcrypt/__runtime__.py

@@ -103,24 +103,30 @@ class RuntimeWarning (Warning):
 
 #__pragma__ ('kwargs')
 
-def __sort__(iterable, key = None, reverse = False):               # Used by py_sort, can deal with kwargs
+def _sort(iterable, key = None, reverse = False):                # Used by py_sort and sorted, can deal with kwargs
     if key:
         iterable.sort (lambda a, b: 1 if key (a) > key (b) else -1) # JavaScript sort, case '==' is irrelevant for sorting
     else:
-        iterable.sort (lambda a, b: 1 if a > b else -1)                                            # JavaScript sort
-        
+        iterable.sort (lambda a, b: 1 if a > b else -1)             # JavaScript sort -  key needed to properly sort non-string values
+
     if reverse:
         iterable.reverse ()
-        
-def sorted(iterable, key = None, reverse = False):
-    if type (iterable) == dict:
-        result = _copy (iterable.keys ())
-    else:       
-        result = _copy (iterable)
-        
-    __sort__ (result, key, reverse)
+
+
+def sorted(iterable, *, key=None, reverse=False):
+    if type(iterable) == dict:
+        result = _copy(iterable.keys())
+    else:
+        result = _copy(iterable)
+
+    _sort(result, key, reverse)
     return result
 
+
+# Used by py_sort
+def __sort__(iterable, *, key=None, reverse=False):
+    _sort(iterable, key, reverse)
+
 #__pragma__ ('nokwargs')
 
 def map(func, *iterables):