explicitly used parens in place of implicit order of ops

#131

Author: cicirello

src/org/cicirello/math/la/MatrixOps.java

@@ -27,7 +27,7 @@
  * represented as 2-D Java arrays.
  *
  * @author <a href=https://www.cicirello.org/ target=_top>Vincent A. Cicirello</a>, <a href=https://www.cicirello.org/ target=_top>https://www.cicirello.org/</a>  
- * @version 2.13.2021
+ * @version 5.13.2021
  */
 public final class MatrixOps {
 
@@ -235,7 +235,7 @@ public static double[][] difference(double[][] A, double[][] B) {
 	 * @return A reference to the C matrix.
 	 */
 	public static int[][] product(int[][] A, int[][] B, int[][] C) {
-		if (A.length == 0 && B.length > 0 || A.length > 0 && B.length == 0) {
+		if ((A.length == 0 && B.length > 0) || (A.length > 0 && B.length == 0)) {
 			throw new IllegalArgumentException("If either matrix has 0 rows, both must.");
 		} else if (A.length == 0) {
 			if (C==null) return new int[0][0];
@@ -267,7 +267,7 @@ public static int[][] product(int[][] A, int[][] B, int[][] C) {
 	 * @return A reference to the C matrix.
 	 */
 	public static double[][] product(double[][] A, double[][] B, double[][] C) {
-		if (A.length == 0 && B.length > 0 || A.length > 0 && B.length == 0) {
+		if ((A.length == 0 && B.length > 0) || (A.length > 0 && B.length == 0)) {
 			throw new IllegalArgumentException("If either matrix has 0 rows, both must.");
 		} else if (A.length == 0) {
 			if (C==null) return new double[0][0];

src/org/cicirello/math/rand/RandomIndexer.java

@@ -33,7 +33,7 @@
  * from the motivating case, the case of efficiently generating random indexes into an array.
  *
  * @author <a href=https://www.cicirello.org/ target=_top>Vincent A. Cicirello</a>, <a href=https://www.cicirello.org/ target=_top>https://www.cicirello.org/</a> 
- * @version 2.13.2021
+ * @version 5.13.2021
  *
  */
 public final class RandomIndexer {
@@ -152,7 +152,7 @@ public static int nextInt(int bound, Random gen) {
 	 */
 	public static int nextBiasedInt(int bound) {
 		if (bound < 1) throw new IllegalArgumentException("bound must be positive");
-		return (int)((long)(ThreadLocalRandom.current().nextInt() & 0x7fffffff) * (long)bound >> 31);
+		return (int)(((long)(ThreadLocalRandom.current().nextInt() & 0x7fffffff) * (long)bound) >> 31);
 	}
 
 	/**
@@ -178,7 +178,7 @@ public static int nextBiasedInt(int bound) {
 	 */
 	public static int nextBiasedInt(int bound, SplittableRandom gen) {
 		if (bound < 1) throw new IllegalArgumentException("bound must be positive");
-		return (int)((long)(gen.nextInt() & 0x7fffffff) * (long)bound >> 31);
+		return (int)(((long)(gen.nextInt() & 0x7fffffff) * (long)bound) >> 31);
 	}
 
 	/**
@@ -211,7 +211,7 @@ public static int nextBiasedInt(int bound, SplittableRandom gen) {
 	 */
 	public static int nextBiasedInt(int bound, Random gen) {
 		if (bound < 1) throw new IllegalArgumentException("bound must be positive");
-		return (int)((long)(gen.nextInt() & 0x7fffffff) * (long)bound >> 31);
+		return (int)(((long)(gen.nextInt() & 0x7fffffff) * (long)bound) >> 31);
 	}
 
 

src/org/cicirello/permutations/distance/KendallTauDistance.java

@@ -48,7 +48,7 @@
  * M. G. Kendall, "A new measure of rank correlation," Biometrika, vol. 30, no. 1/2, pp. 81–93, June 1938.</p>
  * 
  * @author <a href=https://www.cicirello.org/ target=_top>Vincent A. Cicirello</a>, <a href=https://www.cicirello.org/ target=_top>https://www.cicirello.org/</a>
- * @version 4.2.2021
+ * @version 5.13.2021
  * 
  */
 public final class KendallTauDistance implements NormalizedPermutationDistanceMeasurer {
@@ -83,7 +83,7 @@ public int distance(Permutation p1, Permutation p2) {
 	@Override
 	public int max(int length) {
 		if (length <= 1) return 0;
-		return length*(length - 1)>>1;
+		return (length*(length - 1))>>1;
 	}
 
 	private int countInversions(int[] array) {