gibheer/bleve
0
0
Fork 0
Code

optimize upsidedown mergeOldAndNew existing key maps

Browse Source 
The optimization is to provide a better initial size to the map
constructor and to use a 0-byte-sized struct{} as the map values.
This commit is contained in:
Steve Yen 2017-01-07 22:05:52 -08:00
parent c2bafa2a51
commit 40780254ae
1 changed files with 10 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
index/upsidedown/upsidedown.go
View File

@ -502,14 +502,18 @@ func (udc *UpsideDownCouch) mergeOldAndNew(backIndexRow *BackIndexRow, rows []in
updateRows = make([]UpsideDownCouchRow, 0, len(rows))
deleteRows = make([]UpsideDownCouchRow, 0, len(rows))
existingTermKeys := make(map[string]bool)
for _, key := range backIndexRow.AllTermKeys() {
existingTermKeys[string(key)] = true
var mark struct{}
backIndexTermKeys := backIndexRow.AllTermKeys()
existingTermKeys := make(map[string]struct{}, len(backIndexTermKeys))
for _, key := range backIndexTermKeys {
existingTermKeys[string(key)] = mark
}
existingStoredKeys := make(map[string]bool)
for _, key := range backIndexRow.AllStoredKeys() {
existingStoredKeys[string(key)] = true
backIndexStoredKeys := backIndexRow.AllStoredKeys()
existingStoredKeys := make(map[string]struct{}, len(backIndexStoredKeys))
for _, key := range backIndexStoredKeys {
existingStoredKeys[string(key)] = mark
}
keyBuf := GetRowBuffer()