It is enough to have a single document to verify that the corpus is OK.

2 files changed, 10 insertions, 1 deletions

diff --git a/container-search/src/main/java/com/yahoo/search/result/Coverage.java b/container-search/src/main/java/com/yahoo/search/result/Coverage.java
index 390c6ec4435..2688e706d5a 100644
--- a/container-search/src/main/java/com/yahoo/search/result/Coverage.java
+++ b/container-search/src/main/java/com/yahoo/search/result/Coverage.java
@@ -10,7 +10,7 @@ package com.yahoo.search.result;
 public class Coverage extends com.yahoo.container.handler.Coverage {
 
     public Coverage(long docs, long active) {
-        this(docs, active, docs > 1 ? 1 : 0, docs > 1 ? 1: 0);
+        this(docs, active, (docs > 0) ? 1 : 0, (docs > 0) ? 1: 0);
     }
 
     public Coverage(long docs, long active, int nodes) {
diff --git a/container-search/src/test/java/com/yahoo/search/result/CoverageTestCase.java b/container-search/src/test/java/com/yahoo/search/result/CoverageTestCase.java
index 4d521e3e8b4..4afb03a9cab 100644
--- a/container-search/src/test/java/com/yahoo/search/result/CoverageTestCase.java
+++ b/container-search/src/test/java/com/yahoo/search/result/CoverageTestCase.java
@@ -90,4 +90,13 @@ public class CoverageTestCase {
         verifyCoverageConversion(new Coverage(6, 10).setDegradedReason(7).setTargetActive(12));
     }
 
+    @Test
+    void testCoverageWorksForCorpusAboveZero() {
+        for (int i =1; i < 10; i++) {
+            Coverage coverage = new Coverage(i, i);
+            assertEquals(1, coverage.getNodes());
+            verifyCoverageConversion(coverage);
+        }
+    }
+
 }