Java TObjectIntIterator.hasNext方法代码示例

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
public void testIteratorRemoval2() {
    int element_count = 10000;
    int remaining = element_count / 2;

    TObjectIntHashMap<String> map =
            new TObjectIntHashMap<String>( element_count, 0.5f, Integer.MIN_VALUE );

    for ( int pass = 0; pass < 10; pass++ ) {
        Random r = new Random();
        for ( int i = 0; i <= element_count; i++ ) {
            map.put( String.valueOf( r.nextInt() ), i );
        }

        TObjectIntIterator iterator = map.iterator();
        while ( map.size() > remaining && iterator.hasNext() ) {
            iterator.advance();
            iterator.remove();
        }
    }
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
@SubscribeEvent(priority = EventPriority.LOW)
public void diagnostics(final DiagnosticEvent.Gather event) {
	final TObjectIntHashMap<String> counts = new TObjectIntHashMap<String>();

	final Iterator<Entry<String, ISound>> iterator = this.playingSounds.entrySet().iterator();
	while (iterator.hasNext()) {
		Entry<String, ISound> entry = iterator.next();
		ISound isound = entry.getValue();
		counts.adjustOrPutValue(isound.getSound().getSoundLocation().toString(), 1, 1);
	}

	final ArrayList<String> results = new ArrayList<String>();
	final TObjectIntIterator<String> itr = counts.iterator();
	while (itr.hasNext()) {
		itr.advance();
		results.add(String.format(TextFormatting.GOLD + "%s: %d", itr.key(), itr.value()));
	}
	Collections.sort(results);
	event.output.addAll(results);

}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
private static void getBiomeSounds(@Nonnull final TObjectFloatHashMap<SoundEffect> result) {
	// Need to collect sounds from all the applicable biomes
	// along with their weights.
	final TObjectIntIterator<BiomeInfo> info = AreaSurveyHandler.getBiomes().iterator();
	while (info.hasNext()) {
		info.advance();
		final List<SoundEffect> bs = new ArrayList<SoundEffect>();
		info.key().findSoundMatches(bs);
		for (final SoundEffect sound : bs) {
			final int w = info.value();
			result.adjustOrPutValue(sound, w, w);
		}
	}

	// Scale the volumes in the resulting list based on the weights
	final int area = AreaSurveyHandler.getBiomeArea();
	final TObjectFloatIterator<SoundEffect> itr = result.iterator();
	while (itr.hasNext()) {
		itr.advance();
		final float scale = 0.1F + 0.9F * ((float) itr.value() / (float) area);
		itr.setValue(scale);
	}
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
public void testIteratorRemoval2() {
    int element_count = 10000;
    int remaining = element_count / 2;

    TObjectIntMap<String> map = withExpectedSizeAndNoEntryValue( element_count, Integer.MIN_VALUE );

    for ( int pass = 0; pass < 10; pass++ ) {
        Random r = new Random();
        for ( int i = 0; i <= element_count; i++ ) {
            map.put( String.valueOf( r.nextInt() ), i );
        }

        TObjectIntIterator iterator = map.iterator();
        while ( map.size() > remaining && iterator.hasNext() ) {
            iterator.advance();
            iterator.remove();
        }
    }
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
/**
 * Get string path from index
 * @param     index  index of the string path
 * @return    string path
 */
public String getPathFromIndex(int index){
	
	synchronized(path_index){
		
		TObjectIntIterator<String> it = path_index.iterator();
		while(it.hasNext()){
			it.advance();
			if(it.value()==index)
				return (String) it.key();
		}
		
		return null;
	}
	
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
/**
 * PUBLIC: Returns the preferred variant of the term. This is a form
 * of the term which actually occurred in the classified content.
 */
public String getPreferredName() {
  if (variants.isEmpty())
    return getStem();
  Variant maxKey = null;
  int maxValue = -1;
  TObjectIntIterator<Variant> iter = variants.iterator();
  while (iter.hasNext()) {
    iter.advance();
    int thisValue = iter.value();
    Variant thisKey = iter.key();
    // select variant with most occurrences, or lowest lexical value if equal for predictability
    if ((thisValue > maxValue) ||
        ((thisValue == maxValue) && (thisKey.getValue().compareTo(maxKey.getValue()) < 0))) {
      maxValue = thisValue;
      maxKey = thisKey;
    }
  }
  return maxKey.getValue();
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
protected void merge(Term other) {
  if (other == this) return;
  
  this.score = this.score + other.score;    
  this.totalOccurrences = this.totalOccurrences + other.totalOccurrences;

  TObjectIntIterator<Variant> iter = other.variants.iterator();
  while (iter.hasNext()) {
    iter.advance();
    Variant key = iter.key();
    int value = iter.value();
    if (this.variants.containsKey(key))
      this.variants.adjustValue(key, value);
    else
      this.variants.put(key, value);
    key.replaceTerm(this);
  }
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
public static void writeMDNodes(FormattedOutputStream os,
        TypePrinting printer,
        SlotTracker slotTable)
{
    MDNode[] nodes = new MDNode[slotTable.getMdnMap().size()];
    TObjectIntIterator<Value> itr = slotTable.getMdnMap().iterator();
    while (itr.hasNext())
    {
        nodes[itr.value()] = (MDNode) itr.key();
    }

    for (int i = 0; i < nodes.length; i++)
    {
        os.printf("!%d = metadata ", i);
        MDNode node = nodes[i];
        os.printf("!{");
        for (int j = 0, e = node.getNumOfNode(); j < e; j++)
        {
            Value val = node.getNode(j);
            if (val == null) os.printf("null");
            else if (val instanceof MDNode)
            {
                MDNode n = (MDNode)val;
                os.printf("metadata !%d", slotTable.getMetadataSlot(n));
            }
            else
            {
                printer.print(val.getType(), os);
                os.print(' ');
                writeAsOperandInternal(os, val, printer, slotTable);
            }
            if (j < e-1)
                os.print(", ");
        }
        os.println("}");
    }
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
/**
 * Compares this map with another map for equality of their stored
 * entries.
 *
 * @param other an <code>Object</code> value
 * @return a <code>boolean</code> value
 */
public boolean equals( Object other ) {
    if ( ! ( other instanceof TObjectIntMap ) ) {
        return false;
    }
    TObjectIntMap that = ( TObjectIntMap ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    try {
        TObjectIntIterator iter = this.iterator();
        while ( iter.hasNext() ) {
            iter.advance();
            Object key = iter.key();
            int value = iter.value();
            if ( value == no_entry_value ) {
                if ( !( that.get( key ) == that.getNoEntryValue() &&
                 that.containsKey( key ) ) ) {

                    return false;
                }
            } else {
                if ( value != that.get( key ) ) {
                    return false;
                }
            }
        }
    } catch ( ClassCastException ex ) {
        // unused.
    }
    return true;
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
/**
 * Compares this map with another map for equality of their stored
 * entries.
 *
 * @param other an <code>Object</code> value
 * @return a <code>boolean</code> value
 */
@Override
@SuppressWarnings("rawtypes")
public boolean equals( Object other ) {
    if ( ! ( other instanceof TObjectIntMap ) ) {
        return false;
    }
    TObjectIntMap that = ( TObjectIntMap ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    try {
        TObjectIntIterator iter = this.iterator();
        while ( iter.hasNext() ) {
            iter.advance();
            Object key = iter.key();
            int value = iter.value();
            if ( value == no_entry_value ) {
                if ( !( that.get( key ) == that.getNoEntryValue() &&
                 that.containsKey( key ) ) ) {

                    return false;
                }
            } else {
                if ( value != that.get( key ) ) {
                    return false;
                }
            }
        }
    } catch ( ClassCastException ex ) {
        // unused.
    }
    return true;
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
/**
 * Compares this map with another map for equality of their stored
 * entries.
 *
 * @param other an <code>Object</code> value
 * @return a <code>boolean</code> value
 */
public boolean equals( Object other ) {
    if ( ! ( other instanceof TObjectIntMap ) ) {
        return false;
    }
    TObjectIntMap that = ( TObjectIntMap ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    try {
        TObjectIntIterator iter = this.iterator();
        while ( iter.hasNext() ) {
            iter.advance();
            Object key = iter.key();
            int value = iter.value();
            if ( value == no_entry_value ) {
                if ( !( that.get( key ) == that.getNoEntryValue() && that.containsKey( key ) ) ) {
                    return false;
                }
            } else {
                if ( value != that.get( key ) ) {
                    return false;
                }
            }
        }
    } catch ( ClassCastException ex ) {
        // unused.
    }
    return true;
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
@Override
public void testString_TPrimitiveHashMap() {
	int total = 0;

	for( int i = 0; i < ITERATIONS_STRING; i++ ) {
		TObjectIntIterator<String> iterator = string_t_primitive_map.iterator();
		while( iterator.hasNext() ) {
			iterator.advance();
			total += iterator.key().length();
		}
	}

	int_slot.set( total );
}
 

import gnu.trove.iterator.TObjectIntIterator; //导入方法依赖的package包/类
@Override
public List<ScoredAnnotation<ANNOTATION>> annotate(final OBJECT object) {
	if (this.nn == null)
		this.nn = new ObjectNearestNeighboursExact<FEATURE>(this.features, this.comparator);

	final TObjectIntHashMap<ANNOTATION> selected = new TObjectIntHashMap<ANNOTATION>();

	final List<FEATURE> queryfv = new ArrayList<FEATURE>(1);
	queryfv.add(this.extractor.extractFeature(object));

	final int[][] indices = new int[1][this.k];
	final float[][] distances = new float[1][this.k];

	this.nn.searchKNN(queryfv, this.k, indices, distances);

	int count = 0;
	for (int i = 0; i < this.k; i++) {
		// Distance check
		if (distances[0][i] > this.threshold) {
			continue;
		}

		final Collection<ANNOTATION> anns = this.annotations.get(indices[0][i]);

		for (final ANNOTATION ann : anns) {
			selected.adjustOrPutValue(ann, 1, 1);
			count++;
		}
	}

	final TObjectIntIterator<ANNOTATION> iterator = selected.iterator();
	final List<ScoredAnnotation<ANNOTATION>> result = new ArrayList<ScoredAnnotation<ANNOTATION>>(selected.size());
	while (iterator.hasNext()) {
		iterator.advance();

		result.add(new ScoredAnnotation<ANNOTATION>(iterator.key(), (float) iterator.value() / (float) count));
	}

	return result;
}