Merge pull request #482 from steveyen/MB-21377
revert optimization that trims search-disjunction child searchers
This commit is contained in:
commit
09fc57c5db
|
@ -122,19 +122,6 @@ func (s *DisjunctionSearcher) updateMatches() error {
|
||||||
for i := 0; i < len(s.currs); i++ {
|
for i := 0; i < len(s.currs); i++ {
|
||||||
curr := s.currs[i]
|
curr := s.currs[i]
|
||||||
if curr == nil {
|
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
|
continue
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user