java中的计数方法,在java集合中计数事件的优雅方式

Given a collection of objects with possible duplicates, I'd like end up with a count of occurrences per object. I do it by initializing an empty Map, then iterating through the Collection and mapping the object to its count (incrementing the count each time the map already contains the object).

public Map countOccurrences(Collection list){

Map occurrenceMap = new HashMap();

for(Object obj: list){

Integer numOccurrence = occurrenceMap.get(obj);

if(numOccurrence == null){

//first count

occurrenceMap.put(obj, 1);

} else{

occurrenceMap.put(obj, numOccurrence++);

}

}

return occurrenceMap;

}

This looks too verbose for a simple logic of counting occurrences. Is there a more elegant/shorter way of doing this? I'm open to a completely different algorithm or a java language specific feature that allows for a shorter code.

解决方案

Check out Guava's Multiset. Pretty much exactly what you're looking for.

Unfortunately it doesn't have an addAll(Iterable iterable) function, but a simple loop over your collection calling add(E e) is easy enough.

EDIT

My mistake, it does indeed have an addAll method - as it must, since it implements Collection.