Java TIntObjectIterator.value方法代码示例

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
@Override
public void print(PrintStream os, Module m)
{
    os.println("**************** Intervals ******************");
    TIntObjectIterator<LiveInterval> itr = slot2LI.iterator();
    while (itr.hasNext())
    {
        int slot = itr.key();
        LiveInterval interval = itr.value();
        interval.print(os, null);
        TargetRegisterClass rc = getIntervalRegClass(slot);
        if (rc != null)
        {
            os.printf("[%s]\n", rc.getName());
        }
        else
        {
            os.println("[unknown]");
        }
    }
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
@Override
public void process(@Nonnull final EntityPlayer player) {

	if (this.messages.size() == 0)
		return;

	// Go through the cached messages and get rid of those
	// that expire.
	final int currentTick = EnvironState.getTickCounter();
	final TIntObjectIterator<EntityBubbleContext> entityData = this.messages.iterator();
	while (entityData.hasNext()) {
		entityData.advance();
		final EntityBubbleContext ctx = entityData.value();
		if (ctx.clean(currentTick))
			entityData.remove();
	}
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
public void writeTopKBounds(MultipleOutputs<?, ?> sideOutputs, String outputName, String path, int minsup) throws IOException, InterruptedException {
	final IntWritable itemW  = new IntWritable();
	final IntWritable boundW = new IntWritable();
	
	TIntObjectIterator<PatternWithFreq[]> it = this.topK.iterator();
	
	while (it.hasNext()) {
		it.advance();
		if (it.value()[this.k - 1] != null) {
			final int supportCount = it.value()[this.k - 1].getSupportCount();
			
			if (supportCount > minsup) {
				itemW.set(it.key());
				boundW.set(supportCount);
				sideOutputs.write(outputName, itemW, boundW, path);
			}
		}
	}
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
/**
 * @see infoMode
 */
private void collectItemStats() {
	TIntObjectIterator<PatternWithFreq[]> iterator = this.topK.iterator();

	while (iterator.hasNext()) {
		iterator.advance();

		int item = iterator.key();
		PatternWithFreq[] itemTopK = iterator.value();

		int nbPatterns = 0;
		int supportSum = 0;
		while (nbPatterns < this.k && itemTopK[nbPatterns] != null) {
			supportSum += itemTopK[nbPatterns].getSupportCount();
			nbPatterns++;
		}

		int lowestSupport = itemTopK[nbPatterns - 1].getSupportCount();

		if (itemTopK[0] != null) {
			this.decorated.collect(itemTopK[0].getSupportCount(), new int[] { item, nbPatterns, supportSum,
					lowestSupport });
		}
	}
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
public static void tickTimeouts()
{
    if (++timer >= 200)
    {
        timer = 0;
        int threshold = 30; // 5 minute timeout for non-accessed images
        TIntObjectIterator<ImageHandler> iterator = HANDLERS.iterator();

        for (int i = HANDLERS.size(); i > 0; --i)
        {
            iterator.advance();
            ImageHandler imageHandler = iterator.value();

            if (imageHandler.useSingleTemplateImage == false)
            {
                imageHandler.regionImageCache.removeOld(threshold);
            }
        }
    }
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
/** Normalizes all potentials in the tree, both node and sepset. */
public void normalizeAll()
{
  int n = cpfs.length;
  for (int i = 0; i < n; i++) {
    if (cpfs[i] != null) {
      cpfs[i].normalize();
    }
  }

  TIntObjectIterator it = sepsets.iterator();
  while (it.hasNext()) {
    it.advance();
    Factor ptl = ((Sepset) it.value()).ptl;
    ptl.normalize();
  }
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
public void dump ()
{
  int n = cpfs.length;
  // This will cause OpenJGraph to print all our nodes and edges
  System.out.println(dumpToString());
  // Now lets print all the cpfs
  System.out.println("Vertex CPFs");
  for (int i = 0; i < n; i++) {
    if (cpfs[i] != null) {
      System.out.println("CPF "+i+" "+cpfs[i].dumpToString ());
    }
  }

  // And the sepset potentials
  System.out.println("sepset CPFs");
  TIntObjectIterator it = sepsets.iterator();
  while (it.hasNext()) {
    it.advance();
    Factor ptl = ((Sepset) it.value()).ptl;
    System.out.println(ptl.dumpToString ());
  }
  System.out.println ("/End JT");
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
public boolean isNaN()
{
  int n = cpfs.length;
  for (int i = 0; i < n; i++)
    if (cpfs[i].isNaN()) return true;

  // And the sepset potentials
  TIntObjectIterator it = sepsets.iterator();
  while (it.hasNext()) {
    it.advance();
    Factor ptl = ((Sepset) it.value()).ptl;
    if (ptl.isNaN()) return true;
  }

  return false;
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
protected void dumpMap() {
	try {
		tmpFileIndex++;
		String outfile = tmpDIR + "/" + tmpFileIndex + ".tmp";
		logger.info("dumping memory to file: " + outfile);
		PrintStream tmpContentFile = new PrintStream(outfile);
		TIntObjectIterator<T> it = id2item.iterator();
		while (it.hasNext()) {
			it.advance();
			T item = it.value();
			tmpContentFile.print(item.getID());
			tmpContentFile.print("\t");
			tmpContentFile.print(Serialization.serialize(item));
			tmpContentFile.print("\n");
			it.remove();
		}
		tmpContentFile.close();
	} catch (Exception e) {
		logger.error(e.toString());
	}		
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
protected void writeSimnilarity(int element1Id, double element1Score, TIntObjectIterator<ElementSimilarityScoring> it, boolean bR2L) throws SerializationException, IOException, NoScoreFoundException {
	TIntDoubleMap elementsScores = new TIntDoubleHashMap();
	while (it.hasNext()) {
		it.advance();
		int element2Id = it.key();
		if (elementFilter == null || elementFilter.isRelevantElementForCalculation(element2Id)) {
			double element2Score = elementFeatureScoreStorage.getElementScore(element2Id);
			ElementSimilarityScoring similarityScoring = it.value();
			double similarityScore = bR2L ?
						similarityScoring.getSimilarityScore(element2Score, element1Score) :
						similarityScoring.getSimilarityScore(element1Score, element2Score);
			if (similarityScore > 0)
				elementsScores.put(element2Id, similarityScore);
		}
	}
	
	LinkedHashMap<Integer, Double> sortedElementScores = SortUtil.sortMapByValue(elementsScores,true);
	
	if (vectorTruncater != null) 
		sortedElementScores = vectorTruncater.truncate(sortedElementScores);
		
	if (bR2L)
		outR2LDevice.write(element1Id, sortedElementScores);
	else
		outL2RDevice.write(element1Id, sortedElementScores);
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
@Override
public boolean initialisationComplete(TIndexedCollection<DAGNode> nodes,
		TIndexedCollection<DAGEdge> edges, boolean forceRebuild) {
	if (taggedNodes_ == null) {
		taggedNodes_ = MultiMap.createSortedSetMultiMap();
		TIntObjectIterator<DAGNode> iter = nodes.iterator();
		for (int i = nodes.size(); i-- > 0;) {
			iter.advance();
			DAGNode n = iter.value();
			String[] props = n.getProperties();
			for (String prop : props) {
				if (prop.startsWith(TAG_PREFIX)) {
					taggedNodes_.put(prop, n);
				}
			}
		}
	}
	return super.initialisationComplete(nodes, edges, forceRebuild);
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
/**
 * Topologically sorts a collection of nodes.
 * 
 * @param nodes
 *            The nodes to sort.
 * @return The topologically sorted list of nodes.
 */
public List<DAGNode> topologicalList(TIndexedCollection<DAGNode> nodes) {
	cycles_ = new ArrayList<>();
	LinkedList<DAGNode> sortedNodes = new LinkedList<>();
	RewriteOfModule rewriteModule = (RewriteOfModule) dag_
			.getModule(RewriteOfModule.class);
	TIntObjectIterator<DAGNode> iter = nodes.iterator();
	for (int i = nodes.size(); i-- > 0;) {
		iter.advance();
		DAGNode n = iter.value();
		if (rewriteModule != null)
			n = rewriteModule.getRewrite(n);
		// Ignore non-collections
		if (queryModule_.prove(false, CommonConcepts.ISA.getNode(dag_), n,
				CommonConcepts.COLLECTION.getNode(dag_)) == QueryResult.TRUE)
			topologicalVisit(n, sortedNodes,
					new HashMap<DAGNode, String>(),
					new ArrayList<DAGNode>());
	}
	return sortedNodes;
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
void iterate(CellFunction fn) {
	TIntObjectIterator<TIntObjectHashMap<ExchangeCell>> rowIterator = cells
			.iterator();
	while (rowIterator.hasNext()) {
		rowIterator.advance();
		int row = rowIterator.key();
		TIntObjectHashMap<ExchangeCell> rowMap = rowIterator.value();
		if (rowMap == null)
			continue;
		TIntObjectIterator<ExchangeCell> colIterator = rowMap.iterator();
		while (colIterator.hasNext()) {
			colIterator.advance();
			int col = colIterator.key();
			ExchangeCell cell = colIterator.value();
			if (cell == null)
				continue;
			fn.apply(row, col, cell);
		}
	}
}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
/**
 * 一次性统计概率，节约时间
 */
private void statisticProb() {
	System.out.println("统计概率");
	float totalword = alpahbet.size();
	TIntFloatIterator it = wordProb.iterator();
	while(it.hasNext()){
		it.advance();
		float v = it.value()/totalword;
		it.setValue(v);
		Cluster cluster = new Cluster(it.key(),v,alpahbet.lookupString(it.key()));
		clusters.put(it.key(), cluster);
	}

	TIntObjectIterator<TIntFloatHashMap> it1 = pcc.iterator();
	while(it1.hasNext()){
		it1.advance();
		TIntFloatHashMap map = it1.value();
		TIntFloatIterator it2 = map.iterator();
		while(it2.hasNext()){
			it2.advance();
			it2.setValue(it2.value()/totalword);
		}
	}

}
 

import gnu.trove.iterator.TIntObjectIterator; //导入方法依赖的package包/类
/** {@inheritDoc} */
public boolean equals( Object other ) {
    if ( ! ( other instanceof TIntObjectMap ) ) {
        return false;
    }
    TIntObjectMap that = ( TIntObjectMap ) other;
    if ( that.size() != this.size() ) {
        return false;
    }
    try {
        TIntObjectIterator iter = this.iterator();
        while ( iter.hasNext() ) {
            iter.advance();
            int key = iter.key();
            Object value = iter.value();
            if ( value == null ) {
                if ( !( that.get( key ) == null && that.containsKey( key ) ) ) {
                    return false;
                }
            } else {
                if ( !value.equals( that.get( key ) ) ) {
                    return false;
                }
            }
        }
    } catch ( ClassCastException ex ) {
        // unused.
    }
    return true;
}