本文整理汇总了Java中gnu.trove.iterator.TObjectIntIterator类的典型用法代码示例。如果您正苦于以下问题:Java TObjectIntIterator类的具体用法?Java TObjectIntIterator怎么用?Java TObjectIntIterator使用的例子?那么恭喜您, 这里精选的类代码示例或许可以为您提供帮助。
TObjectIntIterator类属于gnu.trove.iterator包,在下文中一共展示了TObjectIntIterator类的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: testIteratorRemoval2
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();
}
}
}
示例2: diagnostics
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);
}
示例3: getBiomeSounds
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);
}
}
示例4: testIteratorRemoval2
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();
}
}
}
示例5: getPathFromIndex
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;
}
}
示例6: getPreferredName
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();
}
示例7: merge
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);
}
}
示例8: findDepVars
import gnu.trove.iterator.TObjectIntIterator; //导入依赖的package包/类
/**
* Find dependent variables within child patterns.
* @param node
* @param depVars
*/
private void findDepVars(TreePatternNode node, HashSet<String> depVars)
{
TObjectIntHashMap<String> depCounts = new TObjectIntHashMap<>();
for(TObjectIntIterator<String> itr = depCounts.iterator(); itr.hasNext();)
{
if (itr.value() > 1)
depVars.add(itr.key());
}
}
示例9: writeMDNodes
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("}");
}
}
示例10: equals
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;
}
示例11: equals
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;
}
示例12: equals
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;
}
示例13: testString_TPrimitiveHashMap
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 );
}
示例14: testString_Trove2PrimitiveHashMap
import gnu.trove.iterator.TObjectIntIterator; //导入依赖的package包/类
@Override
public void testString_Trove2PrimitiveHashMap() {
int total = 0;
for( int i = 0; i < ITERATIONS_STRING; i++ ) {
gnu.trove.TObjectIntIterator<String> iterator =
string_t2_primitive_map.iterator();
while( iterator.hasNext() ) {
iterator.advance();
total += iterator.key().length();
}
}
int_slot.set( total );
}
示例15: kernelComputation
import gnu.trove.iterator.TObjectIntIterator; //导入依赖的package包/类
@Override
public float kernelComputation(DirectedGraphRepresentation exA,
DirectedGraphRepresentation exB) {
TObjectIntMap<NodeDistance> labelDistancesA = GraphUtils.getLabelDistances(exA);
TObjectIntMap<NodeDistance> labelDistancesB = GraphUtils.getLabelDistances(exB);
float sum = 0;
TObjectIntMap<NodeDistance> shortest;
TObjectIntMap<NodeDistance> longest;
if (labelDistancesA.size() < labelDistancesB.size()) {
shortest = labelDistancesA;
longest = labelDistancesB;
} else {
shortest = labelDistancesB;
longest = labelDistancesA;
}
for (TObjectIntIterator<NodeDistance> it = shortest.iterator(); it.hasNext();) {
it.advance();
float shortestValue = it.value();
float longestValue = longest.get(it.key());
sum += shortestValue * longestValue;
}
return sum;
}