sg.atom.utils._commons.time.JodaUtils.java Source code

Introduction

Here is the source code for sg.atom.utils._commons.time.JodaUtils.java

Source

/*
 * Druid - a distributed column store.
 * Copyright (C) 2012  Metamarkets Group Inc.
 *
 * 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 2
 * 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, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
 */
package sg.atom.utils._commons.time;

import com.google.common.base.Predicate;
import com.google.common.collect.Iterables;
import com.google.common.collect.Lists;
import com.google.common.collect.Sets;
import org.joda.time.DateTime;
import org.joda.time.Interval;

import javax.annotation.Nullable;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.TreeSet;
import sg.atom.utils._commons.Comparators;

/**
 */
public class JodaUtils {

    public static ArrayList<Interval> condenseIntervals(Iterable<Interval> intervals) {
        ArrayList<Interval> retVal = Lists.newArrayList();

        TreeSet<Interval> sortedIntervals = Sets.newTreeSet(Comparators.intervalsByStartThenEnd());
        for (Interval interval : intervals) {
            sortedIntervals.add(interval);
        }

        if (sortedIntervals.isEmpty()) {
            return Lists.newArrayList();
        }

        Iterator<Interval> intervalsIter = sortedIntervals.iterator();
        Interval currInterval = intervalsIter.next();
        while (intervalsIter.hasNext()) {
            Interval next = intervalsIter.next();

            if (currInterval.overlaps(next) || currInterval.abuts(next)) {
                currInterval = new Interval(currInterval.getStart(), next.getEnd());
            } else {
                retVal.add(currInterval);
                currInterval = next;
            }
        }
        retVal.add(currInterval);

        return retVal;
    }

    public static Interval umbrellaInterval(Iterable<Interval> intervals) {
        ArrayList<DateTime> startDates = Lists.newArrayList();
        ArrayList<DateTime> endDates = Lists.newArrayList();

        for (Interval interval : intervals) {
            startDates.add(interval.getStart());
            endDates.add(interval.getEnd());
        }

        DateTime minStart = minDateTime(startDates.toArray(new DateTime[] {}));
        DateTime maxEnd = maxDateTime(endDates.toArray(new DateTime[] {}));

        if (minStart == null || maxEnd == null) {
            throw new IllegalArgumentException("Empty list of intervals");
        }
        return new Interval(minStart, maxEnd);
    }

    public static boolean overlaps(final Interval i, Iterable<Interval> intervals) {
        return Iterables.any(intervals, new Predicate<Interval>() {
            @Override
            public boolean apply(@Nullable Interval input) {
                return input.overlaps(i);
            }
        });

    }

    public static DateTime minDateTime(DateTime... times) {
        if (times == null) {
            return null;
        }

        switch (times.length) {
        case 0:
            return null;
        case 1:
            return times[0];
        default:
            DateTime min = times[0];
            for (int i = 1; i < times.length; ++i) {
                min = min.isBefore(times[i]) ? min : times[i];
            }
            return min;
        }
    }

    public static DateTime maxDateTime(DateTime... times) {
        if (times == null) {
            return null;
        }

        switch (times.length) {
        case 0:
            return null;
        case 1:
            return times[0];
        default:
            DateTime max = times[0];
            for (int i = 1; i < times.length; ++i) {
                max = max.isAfter(times[i]) ? max : times[i];
            }
            return max;
        }
    }
}