org.tallison.quaerite.analysis.EquivalenceSet Maven / Gradle / Ivy
/*
* 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.tallison.quaerite.analysis;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import org.apache.commons.lang3.mutable.MutableLong;
import org.tallison.quaerite.core.util.MapUtil;
public class EquivalenceSet implements Comparable {
private long total = 0;
private Map counts = new HashMap<>();
public void addTerm(String term, long count) {
if (counts.containsKey(term)) {
counts.get(term).add(count);
} else {
counts.put(term, new MutableLong(count));
}
total += count;
}
public Map getSortedMap() {
return MapUtil.sortByDescendingValue(counts);
}
public Map getMap() {
return counts;
}
public int size() {
return counts.size();
}
public long getTotalCount() {
return total;
}
@Override
public int compareTo(EquivalenceSet o) {
if (this.counts.size() == o.counts.size()) {
return Long.compare(this.total, o.total);
}
return Integer.compare(this.counts.size(), o.counts.size());
}
@Override
public String toString() {
return "EquivalenceSet{" +
"total=" + total +
", counts=" + counts +
'}';
}
public static class DescendingTotalComparator implements Comparator {
@Override
public int compare(EquivalenceSet o1, EquivalenceSet o2) {
if (o1.total == o2.total) {
return Long.compare(o1.size(), o2.size());
}
return Long.compare(o1.total, o2.total);
}
}
}