| /* |
| * Licensed to the Apache Software Foundation (ASF) under one or more |
| * contributor license agreements. See the NOTICE file distributed with |
| * this work for additional information regarding copyright ownership. |
| * The ASF licenses this file to You under the Apache License, Version 2.0 |
| * (the "License"); you may not use this file except in compliance with |
| * the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| package org.apache.lucene.codecs; |
| |
| import java.util.ArrayList; |
| import java.util.Collections; |
| import java.util.Comparator; |
| import java.util.Set; |
| import java.util.TreeSet; |
| |
| import org.apache.lucene.index.Impact; |
| import org.apache.lucene.util.LuceneTestCase; |
| |
| public class TestCompetitiveFreqNormAccumulator extends LuceneTestCase { |
| |
| public void testBasics() { |
| CompetitiveImpactAccumulator acc = new CompetitiveImpactAccumulator(); |
| Set<Impact> expected = new TreeSet<>(Comparator.comparingInt(i -> i.freq)); |
| |
| acc.add(3, 5); |
| expected.add(new Impact(3, 5)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(6, 11); |
| expected.add(new Impact(6, 11)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(10, 13); |
| expected.add(new Impact(10, 13)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(1, 2); |
| expected.add(new Impact(1, 2)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(7, 9); |
| expected.remove(new Impact(6, 11)); |
| expected.add(new Impact(7, 9)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(8, 2); |
| expected.clear(); |
| expected.add(new Impact(10, 13)); |
| expected.add(new Impact(8, 2)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| } |
| |
| public void testExtremeNorms() { |
| CompetitiveImpactAccumulator acc = new CompetitiveImpactAccumulator(); |
| Set<Impact> expected = new TreeSet<>(Comparator.comparingInt(i -> i.freq)); |
| |
| acc.add(3, 5); |
| expected.add(new Impact(3, 5)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(10, 10000); |
| expected.add(new Impact(10, 10000)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(5, 200); |
| expected.add(new Impact(5, 200)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(20, -100); |
| expected.add(new Impact(20, -100)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| |
| acc.add(30, -3); |
| expected.add(new Impact(30, -3)); |
| assertEquals(new ArrayList<>(expected), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| } |
| |
| public void testOmitFreqs() { |
| CompetitiveImpactAccumulator acc = new CompetitiveImpactAccumulator(); |
| |
| acc.add(1, 5); |
| acc.add(1, 7); |
| acc.add(1, 4); |
| |
| assertEquals(Collections.singletonList(new Impact(1, 4)), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| } |
| |
| public void testOmitNorms() { |
| CompetitiveImpactAccumulator acc = new CompetitiveImpactAccumulator(); |
| |
| acc.add(5, 1); |
| acc.add(7, 1); |
| acc.add(4, 1); |
| |
| assertEquals(Collections.singletonList(new Impact(7, 1)), new ArrayList<>(acc.getCompetitiveFreqNormPairs())); |
| } |
| } |