Support multiple inheritance of rank profiles

2 files changed, 8 insertions, 8 deletions

diff --git a/container-search/src/main/java/com/yahoo/prelude/fastsearch/FastHit.java b/container-search/src/main/java/com/yahoo/prelude/fastsearch/FastHit.java
index 7c7f01b414a..094367dc140 100644
--- a/container-search/src/main/java/com/yahoo/prelude/fastsearch/FastHit.java
+++ b/container-search/src/main/java/com/yahoo/prelude/fastsearch/FastHit.java
@@ -377,7 +377,7 @@ public class FastHit extends Hit {
         }
     }
 
-    private static void appendAsHex(byte [] gid, StringBuilder sb) {
+    private static void appendAsHex(byte[] gid, StringBuilder sb) {
         for (byte b : gid) {
             String hex = Integer.toHexString(0xFF & b);
             if (hex.length() == 1) {
diff --git a/container-search/src/main/java/com/yahoo/search/dispatch/LeanHit.java b/container-search/src/main/java/com/yahoo/search/dispatch/LeanHit.java
index 03b0f092abb..bd0415fa449 100644
--- a/container-search/src/main/java/com/yahoo/search/dispatch/LeanHit.java
+++ b/container-search/src/main/java/com/yahoo/search/dispatch/LeanHit.java
@@ -11,17 +11,17 @@ import java.util.Arrays;
  */
 public class LeanHit implements Comparable<LeanHit> {
 
-    private final byte [] gid;
+    private final byte[] gid;
     private final double relevance;
-    private final byte [] sortData;
+    private final byte[] sortData;
     private final int partId;
     private final int distributionKey;
     private FeatureData matchFeatures;
 
-    public LeanHit(byte [] gid, int partId, int distributionKey, double relevance) {
+    public LeanHit(byte[] gid, int partId, int distributionKey, double relevance) {
         this(gid, partId, distributionKey, relevance, null);
     }
-    public LeanHit(byte [] gid, int partId, int distributionKey, double relevance, byte [] sortData) {
+    public LeanHit(byte[] gid, int partId, int distributionKey, double relevance, byte[] sortData) {
         this.gid = gid;
         this.relevance = Double.isNaN(relevance) ? Double.NEGATIVE_INFINITY : relevance;
         this.sortData = sortData;
@@ -31,8 +31,8 @@ public class LeanHit implements Comparable<LeanHit> {
     }
 
     public double getRelevance() { return relevance; }
-    public byte [] getGid() { return gid; }
-    public byte [] getSortData() { return sortData; }
+    public byte[] getGid() { return gid; }
+    public byte[] getSortData() { return sortData; }
     public boolean hasSortData() { return sortData != null; }
     public int getPartId() { return partId; }
     public int getDistributionKey() { return distributionKey; }
@@ -51,7 +51,7 @@ public class LeanHit implements Comparable<LeanHit> {
         return (res != 0) ? res : compareData(gid, o.gid);
     }
 
-    private static int compareData(byte [] left, byte [] right) {
+    private static int compareData(byte[] left, byte[] right) {
         int i = Arrays.mismatch(left, right);
         if (i < 0) {
             return 0;