Merge pull request #4 from yych42/master

Migrate to null safety

lib/src/euclid.dart

@@ -179,10 +179,6 @@ int greatestCommonDivisor(int a, int b) => a.gcd(b);
 
 /// Returns the greatest common divisor (gcd) of two integers using Euclid's algorithm.
 int greatestCommonDivisorOfMany(List<int> integers) {
-  if (null == integers) {
-    throw ArgumentError.notNull('integers');
-  }
-
   if (integers.length == 0) {
     return 0;
   }
@@ -207,10 +203,6 @@ int leastCommonMultiple(int a, int b) {
 
 /// Returns the least common multiple (lcm) of many [BigInt] using Euclid's algorithm.
 int leastCommonMultipleOfMany(List<int> integers) {
-  if (null == integers) {
-    throw ArgumentError.notNull('integers');
-  }
-
   if (integers.length == 0) {
     return 1;
   }
@@ -229,10 +221,6 @@ BigInt greatestCommonDivisorBig(BigInt a, BigInt b) => a.gcd(b);
 
 /// Returns the greatest common divisor (gcd) of many [BigInt] using Euclid's algorithm.
 BigInt greatestCommonDivisorOfManyBig(List<BigInt> integers) {
-  if (null == integers) {
-    throw ArgumentError.notNull('integers');
-  }
-
   if (integers.length == 0) {
     return BigInt.zero;
   }
@@ -257,10 +245,6 @@ BigInt leastCommonMultipleBig(BigInt a, BigInt b) {
 
 /// Returns the least common multiple (lcm) of many [BigInt] using Euclid's algorithm.
 BigInt leastCommonMultipleOfManyBig(List<BigInt> integers) {
-  if (null == integers) {
-    throw ArgumentError.notNull('integers');
-  }
-
   if (integers.length == 0) {
     return BigInt.one;
   }

lib/src/precision.dart

@@ -25,7 +25,7 @@ const int doubleWidth = 53;
 /// double-precision floating numbers (64 bit).
 ///
 /// According to the definition of Prof. Demmel and used in LAPACK and Scilab.
-final double doublePrecision = pow(2, -doubleWidth);
+final double doublePrecision = pow(2, -doubleWidth) as double;
 
 /// Standard epsilon, the maximum relative precision of IEEE 754
 /// double-precision floating numbers (64 bit).

lib/src/special_functions/factorial.dart

@@ -94,10 +94,6 @@ double multinomial(int n, List<int> ni) {
     throw ArgumentError.value(n, 'n', messages.argumentPositive);
   }
 
-  if (ni == null) {
-    throw ArgumentError.notNull('ni');
-  }
-
   int sum = 0;
   double ret = factorialLn(n);
   for (int i = 0; i < ni.length; i++) {

lib/src/utils.dart

@@ -11,8 +11,8 @@ double log10(num x) => log(x) / ln10;
 
 Tuple2<List<TU>, List<TV>> unpackSinglePass<TU, TV>(
     Iterable<Tuple2<TU, TV>> samples) {
-  var u = new List<TU>();
-  var v = new List<TV>();
+  var u = <TU>[];
+  var v = <TV>[];
 
   for (var tuple in samples) {
     u.add(tuple.item1);

pubspec.yaml

@@ -2,13 +2,12 @@ name: dart_numerics
 description: An ultimate numerical package for Dart for professional and every day use.
 version: 0.0.5
 homepage: https://github.com/zlumyo/dart_numerics
-author: Vladimir Ivanov <zlumyo@gmail.com>
 
 environment:
-  sdk: '>=2.0.0 <3.0.0'
+  sdk: '>=2.12.0 <3.0.0'
 
 dependencies:
-  tuple: ^1.0.2
+  tuple: ^2.0.0
 
 dev_dependencies:
-  test: ^1.0.0
+  test: ^1.19.4