本文整理了Java中gnu.trove.map.TObjectIntMap.iterator()方法的一些代码示例，展示了TObjectIntMap.iterator()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。TObjectIntMap.iterator()方法的具体详情如下：
包路径：gnu.trove.map.TObjectIntMap
类名称：TObjectIntMap
方法名：iterator

TObjectIntMap.iterator介绍

[英]Returns a TObjectIntIterator with access to this map's keys and values.
[中]返回可访问此映射的键和值的TobjectionIterator。

代码示例

代码示例来源：origin: alibaba/mdrill

public TObjectIntIterator<K> iterator() {
  return m.iterator(); // Must be manually synched by user!
}

代码示例来源：origin: opentripplanner/OpenTripPlanner

public TObjectIntIterator<TransitStop> iterator () {
  return bestStops.iterator();
}

代码示例来源：origin: alibaba/mdrill

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(); }
  };
}

代码示例来源：origin: opentripplanner/OpenTripPlanner

TripPattern tripPattern = null;
for (TObjectIntIterator<TripPattern> it = patternCount.iterator(); it.hasNext();) {
  it.advance();
  if (it.value() > maxCount) {

代码示例来源：origin: opentripplanner/OpenTripPlanner

for (TObjectIntIterator<Vertex> iter = times.iterator(); iter.hasNext(); ) {
  iter.advance();
  Vertex vertex = iter.key();

代码示例来源：origin: opentripplanner/OpenTripPlanner

@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++;
}

代码示例来源：origin: opentripplanner/OpenTripPlanner

for (TObjectIntIterator<Vertex> iter = distanceToVertex.iterator(); iter.hasNext(); ) {
  iter.advance();
  Vertex vertex = iter.key();

代码示例来源：origin: opentripplanner/OpenTripPlanner

for (TObjectIntIterator<Vertex> iter = distanceToVertex.iterator(); iter.hasNext(); ) {
  iter.advance();
  Vertex vertex = iter.key();

代码示例来源：origin: opentripplanner/OpenTripPlanner

for (TObjectIntIterator<AddTripPattern.TemporaryStop> it = addedStops.iterator(); it.hasNext();) {
  it.advance();

代码示例来源：origin: com.palantir.patches.sourceforge/trove3

@Override
public TObjectIntIterator<K> iterator() {
  return m.iterator(); // Must be manually synched by user!
}

代码示例来源：origin: net.sf.trove4j/trove4j

public TObjectIntIterator<K> iterator() {
  return m.iterator(); // Must be manually synched by user!
}

代码示例来源：origin: net.sf.trove4j/core

public TObjectIntIterator<K> iterator() {
  return m.iterator(); // Must be manually synched by user!
}

代码示例来源：origin: hernad/easyrec

public TObjectIntIterator<K> iterator() {
  return m.iterator(); // Must be manually synched by user!
}

代码示例来源：origin: net.sf.trove4j/trove4j

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(); }
  };
}

代码示例来源：origin: hernad/easyrec

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(); }
  };
}

代码示例来源：origin: net.sf.trove4j/core

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(); }
  };
}

代码示例来源：origin: com.palantir.patches.sourceforge/trove3

@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(); }
  };
}

代码示例来源：origin: fozziethebeat/S-Space

/**
 * 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;
}

代码示例来源：origin: fozziethebeat/S-Space

/**
 * 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;
}

代码示例来源：origin: de.lmu.ifi.dbs.elki/elki

@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;
}