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

Introduction

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

Prototype

public C lowerEndpoint()

Source Link

Document

Returns the lower endpoint of this range.

Usage

From source file:org.calrissian.mango.domain.ip.CidrValueRangeIPv4.java

public CidrValueRangeIPv4(String cidrString) {

    Range<IPv4> range = cidrRange(cidrString);

    setStart(range.lowerEndpoint());
    setStop(range.upperEndpoint());
}

From source file:net.sf.mzmine.util.components.RangeComponent.java

public void setRangeValue(Range<Double> value) {
    minTxtField.setValue(value.lowerEndpoint());
    maxTxtField.setValue(value.upperEndpoint());
}

From source file:net.sf.mzmine.parameters.parametertypes.tolerances.MZTolerance.java

public Range<Double> getToleranceRange(final Range<Double> mzRange) {
    return Range.closed(mzRange.lowerEndpoint() - getMzToleranceForMass(mzRange.lowerEndpoint()),
            mzRange.upperEndpoint() + getMzToleranceForMass(mzRange.upperEndpoint()));
}

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

public double length(Range<Double> r) {
    return r.upperEndpoint() - r.lowerEndpoint();
}

From source file:com.dangdang.ddframe.rdb.integrate.fixture.SingleKeyDynamicModuloTableShardingAlgorithm.java

@Override
public Collection<String> doBetweenSharding(final Collection<String> availableTargetNames,
        final ShardingValue<Integer> shardingValue) {
    Collection<String> result = new LinkedHashSet<>(availableTargetNames.size());
    Range<Integer> range = shardingValue.getValueRange();
    for (Integer i = range.lowerEndpoint(); i <= range.upperEndpoint(); i++) {
        result.add(tablePrefix + i % 10);
    }//from w  w  w.j  a  va  2s. c  o m
    return result;
}

From source file:com.giaybac.traprange.TrapRangeBuilder.java

/**
 * The result will be ordered by lowerEndpoint ASC
 *
 * @return//  ww  w. j a va 2s .c  o  m
 */
public List<Range<Integer>> build() {
    List<Range<Integer>> retVal = new ArrayList<>();
    //order range by lower Bound
    Collections.sort(ranges, new Comparator<Range>() {
        @Override
        public int compare(Range o1, Range o2) {
            return o1.lowerEndpoint().compareTo(o2.lowerEndpoint());
        }
    });

    for (Range<Integer> range : ranges) {
        if (retVal.isEmpty()) {
            retVal.add(range);
        } else {
            Range<Integer> lastRange = retVal.get(retVal.size() - 1);
            if (lastRange.isConnected(range)) {
                Range newLastRange = lastRange.span(range);
                retVal.set(retVal.size() - 1, newLastRange);
            } else {
                retVal.add(range);
            }
        }
    }
    //debug
    logger.debug("Found " + retVal.size() + " trap-range(s)");
    //return
    return retVal;
}

From source file:net.sf.mzmine.parameters.parametertypes.ranges.IntRangeComponent.java

public void setValue(Range<Integer> value) {
    minTxtField.setText(String.valueOf(value.lowerEndpoint()));
    maxTxtField.setText(String.valueOf(value.upperEndpoint()));
}

From source file:com.dangdang.ddframe.rdb.sharding.example.jdbc.algorithm.SingleKeyModuloTableShardingAlgorithm.java

@Override
public Collection<String> doBetweenSharding(final Collection<String> availableTargetNames,
        final ShardingValue<Long> shardingValue) {
    Collection<String> result = new LinkedHashSet<>(availableTargetNames.size());
    Range<Long> range = shardingValue.getValueRange();
    for (Long i = range.lowerEndpoint(); i <= range.upperEndpoint(); i++) {
        for (String each : availableTargetNames) {
            if (each.endsWith(i % 2 + "")) {
                result.add(each);/*w  w  w . j a v  a2s.co m*/
            }
        }
    }
    return result;
}

From source file:com.dangdang.ddframe.rdb.sharding.example.jdbc.algorithm.ModuloTableShardingAlgorithm.java

@Override
public Collection<String> doBetweenSharding(final Collection<String> tableNames,
        final ShardingValue<Integer> shardingValue) {
    Collection<String> result = new LinkedHashSet<>(tableNames.size());
    Range<Integer> range = shardingValue.getValueRange();
    for (Integer i = range.lowerEndpoint(); i <= range.upperEndpoint(); i++) {
        for (String each : tableNames) {
            if (each.endsWith(i % 2 + "")) {
                result.add(each);/* w ww  .j a v a  2 s . c  o m*/
            }
        }
    }
    return result;
}

From source file:com.dangdang.ddframe.rdb.sharding.example.jpa.algorithm.SingleKeyModuloTableShardingAlgorithm.java

@Override
public Collection<String> doBetweenSharding(final Collection<String> availableTargetNames,
        final ShardingValue<Long> shardingValue) {
    Collection<String> result = new LinkedHashSet<>(availableTargetNames.size());
    Range<Long> range = shardingValue.getValueRange();
    for (Long value = range.lowerEndpoint(); value <= range.upperEndpoint(); value++) {
        for (String each : availableTargetNames) {
            if (each.endsWith(value % 2 + "")) {
                result.add(each);//from   w ww . j  a v  a 2 s  .c  o  m
            }
        }
    }
    return result;
}