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

Java examples for java.util:Set Operation

Description

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

Demo Code

/*//from w  w  w.  j av a2 s. c  om
 **    Copyright (C) 2003-2012 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
 */
//package com.java2s;

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 Tutorials