/** * @return a TIntIterator with access to the values in this set */ public TIntIterator iterator() { return new TIntIterator(this); }
/** * Advances the iterator to the next element in the underlying collection * and returns it. * * @return the next int in the collection * @excetion NoSuchElementException if the iterator is already exhausted */ public int next() { moveToNextIndex(); return _hash._set[_index]; } }// TIntIterator
public boolean hasNext() { return it.hasNext(); }
public Integer next() { return _iter.next(); }
public void remove() { it.remove(); } };
public boolean hasNext() { return _iter.hasNext(); }
public Object next() { return wrap(it.next()); }
public TIntDoubleHashMap getTable(double[][] utilities) { TIntDoubleHashMap rank = new TIntDoubleHashMap( (int) (testSize + testSize * 0.25), (float) 0.75); for (int docId = 0; docId < testSize; docId++) { double sum = 0.0; for (TIntIterator it = categoriesFilter.iterator(); it.hasNext(); ) { int catId = it.next(); if (docCategoriesFilter[docId].contains(catId)) { sum += utilities[docId][catMap.get(catId)]; } } rank.put(docId, sum); } return rank; }
(int) (numOfCategories + numOfCategories * 0.25), (float) 0.75); int n = 0; for (TIntIterator it = categoriesFilter.iterator(); it.hasNext(); ) { catMap.put(it.next(), n); n++; for (TIntIterator it = categoriesFilter.iterator(); it.hasNext(); ) { int catId = it.next(); int currCat = catMap.get(catId); gainsFP[currCat] = gainFPweight * gain.FP(contingencies[currCat]);
TIntDoubleHashMap currGainsFP = new TIntDoubleHashMap(); TIntDoubleHashMap currGainsFN = new TIntDoubleHashMap(); for (TIntIterator it = categoriesFilter.iterator(); it.hasNext(); ) { int catId = it.next(); ContingencyTable newContingency = newEvaluation.getCategoryContingencyTable((short) catId); ContingencyTable oldContingency = oldEvaluation.getCategoryContingencyTable((short) catId);