aboutsummaryrefslogtreecommitdiffstats
path: root/container-search/src/test/java/com/yahoo/search/dispatch/LeanHitTest.java
diff options
context:
space:
mode:
authorHenning Baldersheim <balder@yahoo-inc.com>2019-09-16 22:57:02 +0200
committerGitHub <noreply@github.com>2019-09-16 22:57:02 +0200
commit049d1eb173f90f002e9f7251476fa0c8a71e6f7e (patch)
tree432ee8550037db4765d5fe8bad542b7038643fe3 /container-search/src/test/java/com/yahoo/search/dispatch/LeanHitTest.java
parent74a39bfa696568cf2d94b9c3a773f4fc0c2d0d54 (diff)
Revert "Revert "Revert "Revert "Use a LeanHit until merging is done." MERGEOK"""
Diffstat (limited to 'container-search/src/test/java/com/yahoo/search/dispatch/LeanHitTest.java')
-rw-r--r--container-search/src/test/java/com/yahoo/search/dispatch/LeanHitTest.java42
1 files changed, 42 insertions, 0 deletions
diff --git a/container-search/src/test/java/com/yahoo/search/dispatch/LeanHitTest.java b/container-search/src/test/java/com/yahoo/search/dispatch/LeanHitTest.java
new file mode 100644
index 00000000000..3478038e427
--- /dev/null
+++ b/container-search/src/test/java/com/yahoo/search/dispatch/LeanHitTest.java
@@ -0,0 +1,42 @@
+package com.yahoo.search.dispatch;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+import static org.junit.Assert.assertTrue;
+
+public class LeanHitTest {
+ byte [] gidA = {'a'};
+ byte [] gidB = {'b'};
+ byte [] gidC = {'c'};
+ private void verifyTransitiveOrdering(LeanHit a, LeanHit b, LeanHit c) {
+ assertTrue(a.compareTo(b) < 0);
+ assertTrue(b.compareTo(c) < 0);
+ assertTrue(a.compareTo(c) < 0);
+ assertTrue(b.compareTo(a) > 0);
+ assertTrue(c.compareTo(b) > 0);
+ assertTrue(c.compareTo(a) > 0);
+ }
+ @Test
+ public void testOrderingByRelevance() {
+ assertEquals(0, new LeanHit(gidA, 0, 0, 1).compareTo(new LeanHit(gidA, 0, 0, 1)));
+ verifyTransitiveOrdering(new LeanHit(gidA, 0, 0, 1),
+ new LeanHit(gidA, 0, 0, 0),
+ new LeanHit(gidA, 0, 0, -1));
+ }
+ @Test
+ public void testOrderingByGid() {
+ assertEquals(0, new LeanHit(gidA, 0, 0, 1).compareTo(new LeanHit(gidA, 0, 0, 1)));
+
+ verifyTransitiveOrdering(new LeanHit(gidA, 0, 0, 1),
+ new LeanHit(gidB, 0, 0, 1),
+ new LeanHit(gidC, 0, 0, 1));
+ }
+ @Test
+ public void testOrderingBySortData() {
+ assertEquals(0, new LeanHit(gidA, 0, 0, gidA).compareTo(new LeanHit(gidA, 0, 0, gidA)));
+ verifyTransitiveOrdering(new LeanHit(gidA, 0, 0, gidA),
+ new LeanHit(gidA, 0, 0, gidB),
+ new LeanHit(gidA, 0, 0, gidC));
+ }
+}