public DoubleMatrix1D vectorize() { DoubleMatrix1D v = new DenseDoubleMatrix1D((int) size()); int length = rows * columns; for (int s = 0; s < slices; s++) { v.viewPart(s * length, length).assign(viewSlice(s).vectorize()); } return v; }
public DoubleMatrix1D vectorize() { DoubleMatrix1D v = new DenseDoubleMatrix1D((int) size()); int length = rows * columns; for (int s = 0; s < slices; s++) { v.viewPart(s * length, length).assign(viewSlice(s).vectorize()); } return v; }
public DoubleMatrix3D assign(final double value) { final int zero = (int) index(0, 0, 0); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
public double aggregate(final cern.colt.function.tdouble.DoubleDoubleFunction aggr, final cern.colt.function.tdouble.DoubleFunction f) { if (size() == 0) return Double.NaN; double a = 0; final int zero = (int) index(0, 0, 0); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
public DoubleMatrix3D assign(final double value) { final int zero = (int) index(0, 0, 0); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
public DoubleMatrix3D assign(final cern.colt.function.tdouble.DoubleFunction function) { final int zero = (int) index(0, 0, 0); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
public DoubleMatrix3D assign(final cern.colt.function.tdouble.DoubleFunction function) { final int zero = (int) index(0, 0, 0); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
ConcurrencyUtils.setNumberOfThreads(ConcurrencyUtils.nextPow2(oldNthreads)); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
final DenseDComplexMatrix3D C = new DenseDComplexMatrix3D(slices, rows, columns); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
final DenseDComplexMatrix3D C = new DenseDComplexMatrix3D(slices, rows, columns); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];
final DenseDComplexMatrix3D C = new DenseDComplexMatrix3D(slices, rows, columns); int nthreads = ConcurrencyUtils.getNumberOfThreads(); if ((nthreads > 1) && (size() >= ConcurrencyUtils.getThreadsBeginN_3D())) { nthreads = Math.min(nthreads, slices); Future<?>[] futures = new Future[nthreads];