Java SortedSet getEntryOrEmptySet(K key, Map> map)

Description

get Entry Or Empty Set

License

Open Source License

Declaration

public static <K, V> SortedSet<V> getEntryOrEmptySet(K key, Map<K, SortedSet<V>> map) 

Method Source Code

//package com.java2s;
/*/*from   ww w .j av a  2 s .  c  o m*/
 * JBoss, Home of Professional Open Source.
 * Copyright 2015, Red Hat, Inc., and individual contributors
 * as indicated by the @author tags. See the copyright.txt file in the
 * distribution for a full listing of individual contributors.
 *
 * This is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation; either version 2.1 of
 * the License, or (at your option) any later version.
 *
 * This software is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this software; if not, write to the Free
 * Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
 * 02110-1301 USA, or see the FSF site: http://www.fsf.org.
 */

import java.util.Map;

import java.util.SortedSet;
import java.util.TreeSet;

public class Main {
    public static <K, V> SortedSet<V> getEntryOrEmptySet(K key, Map<K, SortedSet<V>> map) {
        return (map.containsKey(key) ? map.get(key) : new TreeSet<V>());
    }
}

Related

1. computeGraphCauselessFromGraphMms( SortedMap>> causesByDepByName)
2. copyAndClearSet(SortedSet sourceSet)
3. doubleForDescreteStartAndEnds(SortedSet hours)
4. entriesSortedByValues( Map map)
5. fillOutHourly(SortedSet hours)
6. getFlatItems(Map> linkedWorkItemIDsMap)
7. getSortedIntersectionValues(Collection colection1, Collection colection2)
8. getSortedTypes(Class[] types)
9. intersect(SortedSet pSet1, SortedSet pSet2)