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

List of usage examples 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.circletech.smartconnect.algorithm.ModuloTableShardingAlgorithm.java

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

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

From source file:com.squareup.wire.schema.internal.parser.ReservedElement.java

public final String toSchema() {
    StringBuilder builder = new StringBuilder();
    appendDocumentation(builder, documentation());
    builder.append("reserved ");
    ImmutableList<Object> value = values();
    for (int i = 0; i < value.size(); i++) {
        if (i > 0)
            builder.append(", ");

        Object reservation = value.get(i);
        if (reservation instanceof String) {
            builder.append('"').append(reservation).append('"');
        } else if (reservation instanceof Integer) {
            builder.append(reservation);
        } else if (reservation instanceof Range) {
            Range<Integer> range = (Range<Integer>) reservation;
            builder.append(range.lowerEndpoint()).append(" to ").append(range.upperEndpoint());
        } else {/*from w w w .j  a va2 s .co  m*/
            throw new AssertionError();
        }
    }
    return builder.append(";\n").toString();
}

From source file:com.circletech.smartconnect.algorithm.ModuloDatabaseShardingAlgorithm.java

@Override
public Collection<String> doBetweenSharding(final Collection<String> dataSourceNames,
        final ShardingValue<Long> shardingValue) {
    Collection<String> result = new LinkedHashSet<>(dataSourceNames.size());
    Range<Long> range = shardingValue.getValueRange();
    for (Long i = range.lowerEndpoint(); i <= range.upperEndpoint(); i++) {
        for (String each : dataSourceNames) {
            int shardingcode = customConfig.getDatasourcenum();
            if (each.endsWith(i % shardingcode + "")) {
                result.add(each);//from w  w w .  ja va  2  s .  c  o m
            }
        }
    }
    return result;
}

From source file:coolmapplugin.actions.MapSelectedToCytoscape.java

private LinkedList<Object> getSelectedColumnAndRowNames() {
    try {/*from   w  w  w . ja va 2 s. c o  m*/

        CoolMapObject obj = CoolMapMaster.getActiveCoolMapObject();
        CoolMapView coolMapView = obj.getCoolMapView();

        List<Range<Integer>> columnList = coolMapView.getSelectedColumns();
        List<Range<Integer>> rowList = coolMapView.getSelectedRows();

        LinkedList<Object> names = new LinkedList<>();

        for (Range<Integer> range : columnList) {
            for (int i = range.lowerEndpoint(); i < range.upperEndpoint(); ++i) {
                String columnName = obj.getViewNodeColumn(i).getName();
                names.add(columnName);
            }
        }

        for (Range<Integer> range : rowList) {
            for (int i = range.lowerEndpoint(); i < range.upperEndpoint(); ++i) {
                String rowName = obj.getViewNodeRow(i).getName();
                names.add(rowName);
            }
        }

        return names;
    } catch (Exception e) {
        CMConsole.logError("Failed to get selected columns and rows. Internal Error : " + e.getMessage());
    }
    return null;

}

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

public Range<Double> asReal(Range<Integer> r) {
    Range<Integer> asClosed = RangeTools.asClosed(r);
    return Range.closedOpen(asClosed.lowerEndpoint().doubleValue() - 1, asClosed.upperEndpoint().doubleValue());
}

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

private 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 ww w.ja  va  2s. c  o m
            }
        }
    }
    return result;
}

From source file:fung.util.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 = (Range<Integer>) shardingValue.getValueRange();
    for (Integer i = range.lowerEndpoint(); i <= range.upperEndpoint(); i++) {
        for (String each : dataSourceNames) {
            if (each.endsWith(i % 2 + "")) {
                result.add(each);//from   w ww . ja  v a2  s .c o  m
            }
        }
    }
    return result;
}

From source file:com.lite.dal.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 = (Range<Integer>) shardingValue.getValueRange();
    for (Integer i = range.lowerEndpoint(); i <= range.upperEndpoint(); i++) {
        for (String each : availableTargetNames) {
            if (each.endsWith(i % 2 + "")) {
                result.add(each);/* ww w  . ja  va2s.co  m*/
            }
        }
    }
    return result;
}

From source file:fr.inria.eventcloud.load_balancing.criteria.Criterion.java

public Criterion(String name, LoadBalancer loadBalancer, Range<Double> domain) {
    this(name, loadBalancer, domain, domain.upperEndpoint(), domain.lowerEndpoint());
}