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:com.stackframe.sarariman.PeriodOfPerformance.java

public PeriodOfPerformance(Range<Date> range) {
    this.start = range.lowerEndpoint();
    this.end = range.upperEndpoint();
}

From source file:com.dangdang.ddframe.rdb.integrate.fixture.SingleKeyModuloTableShardingAlgorithm.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++) {
        for (String each : availableTargetNames) {
            if (each.endsWith(i % 10 + "")) {
                result.add(each);//from   www .j a va 2  s .com
            }
        }
    }
    return result;
}

From source file:com.dangdang.ddframe.rdb.transaction.soft.ModuloDatabaseShardingAlgorithm.java

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

From source file:com.dangdang.ddframe.rdb.sharding.spring.algorithm.SingleKeyModuloTableShardingAlgorithm.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++) {
        for (String each : availableTargetNames) {
            if (each.endsWith(i % 4 + "")) {
                result.add(each);//from   w w  w. j  av a  2s  .  c o  m
            }
        }
    }
    return result;
}

From source file:com.lite.dal.algorithm.SingleKeyModuloTableShardingAlgorithm.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++) {
        for (String each : availableTargetNames) {
            if (each.endsWith(i % 2 + "")) {
                result.add(each);// w  w w. java2s  .c  o  m
            }
        }
    }
    return result;
}

From source file:com.dangdang.ddframe.rdb.sharding.example.transaction.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 value = range.lowerEndpoint(); value <= range.upperEndpoint(); value++) {
        for (String each : tableNames) {
            if (each.endsWith(value % 2 + "")) {
                result.add(each);//from w w w  .  j  a  v  a  2 s .  com
            }
        }
    }
    return result;
}

From source file:org.eclipse.m2m.internal.qvt.oml.tools.coverage.ui.CoverageAnnotator.java

public void annotate(IFile file, RangeSet<Integer> ranges, String markerType, String message) {

    for (Range<Integer> range : ranges.asRanges()) {

        int start = range.lowerEndpoint();
        int end = range.upperEndpoint();

        try {//from   ww w .j  av  a  2  s.c  o  m
            IMarker m = file.createMarker(markerType);
            m.setAttribute(IMarker.CHAR_START, start);
            m.setAttribute(IMarker.CHAR_END, end);
            if (message.length() > 0) {
                m.setAttribute(IMarker.MESSAGE, message);
            }

        } catch (Exception e) {
            Activator.error("Failed to setup coverage marker", e);
        }
    }
}

From source file:edu.cmu.sv.modelinference.eventtool.AvgEventGenerator.java

@Override
public List<Event> computeEvents(List<Range<Integer>> eventIntervals, double[] ys, int stepSize) {
    List<Event> avgForEvents = new ArrayList<>();
    int idx = 0;/*from  w ww  .j  a v a 2s  . co  m*/
    for (Range<Integer> event : eventIntervals) {
        double[] yData = new double[(event.upperEndpoint() - event.lowerEndpoint()) / stepSize];
        for (int i = 0, r = event.lowerEndpoint(); r < event.upperEndpoint(); r += stepSize, i++, idx++) {
            yData[i] = ys[idx];
        }
        avgForEvents.add(new Event(event, new AvgFeature(yData)));
    }
    return avgForEvents;
}

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

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

From source file:com.dangdang.ddframe.rdb.sharding.example.jdbc.algorithm.SingleKeyModuloDatabaseShardingAlgorithm.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 value = range.lowerEndpoint(); value <= range.upperEndpoint(); value++) {
        for (String each : availableTargetNames) {
            if (each.endsWith(value % 2 + "")) {
                result.add(each);//from w  w w  .j av a  2  s .c  o  m
            }
        }
    }
    return result;
}