public TObjectLongIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectLongIterator<K> iterator() { return new TObjectLongIterator<K>() { TObjectLongIterator<K> iter = m.iterator(); public K key() { return iter.key(); } public long value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public long setValue( long val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
public TObjectLongIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectLongIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
@Override public TObjectLongIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectLongIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectLongIterator<K> iterator() { return new TObjectLongIterator<K>() { TObjectLongIterator<K> iter = m.iterator(); public K key() { return iter.key(); } public long value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public long setValue( long val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
public TObjectLongIterator<K> iterator() { return new TObjectLongIterator<K>() { TObjectLongIterator<K> iter = m.iterator(); public K key() { return iter.key(); } public long value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public long setValue( long val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
public TObjectLongIterator<K> iterator() { return new TObjectLongIterator<K>() { TObjectLongIterator<K> iter = m.iterator(); public K key() { return iter.key(); } public long value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public long setValue( long val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
@Override public TObjectLongIterator<K> iterator() { return new TObjectLongIterator<K>() { TObjectLongIterator<K> iter = m.iterator(); @Override public K key() { return iter.key(); } @Override public long value() { return iter.value(); } @Override public void advance() { iter.advance(); } @Override public boolean hasNext() { return iter.hasNext(); } @Override public long setValue( long 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() { TObjectLongIterator<T> iter = counts.iterator(); long maxCount = -1; T max = null; while (iter.hasNext()) { iter.advance(); long 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() { TObjectLongIterator<T> iter = counts.iterator(); long minCount = Long.MAX_VALUE; T min = null; while (iter.hasNext()) { iter.advance(); long count = iter.value(); if (count < minCount) { min = iter.key(); minCount = count; } } return min; }
TObjectLongIterator<String> it = countMap.iterator(); int i=0; while (it.hasNext()) {