本文整理了Java中gnu.trove.TIntArrayList.size()
方法的一些代码示例,展示了TIntArrayList.size()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。TIntArrayList.size()
方法的具体详情如下:
包路径:gnu.trove.TIntArrayList
类名称:TIntArrayList
方法名:size
[英]See gnu.trove.list.array.TIntArrayList#size()
[中]见gnu。宝藏。列表大堆TIntArrayList#size()
代码示例来源:origin: JetBrains/ideavim
int index = navigationOffsets.size();
for (int i = 0; i < navigationOffsets.size(); i++) {
if (navigationOffsets.get(i) > offset) {
index = i;
resultIndex = 0;
else if (resultIndex >= navigationOffsets.size()) {
resultIndex = navigationOffsets.size() - 1;
代码示例来源:origin: org.fudaa.framework.ctulu/ctulu-gis
public Object getAverage() {
if (list_.size() == 0) {
return new Integer(0);
}
return new Integer((int) CtuluLibArray.getMoyenne(list_));
}
代码示例来源:origin: org.fudaa.framework.ebli/ebli-2d
int getLastNonZero(TIntArrayList l) {
if (l == null || l.isEmpty()) {
return 0;
}
for (int i = l.size() - 1; i >= 0; i--) {
int value = l.getQuick(i);
if (value > 0) {
return value;
}
}
return 0;
}
代码示例来源:origin: org.fuzzydb.attrs/org.fuzzydb.attrs.compact
private void setLength(int sequence, int length) {
if (sequence >= lengths.size()) {
padSpace(lengths, sequence);
}
lengths.set(sequence, length);
}
代码示例来源:origin: terrier-org/terrier-core
@Override
public void addDocument(int length) {
int docid = docLengths.size();
super.addDocument(length);
docids2lengths.put(docid, length);
}
代码示例来源: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: de.julielab/jcore-mallet-2.0.9
public void incrementExpectations(FeatureVector input, int inputPosition,
int srcIndex, int destIndex, double prob) {
int li2 = map.getLabelIndex(destIndex);
for (int i = 0; i < cache.size(); i++) {
constraints.get(cache.getQuick(i)).expectation[li2] += prob;
}
}
代码示例来源:origin: terrier-org/terrier-core
/** {@inheritDoc} */
public int[] getFieldFrequencies() {
if (pl_doc.size()==0) {
int[] f = {};
fields.put(index, f);
}
return fields.get(getId());
}
代码示例来源:origin: cc.mallet/mallet
public void incrementExpectations(FeatureVector input, int inputPosition,
int srcIndex, int destIndex, double prob) {
int li2 = map.getLabelIndex(destIndex);
for (int i = 0; i < cache.size(); i++) {
constraints.get(cache.getQuick(i)).expectation[li2] += prob;
}
}
代码示例来源:origin: org.fudaa.framework.ctulu/ctulu-common
public final void initWith(final CtuluListInteger _m, final boolean _throwEvent) {
list_ = new TIntArrayList(_m.list_.size());
list_.add(_m.list_.toNativeArray());
if (_throwEvent) {
fireIntStructureChanged();
}
}
代码示例来源:origin: cc.mallet/mallet
public double getCompositeConstraintFeatureValue(FeatureVector fv, int ip, int si1, int si2) {
double value = 0;
int li2 = map.getLabelIndex(si2);
for (int i = 0; i < cache.size(); i++) {
value += constraints.get(cache.getQuick(i)).getValue(li2);
}
return value;
}
代码示例来源:origin: de.julielab/jcore-mallet-2.0.9
public double getScore(FeatureVector input, int inputPosition,
int srcIndex, int destIndex, double[] parameters) {
double dot = 0;
int li2 = map.getLabelIndex(destIndex);
for (int i = 0; i < cache.size(); i++) {
int fi = cache.getQuick(i);
OneLabelL2IndPRConstraint constraint = constraints.get(fi);
dot += constraint.getScore(li2, parameters);
}
return dot;
}
代码示例来源:origin: de.julielab/jcore-mallet-2.0.9
public double getCompositeConstraintFeatureValue(FeatureVector fv, int ip, int si1, int si2) {
double value = 0;
int li2 = map.getLabelIndex(si2);
for (int i = 0; i < cache.size(); i++) {
value += constraints.get(cache.getQuick(i)).getValue(li2);
}
return value;
}
代码示例来源:origin: cc.mallet/mallet
public void incrementExpectations(FeatureVector input, int inputPosition,
int srcIndex, int destIndex, double prob) {
int li2 = map.getLabelIndex(destIndex);
for (int i = 0; i < cache.size(); i++) {
constraints.get(cache.getQuick(i)).incrementExpectation(li2, prob);
}
}
代码示例来源:origin: cc.mallet/mallet
public double getCompositeConstraintFeatureValue(FeatureVector fv, int ip, int si1, int si2) {
double value = 0;
int li2 = map.getLabelIndex(si2);
for (int i = 0; i < cache.size(); i++) {
value += constraints.get(cache.getQuick(i)).getGradientContribution(li2);
}
return value;
}
代码示例来源:origin: cc.mallet/mallet
public double getCompositeConstraintFeatureValue(FeatureVector input, int label) {
double value = 0;
for (int i = 0; i < indexCache.size(); i++) {
if (useValues) {
value += constraints.get(indexCache.getQuick(i)).getGradientContribution(label) * valueCache.getQuick(i);
}
else {
value += constraints.get(indexCache.getQuick(i)).getGradientContribution(label);
}
}
return value;
}
代码示例来源:origin: de.julielab/jcore-mallet-2.0.9
public double getCompositeConstraintFeatureValue(FeatureVector input, int label) {
double value = 0;
for (int i = 0; i < indexCache.size(); i++) {
if (useValues) {
value += constraints.get(indexCache.getQuick(i)).getGradientContribution(label) * valueCache.getQuick(i);
}
else {
value += constraints.get(indexCache.getQuick(i)).getGradientContribution(label);
}
}
return value;
}
代码示例来源:origin: cc.mallet/mallet
public double getCompositeConstraintFeatureValue(FeatureVector input, int label) {
double value = 0;
for (int i = 0; i < indexCache.size(); i++) {
if (useValues) {
value += constraints.get(indexCache.getQuick(i)).getValue(label) * valueCache.getQuick(i);
}
else {
value += constraints.get(indexCache.getQuick(i)).getValue(label);
}
}
return value;
}
内容来源于网络,如有侵权,请联系作者删除!