gibheer
/
bleve
0
0
Fork 0
Code

revert optimization that trims search-disjunction child searchers 

This commit reverts a previous optimization attempt 3f588cd4a that
tried to trim or shrink the array of child searchers in a
search-disjunction.

Although I am not sure why at the moment, that optimization
incorrectly broke higher level boolean queries, but reverting so that
functionality is restored.
This commit is contained in:
Steve Yen 2016-10-18 14:32:58 -07:00
parent bfec4f23c0
commit 58c3b5c9b8
1 changed files with 0 additions and 13 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
search/searcher/search_disjunction.go
View File

@ -122,19 +122,6 @@ func (s *DisjunctionSearcher) updateMatches() error {
for i := 0; i < len(s.currs); i++ {
curr := s.currs[i]
if curr == nil {
err := s.searchers[i].Close()
if err != nil {
return err
}
last := len(s.searchers) - 1
s.searchers[i] = s.searchers[last]
s.searchers = s.searchers[0:last]
s.currs[i] = s.currs[last]
s.currs = s.currs[0:last]
i-- // To keep i the same for the next iteration.
continue
}