Reland: Use simple/fast inline function version of MinMax in JS

src/js/harmony-array.js

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 (function(global, utils) {
 
 'use strict';
 
 %CheckIsBootstrapping();
 
 // -------------------------------------------------------------------
 // Imports
 
 var GetIterator;
 var GetMethod;
 var GlobalArray = global.Array;
 var iteratorSymbol = utils.ImportNow("iterator_symbol");
-var MathMax;
-var MathMin;
 var ObjectIsFrozen;
 var ObjectDefineProperty;
+var MaxSimple;

[Jakob Kummerow, 2015/10/15 14:18:48]

nit: please preserve alpha-sorting

[skomski, 2015/10/15 15:17:58]

Done.

+var MinSimple;
 
 utils.Import(function(from) {
   GetIterator = from.GetIterator;
   GetMethod = from.GetMethod;
-  MathMax = from.MathMax;
-  MathMin = from.MathMin;
   ObjectIsFrozen = from.ObjectIsFrozen;
   ObjectDefineProperty = from.ObjectDefineProperty;
+  MaxSimple = from.MaxSimple;
+  MinSimple = from.MinSimple;
 });
 
 // -------------------------------------------------------------------
 
 function InnerArrayCopyWithin(target, start, end, array, length) {
   target = TO_INTEGER(target);
   var to;
   if (target < 0) {
-    to = MathMax(length + target, 0);
+    to = MaxSimple(length + target, 0);
   } else {
-    to = MathMin(target, length);
+    to = MinSimple(target, length);
   }
 
   start = TO_INTEGER(start);
   var from;
   if (start < 0) {
-    from = MathMax(length + start, 0);
+    from = MaxSimple(length + start, 0);
   } else {
-    from = MathMin(start, length);
+    from = MinSimple(start, length);
   }
 
   end = IS_UNDEFINED(end) ? length : TO_INTEGER(end);
   var final;
   if (end < 0) {
-    final = MathMax(length + end, 0);
+    final = MaxSimple(length + end, 0);
   } else {
-    final = MathMin(end, length);
+    final = MinSimple(end, length);
   }
 
-  var count = MathMin(final - from, length - to);
+  var count = MinSimple(final - from, length - to);
   var direction = 1;
   if (from < to && to < (from + count)) {
     direction = -1;
     from = from + count - 1;
     to = to + count - 1;
   }
 
   while (count > 0) {
     if (from in array) {
       array[to] = array[from];
@@ skipping 219 matching lines @@
 
 utils.Export(function(to) {
   to.ArrayFrom = ArrayFrom;
   to.InnerArrayCopyWithin = InnerArrayCopyWithin;
   to.InnerArrayFill = InnerArrayFill;
   to.InnerArrayFind = InnerArrayFind;
   to.InnerArrayFindIndex = InnerArrayFindIndex;
 });
 
 })