public TObjectIntIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectIntIterator<TransitStop> iterator () { return bestStops.iterator(); }
public TObjectIntIterator<K> iterator() { return new TObjectIntIterator<K>() { TObjectIntIterator<K> iter = m.iterator(); public K key() { return iter.key(); } public int value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public int setValue( int val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
TripPattern tripPattern = null; for (TObjectIntIterator<TripPattern> it = patternCount.iterator(); it.hasNext();) { it.advance(); if (it.value() > maxCount) {
for (TObjectIntIterator<Vertex> iter = times.iterator(); iter.hasNext(); ) { iter.advance(); Vertex vertex = iter.key();
@Override public void proceed() { for (TObjectIntIterator<TransitStop> it = matrix[current].iterator(); it.hasNext();) { it.advance(); if (it.value() < matrix[current + 1].get(it.key())) matrix[current + 1].put(it.key(), it.value()); } current++; }
for (TObjectIntIterator<Vertex> iter = distanceToVertex.iterator(); iter.hasNext(); ) { iter.advance(); Vertex vertex = iter.key();
for (TObjectIntIterator<Vertex> iter = distanceToVertex.iterator(); iter.hasNext(); ) { iter.advance(); Vertex vertex = iter.key();
for (TObjectIntIterator<AddTripPattern.TemporaryStop> it = addedStops.iterator(); it.hasNext();) { it.advance();
@Override public TObjectIntIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectIntIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectIntIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectIntIterator<K> iterator() { return m.iterator(); // Must be manually synched by user! }
public TObjectIntIterator<K> iterator() { return new TObjectIntIterator<K>() { TObjectIntIterator<K> iter = m.iterator(); public K key() { return iter.key(); } public int value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public int setValue( int val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
public TObjectIntIterator<K> iterator() { return new TObjectIntIterator<K>() { TObjectIntIterator<K> iter = m.iterator(); public K key() { return iter.key(); } public int value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public int setValue( int val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
public TObjectIntIterator<K> iterator() { return new TObjectIntIterator<K>() { TObjectIntIterator<K> iter = m.iterator(); public K key() { return iter.key(); } public int value() { return iter.value(); } public void advance() { iter.advance(); } public boolean hasNext() { return iter.hasNext(); } public int setValue( int val ) { throw new UnsupportedOperationException(); } public void remove() { throw new UnsupportedOperationException(); } }; }
@Override public TObjectIntIterator<K> iterator() { return new TObjectIntIterator<K>() { TObjectIntIterator<K> iter = m.iterator(); @Override public K key() { return iter.key(); } @Override public int value() { return iter.value(); } @Override public void advance() { iter.advance(); } @Override public boolean hasNext() { return iter.hasNext(); } @Override public int setValue( int 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() { TObjectIntIterator<T> iter = counts.iterator(); int maxCount = -1; T max = null; while (iter.hasNext()) { iter.advance(); int 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() { TObjectIntIterator<T> iter = counts.iterator(); int minCount = Integer.MAX_VALUE; T min = null; while (iter.hasNext()) { iter.advance(); int count = iter.value(); if (count < minCount) { min = iter.key(); minCount = count; } } return min; }
@Override public ClassLabel classify(O instance) { TObjectIntMap<ClassLabel> count = new TObjectIntHashMap<>(); KNNList query = knnq.getKNNForObject(instance, k); for(DoubleDBIDListIter neighbor = query.iter(); neighbor.valid(); neighbor.advance()) { count.adjustOrPutValue(labelrep.get(neighbor), 1, 1); } int bestoccur = Integer.MIN_VALUE; ClassLabel bestl = null; for(TObjectIntIterator<ClassLabel> iter = count.iterator(); iter.hasNext();) { iter.advance(); if(iter.value() > bestoccur) { bestoccur = iter.value(); bestl = iter.key(); } } return bestl; }