Java SortedSet doubleForDescreteStartAndEnds(SortedSet hours)

Description

Do a doubling that creates a set of times where start and end times become distinct even/odd entities in the set.

License

Open Source License

Declaration

public static SortedSet doubleForDescreteStartAndEnds(SortedSet hours) 

Method Source Code

//package com.java2s;
/*//w  w  w  .  j a  v a2s .  c  o  m
**    Copyright (C) 2003-2018 Institute for Systems Biology 
**                            Seattle, Washington, USA. 
**
**    This library 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 library 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 library; if not, write to the Free Software
**    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
*/

import java.util.SortedSet;

import java.util.Iterator;

import java.util.TreeSet;

public class Main {
    /***************************************************************************
    **
    ** Do a doubling that creates a set of times where start and end times
    ** become distinct even/odd entities in the set.
    */

    public static SortedSet doubleForDescreteStartAndEnds(SortedSet hours) {
        TreeSet retval = new TreeSet();
        if (hours.isEmpty()) {
            return (retval);
        }
        Iterator vit = hours.iterator();
        while (vit.hasNext()) {
            Integer time = (Integer) vit.next();
            int start = time.intValue() * 2;
            retval.add(new Integer(start));
            retval.add(new Integer(start + 1));
        }
        return (retval);
    }
}

Related

1. asSortedSet(T... args)
2. asSortedSet(T... elements)
3. computeGraphCauselessFromGraphLmms( List>>> causesByDepByNameList)
4. computeGraphCauselessFromGraphMms( SortedMap>> causesByDepByName)
5. copyAndClearSet(SortedSet sourceSet)
6. entriesSortedByValues( Map map)
7. fillOutHourly(SortedSet hours)
8. getEntryOrEmptySet(K key, Map> map)
9. getFlatItems(Map> linkedWorkItemIDsMap)