TermValueList<T> list = (listFactory == null ? (TermValueList<T>) new TermStringList()
: listFactory.createTermList());
IntArrayList minIDList = new IntArrayList();
IntArrayList maxIDList = new IntArrayList();
IntArrayList freqList = new IntArrayList();
OpenBitSet bitset = new OpenBitSet(maxdoc + 1);
int negativeValueCount = getNegativeValueCount(reader, field);
int t = 1; // valid term id starts from 1
list.add(null);
minIDList.add(-1);
maxIDList.add(-1);
freqList.add(0);
_overflow = false;
Terms terms = reader.terms(field);
if (terms != null) {
TermsEnum termsEnum = terms.iterator(null);
BytesRef text;
while ((text = termsEnum.next()) != null) {
String strText = text.utf8ToString();
list.add(strText);
Term term = new Term(field, strText);
DocsEnum docsEnum = reader.termDocsEnum(term);
int df = 0;
int minID = -1;
int maxID = -1;
int docID = -1;
int valId = (t - 1 < negativeValueCount) ? (negativeValueCount - t + 1) : t;
while ((docID = docsEnum.nextDoc()) != DocsEnum.NO_MORE_DOCS) {
df++;
if (!loader.add(docID, valId)) logOverflow(fieldName);
minID = docID;
bitset.fastSet(docID);
while (docsEnum.nextDoc() != DocsEnum.NO_MORE_DOCS) {
docID = docsEnum.docID();
df++;
if (!loader.add(docID, valId)) logOverflow(fieldName);
bitset.fastSet(docID);
}
maxID = docID;
}
freqList.add(df);
minIDList.add(minID);
maxIDList.add(maxID);
t++;
}
}
list.seal();
// Process minIDList and maxIDList for negative number
for (int i = 1; i < negativeValueCount/2 + 1; ++i) {
int top = i;
int tail = negativeValueCount - i + 1;
int topValue = minIDList.getInt(top);
int tailValue = minIDList.getInt(tail);
minIDList.set(top, tailValue);
minIDList.set(tail, topValue);
topValue = maxIDList.getInt(top);
tailValue = maxIDList.getInt(tail);
maxIDList.set(top, tailValue);
maxIDList.set(tail, topValue);
}
try {
_nestedArray.load(maxdoc + 1, loader);
} catch (IOException e) {
throw e;
} catch (Exception e) {
throw new RuntimeException("failed to load due to " + e.toString(), e);
}
this.valArray = list;
this.freqs = freqList.toIntArray();
this.minIDs = minIDList.toIntArray();
this.maxIDs = maxIDList.toIntArray();
int doc = 0;
while (doc < maxdoc && !_nestedArray.contains(doc, 0, true)) {
++doc;
}
if (doc < maxdoc) {
this.minIDs[0] = doc;
doc = maxdoc - 1;
while (doc >= 0 && !_nestedArray.contains(doc, 0, true)) {
--doc;
}
this.maxIDs[0] = doc;
}
this.freqs[0] = maxdoc - (int) bitset.cardinality();
}