Java SortedSet getFlatItems(Map> linkedWorkItemIDsMap)

Description

Get the linked workItemIDs

License

Open Source License

Parameter

Parameter	Description
linkedWorkItemIDsMap	a parameter

Declaration

private static SortedSet<Integer> getFlatItems(Map<Integer, SortedSet<Integer>> linkedWorkItemIDsMap) 

Method Source Code

//package com.java2s;
/**/* w w w  .  j  a  va 2  s .c  o m*/
 * Genji Scrum Tool and Issue Tracker
 * Copyright (C) 2015 Steinbeis GmbH & Co. KG Task Management Solutions
    
 * <a href="http://www.trackplus.com">Genji Scrum Tool</a>
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

import java.util.Iterator;

import java.util.Map;

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

public class Main {
    /**
     * Get the linked workItemIDs
     * @param linkedWorkItemIDsMap
     * @return
     */
    private static SortedSet<Integer> getFlatItems(Map<Integer, SortedSet<Integer>> linkedWorkItemIDsMap) {
        //get the flat linked items
        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;
    }
}

Related

1. copyAndClearSet(SortedSet sourceSet)
2. doubleForDescreteStartAndEnds(SortedSet hours)
3. entriesSortedByValues( Map map)
4. fillOutHourly(SortedSet hours)
5. getEntryOrEmptySet(K key, Map> map)
6. getSortedIntersectionValues(Collection colection1, Collection colection2)
7. getSortedTypes(Class[] types)
8. intersect(SortedSet pSet1, SortedSet pSet2)
9. intersectSorted(final Collection c1, final Collection c2)