Java Utililty Methods SortedSet

return (map.containsKey(key) ? map.get(key) : new TreeSet<V>());

SortedSet<Integer> linkedWorkItemIDsSet = new TreeSet<Integer>();
if (linkedWorkItemIDsMap != null) {
    Iterator<SortedSet<Integer>> iterator = linkedWorkItemIDsMap.values().iterator();
    while (iterator.hasNext()) {
        linkedWorkItemIDsSet.addAll(iterator.next());
return linkedWorkItemIDsSet;
...

Set<T> set = new TreeSet<>();
set.addAll(getIntersectionValues(colection1, colection2));
return set;

final TreeSet<Class<?>> classes = new TreeSet<Class<?>>(CLASS_COMPARATOR);
if (types != null) {
    classes.addAll(asList(types));
return classes;

SortedSet<E> result = new TreeSet<>();
Iterator<E> it1 = pSet1.iterator();
Iterator<E> it2 = pSet2.iterator();
if (!it1.hasNext()) {
    return result;
if (!it2.hasNext()) {
    return result;
...

final SortedSet<T> set = new TreeSet<T>();
for (T t : c1) {
    if (c2.contains(t))
        set.add(t);
return set;

SortedSet result = new TreeSet();
Iterator iter = map.entrySet().iterator();
Map.Entry me;
while (iter.hasNext()) {
    me = (Map.Entry) iter.next();
    result.add(me.getValue());
return result;
...

return new TreeSet<T>();

TreeSet union = new TreeSet(s1);
union.addAll(s2);
int sum = 0;
Iterator uit = union.iterator();
while (uit.hasNext()) {
    String unext = (String) uit.next();
    int increment = (s1.contains(unext) && s2.contains(unext)) ? 0 : 1;
    sum += increment;
...

SortedSet<E> result = new TreeSet<>();
Iterator<E> it1 = pSet1.iterator();
while (it1.hasNext()) {
    E elem = it1.next();
    if (!pSet2.contains(elem)) {
        result.add(elem);
return result;