本文整理了Java中gnu.trove.TIntArrayList.clear()
方法的一些代码示例,展示了TIntArrayList.clear()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。TIntArrayList.clear()
方法的具体详情如下:
包路径:gnu.trove.TIntArrayList
类名称:TIntArrayList
方法名:clear
[英]See gnu.trove.list.array.TIntArrayList#clear()
[中]见gnu。宝藏。列表大堆TintraryList#clear()
代码示例来源:origin: de.julielab/jcore-mallet-0.4
/**
* Clears the stack, reseting its capacity to the default.
*/
public void clear() {
_list.clear(DEFAULT_CAPACITY);
}
代码示例来源:origin: de.julielab/jcore-mallet-0.4
/**
* Flushes the internal state of the list, resetting the capacity
* to the default.
*/
public void clear() {
clear(DEFAULT_CAPACITY);
}
代码示例来源:origin: cc.mallet/mallet
public void clear()
{
included.clear();
}
代码示例来源:origin: de.julielab/jcore-mallet-2.0.9
public void clear()
{
included.clear();
}
代码示例来源:origin: com.github.steveash.mallet/mallet
public void clear()
{
included.clear();
}
代码示例来源:origin: jatecs/jatecs
public void initializeClusters(IWeighting3D dists, Centroid[] centroids) {
Random r = new Random();
boolean[] assigned = new boolean[dists.getFirstDimensionSize()];
// Choose k random centroids.
for (int i = 0; i < centroids.length; i++) {
centroids[i].documents.clear();
int next = r.nextInt(dists.getFirstDimensionSize());
int idx = -1;
if (assigned[next]) {
for (int doc = (next + 1) % assigned.length; doc != next; doc = (doc + 1) % assigned.length) {
if (!assigned[doc]) {
assigned[doc] = true;
idx = doc;
break;
}
}
} else {
idx = next;
assigned[idx] = true;
}
centroids[i].documents.add((short) idx);
}
// Update centroid for each cluster.
for (int i = 0; i < centroids.length; i++)
centroids[i].computeCentroid(dists);
}
代码示例来源:origin: jatecs/jatecs
public void beginEvaluation(IIntIterator documents, IIndex index) {
_assignments.clear();
documents.begin();
while (documents.hasNext()) {
documents.next();
_assignments.add(-1);
}
_documents = documents;
_index = index;
}
代码示例来源:origin: jatecs/jatecs
public void initializeClusters(IWeighting3D dists, Centroid[] centroids) {
TreeSet<CategoryItem> ordered = new TreeSet<CategoryItem>();
IShortIterator categories = _index.getCategoryDB().getCategories();
while (categories.hasNext()) {
short catID = categories.next();
int positives = _index.getClassificationDB().getCategoryDocumentsCount(catID);
CategoryItem ci = new CategoryItem();
ci.catID = catID;
ci.positives = positives;
ordered.add(ci);
}
Iterator<CategoryItem> items = ordered.iterator();
// Choose k random centroids.
for (int i = 0; i < centroids.length; i++) {
centroids[i].documents.clear();
CategoryItem ci = items.next();
centroids[i].documents.add(ci.catID);
}
// Update centroid for each cluster.
for (int i = 0; i < centroids.length; i++)
centroids[i].computeCentroid(dists);
}
代码示例来源:origin: jatecs/jatecs
centroids[i].documents.clear();
FeatureItem ci = items.next();
centroids[i].documents.add(ci.featureID);
代码示例来源:origin: jatecs/jatecs
centroids[i].documents.clear();
代码示例来源:origin: JetBrains/jediterm
x1.clear();
y1.clear();
x1.add(newX.toNativeArray());
y1.add(newY.toNativeArray());
代码示例来源:origin: jatecs/jatecs
while (toUpdate) {
for (int i = 0; i < centroids.length; i++) {
centroids[i].documents.clear();
代码示例来源:origin: terrier-org/terrier-core
ids.clear();
int previous = -1;
for(int i : _tmp)
代码示例来源:origin: terrier-org/terrier-core
ids.clear();
int previous = -1;
for(int i : _tmp)
代码示例来源:origin: jatecs/jatecs
if (gsize > maxFeatsPerGroup) {
maxFeatsPerGroup = gsize;
maxFeatsPerGroupGroups.clear();
maxFeatsPerGroupGroups.add(i);
代码示例来源:origin: jatecs/jatecs
if (docCats < minCatsPerDoc) {
minCatsPerDoc = docCats;
minCatsPerDocDocs.clear();
minCatsPerDocDocs.add(doc);
if (docCats > maxCatsPerDoc) {
maxCatsPerDoc = docCats;
maxCatsPerDocDocs.clear();
maxCatsPerDocDocs.add(doc);
代码示例来源:origin: jatecs/jatecs
while (toUpdate) {
for (int i = 0; i < centroids.length; i++) {
centroids[i].documents.clear();
centroids[i].distances.clear();
代码示例来源:origin: jatecs/jatecs
if (dl < minLength) {
minLength = dl;
minLengthDocs.clear();
minLengthDocs.add(doc);
if (dl > maxLength) {
maxLength = dl;
maxLengthDocs.clear();
maxLengthDocs.add(doc);
maxTFFeats.clear();
maxTFFeats.add(feat);
maxTFDocs.clear();
maxTFDocs.add(doc);
代码示例来源:origin: jatecs/jatecs
if (df < minDF && df != 0) {
minDF = df;
minDFFeats.clear();
minDFFeats.add(feat);
if (df > maxDF) {
maxDF = df;
maxDFFeats.clear();
maxDFFeats.add(feat);
内容来源于网络,如有侵权,请联系作者删除!