@Test public void testMaxInRow() { assertThat(MatrixUtils.maxInRow(nonZeroColumnMatrix(), 1)).isEqualTo(3); }
public static int maxInRow(DoubleMatrix2D A, int row) { int index = 0; double max = A.getQuick(row, index); for (int c = 1; c < A.columns(); c++) { if (max < A.getQuick(row, c)) { max = A.getQuick(row, c); index = c; } } return index; }
MatrixUtils { public static int maxInRow(DoubleMatrix2D A, int row) { int index = 0; double max = A.getQuick(row, index); for (int c = 1; c < A.columns(); c++) { if (max < A.getQuick(row, c)) { max = A.getQuick(row, c); index = c; } } return index; } }
MatrixUtils { public static int maxInRow(DoubleMatrix2D A, int row) { int index = 0; double max = A.getQuick(row, index); for (int c = 1; c < A.columns(); c++) { if (max < A.getQuick(row, c)) { max = A.getQuick(row, c); index = c; } } return index; }  }
MatrixUtils { public static int maxInRow(DoubleMatrix2D A, int row) { int index = 0; double max = A.getQuick(row, index); for (int c = 1; c < A.columns(); c++) { if (max < A.getQuick(row, c)) { max = A.getQuick(row, c); index = c; } } return index; }  static DoubleMatrix2D normalizeColumnL2(DoubleMatrix2D A, double[] work); static DoubleMatrix2D normalizeSparseColumnL2(
      final DoubleMatrix2D A, final double[] work); static DoubleMatrix2D normalizeColumnL1(DoubleMatrix2D A, double[] work); static double computeOrthogonality(DoubleMatrix2D A); static double computeSparseness(DoubleMatrix2D A); static int[] minInColumns(DoubleMatrix2D A, int[] indices, double[] minValues); static int[] maxInColumns(DoubleMatrix2D A, int[] indices, double[] maxValues); static int[] maxInColumns(
      DoubleMatrix2D A, int[] indices, double[] maxValues, DoubleFunction transform); static int maxInRow(DoubleMatrix2D A, int row); static double[] sumRows(DoubleMatrix2D A, double[] sums); static double frobeniusNorm(DoubleMatrix2D matrix); static DoubleMatrix2D sortedRowsView(
      DoubleMatrix2D matrix, IndirectComparator comparator); }
MatrixUtils { public static int maxInRow(DoubleMatrix2D A, int row) { int index = 0; double max = A.getQuick(row, index); for (int c = 1; c < A.columns(); c++) { if (max < A.getQuick(row, c)) { max = A.getQuick(row, c); index = c; } } return index; }  static DoubleMatrix2D normalizeColumnL2(DoubleMatrix2D A, double[] work); static DoubleMatrix2D normalizeSparseColumnL2(
      final DoubleMatrix2D A, final double[] work); static DoubleMatrix2D normalizeColumnL1(DoubleMatrix2D A, double[] work); static double computeOrthogonality(DoubleMatrix2D A); static double computeSparseness(DoubleMatrix2D A); static int[] minInColumns(DoubleMatrix2D A, int[] indices, double[] minValues); static int[] maxInColumns(DoubleMatrix2D A, int[] indices, double[] maxValues); static int[] maxInColumns(
      DoubleMatrix2D A, int[] indices, double[] maxValues, DoubleFunction transform); static int maxInRow(DoubleMatrix2D A, int row); static double[] sumRows(DoubleMatrix2D A, double[] sums); static double frobeniusNorm(DoubleMatrix2D matrix); static DoubleMatrix2D sortedRowsView(
      DoubleMatrix2D matrix, IndirectComparator comparator);  }