public class Count<T> extends HashMap<T,Integer>
| Modifier and Type | Class and Description |
|---|---|
static class |
Count.KeyComparator<T extends Comparable<? super T>> |
static class |
Count.OccurrenceComparator<T extends Comparable<? super T>> |
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
Count() |
| Modifier and Type | Method and Description |
|---|---|
int |
add(T id) |
int |
add(T id,
int value) |
void |
addAll(Map<T,Integer> all) |
void |
clear() |
TreeSet<Map.Entry<T,Integer>> |
getKeyOrderedEntries() |
TreeSet<Map.Entry<T,Integer>> |
getOccurrenceOrderedEntries() |
TreeSet<Map.Entry<T,Integer>> |
getOccurrenceOrderedEntries(boolean ascending) |
long |
getTotal() |
void |
printOrderedStats() |
void |
printOrderedStats(int topK) |
void |
printOrderedStats(int topK,
Logger log,
Level l) |
void |
printOrderedStats(int topK,
PrintStream out) |
void |
printOrderedStats(Logger log,
Level l) |
void |
printOrderedStats(PrintStream out) |
void |
printStats() |
void |
printStats(Logger log,
Level l) |
void |
printStats(PrintStream out) |
String |
toString() |
clone, compute, computeIfAbsent, computeIfPresent, containsKey, containsValue, entrySet, forEach, get, getOrDefault, isEmpty, keySet, merge, put, putAll, putIfAbsent, remove, remove, replace, replace, replaceAll, size, valuesequals, hashCodepublic long getTotal()
public int add(T id, int value)
public int add(T id)
public void printStats()
public void printStats(PrintStream out)
public void printOrderedStats()
public void printOrderedStats(PrintStream out)
public TreeSet<Map.Entry<T,Integer>> getOccurrenceOrderedEntries()
public TreeSet<Map.Entry<T,Integer>> getOccurrenceOrderedEntries(boolean ascending)
public void printOrderedStats(int topK)
public void printOrderedStats(int topK,
PrintStream out)
public String toString()
toString in class AbstractMap<T,Integer>Copyright © 2020. All rights reserved.