private static void addNavigationElements(@NotNull TreeElement root, @NotNull TIntArrayList navigationOffsets, boolean start) { if (root instanceof PsiTreeElementBase) { PsiElement element = ((PsiTreeElementBase)root).getValue(); int offset; if (start) { offset = element.getTextRange().getStartOffset(); if (element.getLanguage().getID().equals("JAVA")) { // HACK: for Java classes and methods, we want to jump to the opening brace int textOffset = element.getTextOffset(); int braceIndex = element.getText().indexOf('{', textOffset - offset); if (braceIndex >= 0) { offset += braceIndex; } } } else { offset = element.getTextRange().getEndOffset() - 1; } if (!navigationOffsets.contains(offset)) { navigationOffsets.add(offset); } } for (TreeElement child : root.getChildren()) { addNavigationElements(child, navigationOffsets, start); } }
StructureViewModel model = builder.createStructureViewModel(editor); TIntArrayList navigationOffsets = new TIntArrayList(); addNavigationElements(model.getRoot(), navigationOffsets, isStart); if (navigationOffsets.isEmpty()) { return -1; navigationOffsets.sort(); int index = navigationOffsets.size(); for (int i = 0; i < navigationOffsets.size(); i++) { if (navigationOffsets.get(i) > offset) { index = i; if (count > 0) count--; break; else if (navigationOffsets.get(i) == offset) { index = i; break; resultIndex = 0; else if (resultIndex >= navigationOffsets.size()) { resultIndex = navigationOffsets.size() - 1; return navigationOffsets.get(resultIndex);
public TIntArrayListIterator selectNegatives(String category) { short catID = _index.getCategoryDB().getCategory(category); TreeSet<Item> best = _best.get(catID); assert (best != null); TIntArrayList neg = new TIntArrayList(); Iterator<Item> it = best.iterator(); while (it.hasNext()) { Item docS = it.next(); assert (!neg.contains(docS.docID)); neg.add(docS.docID); } neg.sort(); return new TIntArrayListIterator(neg); }
@NotNull TIntArrayList x2, @NotNull TIntArrayList y2) { TIntArrayList newX = new TIntArrayList(); TIntArrayList newY = new TIntArrayList(); while (i < x1.size() && j < x2.size()) { if (x1.get(i) < x2.get(j) || x1.get(i) == x2.get(j) && y1.get(i) < y2.get(j)) { newX.add(x1.get(i)); newY.add(y1.get(i)); i++; else if (x1.get(i) > x2.get(j) || x1.get(i) == x2.get(j) && y1.get(i) > y2.get(j)) { newX.add(x2.get(j)); newY.add(y2.get(j)); j++; newX.add(x1.get(i)); newY.add(y1.get(i)); i++; j++; while (i < x1.size()) { newX.add(x1.get(i)); newY.add(y1.get(i)); i++; while (j < x2.size()) { newX.add(x2.get(j)); newY.add(y2.get(j));
public static int[] getSelectedIdx(final BitSet _set) { if (_set == null || _set.isEmpty()) { return FuEmptyArrays.INT0; } final int max = _set.length(); final TIntArrayList list = new TIntArrayList(max); for (int i = 0; i < max; i++) { if (_set.get(i)) { list.add(i); } } return list.toNativeArray(); }
centroids[whichCluster].documents.add(docID); centroids[i].documents.clear(); ClusterDocumentDescriptor cd = clusters.get(i); cd.documents = new TIntArrayList( centroids[i].documents.toNativeArray());
/** * @param _d le tableau a moyenne * @return la moyenne des valeurs du tableau _d. "0" si null ou vide */ public static double getMoyenne(final TIntArrayList _d) { if (_d == null || _d.size() == 0) { return 0; } double r = 0; for (int i = _d.size() - 1; i >= 0; i--) { r += _d.getQuick(i); } return r / _d.size(); }
final int nbInitVar = variable.size(); final TIntArrayList vectIdx = new TIntArrayList(nbInitVar); for (int i = 0; i < nbInitVar; i++) { if (vects.isVect((CtuluVariable) variable.get(i))) { vectIdx.add(i); if (vectIdx.isEmpty()) { return _params; vects, nbInitVar, vectIdx.toNativeArray()); final int size = vectIdx.size(); final int idxInit = vectIdx.getQuick(i); final CtuluVariable object = (CtuluVariable) variable.get(idxInit); if (vects.isVx(object)) {
public ListVarSet (Universe universe, Collection included) { this.universe = universe; this.included = new TIntArrayList (included.size ()); java.util.Iterator it = included.iterator(); while (it.hasNext()) { this.included.add (universe.getIndex ((Variable) it.next ())); } this.included.sort (); }
public final void initWith(final CtuluListInteger _m, final boolean _throwEvent) { list_ = new TIntArrayList(_m.list_.size()); list_.add(_m.list_.toNativeArray()); if (_throwEvent) { fireIntStructureChanged(); } }
/** * Pad the supplied array, cos Trove doesn't supply the capability * @param array * @param sequence */ private void padSpace(TIntArrayList array, int sequence) { Assert.state( array.size() <= sequence); // e.g. 0 <= 0, on first add while( array.size() <= sequence){ // ensures we add including then value we want to then set array.add( -1 ); } }
public GISAttributeModel createSubModel(final int[] _idxToRemove) { final TIntArrayList newList = new TIntArrayList(getSize()); final int nb = getSize(); for (int i = 0; i < nb; i++) { if (Arrays.binarySearch(_idxToRemove, i) < 0) { newList.add(list_.get(i)); } } return new GISAttributeModelIntegerList(newList, this); }
/** Returns the indices of the terms that must be called through assignScore() but not actually used to match documents. */ public int[] getNonMatchingTerms() { return nonMatchOnTerms.toNativeArray(); }
/** {@inheritDoc} */ public int getId() { if (pl_doc.size()==0) { // special case: the posting list is empty, but some retrieval code (i.e. DAAT retrieval) assumes // that each posting list must have at least one document in it. So we add a new document // with no terms in it pl_doc.add(0); pl_freq.add(0); } return pl_doc.get(index); }
public TIntArrayListIterator selectNegatives(String category) { TIntArrayList negatives = new TIntArrayList(); short id = _globalIndex.getCategoryDB().getCategory(category); IShortIterator cats = _globalIndex.getCategoryDB() .getSiblingCategories(id); while (cats.hasNext()) { short catID = cats.next(); IIntIterator docsNegative = _globalIndex.getClassificationDB() .getCategoryDocuments(catID); while (docsNegative.hasNext()) { int docID = docsNegative.next(); if (!negatives.contains(docID) && !_globalIndex.getClassificationDB() .hasDocumentCategory(docID, id)) negatives.add(docID); } } return new TIntArrayListIterator(negatives); }
private void fillUnclusteredInstances (int size) { unclusteredInstances = new TIntArrayList(size); for (int i = 0; i < size; i++) unclusteredInstances.add(i); unclusteredInstances.shuffle(random); }
public DocumentIndexEntry next() { FieldDocumentIndexEntry die = new FieldDocumentIndexEntry(); die.setDocumentLength(docLengths.get(index)); die.setFieldLengths(fieldLengths.get(index++).toNativeArray()); return die; }