minor optimization of upsidedown backIndexRowForDoc
This change might allow a smart enough golang compiler to perhaps allocate a backIndexRow on the stack rather than the heap.
This commit is contained in:
parent
89a1cefde1
commit
8b140d84c4
|
@ -1008,7 +1008,7 @@ func init() {
|
||||||
|
|
||||||
func backIndexRowForDoc(kvreader store.KVReader, docID index.IndexInternalID) (*BackIndexRow, error) {
|
func backIndexRowForDoc(kvreader store.KVReader, docID index.IndexInternalID) (*BackIndexRow, error) {
|
||||||
// use a temporary row structure to build key
|
// use a temporary row structure to build key
|
||||||
tempRow := &BackIndexRow{
|
tempRow := BackIndexRow{
|
||||||
doc: docID,
|
doc: docID,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user