0
0

avoid fieldTermFreqs loop if no composite fields

This commit is contained in:
Steve Yen 2016-01-13 09:08:19 -08:00
parent b286466787
commit fe39b3fd13
2 changed files with 18 additions and 14 deletions

View File

@ -65,15 +65,17 @@ func (f *Firestorm) Analyze(d *document.Document) *index.AnalysisResult {
analyzeField(field, true) analyzeField(field, true)
} }
for fieldIndex, tokenFreqs := range fieldTermFreqs { if len(d.CompositeFields) > 0 {
// see if any of the composite fields need this for fieldIndex, tokenFreqs := range fieldTermFreqs {
for _, compositeField := range d.CompositeFields { // see if any of the composite fields need this
compositeField.Compose(fieldNames[fieldIndex], fieldLengths[fieldIndex], tokenFreqs) for _, compositeField := range d.CompositeFields {
compositeField.Compose(fieldNames[fieldIndex], fieldLengths[fieldIndex], tokenFreqs)
}
} }
}
for _, compositeField := range d.CompositeFields { for _, compositeField := range d.CompositeFields {
analyzeField(compositeField, false) analyzeField(compositeField, false)
}
} }
rowsCapNeeded := len(rv.Rows) rowsCapNeeded := len(rv.Rows)

View File

@ -65,15 +65,17 @@ func (udc *UpsideDownCouch) Analyze(d *document.Document) *index.AnalysisResult
analyzeField(field, true) analyzeField(field, true)
} }
for fieldIndex, tokenFreqs := range fieldTermFreqs { if len(d.CompositeFields) > 0 {
// see if any of the composite fields need this for fieldIndex, tokenFreqs := range fieldTermFreqs {
for _, compositeField := range d.CompositeFields { // see if any of the composite fields need this
compositeField.Compose(fieldNames[fieldIndex], fieldLengths[fieldIndex], tokenFreqs) for _, compositeField := range d.CompositeFields {
compositeField.Compose(fieldNames[fieldIndex], fieldLengths[fieldIndex], tokenFreqs)
}
} }
}
for _, compositeField := range d.CompositeFields { for _, compositeField := range d.CompositeFields {
analyzeField(compositeField, false) analyzeField(compositeField, false)
}
} }
rowsCapNeeded := len(rv.Rows) + 1 rowsCapNeeded := len(rv.Rows) + 1