gnu.trove.TIntArrayList.sort()方法的使用及代码示例

x33g5p2x  于2022-01-30 转载在 其他  
字(7.2k)|赞(0)|评价(0)|浏览(144)

本文整理了Java中gnu.trove.TIntArrayList.sort()方法的一些代码示例，展示了TIntArrayList.sort()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。TIntArrayList.sort()方法的具体详情如下：
包路径：gnu.trove.TIntArrayList
类名称：TIntArrayList
方法名：sort

TIntArrayList.sort介绍

[英]See gnu.trove.list.array.TIntArrayList#sort()
[中]见gnu。宝藏。列表大堆TIntArrayList#sort（）

代码示例

代码示例来源：origin: JetBrains/ideavim

navigationOffsets.sort();

代码示例来源：origin: org.fudaa.framework.ctulu/ctulu-common

protected void sort() {
 list_.sort();
}

代码示例来源：origin: com.github.steveash.mallet/mallet

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 ();
}

代码示例来源：origin: de.julielab/jcore-mallet-2.0.9

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 ();
}

代码示例来源：origin: de.julielab/jcore-mallet-2.0.9

public boolean add (Object o)
{
 int idx = universe.getIndex ((Variable) o);
 if (idx == -1)
  throw new UnsupportedOperationException();
 included.add (idx);
 included.sort ();
 return true;
}

代码示例来源：origin: cc.mallet/mallet

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 ();
}

代码示例来源：origin: cc.mallet/mallet

public boolean add (Object o)
{
 int idx = universe.getIndex ((Variable) o);
 if (idx == -1)
  throw new UnsupportedOperationException();
 included.add (idx);
 included.sort ();
 return true;
}

代码示例来源：origin: com.github.steveash.mallet/mallet

public boolean add (Object o)
{
 int idx = universe.getIndex ((Variable) o);
 if (idx == -1)
  throw new UnsupportedOperationException();
 included.add (idx);
 included.sort ();
 return true;
}

代码示例来源：origin: jatecs/jatecs

public TIntArrayListIterator selectNegatives(String category) {
  short catID = _index.getCategoryDB().getCategory(category);
  TreeSet<DocumentSimilar> best = _best.get(catID);
  TIntArrayList neg = new TIntArrayList();
  Iterator<DocumentSimilar> it = best.iterator();
  while (it.hasNext()) {
    DocumentSimilar docS = it.next();
    neg.add(docS.docID);
  }
  neg.sort();
  return new TIntArrayListIterator(neg);
}

代码示例来源：origin: jatecs/jatecs

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);
}

代码示例来源：origin: jatecs/jatecs

public void removeCategoryFeatures(short category,
                  IIntIterator removedFeatures) {
  TIntArrayList feats = _categoriesFeatures.get(category);
  while (removedFeatures.hasNext()) {
    int feature = removedFeatures.next();
    if (feats.binarySearch(feature) < 0)
      feats.add(feature);
  }
  feats.sort();
  _hasLocalRepresentation = _hasLocalRepresentation || feats.size() > 0;
}

代码示例来源：origin: org.fudaa.framework.ctulu/ctulu-gis

private void manageBadPoints(final InterpolationTarget _target, final CtuluAnalyze _analyze,
  final int _nbToInterpolate, final TIntArrayList _pointNotSet) {
 _pointNotSet.sort();
 final int nbBad = _pointNotSet.size();
 // Affichage avertissement
 if (nbBad == _nbToInterpolate) {
  _analyze.addFatalError(CtuluLib.getS("Aucun point n'a pu tre interpol"), 0);
 } else if (nbBad > 15) {
  _analyze.addWarn(CtuluLib.getS("{0} points n'ont pas t interpols correctement", CtuluLibString
    .getString(nbBad)), 0);
 } else {
  final StringBuffer b = new StringBuffer();
  for (int i = 0; i < nbBad; i++) {
   final int temp = _pointNotSet.getQuick(i);
   b.append(CtuluLibString.getString(temp)).append(CtuluLibString.ESPACE).append("(").append(_target.getPtX(temp))
     .append(";").append(_target.getPtY(temp)).append(")");
  }
  _analyze.addWarn(CtuluLib.getS("Points non interpols correctement: {0}", b.toString()), 0);
 }
}

代码示例来源：origin: jatecs/jatecs

tr.sort();
va.sort();

代码示例来源：origin: jatecs/jatecs

public void computeTSR(IIndex index) {
  TextualProgressBar bar = new TextualProgressBar(
      "Compute global threshold ("
          + Os.generateDoubleString(_threshold, 3)
          + ") TSR with " + _function.getClass().getName());
  int total = index.getFeatureDB().getFeaturesCount();
  int step = 0;
  TIntArrayList toRemove = new TIntArrayList();
  IIntIterator it = index.getFeatureDB().getFeatures();
  while (it.hasNext()) {
    int featID = it.next();
    double score = _function.compute((short) 0, featID, index);
    if (score < _threshold)
      toRemove.add(featID);
    step++;
    bar.signal((step * 100) / total);
  }
  bar.signal(100);
  toRemove.sort();
  // Remove the worst features.
  JatecsLogger.status().print(
      "Removing " + toRemove.size() + " features...");
  index.removeFeatures(new TIntArrayListIterator(toRemove));
  JatecsLogger.status().println(
      "done. Now the DB contains "
          + index.getFeatureDB().getFeaturesCount()
          + " feature(s).");
}

代码示例来源：origin: jatecs/jatecs

@Override
public void computeTSR(IIndex index) {
  TextualProgressBar bar = new TextualProgressBar(
      "Compute TSR with by using regex matcher");
  int total = index.getFeatureDB().getFeaturesCount();
  int step = 0;
  TIntArrayList toRemove = new TIntArrayList();
  IIntIterator it = index.getFeatureDB().getFeatures();
  while (it.hasNext()) {
    int featID = it.next();
    String featName = index.getFeatureDB().getFeatureName(featID);
    if (!featName.matches(regexPatternMatching)) {
      toRemove.add(featID);
    }
    step++;
    bar.signal((step * 100) / total);
  }
  bar.signal(100);
  toRemove.sort();
  // Remove the worst features.
  JatecsLogger.status().print("Removing worst features...");
  TIntArrayListIterator toRemoveIT = new TIntArrayListIterator(toRemove);
  index.removeFeatures(toRemoveIT);
  JatecsLogger.status().println(
      "done. Now the DB contains "
          + index.getFeatureDB().getFeaturesCount()
          + " feature(s).");
}

代码示例来源：origin: jatecs/jatecs

@Override
public void computeTSR(IIndex index) {
  TextualProgressBar bar = new TextualProgressBar(
      "Compute TSR with by using regex matcher");
  int total = index.getFeatureDB().getFeaturesCount();
  int step = 0;
  TIntArrayList toRemove = new TIntArrayList();
  IIntIterator it = index.getFeatureDB().getFeatures();
  while (it.hasNext()) {
    int featID = it.next();
    String featName = index.getFeatureDB().getFeatureName(featID);
    if (!featName.matches(regexPatternMatching)) {
      toRemove.add(featID);
    }
    step++;
    bar.signal((step * 100) / total);
  }
  bar.signal(100);
  toRemove.sort();
  // Remove the worst features.
  JatecsLogger.status().print("Removing worst features...");
  index.removeFeatures(new TIntArrayListIterator(toRemove));
  JatecsLogger.status().println(
      "done. Now the DB contains "
          + index.getFeatureDB().getFeaturesCount()
          + " feature(s).");
}

代码示例来源：origin: jatecs/jatecs

docsToRemove.sort();
idx.removeDocuments(new TIntArrayListIterator(docsToRemove), false);

代码示例来源：origin: jatecs/jatecs

docsToRemove.sort();
idx.removeDocuments(new TIntArrayListIterator(docsToRemove), false);

代码示例来源：origin: jatecs/jatecs

docsToRemove.sort();
idx.removeDocuments(new TIntArrayListIterator(docsToRemove), false);

代码示例来源：origin: jatecs/jatecs

docsToRemove.sort();
idx.removeDocuments(new TIntArrayListIterator(docsToRemove), false);

内容来源于网络，如有侵权，请联系作者删除！

TIntArrayList

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com