public void run() { for (int i = firstIdx; i < lastIdx; i++) { values.setQuick(i, ix[i]); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { setQuick(i, values[i]); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { setQuick(i, value); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { values.setQuick(i, ix[i]); } } });
/** * Constructs a matrix with cells having descending values. For debugging * purposes. Example: <tt>2 1 0</tt> */ public DoubleMatrix1D descending(int size) { DoubleMatrix1D matrix = make(size); int v = 0; for (int i = size; --i >= 0;) { matrix.setQuick(i, v++); } return matrix; }
public void run() { for (int i = firstIdx; i < lastIdx; i++) { Re.setQuick(i, getQuick(i)[0]); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { setQuick(i, source.getQuick(i)); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { Im.setQuick(i, getQuick(i)[1]); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { values.setQuick(i, ix.getQuick(i)); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { Re.setQuick(i, getQuick(i)[0]); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { values.setQuick(i, ix.getQuick(i)); } } });
public void run() { double elem; for (int i = firstIdx; i < lastIdx; i++) { elem = getQuick(i); if (cond.apply(elem) == true) { setQuick(i, value); } } } });
public DoubleMatrix1D vectorize() { DoubleMatrix1D v = new DenseDoubleMatrix1D(rows * columns); int idx = 0; for (int c = 0; c < columns; c++) { for (int r = 0; r < rows; r++) { v.setQuick(idx++, getQuick(r, c)); } } return v; }
public void run() { for (int i = firstIdx; i < lastIdx; i++) { setQuick(i, f.apply(getQuick(i))); } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { setQuick(i, f.apply(getQuick(i))); } } });
public void run() { double elem; for (int i = firstIdx; i < lastIdx; i++) { elem = getQuick(i); if (cond.apply(elem) == true) { setQuick(i, value); } } } });
public void run() { for (int r = firstRow; r < lastRow; r++) { double s = 0; for (int c = 0; c < columns; c++) { s += getQuick(r, c) * y.getQuick(c); } zz.setQuick(r, alpha * s + beta * zz.getQuick(r)); } } });
public void run() { double elem; for (int i = firstIdx; i < lastIdx; i++) { elem = getQuick(i); if (cond.apply(elem) == true) { setQuick(i, f.apply(elem)); } } } });
public void run() { for (int i = firstIdx; i < lastIdx; i++) { setQuick(i, function.apply(getQuick(i), y.getQuick(i))); } } });