a444c25ddf
Instead of sorting docNum keys from a hashmap, this change instead iterates from docNum 0 to N and uses an array instead of hashmap. The array is also reused across outer loop iterations. This optimizes for when there's a lot of structural similarity between docs, where many/most docs have the same fields. i.e., beers, breweries. If every doc has completely different fields, then this change might produce worse behavior compared to the previous sparse hashmap approach. |
||
|---|---|---|
| .. | ||
| mem | ||
| zap | ||
| empty.go | ||
| int_test.go | ||
| int.go | ||
| segment.go | ||