com.landawn.abacus.util.Matrix Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of abacus-android Show documentation
Show all versions of abacus-android Show documentation
A general and simple library for Android
/*
* Copyright (C) 2016 HaiYang Li
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
* in compliance with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under the License
* is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
* or implied. See the License for the specific language governing permissions and limitations under
* the License.
*/
package com.landawn.abacus.util;
import java.util.List;
import java.util.NoSuchElementException;
import com.landawn.abacus.annotation.Beta;
import com.landawn.abacus.util.Try.Consumer;
import com.landawn.abacus.util.f.ff;
import com.landawn.abacus.util.u.Nullable;
import com.landawn.abacus.util.stream.IntStream;
import com.landawn.abacus.util.stream.ObjIteratorEx;
import com.landawn.abacus.util.stream.Stream;
/**
*
* @since 0.8
*
* @author Haiyang Li
*/
public final class Matrix extends AbstractMatrix, Stream, Stream>, Matrix> {
private final Class arrayType;
private final Class componentType;
public Matrix(final T[][] a) {
super(a);
this.arrayType = (Class) this.a.getClass().getComponentType();
this.componentType = (Class) this.arrayType.getComponentType();
}
@SafeVarargs
public static Matrix of(final T[]... a) {
return new Matrix<>(a);
}
public static Matrix repeat(final T val, final int len) {
final T[][] c = N.newArray(N.newArray(val.getClass(), 0).getClass(), 1);
c[0] = Array.repeat(val, len);
return new Matrix<>(c);
}
public static Matrix diagonalLU2RD(final T[] leftUp2RighDownDiagonal) {
return diagonal(leftUp2RighDownDiagonal, null);
}
public static Matrix diagonalRU2LD(final T[] rightUp2LeftDownDiagonal) {
return diagonal(null, rightUp2LeftDownDiagonal);
}
public static Matrix diagonal(final T[] leftUp2RighDownDiagonal, T[] rightUp2LeftDownDiagonal) {
N.checkArgument(
N.isNullOrEmpty(leftUp2RighDownDiagonal) || N.isNullOrEmpty(rightUp2LeftDownDiagonal)
|| leftUp2RighDownDiagonal.length == rightUp2LeftDownDiagonal.length,
"The length of 'leftUp2RighDownDiagonal' and 'rightUp2LeftDownDiagonal' must be same");
final Class arrayClass = leftUp2RighDownDiagonal != null ? leftUp2RighDownDiagonal.getClass() : rightUp2LeftDownDiagonal.getClass();
final Class componentClass = arrayClass.getComponentType();
final int len = leftUp2RighDownDiagonal != null ? leftUp2RighDownDiagonal.length : rightUp2LeftDownDiagonal.length;
final T[][] c = N.newArray(arrayClass, len);
for (int i = 0; i < len; i++) {
c[i] = N.newArray(componentClass, len);
}
if (N.isNullOrEmpty(leftUp2RighDownDiagonal)) {
if (N.isNullOrEmpty(rightUp2LeftDownDiagonal)) {
return new Matrix<>(c);
} else {
for (int i = 0, j = len - 1; i < len; i++, j--) {
c[i][j] = rightUp2LeftDownDiagonal[i];
}
return new Matrix<>(c);
}
} else {
for (int i = 0; i < len; i++) {
c[i][i] = leftUp2RighDownDiagonal[i];
}
if (N.notNullOrEmpty(rightUp2LeftDownDiagonal)) {
for (int i = 0, j = len - 1; i < len; i++, j--) {
c[i][j] = rightUp2LeftDownDiagonal[i];
}
}
return new Matrix<>(c);
}
}
public T get(final int i, final int j) {
return a[i][j];
}
public T get(final IntPair point) {
return a[point._1][point._2];
}
public void set(final int i, final int j, final T val) {
a[i][j] = val;
}
public void set(final IntPair point, final T val) {
a[point._1][point._2] = val;
}
public Nullable upOf(final int i, final int j) {
return i == 0 ? Nullable. empty() : Nullable.of(a[i - 1][j]);
}
public Nullable downOf(final int i, final int j) {
return i == rows - 1 ? Nullable. empty() : Nullable.of(a[i + 1][j]);
}
public Nullable leftOf(final int i, final int j) {
return j == 0 ? Nullable. empty() : Nullable.of(a[i][j - 1]);
}
public Nullable rightOf(final int i, final int j) {
return j == cols - 1 ? Nullable. empty() : Nullable.of(a[i][j + 1]);
}
/**
* Returns the four adjacencies with order: up, right, down, left. null is set if the adjacency doesn't exist.
*
* @param i
* @param j
* @return
*/
public Stream adjacent4Points(final int i, final int j) {
final IntPair up = i == 0 ? null : IntPair.of(i - 1, j);
final IntPair right = j == cols - 1 ? null : IntPair.of(i, j + 1);
final IntPair down = i == rows - 1 ? null : IntPair.of(i + 1, j);
final IntPair left = j == 0 ? null : IntPair.of(i, j - 1);
return Stream.of(up, right, down, left);
}
/**
* Returns the eight adjacencies with order: left-up, up, right-up, right, right-down, down, left-down, left. null is set if the adjacency doesn't exist.
*
* @param i
* @param j
* @return
*/
public Stream adjacent8Points(final int i, final int j) {
final IntPair up = i == 0 ? null : IntPair.of(i - 1, j);
final IntPair right = j == cols - 1 ? null : IntPair.of(i, j + 1);
final IntPair down = i == rows - 1 ? null : IntPair.of(i + 1, j);
final IntPair left = j == 0 ? null : IntPair.of(i, j - 1);
final IntPair leftUp = i > 0 && j > 0 ? IntPair.of(i - 1, j - 1) : null;
final IntPair rightUp = i > 0 && j < cols - 1 ? IntPair.of(i - 1, j + 1) : null;
final IntPair rightDown = i < rows - 1 && j < cols - 1 ? IntPair.of(j + 1, j + 1) : null;
final IntPair leftDown = i < rows - 1 && j > 0 ? IntPair.of(i + 1, j - 1) : null;
return Stream.of(leftUp, up, rightUp, right, rightDown, down, leftDown, left);
}
public T[] row(final int rowIndex) {
N.checkArgument(rowIndex >= 0 && rowIndex < rows, "Invalid row Index: %s", rowIndex);
return a[rowIndex];
}
public T[] column(final int columnIndex) {
N.checkArgument(columnIndex >= 0 && columnIndex < cols, "Invalid column Index: %s", columnIndex);
final T[] c = N.newArray(componentType, rows);
for (int i = 0; i < rows; i++) {
c[i] = a[i][columnIndex];
}
return c;
}
public void setRow(int rowIndex, T[] row) {
N.checkArgument(row.length == cols, "The size of the specified row doesn't match the length of column");
N.copy(row, 0, a[rowIndex], 0, cols);
}
public void setColumn(int columnIndex, T[] column) {
N.checkArgument(column.length == rows, "The size of the specified column doesn't match the length of row");
for (int i = 0; i < rows; i++) {
a[i][columnIndex] = column[i];
}
}
public void updateRow(int rowIndex, Try.UnaryOperator func) throws E {
for (int i = 0; i < cols; i++) {
a[rowIndex][i] = func.apply(a[rowIndex][i]);
}
}
public void updateColumn(int columnIndex, Try.UnaryOperator func) throws E {
for (int i = 0; i < rows; i++) {
a[i][columnIndex] = func.apply(a[i][columnIndex]);
}
}
public T[] getLU2RD() {
N.checkState(rows == cols, "'rows' and 'cols' must be same to get diagonals: rows=%s, cols=%s", rows, cols);
final T[] res = N.newArray(componentType, rows);
for (int i = 0; i < rows; i++) {
res[i] = a[i][i];
}
return res;
}
public void setLU2RD(final T[] diagonal) {
N.checkState(rows == cols, "'rows' and 'cols' must be same to get diagonals: rows=%s, cols=%s", rows, cols);
N.checkArgument(diagonal.length >= rows, "The length of specified array is less than rows=%s", rows);
for (int i = 0; i < rows; i++) {
a[i][i] = diagonal[i];
}
}
public void updateLU2RD(final Try.UnaryOperator func) throws E {
N.checkState(rows == cols, "'rows' and 'cols' must be same to get diagonals: rows=%s, cols=%s", rows, cols);
for (int i = 0; i < rows; i++) {
a[i][i] = func.apply(a[i][i]);
}
}
public T[] getRU2LD() {
N.checkState(rows == cols, "'rows' and 'cols' must be same to get diagonals: rows=%s, cols=%s", rows, cols);
final T[] res = N.newArray(componentType, rows);
for (int i = 0; i < rows; i++) {
res[i] = a[i][cols - i - 1];
}
return res;
}
public void setRU2LD(final T[] diagonal) {
N.checkState(rows == cols, "'rows' and 'cols' must be same to get diagonals: rows=%s, cols=%s", rows, cols);
N.checkArgument(diagonal.length >= rows, "The length of specified array is less than rows=%s", rows);
for (int i = 0; i < rows; i++) {
a[i][cols - i - 1] = diagonal[i];
}
}
public void updateRU2LD(final Try.UnaryOperator func) throws E {
N.checkState(rows == cols, "'rows' and 'cols' must be same to get diagonals: rows=%s, cols=%s", rows, cols);
for (int i = 0; i < rows; i++) {
a[i][cols - i - 1] = func.apply(a[i][cols - i - 1]);
}
}
public void updateAll(final Try.UnaryOperator func) throws E {
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
a[i][j] = func.apply(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
a[i][j] = func.apply(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
a[i][j] = func.apply(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
a[i][j] = func.apply(a[i][j]);
}
}
}
}
}
/**
* Update all elements based on points
*
* @param func
*/
public void updateAll(final Try.IntBiFunction func) throws E {
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
a[i][j] = func.apply(i, j);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
a[i][j] = func.apply(i, j);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
a[i][j] = func.apply(i, j);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
a[i][j] = func.apply(i, j);
}
}
}
}
}
public void replaceIf(final Try.Predicate predicate, final T newValue) throws E {
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
a[i][j] = predicate.test(a[i][j]) ? newValue : a[i][j];
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
a[i][j] = predicate.test(a[i][j]) ? newValue : a[i][j];
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
a[i][j] = predicate.test(a[i][j]) ? newValue : a[i][j];
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
a[i][j] = predicate.test(a[i][j]) ? newValue : a[i][j];
}
}
}
}
}
/**
* Replace elements by Predicate.test(i, j) based on points
*
* @param predicate
* @param newValue
*/
public void replaceIf(final Try.IntBiPredicate predicate, final T newValue) throws E {
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
a[i][j] = predicate.test(i, j) ? newValue : a[i][j];
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
a[i][j] = predicate.test(i, j) ? newValue : a[i][j];
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
a[i][j] = predicate.test(i, j) ? newValue : a[i][j];
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
a[i][j] = predicate.test(i, j) ? newValue : a[i][j];
}
}
}
}
}
public Matrix map(final Try.UnaryOperator func) throws E {
return map(this.componentType, func);
}
public Matrix map(final Class cls, final Try.Function func) throws E {
final R[][] c = N.newArray(N.newArray(cls, 0).getClass(), rows);
for (int i = 0; i < rows; i++) {
c[i] = N.newArray(cls, cols);
}
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.apply(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.apply(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.apply(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.apply(a[i][j]);
}
}
}
}
return Matrix.of(c);
}
public BooleanMatrix mapToBoolean(final Try.ToBooleanFunction func) throws E {
final boolean[][] c = new boolean[rows][cols];
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsBoolean(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsBoolean(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsBoolean(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsBoolean(a[i][j]);
}
}
}
}
return BooleanMatrix.of(c);
}
public ByteMatrix mapToByte(final Try.ToByteFunction func) throws E {
final byte[][] c = new byte[rows][cols];
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsByte(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsByte(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsByte(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsByte(a[i][j]);
}
}
}
}
return ByteMatrix.of(c);
}
public CharMatrix mapToChar(final Try.ToCharFunction func) throws E {
final char[][] c = new char[rows][cols];
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsChar(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsChar(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsChar(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsChar(a[i][j]);
}
}
}
}
return CharMatrix.of(c);
}
public ShortMatrix mapToShort(final Try.ToShortFunction func) throws E {
final short[][] c = new short[rows][cols];
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsShort(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsShort(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsShort(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsShort(a[i][j]);
}
}
}
}
return ShortMatrix.of(c);
}
public IntMatrix mapToInt(final Try.ToIntFunction func) throws E {
final int[][] c = new int[rows][cols];
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsInt(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsInt(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsInt(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsInt(a[i][j]);
}
}
}
}
return IntMatrix.of(c);
}
public LongMatrix mapToLong(final Try.ToLongFunction func) throws E {
final long[][] c = new long[rows][cols];
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsLong(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsLong(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsLong(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsLong(a[i][j]);
}
}
}
}
return LongMatrix.of(c);
}
public FloatMatrix mapToFloat(final Try.ToFloatFunction func) throws E {
final float[][] c = new float[rows][cols];
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsFloat(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsFloat(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsFloat(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsFloat(a[i][j]);
}
}
}
}
return FloatMatrix.of(c);
}
public DoubleMatrix mapToDouble(final Try.ToDoubleFunction func) throws E {
final double[][] c = new double[rows][cols];
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsDouble(a[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsDouble(a[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
c[i][j] = func.applyAsDouble(a[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
c[i][j] = func.applyAsDouble(a[i][j]);
}
}
}
}
return DoubleMatrix.of(c);
}
public void fill(final T val) {
for (int i = 0; i < rows; i++) {
N.fill(a[i], val);
}
}
public void fill(final T[][] b) {
fill(0, 0, b);
}
public void fill(final int fromRowIndex, final int fromColumnIndex, final T[][] b) {
N.checkFromToIndex(fromRowIndex, rows, rows);
N.checkFromToIndex(fromColumnIndex, cols, cols);
for (int i = 0, minLen = N.min(rows - fromRowIndex, b.length); i < minLen; i++) {
N.copy(b[i], 0, a[i + fromRowIndex], fromColumnIndex, N.min(b[i].length, cols - fromColumnIndex));
}
}
@Override
public Matrix copy() {
final T[][] c = N.newArray(arrayType, rows);
for (int i = 0; i < rows; i++) {
c[i] = a[i].clone();
}
return new Matrix<>(c);
}
@Override
public Matrix copy(final int fromRowIndex, final int toRowIndex) {
N.checkFromToIndex(fromRowIndex, toRowIndex, rows);
final T[][] c = N.newArray(arrayType, toRowIndex - fromRowIndex);
for (int i = fromRowIndex; i < toRowIndex; i++) {
c[i - fromRowIndex] = a[i].clone();
}
return new Matrix<>(c);
}
@Override
public Matrix copy(final int fromRowIndex, final int toRowIndex, final int fromColumnIndex, final int toColumnIndex) {
N.checkFromToIndex(fromRowIndex, toRowIndex, rows);
N.checkFromToIndex(fromColumnIndex, toColumnIndex, cols);
final T[][] c = N.newArray(arrayType, toRowIndex - fromRowIndex);
for (int i = fromRowIndex; i < toRowIndex; i++) {
c[i - fromRowIndex] = N.copyOfRange(a[i], fromColumnIndex, toColumnIndex);
}
return new Matrix<>(c);
}
public Matrix extend(final int newRows, final int newCols) {
return extend(newRows, newCols, null);
}
public Matrix extend(final int newRows, final int newCols, final T defaultValueForNewCell) {
N.checkArgument(newRows >= 0, "The 'newRows' can't be negative %s", newRows);
N.checkArgument(newCols >= 0, "The 'newCols' can't be negative %s", newCols);
if (newRows <= rows && newCols <= cols) {
return copy(0, newRows, 0, newCols);
} else {
final boolean fillDefaultValue = defaultValueForNewCell != null;
final T[][] b = N.newArray(arrayType, newRows);
for (int i = 0; i < newRows; i++) {
b[i] = i < rows ? N.copyOf(a[i], newCols) : (T[]) N.newArray(componentType, newCols);
if (fillDefaultValue) {
if (i >= rows) {
N.fill(b[i], defaultValueForNewCell);
} else if (cols < newCols) {
N.fill(b[i], cols, newCols, defaultValueForNewCell);
}
}
}
return new Matrix(b);
}
}
public Matrix extend(final int toUp, final int toDown, final int toLeft, final int toRight) {
return extend(toUp, toDown, toLeft, toRight, null);
}
public Matrix extend(final int toUp, final int toDown, final int toLeft, final int toRight, final T defaultValueForNewCell) {
N.checkArgument(toUp >= 0, "The 'toUp' can't be negative %s", toUp);
N.checkArgument(toDown >= 0, "The 'toDown' can't be negative %s", toDown);
N.checkArgument(toLeft >= 0, "The 'toLeft' can't be negative %s", toLeft);
N.checkArgument(toRight >= 0, "The 'toRight' can't be negative %s", toRight);
if (toUp == 0 && toDown == 0 && toLeft == 0 && toRight == 0) {
return copy();
} else {
final int newRows = toUp + rows + toDown;
final int newCols = toLeft + cols + toRight;
final boolean fillDefaultValue = defaultValueForNewCell != null;
final T[][] b = N.newArray(arrayType, newRows);
for (int i = 0; i < newRows; i++) {
b[i] = N.newArray(componentType, newCols);
if (i >= toUp && i < toUp + rows) {
N.copy(a[i - toUp], 0, b[i], toLeft, cols);
}
if (fillDefaultValue) {
if (i < toUp || i >= toUp + rows) {
N.fill(b[i], defaultValueForNewCell);
} else if (cols < newCols) {
if (toLeft > 0) {
N.fill(b[i], 0, toLeft, defaultValueForNewCell);
}
if (toRight > 0) {
N.fill(b[i], cols + toLeft, newCols, defaultValueForNewCell);
}
}
}
}
return new Matrix(b);
}
}
public void reverseH() {
for (int i = 0; i < rows; i++) {
N.reverse(a[i]);
}
}
public void reverseV() {
for (int j = 0; j < cols; j++) {
T tmp = null;
for (int l = 0, h = rows - 1; l < h;) {
tmp = a[l][j];
a[l++][j] = a[h][j];
a[h--][j] = tmp;
}
}
}
/**
*
* @return
* @see IntMatrix#flipH()
*/
public Matrix flipH() {
final Matrix res = this.copy();
res.reverseH();
return res;
}
/**
*
* @return
* @see IntMatrix#flipV()
*/
public Matrix flipV() {
final Matrix res = this.copy();
res.reverseV();
return res;
}
@Override
public Matrix rotate90() {
final T[][] c = N.newArray(arrayType, cols);
for (int i = 0; i < cols; i++) {
c[i] = N.newArray(this.componentType, rows);
}
if (rows <= cols) {
for (int j = 0; j < rows; j++) {
for (int i = 0; i < cols; i++) {
c[i][j] = a[rows - j - 1][i];
}
}
} else {
for (int i = 0; i < cols; i++) {
for (int j = 0; j < rows; j++) {
c[i][j] = a[rows - j - 1][i];
}
}
}
return new Matrix<>(c);
}
@Override
public Matrix rotate180() {
final T[][] c = N.newArray(arrayType, rows);
for (int i = 0; i < rows; i++) {
c[i] = a[rows - i - 1].clone();
N.reverse(c[i]);
}
return new Matrix<>(c);
}
@Override
public Matrix rotate270() {
final T[][] c = N.newArray(arrayType, cols);
for (int i = 0; i < cols; i++) {
c[i] = N.newArray(this.componentType, rows);
}
if (rows <= cols) {
for (int j = 0; j < rows; j++) {
for (int i = 0; i < cols; i++) {
c[i][j] = a[j][cols - i - 1];
}
}
} else {
for (int i = 0; i < cols; i++) {
for (int j = 0; j < rows; j++) {
c[i][j] = a[j][cols - i - 1];
}
}
}
return new Matrix<>(c);
}
@Override
public Matrix transpose() {
final T[][] c = N.newArray(arrayType, cols);
for (int i = 0; i < cols; i++) {
c[i] = N.newArray(componentType, rows);
}
if (rows <= cols) {
for (int j = 0; j < rows; j++) {
for (int i = 0; i < cols; i++) {
c[i][j] = a[j][i];
}
}
} else {
for (int i = 0; i < cols; i++) {
for (int j = 0; j < rows; j++) {
c[i][j] = a[j][i];
}
}
}
return new Matrix<>(c);
}
@Override
public Matrix reshape(final int newRows, final int newCols) {
final T[][] c = N.newArray(arrayType, newRows);
for (int i = 0; i < newRows; i++) {
c[i] = N.newArray(componentType, newCols);
}
if (newRows == 0 || newCols == 0 || N.isNullOrEmpty(a)) {
return new Matrix<>(c);
}
if (a.length == 1) {
final T[] a0 = a[0];
for (int i = 0, len = (int) N.min(newRows, count % newCols == 0 ? count / newCols : count / newCols + 1); i < len; i++) {
N.copy(a0, i * newCols, c[i], 0, (int) N.min(newCols, count - i * newCols));
}
} else {
long cnt = 0;
for (int i = 0, len = (int) N.min(newRows, count % newCols == 0 ? count / newCols : count / newCols + 1); i < len; i++) {
for (int j = 0, col = (int) N.min(newCols, count - i * newCols); j < col; j++, cnt++) {
c[i][j] = a[(int) (cnt / this.cols)][(int) (cnt % this.cols)];
}
}
}
return new Matrix<>(c);
}
/**
* Repeat elements rowRepeats times in row direction and colRepeats times in column direction.
*
* @param rowRepeats
* @param colRepeats
* @return a new matrix
* @see IntMatrix#repelem(int, int)
*/
@Override
public Matrix repelem(final int rowRepeats, final int colRepeats) {
N.checkArgument(rowRepeats > 0 && colRepeats > 0, "rowRepeats=%s and colRepeats=%s must be bigger than 0", rowRepeats, colRepeats);
final T[][] c = N.newArray(arrayType, rows * rowRepeats);
for (int i = 0, len = c.length; i < len; i++) {
c[i] = N.newArray(componentType, cols * colRepeats);
}
for (int i = 0; i < rows; i++) {
final T[] fr = c[i * rowRepeats];
for (int j = 0; j < cols; j++) {
N.copy(Array.repeat(a[i][j], colRepeats), 0, fr, j * colRepeats, colRepeats);
}
for (int k = 1; k < rowRepeats; k++) {
N.copy(fr, 0, c[i * rowRepeats + k], 0, fr.length);
}
}
return new Matrix(c);
}
/**
* Repeat this matrix rowRepeats times in row direction and colRepeats times in column direction.
*
* @param rowRepeats
* @param colRepeats
* @return a new matrix
* @see IntMatrix#repmat(int, int)
*/
@Override
public Matrix repmat(final int rowRepeats, final int colRepeats) {
N.checkArgument(rowRepeats > 0 && colRepeats > 0, "rowRepeats=%s and colRepeats=%s must be bigger than 0", rowRepeats, colRepeats);
final T[][] c = N.newArray(arrayType, rows * rowRepeats);
for (int i = 0, len = c.length; i < len; i++) {
c[i] = N.newArray(componentType, cols * colRepeats);
}
for (int i = 0; i < rows; i++) {
for (int j = 0; j < colRepeats; j++) {
N.copy(a[i], 0, c[i], j * cols, cols);
}
}
for (int i = 1; i < rowRepeats; i++) {
for (int j = 0; j < rows; j++) {
N.copy(c[j], 0, c[i * rows + j], 0, c[j].length);
}
}
return new Matrix(c);
}
@Override
public List flatten() {
final T[] c = N.newArray(componentType, rows * cols);
for (int i = 0; i < rows; i++) {
N.copy(a[i], 0, c, i * cols, cols);
}
return N.asList(c);
}
@Override
public void flatOp(Consumer op) throws E {
ff.flatOp(a, op);
}
/**
*
* @param b
* @return
* @see IntMatrix#vstack(IntMatrix)
*/
public Matrix vstack(final Matrix b) {
N.checkArgument(this.cols == b.cols, "The count of column in this matrix and the specified matrix are not equals");
final T[][] c = N.newArray(arrayType, this.rows + b.rows);
int j = 0;
for (int i = 0; i < rows; i++) {
c[j++] = a[i].clone();
}
for (int i = 0; i < b.rows; i++) {
c[j++] = b.a[i].clone();
}
return Matrix.of(c);
}
/**
*
* @param b
* @return
* @see IntMatrix#hstack(IntMatrix)
*/
public Matrix hstack(final Matrix b) {
N.checkArgument(this.rows == b.rows, "The count of row in this matrix and the specified matrix are not equals");
final T[][] c = N.newArray(arrayType, rows);
for (int i = 0; i < rows; i++) {
c[i] = N.copyOf(a[i], cols + b.cols);
N.copy(b.a[i], 0, c[i], cols, b.cols);
}
return Matrix.of(c);
}
public Matrix zipWith(final Matrix matrixB, final Try.BiFunction zipFunction) throws E {
return zipWith(componentType, matrixB, zipFunction);
}
public Matrix zipWith(final Class cls, final Matrix matrixB,
final Try.BiFunction zipFunction) throws E {
N.checkArgument(rows == matrixB.rows && cols == matrixB.cols, "Can't zip two matrices which have different shape.");
final R[][] result = N.newArray(N.newArray(cls, 0).getClass(), rows);
for (int i = 0; i < rows; i++) {
result[i] = N.newArray(cls, cols);
}
final B[][] b = matrixB.a;
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
result[i][j] = zipFunction.apply(a[i][j], b[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
result[i][j] = zipFunction.apply(a[i][j], b[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
result[i][j] = zipFunction.apply(a[i][j], b[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
result[i][j] = zipFunction.apply(a[i][j], b[i][j]);
}
}
}
}
return new Matrix<>(result);
}
public Matrix zipWith(final Matrix matrixB, final Matrix matrixC,
final Try.TriFunction zipFunction) throws E {
return zipWith(componentType, matrixB, matrixC, zipFunction);
}
public Matrix zipWith(final Class cls, final Matrix matrixB, final Matrix matrixC,
final Try.TriFunction zipFunction) throws E {
N.checkArgument(rows == matrixB.rows && cols == matrixB.cols, "Can't zip two matrices which have different shape.");
final R[][] result = N.newArray(N.newArray(cls, 0).getClass(), rows);
for (int i = 0; i < rows; i++) {
result[i] = N.newArray(cls, cols);
}
final B[][] b = matrixB.a;
final C[][] c = matrixC.a;
if (isParallelable()) {
if (rows <= cols) {
IntStream.range(0, rows).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int i) throws E {
for (int j = 0; j < cols; j++) {
result[i][j] = zipFunction.apply(a[i][j], b[i][j], c[i][j]);
}
}
});
} else {
IntStream.range(0, cols).parallel().forEach(new Try.IntConsumer() {
@Override
public void accept(final int j) throws E {
for (int i = 0; i < rows; i++) {
result[i][j] = zipFunction.apply(a[i][j], b[i][j], c[i][j]);
}
}
});
}
} else {
if (rows <= cols) {
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
result[i][j] = zipFunction.apply(a[i][j], b[i][j], c[i][j]);
}
}
} else {
for (int j = 0; j < cols; j++) {
for (int i = 0; i < rows; i++) {
result[i][j] = zipFunction.apply(a[i][j], b[i][j], c[i][j]);
}
}
}
}
return new Matrix<>(result);
}
/**
*
* @return a stream composed by elements on the diagonal line from left up to right down.
*/
@Override
public Stream streamLU2RD() {
N.checkState(rows == cols, "'rows' and 'cols' must be same to get diagonals: rows=%s, cols=%s", rows, cols);
if (isEmpty()) {
return Stream.empty();
}
return Stream.of(new ObjIteratorEx() {
private final int toIndex = rows;
private int cursor = 0;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public T next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return a[cursor][cursor++];
}
@Override
public void skip(long n) {
N.checkArgNotNegative(n, "n");
cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
}
@Override
public long count() {
return toIndex - cursor;
}
});
}
/**
*
* @return a stream composed by elements on the diagonal line from right up to left down.
*/
@Override
public Stream streamRU2LD() {
N.checkState(rows == cols, "'rows' and 'cols' must be same to get diagonals: rows=%s, cols=%s", rows, cols);
if (isEmpty()) {
return Stream.empty();
}
return Stream.of(new ObjIteratorEx() {
private final int toIndex = rows;
private int cursor = 0;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public T next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return a[cursor][rows - ++cursor];
}
@Override
public void skip(long n) {
N.checkArgNotNegative(n, "n");
cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
}
@Override
public long count() {
return toIndex - cursor;
}
});
}
/**
*
* @return a stream based on the order of row.
*/
@Override
public Stream streamH() {
return streamH(0, rows);
}
@Override
public Stream streamH(final int rowIndex) {
return streamH(rowIndex, rowIndex + 1);
}
/**
*
* @param fromRowIndex
* @param toRowIndex
* @return a stream based on the order of row.
*/
@Override
public Stream streamH(final int fromRowIndex, final int toRowIndex) {
N.checkFromToIndex(fromRowIndex, toRowIndex, rows);
if (isEmpty()) {
return Stream.empty();
}
return Stream.of(new ObjIteratorEx() {
private int i = fromRowIndex;
private int j = 0;
@Override
public boolean hasNext() {
return i < toRowIndex;
}
@Override
public T next() {
if (i >= toRowIndex) {
throw new NoSuchElementException();
}
final T result = a[i][j++];
if (j >= cols) {
i++;
j = 0;
}
return result;
}
@Override
public void skip(long n) {
N.checkArgNotNegative(n, "n");
if (n >= (toRowIndex - i) * cols * 1L - j) {
i = toRowIndex;
j = 0;
} else {
i += (n + j) / cols;
j += (n + j) % cols;
}
}
@Override
public long count() {
return (toRowIndex - i) * cols * 1L - j;
}
@Override
public A[] toArray(A[] c) {
final int len = (int) count();
if (c.length < len) {
c = N.copyOf(c, len);
}
for (int k = 0; k < len; k++) {
c[k] = (A) a[i][j++];
if (j >= cols) {
i++;
j = 0;
}
}
return c;
}
});
}
/**
*
* @return a stream based on the order of column.
*/
@Override
@Beta
public Stream streamV() {
return streamV(0, cols);
}
@Override
public Stream streamV(final int columnIndex) {
return streamV(columnIndex, columnIndex + 1);
}
/**
*
* @param fromColumnIndex
* @param toColumnIndex
* @return a stream based on the order of column.
*/
@Beta
@Override
public Stream streamV(final int fromColumnIndex, final int toColumnIndex) {
N.checkFromToIndex(fromColumnIndex, toColumnIndex, cols);
if (isEmpty()) {
return Stream.empty();
}
return Stream.of(new ObjIteratorEx() {
private int i = 0;
private int j = fromColumnIndex;
@Override
public boolean hasNext() {
return j < toColumnIndex;
}
@Override
public T next() {
if (j >= toColumnIndex) {
throw new NoSuchElementException();
}
final T result = a[i++][j];
if (i >= rows) {
i = 0;
j++;
}
return result;
}
@Override
public void skip(long n) {
N.checkArgNotNegative(n, "n");
if (n >= (toColumnIndex - j) * Matrix.this.rows * 1L - i) {
i = 0;
j = toColumnIndex;
} else {
i += (n + i) % Matrix.this.rows;
j += (n + i) / Matrix.this.rows;
}
}
@Override
public long count() {
return (toColumnIndex - j) * rows - i;
}
@Override
public A[] toArray(A[] c) {
final int len = (int) count();
if (c.length < len) {
c = N.copyOf(c, len);
}
for (int k = 0; k < len; k++) {
c[k] = (A) a[i++][j];
if (i >= rows) {
i = 0;
j++;
}
}
return c;
}
});
}
/**
*
* @return a row stream based on the order of row.
*/
@Override
public Stream> streamR() {
return streamR(0, rows);
}
/**
*
* @param fromRowIndex
* @param toRowIndex
* @return a row stream based on the order of row.
*/
@Override
public Stream> streamR(final int fromRowIndex, final int toRowIndex) {
N.checkFromToIndex(fromRowIndex, toRowIndex, rows);
if (isEmpty()) {
return Stream.empty();
}
return Stream.of(new ObjIteratorEx>() {
private final int toIndex = toRowIndex;
private int cursor = fromRowIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public Stream next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return Stream.of(a[cursor++]);
}
@Override
public void skip(long n) {
N.checkArgNotNegative(n, "n");
cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
}
@Override
public long count() {
return toIndex - cursor;
}
});
}
/**
*
* @return a column stream based on the order of column.
*/
@Override
@Beta
public Stream> streamC() {
return streamC(0, cols);
}
/**
*
* @param fromColumnIndex
* @param toColumnIndex
* @return a column stream based on the order of column.
*/
@Override
@Beta
public Stream> streamC(final int fromColumnIndex, final int toColumnIndex) {
N.checkFromToIndex(fromColumnIndex, toColumnIndex, cols);
if (isEmpty()) {
return Stream.empty();
}
return Stream.of(new ObjIteratorEx>() {
private final int toIndex = toColumnIndex;
private volatile int cursor = fromColumnIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public Stream next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return Stream.of(new ObjIteratorEx() {
private final int columnIndex = cursor++;
private final int toIndex2 = rows;
private int cursor2 = 0;
@Override
public boolean hasNext() {
return cursor2 < toIndex2;
}
@Override
public T next() {
if (cursor2 >= toIndex2) {
throw new NoSuchElementException();
}
return a[cursor2++][columnIndex];
}
@Override
public void skip(long n) {
N.checkArgNotNegative(n, "n");
cursor2 = n < toIndex2 - cursor2 ? cursor2 + (int) n : toIndex2;
}
@Override
public long count() {
return toIndex2 - cursor2;
}
});
}
@Override
public void skip(long n) {
N.checkArgNotNegative(n, "n");
cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
}
@Override
public long count() {
return toIndex - cursor;
}
});
}
@Override
protected int length(T[] a) {
return a == null ? 0 : a.length;
}
public void forEach(final Try.Consumer action) throws E {
forEach(0, rows, 0, cols, action);
}
public void forEach(final int fromRowIndex, final int toRowIndex, final int fromColumnIndex, final int toColumnIndex,
final Try.Consumer action) throws E {
N.checkFromToIndex(fromRowIndex, toRowIndex, rows);
N.checkFromToIndex(fromColumnIndex, toColumnIndex, cols);
for (int i = fromRowIndex; i < toRowIndex; i++) {
for (int j = fromColumnIndex; j < toColumnIndex; j++) {
action.accept(a[i][j]);
}
}
}
@Override
public void println() {
ff.println(a);
}
@Override
public int hashCode() {
return N.deepHashCode(a);
}
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj instanceof Matrix) {
final Matrix another = (Matrix) obj;
return N.deepEquals(this.a, another.a);
}
return false;
}
@Override
public String toString() {
return N.deepToString(a);
}
}