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

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

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

TIntArrayList.remove介绍

[英]Removes the value at offset from the list.
[中]从列表中删除偏移量处的值。

代码示例

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

protected void internalRemove(final int _i) {
 list_.remove(_i);
}

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

/**
 * Removes and returns the value at the top of the stack.
 *
 * @return an <code>int</code> value
 */
public int pop() {
  return _list.remove(_list.size() - 1);
}

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

/**
 * Removes the value at <tt>offset</tt> from the list.
 *
 * @param offset an <code>int</code> value
 * @return the value previously stored at offset.
 */
public int remove(int offset) {
  int old = get(offset);
  remove(offset, 1);
  return old;
}

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

/**
 * @overrride
 */
public void undo() {
 list_.remove(idxBefore_, newValue_.length);
 fireDataRemoved();
}

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

private void sampleNextInstanceToCluster (Clustering clustering) {
  if (unclusteredInstances == null)
    fillUnclusteredInstances(clustering.getNumInstances());
  instanceBeingClustered = (unclusteredInstances.size() == 0) ? -1 :
                           unclusteredInstances.remove(0);		
}

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

private void sampleNextInstanceToCluster (Clustering clustering) {
  if (unclusteredInstances == null)
    fillUnclusteredInstances(clustering.getNumInstances());
  instanceBeingClustered = (unclusteredInstances.size() == 0) ? -1 :
                           unclusteredInstances.remove(0);		
}

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

private void sampleNextInstanceToCluster (Clustering clustering) {
  if (unclusteredInstances == null)
    fillUnclusteredInstances(clustering.getNumInstances());
  instanceBeingClustered = (unclusteredInstances.size() == 0) ? -1 :
                           unclusteredInstances.remove(0);		
}

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

public void setDocumentFeatureFrequency(int document, int feature, int frequency) {
  if (document >= 0) {
    int size = _contentDB._documentsFeatures.size();
    if (document >= size) {
      for (int i = size; i <= document; ++i) {
        _contentDB._documentsFeatures.add(new TIntArrayList());
        _contentDB._documentsFrequencies.add(new TIntArrayList());
      }
    }
    if (feature >= 0) {
      TIntArrayList feats = _contentDB._documentsFeatures.get(document);
      TIntArrayList freqs = _contentDB._documentsFrequencies.get(document);
      int pos = feats.binarySearch(feature);
      if (pos < 0 && frequency > 0) {
        pos = -pos - 1;
        feats.insert(pos, feature);
        freqs.insert(pos, frequency);
      } else {
        if (frequency > 0) {
          freqs.setQuick(pos, frequency);
        } else {
          feats.remove(pos);
          freqs.remove(pos);
        }
      }
    }
  }
}

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

public void setDocumentFeatureFrequency(int document, int feature,
                    int frequency) {
  if (feature >= 0) {
    int size = _contentDB._featuresDocuments.size();
    if (feature >= size) {
      for (int i = size; i <= feature; ++i) {
        _contentDB._featuresDocuments.add(new TIntArrayList());
        _contentDB._featuresFrequencies.add(new TIntArrayList());
      }
    }
    if (document >= 0) {
      TIntArrayList docs = _contentDB._featuresDocuments.get(feature);
      TIntArrayList freqs = _contentDB._featuresFrequencies
          .get(feature);
      int pos = docs.binarySearch(document);
      if (pos < 0 && frequency > 0) {
        pos = -pos - 1;
        docs.insert(pos, document);
        freqs.insert(pos, frequency);
      } else {
        if (frequency > 0) {
          freqs.setQuick(pos, frequency);
        } else {
          docs.remove(pos);
          freqs.remove(pos);
        }
      }
    }
  }
}

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

public boolean remove(final int _i, final CtuluCommandContainer _c) {
 if ((_i >= 0) && (_i < list_.size())) {
  final int xRemoved = list_.remove(_i);
  if (_c != null) {
   _c.addCmd(new CommandRemove(_i, xRemoved));
  }
  fireDataRemoved();
  return true;
 }
 return false;
}

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

feats.remove(j);
freqs.remove(j);
if (j < feats.size() && removedFeatures.hasNext()) {
  feat = feats.getQuick(j);

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

feats.remove(j);
freqs.remove(j);
if (j < feats.size() && removedFeatures.hasNext()) {
  feat = feats.getQuick(j);

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

clustering.getNumClusters());
updateScoreMatrix(clustering, clusterIndex, clusterToMerge);
unclusteredInstances.remove(unclusteredInstances.indexOf(instanceToMerge));
 clustering = ClusterUtils.mergeClusters(clustering, clusterIndex, clusterToMerge);

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

clustering.getNumClusters());
updateScoreMatrix(clustering, clusterIndex, clusterToMerge);
unclusteredInstances.remove(unclusteredInstances.indexOf(instanceToMerge));
 clustering = ClusterUtils.mergeClusters(clustering, clusterIndex, clusterToMerge);

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

clustering.getNumClusters());
updateScoreMatrix(clustering, clusterIndex, clusterToMerge);
unclusteredInstances.remove(unclusteredInstances.indexOf(instanceToMerge));
 clustering = ClusterUtils.mergeClusters(clustering, clusterIndex, clusterToMerge);

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

docs.remove(j);
docsPrimary.remove(j);
if (j < docs.size() && removedDocuments.hasNext()) {

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

docs.remove(j);
freqs.remove(j);
if (j < docs.size() && removedDocuments.hasNext()) {
  doc = docs.getQuick(j);

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

docs.remove(j);
if (j < docs.size() && removedDocuments.hasNext()) {
  doc = docs.getQuick(j);

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

centroids[whichCluster].documents.remove(idxToRemove);
centroids[whichCluster].distances.remove(idxToRemove);
visitedClusters[whichCluster] = true;

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

feats.remove(j);
if (j < feats.size() && removedFeatures.hasNext()) {
  feat = feats.getQuick(j);

相关文章