Drop optimization that should make terms present in query and rankitem cheap in matching part of tree.

This optimization is outdated as this is not a normal usecase anymore, and queries have become larger and more expensive.

1 files changed, 0 insertions, 21 deletions

diff --git a/container-search/src/test/java/com/yahoo/prelude/query/test/QueryCanonicalizerTestCase.java b/container-search/src/test/java/com/yahoo/prelude/query/test/QueryCanonicalizerTestCase.java
index 81aa28a5326..d14697da981 100644
--- a/container-search/src/test/java/com/yahoo/prelude/query/test/QueryCanonicalizerTestCase.java
+++ b/container-search/src/test/java/com/yahoo/prelude/query/test/QueryCanonicalizerTestCase.java
@@ -467,27 +467,6 @@ public class QueryCanonicalizerTestCase {
     }
 
     @Test
-    void testRankDuplicateCheapification() {
-        AndItem and = new AndItem();
-        WordItem shoe = new WordItem("shoe", "prod");
-        and.addItem(shoe);
-        and.addItem(new WordItem("apparel & accessories", "tcnm"));
-        RankItem rank = new RankItem();
-        rank.addItem(and);
-
-        rank.addItem(new WordItem("shoe", "prod")); // rank item which also ossurs in first argument
-        for (int i = 0; i < 25; i++)
-            rank.addItem(new WordItem("word" + i, "normbrnd"));
-        QueryTree tree = new QueryTree(rank);
-
-        assertTrue(shoe.isRanked());
-        assertTrue(shoe.usePositionData());
-        QueryCanonicalizer.canonicalize(tree);
-        assertFalse(shoe.isRanked());
-        assertFalse(shoe.usePositionData());
-    }
-
-    @Test
     void queryTreeExceedsAllowedSize() {
         Query query = new Query();
         QueryTree tree = query.getModel().getQueryTree();