mirror of
https://github.com/dart-lang/sdk
synced 2024-09-16 01:45:06 +00:00
0b58c4bd10
Retain the old values. Reapply of https://dart-review.googlesource.com/c/sdk/+/20680 with fixes for VM method fingerprints. Change-Id: Ie14e7ccc3194d5561983348e6b6752728913ff4d Reviewed-on: https://dart-review.googlesource.com/20664 Reviewed-by: Erik Ernst <eernst@google.com> Commit-Queue: Lasse R.H. Nielsen <lrn@google.com>
292 lines
8.5 KiB
Dart
292 lines
8.5 KiB
Dart
// Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file
|
|
// for details. All rights reserved. Use of this source code is governed by a
|
|
// BSD-style license that can be found in the LICENSE file.
|
|
|
|
/// Note: the VM concatenates all patch files into a single patch file. This
|
|
/// file is the first patch in "dart:math" which contains all the imports used
|
|
/// by patches of that library. We plan to change this when we have a shared
|
|
/// front end and simply use parts.
|
|
|
|
import "dart:_internal" show patch;
|
|
|
|
import "dart:typed_data" show Uint32List;
|
|
|
|
/// There are no parts of this patch library.
|
|
|
|
@patch
|
|
T min<T extends num>(T a, T b) {
|
|
// These partially redundant type checks improve code quality for dart2js.
|
|
// Most of the improvement is at call sites from the inferred non-null num
|
|
// return type.
|
|
if (a is! num) throw new ArgumentError(a);
|
|
if (b is! num) throw new ArgumentError(b);
|
|
|
|
if (a > b) return b;
|
|
if (a < b) return a;
|
|
if (b is double) {
|
|
// Special case for NaN and -0.0. If one argument is NaN return NaN.
|
|
// [min] must also distinguish between -0.0 and 0.0.
|
|
if (a is double) {
|
|
if (a == 0.0) {
|
|
// a is either 0.0 or -0.0. b is either 0.0, -0.0 or NaN.
|
|
// The following returns -0.0 if either a or b is -0.0, and it
|
|
// returns NaN if b is NaN.
|
|
num n = (a + b) * a * b;
|
|
return n;
|
|
}
|
|
}
|
|
// Check for NaN and b == -0.0.
|
|
if (a == 0 && b.isNegative || b.isNaN) return b;
|
|
return a;
|
|
}
|
|
return a;
|
|
}
|
|
|
|
@patch
|
|
T max<T extends num>(T a, T b) {
|
|
// These partially redundant type checks improve code quality for dart2js.
|
|
// Most of the improvement is at call sites from the inferred non-null num
|
|
// return type.
|
|
if (a is! num) throw new ArgumentError(a);
|
|
if (b is! num) throw new ArgumentError(b);
|
|
|
|
if (a > b) return a;
|
|
if (a < b) return b;
|
|
if (b is double) {
|
|
// Special case for NaN and -0.0. If one argument is NaN return NaN.
|
|
// [max] must also distinguish between -0.0 and 0.0.
|
|
if (a is double) {
|
|
if (a == 0.0) {
|
|
// a is either 0.0 or -0.0. b is either 0.0, -0.0, or NaN.
|
|
// The following returns 0.0 if either a or b is 0.0, and it
|
|
// returns NaN if b is NaN.
|
|
num n = a + b;
|
|
return n;
|
|
}
|
|
}
|
|
// Check for NaN.
|
|
if (b.isNaN) return b;
|
|
return a;
|
|
}
|
|
// max(-0.0, 0) must return 0.
|
|
if (b == 0 && a.isNegative) return b;
|
|
return a;
|
|
}
|
|
|
|
// If [x] is an [int] and [exponent] is a non-negative [int], the result is
|
|
// an [int], otherwise the result is a [double].
|
|
@patch
|
|
num pow(num x, num exponent) {
|
|
if ((x is int) && (exponent is int) && (exponent >= 0)) {
|
|
return _intPow(x, exponent);
|
|
}
|
|
return _doublePow(x.toDouble(), exponent.toDouble());
|
|
}
|
|
|
|
double _doublePow(double base, double exponent) {
|
|
if (exponent == 0.0) {
|
|
return 1.0; // ECMA-262 15.8.2.13
|
|
}
|
|
// Speed up simple cases.
|
|
if (exponent == 1.0) return base;
|
|
if (exponent == 2.0) return base * base;
|
|
if (exponent == 3.0) return base * base * base;
|
|
|
|
if (base == 1.0) return 1.0;
|
|
|
|
if (base.isNaN || exponent.isNaN) {
|
|
return double.nan;
|
|
}
|
|
if ((base != -double.infinity) && (exponent == 0.5)) {
|
|
if (base == 0.0) {
|
|
return 0.0;
|
|
}
|
|
return sqrt(base);
|
|
}
|
|
return _pow(base.toDouble(), exponent.toDouble());
|
|
}
|
|
|
|
double _pow(double base, double exponent) native "Math_doublePow";
|
|
|
|
int _intPow(int base, int exponent) {
|
|
// Exponentiation by squaring.
|
|
int result = 1;
|
|
while (exponent != 0) {
|
|
if ((exponent & 1) == 1) {
|
|
result *= base;
|
|
}
|
|
exponent >>= 1;
|
|
// Skip unnecessary operation (can overflow to Mint or Bigint).
|
|
if (exponent != 0) {
|
|
base *= base;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
@patch
|
|
double atan2(num a, num b) => _atan2(a.toDouble(), b.toDouble());
|
|
@patch
|
|
double sin(num radians) => _sin(radians.toDouble());
|
|
@patch
|
|
double cos(num radians) => _cos(radians.toDouble());
|
|
@patch
|
|
double tan(num radians) => _tan(radians.toDouble());
|
|
@patch
|
|
double acos(num x) => _acos(x.toDouble());
|
|
@patch
|
|
double asin(num x) => _asin(x.toDouble());
|
|
@patch
|
|
double atan(num x) => _atan(x.toDouble());
|
|
@patch
|
|
double sqrt(num x) => _sqrt(x.toDouble());
|
|
@patch
|
|
double exp(num x) => _exp(x.toDouble());
|
|
@patch
|
|
double log(num x) => _log(x.toDouble());
|
|
|
|
double _atan2(double a, double b) native "Math_atan2";
|
|
double _sin(double x) native "Math_sin";
|
|
double _cos(double x) native "Math_cos";
|
|
double _tan(double x) native "Math_tan";
|
|
double _acos(double x) native "Math_acos";
|
|
double _asin(double x) native "Math_asin";
|
|
double _atan(double x) native "Math_atan";
|
|
double _sqrt(double x) native "Math_sqrt";
|
|
double _exp(double x) native "Math_exp";
|
|
double _log(double x) native "Math_log";
|
|
|
|
// TODO(iposva): Handle patch methods within a patch class correctly.
|
|
@patch
|
|
class Random {
|
|
@patch
|
|
factory Random([int seed]) {
|
|
var state = _Random._setupSeed((seed == null) ? _Random._nextSeed() : seed);
|
|
// Crank a couple of times to distribute the seed bits a bit further.
|
|
return new _Random._withState(state)
|
|
.._nextState()
|
|
.._nextState()
|
|
.._nextState()
|
|
.._nextState();
|
|
}
|
|
|
|
@patch
|
|
factory Random.secure() {
|
|
return new _SecureRandom();
|
|
}
|
|
}
|
|
|
|
class _Random implements Random {
|
|
// Internal state of the random number generator.
|
|
final Uint32List _state;
|
|
static const _kSTATE_LO = 0;
|
|
static const _kSTATE_HI = 1; // Unused in Dart code.
|
|
|
|
_Random._withState(this._state);
|
|
|
|
// The algorithm used here is Multiply with Carry (MWC) with a Base b = 2^32.
|
|
// http://en.wikipedia.org/wiki/Multiply-with-carry
|
|
// The constant A is selected from "Numerical Recipes 3rd Edition" p.348 B1.
|
|
|
|
// Implements:
|
|
// var state =
|
|
// ((_A * (_state[_kSTATE_LO])) + _state[_kSTATE_HI]) & ((1 << 64) - 1);
|
|
// _state[_kSTATE_LO] = state & ((1 << 32) - 1);
|
|
// _state[_kSTATE_HI] = state >> 32;
|
|
// This is a native to prevent 64-bit operations in Dart, which
|
|
// fail with --throw_on_javascript_int_overflow.
|
|
// TODO(regis): Implement in Dart and remove Random_nextState in math.cc.
|
|
void _nextState() native "Random_nextState";
|
|
|
|
int nextInt(int max) {
|
|
const limit = 0x3FFFFFFF;
|
|
if ((max <= 0) || ((max > limit) && (max > _POW2_32))) {
|
|
throw new RangeError.range(
|
|
max, 1, _POW2_32, "max", "Must be positive and <= 2^32");
|
|
}
|
|
if ((max & -max) == max) {
|
|
// Fast case for powers of two.
|
|
_nextState();
|
|
return _state[_kSTATE_LO] & (max - 1);
|
|
}
|
|
|
|
var rnd32;
|
|
var result;
|
|
do {
|
|
_nextState();
|
|
rnd32 = _state[_kSTATE_LO];
|
|
result = rnd32 % max;
|
|
} while ((rnd32 - result + max) > _POW2_32);
|
|
return result;
|
|
}
|
|
|
|
double nextDouble() {
|
|
return ((nextInt(1 << 26) * _POW2_27_D) + nextInt(1 << 27)) / _POW2_53_D;
|
|
}
|
|
|
|
bool nextBool() {
|
|
return nextInt(2) == 0;
|
|
}
|
|
|
|
// Constants used by the algorithm.
|
|
static const _POW2_32 = 1 << 32;
|
|
static const _POW2_53_D = 1.0 * (1 << 53);
|
|
static const _POW2_27_D = 1.0 * (1 << 27);
|
|
|
|
static const _A = 0xffffda61;
|
|
|
|
// Use a singleton Random object to get a new seed if no seed was passed.
|
|
static var _prng = new _Random._withState(_initialSeed());
|
|
|
|
// This is a native to prevent 64-bit operations in Dart, which
|
|
// fail with --throw_on_javascript_int_overflow.
|
|
// TODO(regis): Implement here in Dart and remove native in math.cc.
|
|
static Uint32List _setupSeed(int seed) native "Random_setupSeed";
|
|
// Get a seed from the VM's random number provider.
|
|
static Uint32List _initialSeed() native "Random_initialSeed";
|
|
|
|
static int _nextSeed() {
|
|
// Trigger the PRNG once to change the internal state.
|
|
_prng._nextState();
|
|
return _prng._state[_kSTATE_LO];
|
|
}
|
|
}
|
|
|
|
class _SecureRandom implements Random {
|
|
_SecureRandom() {
|
|
// Throw early in constructor if entropy source is not hooked up.
|
|
_getBytes(1);
|
|
}
|
|
|
|
// Return count bytes of entropy as a positive integer; count <= 8.
|
|
static int _getBytes(int count) native "SecureRandom_getBytes";
|
|
|
|
int nextInt(int max) {
|
|
RangeError.checkValueInInterval(
|
|
max, 1, _POW2_32, "max", "Must be positive and <= 2^32");
|
|
final byteCount = ((max - 1).bitLength + 7) >> 3;
|
|
if (byteCount == 0) {
|
|
return 0; // Not random if max == 1.
|
|
}
|
|
var rnd;
|
|
var result;
|
|
do {
|
|
rnd = _getBytes(byteCount);
|
|
result = rnd % max;
|
|
} while ((rnd - result + max) > (1 << (byteCount << 3)));
|
|
return result;
|
|
}
|
|
|
|
double nextDouble() {
|
|
return (_getBytes(7) >> 3) / _POW2_53_D;
|
|
}
|
|
|
|
bool nextBool() {
|
|
return _getBytes(1).isEven;
|
|
}
|
|
|
|
// Constants used by the algorithm.
|
|
static const _POW2_32 = 1 << 32;
|
|
static const _POW2_53_D = 1.0 * (1 << 53);
|
|
}
|