less search overhead when first result set is smaller than requested

12 years ago · 4ca1b76627
parent f748b0aa7c
commit 4ca1b76627
1 changed files with 3 additions and 1 deletions
--- a/source/net/yacy/peers/RemoteSearch.java
+++ b/source/net/yacy/peers/RemoteSearch.java
@ -263,9 +263,10 @@ public class RemoteSearch extends Thread {
                int tmpoffset = 0;
                int tmpcount = 10;
                while (tmpoffset + tmpcount <= count && tmpcount > 0) {
+                    int urls = 0;
                    try {
                        event.rankingProcess.oneFeederStarted();
-                        int urls = Protocol.solrQuery(
+                        urls = Protocol.solrQuery(
                                        event,
                                        tmpoffset,
                                        tmpcount,
@ -286,6 +287,7 @@ public class RemoteSearch extends Thread {
                    } finally {
                        event.rankingProcess.oneFeederTerminated();
                    }
+                    if (urls < tmpcount) break; // there won't be more
                    tmpoffset += tmpcount;
                    tmpcount = count - tmpoffset; // increase the tmpcount to get to all results in less time
                }