public TObjectDoubleIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectDoubleIterator<K> iterator() { return new TObjectDoubleIterator<K>() { TObjectDoubleIterator<K> iter = m.iterator(); public K 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 TObjectDoubleIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectDoubleIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
@Override public TObjectDoubleIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectDoubleIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectDoubleIterator<String> getInnerKeys(String key) { TObjectDoubleMap<String> row = matrix.get(key); if (row != null) { return row.iterator(); } return null; }
public TObjectDoubleIterator<K> iterator() { return new TObjectDoubleIterator<K>() { TObjectDoubleIterator<K> iter = m.iterator(); public K 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 TObjectDoubleIterator<K> iterator() { return new TObjectDoubleIterator<K>() { TObjectDoubleIterator<K> iter = m.iterator(); public K 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 TObjectDoubleIterator<K> iterator() { return new TObjectDoubleIterator<K>() { TObjectDoubleIterator<K> iter = m.iterator(); public K 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 public TObjectDoubleIterator<K> iterator() { return new TObjectDoubleIterator<K>() { TObjectDoubleIterator<K> iter = m.iterator(); @Override public K key() { return iter.key(); } @Override public double value() { return iter.value(); } @Override public void advance() { iter.advance(); } @Override public boolean hasNext() { return iter.hasNext(); } @Override public double setValue( double val ) { throw new UnsupportedOperationException(); } @Override public void remove() { throw new UnsupportedOperationException(); } }; }
/** * Returns the element that currently has the largest count. If no objects * have been counted, {@code null} is returned. Ties in counts are * arbitrarily broken. */ public T max() { TObjectDoubleIterator<T> iter = counts.iterator(); double maxCount = -1; T max = null; while (iter.hasNext()) { iter.advance(); double count = iter.value(); if (count > maxCount) { max = iter.key(); maxCount = count; } } return max; }
/** * Returns the element that currently has the smallest count. If no objects * have been counted, {@code null} is returned. Ties in counts are * arbitrarily broken. */ public T min() { TObjectDoubleIterator<T> iter = counts.iterator(); double minCount = Double.MAX_VALUE; T min = null; while (iter.hasNext()) { iter.advance(); double count = iter.value(); if (count < minCount) { min = iter.key(); minCount = count; } } return min; }