public TIntDoubleIterator iterator() { return m.iterator(); // Must be manually synched by user! }
public TIntDoubleIterator iterator() { return new TIntDoubleIterator() { TIntDoubleIterator iter = m.iterator(); public int key() { return iter.key(); } public double value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public double setValue( double val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
/** {@inheritDoc} */ public void putAll( TIntDoubleMap map ) { ensureCapacity( map.size() ); TIntDoubleIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
public WeightedEdgeIterator() { iter = edges.iterator(); alreadyRemoved = false; }
public TIntDoubleIterator iterator() { return m.iterator(); // Must be manually synched by user! }
public TIntDoubleIterator iterator() { return m.iterator(); // Must be manually synched by user! }
public TIntDoubleIterator iterator() { return m.iterator(); // Must be manually synched by user! }
@Override public TIntDoubleIterator iterator() { return m.iterator(); // Must be manually synched by user! }
public TIntDoubleIterator iterator() { return new TIntDoubleIterator() { TIntDoubleIterator iter = m.iterator(); public int key() { return iter.key(); } public double value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public double setValue( double val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
public TIntDoubleIterator iterator() { return new TIntDoubleIterator() { TIntDoubleIterator iter = m.iterator(); public int key() { return iter.key(); } public double value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public double setValue( double val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
public TIntDoubleIterator iterator() { return new TIntDoubleIterator() { TIntDoubleIterator iter = m.iterator(); public int key() { return iter.key(); } public double value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public double setValue( double val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
@Override protected void prepareComplete() { final double dbsize = objcnt; // Compute IDF values for(TIntDoubleIterator iter = idf.iterator(); iter.hasNext();) { iter.advance(); // Note: dbsize is a double! iter.setValue(Math.log(dbsize / iter.value())); } }
/** * Returns the sum of the weights of the edges contained in this set. */ public double sum() { double sum = 0; TIntDoubleIterator iter = edges.iterator(); while (iter.hasNext()) { iter.advance(); sum += iter.value(); } return sum; }
@Override public SparseFloatVector newNumberVector(TIntDoubleMap dvalues, int maxdim) { int[] indexes = new int[dvalues.size()]; float[] values = new float[dvalues.size()]; // Import and sort the indexes TIntDoubleIterator iter = dvalues.iterator(); for(int i = 0; iter.hasNext(); i++) { iter.advance(); indexes[i] = iter.key(); } Arrays.sort(indexes); // Import the values accordingly for(int i = 0; i < dvalues.size(); i++) { values[i] = (float) dvalues.get(indexes[i]); } return new SparseFloatVector(indexes, values, maxdim); }
/** {@inheritDoc} */ @Override public void putAll( TIntDoubleMap map ) { ensureCapacity( map.size() ); TIntDoubleIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
/** {@inheritDoc} */ public void putAll( TIntDoubleMap map ) { ensureCapacity( map.size() ); TIntDoubleIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
/** {@inheritDoc} */ public void putAll( TIntDoubleMap map ) { ensureCapacity( map.size() ); TIntDoubleIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
/** {@inheritDoc} */ public void putAll( TIntDoubleMap map ) { ensureCapacity( map.size() ); TIntDoubleIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
/** {@inheritDoc} */ @Override public void putAll( TIntDoubleMap map ) { ensureCapacity( map.size() ); TIntDoubleIterator iter = map.iterator(); while ( iter.hasNext() ) { iter.advance(); this.put( iter.key(), iter.value() ); } }
@Override public BitVector newNumberVector(TIntDoubleMap values, int maxdim) { long[] bits = BitsUtil.zero(maxdim); // Import and sort the indexes for(TIntDoubleIterator iter = values.iterator(); iter.hasNext();) { iter.advance(); if(iter.value() != 0.) { BitsUtil.setI(bits, iter.key()); } } return new BitVector(bits, maxdim); }