本文整理了Java中gnu.trove.TIntArrayList.setQuick()
方法的一些代码示例,展示了TIntArrayList.setQuick()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。TIntArrayList.setQuick()
方法的具体详情如下:
包路径:gnu.trove.TIntArrayList
类名称:TIntArrayList
方法名:setQuick
[英]See gnu.trove.list.array.TIntArrayList#setQuick(int,int)
[中]见gnu。宝藏。列表大堆TIntArrayList#setQuick(int,int)
代码示例来源:origin: org.fudaa.framework.ctulu/ctulu-common
protected boolean internalSet(final int _i, final int _newV) {
final double old = list_.getQuick(_i);
if (old == _newV) {
return false;
}
list_.setQuick(_i, _newV);
return true;
}
代码示例来源:origin: terrier-org/terrier-core
/** Returns true iff we did not already have a posting for this document */
public boolean addOrUpdateFreq(int docid, int freq) {
int index = pl_doc.binarySearch(docid);
if (index >= 0)
{
pl_freq.setQuick(index, freq + pl_freq.get(index));
return false;
} else {
pl_doc.insert( -(index +1), docid);
pl_freq.insert( -(index +1), freq);
return true;
}
}
代码示例来源: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: 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
} else {
if (frequency > 0) {
freqs.setQuick(pos, frequency);
} else {
freqs.remove(pos);
} else {
if (frequency > 0) {
freqs.setQuick(pos, frequency);
} else {
docs.remove(pos);
代码示例来源:origin: jatecs/jatecs
ContingencyTable oldContingency = oldEvaluation.getGlobalContingencyTable();
TIntArrayList increment = new TIntArrayList(4);
increment.setQuick(0, newContingency.tp() - oldContingency.tp());
increment.setQuick(1, newContingency.tn() - oldContingency.tn());
increment.setQuick(2, newContingency.fp() - oldContingency.fp());
increment.setQuick(3, newContingency.fn() - oldContingency.fn());
if (increment.getQuick(0) != 0 || increment.getQuick(1) != 0 || increment.getQuick(2) != 0 || increment.getQuick(3) != 0) {
for (int j = 0; j < 4; j++) {
代码示例来源:origin: jatecs/jatecs
break;
} else {
docs.setQuick(j, doc - shift);
++j;
if (j < docs.size())
docs.setQuick(j, docs.getQuick(j) - shift);
++j;
代码示例来源:origin: jatecs/jatecs
break;
} else {
feats.setQuick(j, feat - shift);
++j;
if (j < feats.size())
feats.setQuick(j, feats.getQuick(j) - shift);
++j;
代码示例来源:origin: jatecs/jatecs
break;
} else {
feats.setQuick(j, feat - shift);
++j;
if (j < feats.size())
feats.setQuick(j, feats.getQuick(j) - shift);
++j;
代码示例来源:origin: jatecs/jatecs
break;
} else {
docs.setQuick(j, doc - shift);
++j;
if (j < docs.size())
docs.setQuick(j, docs.getQuick(j) - shift);
++j;
代码示例来源:origin: jatecs/jatecs
break;
} else {
feats.setQuick(j, feat - shift);
++j;
if (j < feats.size())
feats.setQuick(j, feats.getQuick(j) - shift);
++j;
代码示例来源:origin: jatecs/jatecs
break;
} else {
docs.setQuick(j, doc - shift);
++j;
if (j < docs.size())
docs.setQuick(j, docs.getQuick(j) - shift);
++j;
代码示例来源:origin: jatecs/jatecs
break;
} else {
docs.setQuick(j, doc - shift);
++j;
if (j < docs.size())
docs.setQuick(j, docs.getQuick(j) - shift);
++j;
代码示例来源:origin: jatecs/jatecs
ContingencyTable oldContingency = oldEvaluation.getCategoryContingencyTable((short) catId);
TIntArrayList increment = new TIntArrayList(4);
increment.setQuick(0, newContingency.tp() - oldContingency.tp());
increment.setQuick(1, newContingency.tn() - oldContingency.tn());
increment.setQuick(2, newContingency.fp() - oldContingency.fp());
increment.setQuick(3, newContingency.fn() - oldContingency.fn());
if (increment.getQuick(0) != 0 || increment.getQuick(1) != 0 || increment.getQuick(2) != 0 || increment.getQuick(3) != 0) {
int currCat = catMap.get(catId);
代码示例来源:origin: jatecs/jatecs
break;
} else {
feats.setQuick(j, feat - shift);
++j;
if (j < feats.size())
feats.setQuick(j, feats.getQuick(j) - shift);
++j;
内容来源于网络,如有侵权,请联系作者删除!