diff options
Diffstat (limited to 'deps/v8/src/builtins/array-copywithin.tq')
-rw-r--r-- | deps/v8/src/builtins/array-copywithin.tq | 26 |
1 files changed, 13 insertions, 13 deletions
diff --git a/deps/v8/src/builtins/array-copywithin.tq b/deps/v8/src/builtins/array-copywithin.tq index 8406123b20..6b9ba934a4 100644 --- a/deps/v8/src/builtins/array-copywithin.tq +++ b/deps/v8/src/builtins/array-copywithin.tq @@ -4,7 +4,7 @@ module array { macro ConvertToRelativeIndex(index: Number, length: Number): Number { - return index < 0 ? max(index + length, 0) : min(index, length); + return index < 0 ? Max(index + length, 0) : Min(index, length); } // https://tc39.github.io/ecma262/#sec-array.prototype.copyWithin @@ -17,32 +17,32 @@ module array { const length: Number = GetLengthProperty(context, object); // 3. Let relativeTarget be ? ToInteger(target). - const relative_target: Number = ToInteger_Inline(context, arguments[0]); + const relativeTarget: Number = ToInteger_Inline(context, arguments[0]); // 4. If relativeTarget < 0, let to be max((len + relativeTarget), 0); // else let to be min(relativeTarget, len). - let to: Number = ConvertToRelativeIndex(relative_target, length); + let to: Number = ConvertToRelativeIndex(relativeTarget, length); // 5. Let relativeStart be ? ToInteger(start). - const relative_start: Number = ToInteger_Inline(context, arguments[1]); + const relativeStart: Number = ToInteger_Inline(context, arguments[1]); // 6. If relativeStart < 0, let from be max((len + relativeStart), 0); // else let from be min(relativeStart, len). - let from: Number = ConvertToRelativeIndex(relative_start, length); + let from: Number = ConvertToRelativeIndex(relativeStart, length); // 7. If end is undefined, let relativeEnd be len; // else let relativeEnd be ? ToInteger(end). - let relative_end: Number = length; + let relativeEnd: Number = length; if (arguments[2] != Undefined) { - relative_end = ToInteger_Inline(context, arguments[2]); + relativeEnd = ToInteger_Inline(context, arguments[2]); } // 8. If relativeEnd < 0, let final be max((len + relativeEnd), 0); // else let final be min(relativeEnd, len). - const final: Number = ConvertToRelativeIndex(relative_end, length); + const final: Number = ConvertToRelativeIndex(relativeEnd, length); // 9. Let count be min(final-from, len-to). - let count: Number = min(final - from, length - to); + let count: Number = Min(final - from, length - to); // 10. If from<to and to<from+count, then. let direction: Number = 1; @@ -63,15 +63,15 @@ module array { // a. Let fromKey be ! ToString(from). // b. Let toKey be ! ToString(to). // c. Let fromPresent be ? HasProperty(O, fromKey). - const from_present: Boolean = HasProperty(context, object, from); + const fromPresent: Boolean = HasProperty(context, object, from); // d. If fromPresent is true, then. - if (from_present == True) { + if (fromPresent == True) { // i. Let fromVal be ? Get(O, fromKey). - const from_val: Object = GetProperty(context, object, from); + const fromVal: Object = GetProperty(context, object, from); // ii. Perform ? Set(O, toKey, fromVal, true). - SetProperty(context, object, to, from_val); + SetProperty(context, object, to, fromVal); } else { // i. Perform ? DeletePropertyOrThrow(O, toKey). DeleteProperty(context, object, to, kStrict); |