@Override public double get( final int index) { return this.internalVector.get(index); }
@Override public double get(int aParamInt) { return wrapped.get(aParamInt); }
@Override public Double getValue(int aParamInt) { return wrapped.get(aParamInt); }
@Override public double getElement( int index) { return this.internalVector.get( index ); }
@Override public double get( final int index) { return this.internalVector.get(index); }
@Override public double add(int aParamInt, double aParamDouble) { wrapped.add(aParamInt, aParamDouble); return wrapped.get(aParamInt); }
private static double getMinOverlap(Vector vec1, Vector vec2) { double vectorOverlap = 0.0; for (VectorEntry e : vec1) { double n = vec2.get(e.index()); if (n != 0.0) { vectorOverlap += min(e.get(), n); } } return vectorOverlap; }
private static double getMinOverlap(Vector vec1, Vector vec2) { double vectorOverlap = 0.0; for (VectorEntry e : vec1) { double n = vec2.get(e.index()); if (n != 0.0) { vectorOverlap += min(e.get(), n); } } return vectorOverlap; }
@Override public Vector multAdd(double alpha, Vector x, Vector y) { checkMultAdd(x, y); if (alpha == 0) return y; Node node = links.head; while (node != null) { y.add(node.row, alpha * node.val * x.get(node.col)); node = node.rowTail; } return y; }
@Override public Vector transMultAdd(double alpha, Vector x, Vector y) { checkTransMultAdd(x, y); if (alpha == 0) return y; Node node = links.head; while (node != null) { y.add(node.col, alpha * node.val * x.get(node.row)); node = node.colTail; } return y; }
@Override public Vector transMultAdd(double alpha, Vector x, Vector y) { checkTransMultAdd(x, y); if (alpha == 0) return y; Node node = links.head; while (node != null) { y.add(node.col, alpha * node.val * x.get(node.row)); node = node.colTail; } return y; }
@Override public Vector multAdd(double alpha, Vector x, Vector y) { checkMultAdd(x, y); if (alpha == 0) return y; Node node = links.head; while (node != null) { y.add(node.row, alpha * node.val * x.get(node.col)); node = node.rowTail; } return y; }
private static double getLeskOverlap(Vector vec1, Vector vec2) { double vectorOverlap = 0.0; for (VectorEntry e : vec1) { double n = vec2.get(e.index()); if (n != 0.0) { vectorOverlap += e.get() + n; } } return vectorOverlap; }
private static double getLeskOverlap(Vector vec1, Vector vec2) { double vectorOverlap = 0.0; for (VectorEntry e : vec1) { double n = vec2.get(e.index()); if (n != 0.0) { vectorOverlap += e.get() + n; } } return vectorOverlap; }
public double dot(Vector y) { checkSize(y); double ret = 0; for (VectorEntry e : this) ret += e.get() * y.get(e.index()); return ret; }
public double dot(Vector y) { checkSize(y); double ret = 0; for (VectorEntry e : this) ret += e.get() * y.get(e.index()); return ret; }
public Vector multAdd(double alpha, Vector x, Vector y) { checkMultAdd(x, y); if (alpha != 0) for (MatrixEntry e : this) y.add(e.row(), alpha * e.get() * x.get(e.column())); return y; }
public Vector transMultAdd(double alpha, Vector x, Vector y) { checkTransMultAdd(x, y); if (alpha != 0) for (MatrixEntry e : this) y.add(e.column(), alpha * e.get() * x.get(e.row())); return y; }
public Vector multAdd(double alpha, Vector x, Vector y) { checkMultAdd(x, y); if (alpha != 0) for (MatrixEntry e : this) y.add(e.row(), alpha * e.get() * x.get(e.column())); return y; }
public Vector transMultAdd(double alpha, Vector x, Vector y) { checkTransMultAdd(x, y); if (alpha != 0) for (MatrixEntry e : this) y.add(e.column(), alpha * e.get() * x.get(e.row())); return y; }