@Override public void forEachNonZero( final IndexValueConsumer consumer) { final no.uib.cipr.matrix.sparse.SparseVector internal = this.getInternalVector(); final int[] indices = internal.getRawIndex(); final double[] values = internal.getData(); final int used = internal.getUsed(); for (int i = 0; i < used; i++) { final double value = values[i]; if (value != 0.0) { consumer.consume(indices[i], value); } } }
@Override public void forEachNonZero( final IndexValueConsumer consumer) { final no.uib.cipr.matrix.sparse.SparseVector internal = this.getInternalVector(); final int[] indices = internal.getRawIndex(); final double[] values = internal.getData(); final int used = internal.getUsed(); for (int i = 0; i < used; i++) { final double value = values[i]; if (value != 0.0) { consumer.consume(indices[i], value); } } }
@Override public void forEachNonZero( final IndexValueConsumer consumer) { // Default implementation uses an iterator. However, specialized // sub-classes can add optimizations. for (final VectorEntry entry : this) { final double value = entry.getValue(); if (value != 0.0) { consumer.consume(entry.getIndex(), value); } } }
@Override public void forEachNonZero( final IndexValueConsumer consumer) { final double[] values = this.getArray(); final int dimensionality = values.length; for (int i = 0; i < dimensionality; i++) { final double value = values[i]; if (value != 0.0) { consumer.consume(i, value); } } }
@Override public void forEachNonZero( final IndexValueConsumer consumer) { // Default implementation uses an iterator. However, specialized // sub-classes can add optimizations. for (final VectorEntry entry : this) { final double value = entry.getValue(); if (value != 0.0) { consumer.consume(entry.getIndex(), value); } } }
@Override public void forEachNonZero( final IndexValueConsumer consumer) { final double[] values = this.getArray(); final int dimensionality = values.length; for (int i = 0; i < dimensionality; i++) { final double value = values[i]; if (value != 0.0) { consumer.consume(i, value); } } }
@Override public void forEachNonZero( final IndexValueConsumer consumer) { final double[] values = this.getArray(); final int dimensionality = values.length; for (int i = 0; i < dimensionality; i++) { final double value = values[i]; if (value != 0.0) { consumer.consume(i, value); } } }
@Override public void forEachEntry( final IndexValueConsumer consumer) { final no.uib.cipr.matrix.sparse.SparseVector internal = this.getInternalVector(); final int[] indices = internal.getRawIndex(); final double[] values = internal.getData(); final int used = internal.getUsed(); for (int i = 0; i < used; i++) { consumer.consume(indices[i], values[i]); } }
@Override public void forEachEntry( final IndexValueConsumer consumer) { final no.uib.cipr.matrix.sparse.SparseVector internal = this.getInternalVector(); final int[] indices = internal.getRawIndex(); final double[] values = internal.getData(); final int used = internal.getUsed(); for (int i = 0; i < used; i++) { consumer.consume(indices[i], values[i]); } }
@Override public void forEachNonZero( final IndexValueConsumer consumer) { // Default implementation uses an iterator. However, specialized // sub-classes can add optimizations. for (final VectorEntry entry : this) { final double value = entry.getValue(); if (value != 0.0) { consumer.consume(entry.getIndex(), value); } } }
@Override public void forEachElement( final IndexValueConsumer consumer) { final double[] values = this.getArray(); final int dimensionality = values.length; for (int i = 0; i < dimensionality; i++) { consumer.consume(i, values[i]); } }
@Override public void forEachEntry( final IndexValueConsumer consumer) { // Default implementation uses an iterator. However, specialized // sub-classes can add optimizations. for (final VectorEntry entry : this) { consumer.consume(entry.getIndex(), entry.getValue()); } }
@Override public void forEachElement( final IndexValueConsumer consumer) { // This is by definition a dense iteration. final int dimensionality = this.getDimensionality(); for (int i = 0; i < dimensionality; i++) { consumer.consume(i, this.get(i)); } }
@Override public void forEachEntry( final IndexValueConsumer consumer) { final no.uib.cipr.matrix.sparse.SparseVector internal = this.getInternalVector(); final int[] indices = internal.getRawIndex(); final double[] values = internal.getData(); final int used = internal.getUsed(); for (int i = 0; i < used; i++) { consumer.consume(indices[i], values[i]); } }
@Override public void forEachElement( final IndexValueConsumer consumer) { final double[] values = this.getArray(); final int dimensionality = values.length; for (int i = 0; i < dimensionality; i++) { consumer.consume(i, values[i]); } }
@Override public void forEachEntry( final IndexValueConsumer consumer) { // Default implementation uses an iterator. However, specialized // sub-classes can add optimizations. for (final VectorEntry entry : this) { consumer.consume(entry.getIndex(), entry.getValue()); } }
@Override public void forEachEntry( final IndexValueConsumer consumer) { // Default implementation uses an iterator. However, specialized // sub-classes can add optimizations. for (final VectorEntry entry : this) { consumer.consume(entry.getIndex(), entry.getValue()); } }
@Override public void forEachElement( final IndexValueConsumer consumer) { final double[] values = this.getArray(); final int dimensionality = values.length; for (int i = 0; i < dimensionality; i++) { consumer.consume(i, values[i]); } }
@Override public void forEachElement( final IndexValueConsumer consumer) { // This is by definition a dense iteration. final int dimensionality = this.getDimensionality(); for (int i = 0; i < dimensionality; i++) { consumer.consume(i, this.get(i)); } }
@Override public void forEachElement( final IndexValueConsumer consumer) { // This is by definition a dense iteration. final int dimensionality = this.getDimensionality(); for (int i = 0; i < dimensionality; i++) { consumer.consume(i, this.get(i)); } }