Example usage for com.google.common.collect Range upperEndpoint

Introduction

In this page you can find the example usage for com.google.common.collect Range upperEndpoint.

Prototype

public C upperEndpoint()

Source Link

Document

Returns the upper endpoint of this range.

Usage

From source file:org.mskcc.shenkers.data.interval.RangeTools.java

public static double lengthReal(Range<Double> i) {
    return i.upperEndpoint() - i.lowerEndpoint();
}

From source file:org.mskcc.shenkers.data.interval.RangeTools.java

public static int length(Range<Integer> i) {
    return i.upperEndpoint() - i.lowerEndpoint() + 1;
}

From source file:net.sf.mzmine.util.RangeUtils.java

public static double rangeLength(Range<Double> range) {
    return range.upperEndpoint() - range.lowerEndpoint();
}

From source file:net.sf.mzmine.util.RangeUtils.java

public static double rangeCenter(Range<Double> range) {
    return (range.upperEndpoint() + range.lowerEndpoint()) / 2.0;
}

From source file:com.google.devtools.javatools.transform.StringUtil.java

/**
 * Strips the given ranges from {@code text}.
 *//*from ww w.  j av  a  2s  .  c o m*/
public static final String stripRanges(String text, RangeSet<Integer> rangesToRemove) {
    StringBuilder contentBuilder = new StringBuilder(text);
    // Delete the ranges.  Go from last to first to avoid having to
    // compute the offsets.
    List<Range<Integer>> ranges = Lists.newArrayList(rangesToRemove.asRanges());
    Collections.reverse(ranges);
    for (Range<Integer> range : ranges) {
        contentBuilder.delete(range.lowerEndpoint(), range.upperEndpoint());
    }
    return contentBuilder.toString();
}

From source file:net.conquiris.lucene.search.SearchSupport.java

static <T extends Comparable<T>> T max(Range<? extends T> range) {
    if (range.hasUpperBound()) {
        return range.upperEndpoint();
    }// w w  w.  j  a v  a2  s.c  om
    return null;
}

From source file:net.sf.mzmine.util.RangeUtils.java

/**
 * Splits the range in numOfBins bins and then returns the index of the bin
 * which contains given value. Indexes are from 0 to (numOfBins - 1).
 *///from  w  w w  . j  a  v a  2s.co m
public static int binNumber(Range<Double> range, int numOfBins, double value) {
    double rangeLength = range.upperEndpoint() - range.lowerEndpoint();
    double valueDistanceFromStart = value - range.lowerEndpoint();
    int index = (int) Math.round((valueDistanceFromStart / rangeLength) * (numOfBins - 1));
    return index;
}

From source file:jetbrains.jetpad.projectional.view.ScrollUtil.java

static int moveDelta(Range<Integer> container, Range<Integer> range) {
    if (container.encloses(range))
        return 0;
    if (container.upperEndpoint() - container.lowerEndpoint() < range.upperEndpoint() - range.lowerEndpoint()) {
        return container.lowerEndpoint() - range.lowerEndpoint();
    }/*  ww w.  j a  v  a  2  s .  c  o  m*/

    if (container.contains(range.upperEndpoint())) {
        return container.lowerEndpoint() - range.lowerEndpoint();
    }

    if (container.contains(range.lowerEndpoint())) {
        return container.upperEndpoint() - range.upperEndpoint();
    }

    if (container.upperEndpoint() < range.lowerEndpoint()) {
        return container.upperEndpoint() - range.upperEndpoint();
    } else if (container.lowerEndpoint() > range.upperEndpoint()) {
        return container.lowerEndpoint() - range.lowerEndpoint();
    } else {
        throw new IllegalStateException("This can't happen");
    }
}

From source file:com.wealdtech.utils.WealdInterval.java

public static WealdInterval fromRange(final Range<DateTime> range) {
    return new WealdInterval(range.lowerEndpoint(), range.upperEndpoint());
}

From source file:com.facebook.presto.sql.planner.iterative.rule.PushLimitThroughOuterJoin.java

private static boolean isLimited(PlanNode node, Lookup lookup, long limit) {
    Range<Long> cardinality = extractCardinality(node, lookup);
    return cardinality.hasUpperBound() && cardinality.upperEndpoint() <= limit;
}