A question on the performance of AbstractVector operations like times
public Vector times(double x) {
Vector result = clone();
Iterator<Element> iter = iterateNonZero();
while (iter.hasNext()) {
Element element = iter.next();
int index = element.index();
result.setQuick(index, element.get() * x);
}
return result;
}
shouldnt this be like the assign mult function. Would make a big diff for
SeqAccSparseVector right?
public Vector times(double x) {
Vector result = clone();
Iterator<Element> iter = *result.*iterateNonZero();
while (iter.hasNext()) {
Element element = iter.next();
*element.set(element.get() * x);*
}
return result;
}
