List of usage examples for com.google.common.collect DiscreteDomain integers
public static DiscreteDomain<Integer> integers()
From source file:io.techcode.velox.math.FastMath.java
/** * Returns a random int value defined by the range. * * @param range range definition./*from w ww. ja v a 2 s .co m*/ * @return random int value. */ public static int randomInt(Range<Integer> range) { return randomGeneric(range, DiscreteDomain.integers()); }
From source file:crud.http.util.FailedResponseOperator.java
/** * Treat all non-200-range responses as errors. *//*from w w w . j a va 2 s .c om*/ public static FailedResponseOperator nonSuccessResponses() { if (nonSuccessResponses == null) { final ImmutableSet<Integer> prefix = ContiguousSet .create(Range.closedOpen(MIN_STATUS_CODE, MIN_SUCCESS_STATUS_CODE), DiscreteDomain.integers()); final ImmutableSet<Integer> suffix = ContiguousSet .create(Range.openClosed(MAX_SUCCESS_STATUS_CODE, MAX_STATUS_CODE), DiscreteDomain.integers()); final ImmutableSet<Integer> all = ImmutableSet.<Integer>builder().addAll(prefix).addAll(suffix).build(); // Don't delegate to fromStatusCodes(): it does extraneous checking nonSuccessResponses = new FailedResponseOperator(all); } return nonSuccessResponses; }
From source file:org.apache.calcite.chinook.PreferredGenresTableFactory.java
private Queryable<Integer> fetchPreferredGenres() { if (EnvironmentFairy.getUser() == EnvironmentFairy.User.SPECIFIC_USER) { return Linq4j.asEnumerable(SPECIFIC_USER_PREFERRED_GENRES).asQueryable(); } else {// w w w .ja va 2 s. co m final ContiguousSet<Integer> set = ContiguousSet.create(Range.closed(FIRST_ID, LAST_ID), DiscreteDomain.integers()); return Linq4j.asEnumerable(set).asQueryable(); } }
From source file:org.apache.calcite.chinook.PreferredAlbumsTableFactory.java
private Queryable<Integer> fetchPreferredAlbums() { if (EnvironmentFairy.getUser() == EnvironmentFairy.User.SPECIFIC_USER) { return Linq4j.asEnumerable(SPECIFIC_USER_PREFERRED_ALBUMS).asQueryable(); } else {//from ww w .j a v a2s. c o m final ContiguousSet<Integer> set = ContiguousSet.create(Range.closed(FIRST_ID, LAST_ID), DiscreteDomain.integers()); return Linq4j.asEnumerable(set).asQueryable(); } }
From source file:com.cognifide.aet.job.common.datafilters.removelines.RemoveLinesDataModifier.java
private Set<Integer> extractIndexes(String dataRanges) throws ParametersException { Set<Integer> indexesToRemove = new HashSet<Integer>(); if (dataRanges != null) { for (String range : dataRanges.split(";")) { try { String[] split = range.split(","); indexesToRemove.addAll(/*w w w. j ava2s. c o m*/ ContiguousSet.create(Range.closed(Integer.valueOf(split[0]), Integer.valueOf(split[1])), DiscreteDomain.integers())); } catch (IllegalArgumentException e) { throw new ParametersException("Bad range: " + range, e); } } } return indexesToRemove; }
From source file:org.apache.aurora.scheduler.base.Numbers.java
/** * Performs {@link #toRange(IRange)} for a collection of ranges, and convert the result to a set * of integers./*from w w w. ja v a 2s .c o m*/ * * @param ranges Ranges to convert. * @return A set representing {@code ranges}. */ public static Set<Integer> rangesToInstanceIds(Iterable<IRange> ranges) { ImmutableRangeSet.Builder<Integer> instanceIds = ImmutableRangeSet.builder(); for (IRange range : ranges) { instanceIds.add(toRange(range)); } return instanceIds.build().asSet(DiscreteDomain.integers()); }
From source file:com.comphenix.protocol.RangeParser.java
/** * Simplify a list of ranges by assuming a maximum value. * @param ranges - the list of ranges to simplify. * @param maximum - the maximum value (minimum value is always 0). * @return A simplified list of ranges.//from w ww . j a v a2 s. c o m */ private static List<Range<Integer>> simplify(List<Range<Integer>> ranges, int maximum) { List<Range<Integer>> result = new ArrayList<Range<Integer>>(); boolean[] set = new boolean[maximum + 1]; int start = -1; // Set every ID for (Range<Integer> range : ranges) { for (int id : ContiguousSet.create(range, DiscreteDomain.integers())) { set[id] = true; } } // Generate ranges from this set for (int i = 0; i <= set.length; i++) { if (i < set.length && set[i]) { if (start < 0) { start = i; } } else { if (start >= 0) { result.add(Range.closed(start, i - 1)); start = -1; } } } return result; }
From source file:com.reimed.guid.client.pii.validation.GreogorianBirthdayConstraint.java
private ContiguousSet<Integer> range(int start, int end) { return ContiguousSet.create(Range.closed(start, end), DiscreteDomain.integers()); }
From source file:com.google.errorprone.refaster.UBlank.java
@Override public Choice<UnifierWithUnconsumedStatements> apply(final UnifierWithUnconsumedStatements state) { int goodIndex = 0; while (goodIndex < state.unconsumedStatements().size()) { StatementTree stmt = state.unconsumedStatements().get(goodIndex); if (firstNonNull(FORBIDDEN_REFERENCE_SCANNER.scan(stmt, state.unifier()), false) && ControlFlowVisitor.INSTANCE.visitStatement(stmt) == ControlFlowVisitor.Result.NEVER_EXITS) { break; } else {//w ww. jav a2 s . c o m goodIndex++; } } Collection<Integer> breakPoints = ContiguousSet.create(Range.closed(0, goodIndex), DiscreteDomain.integers()); return Choice.from(breakPoints).transform(new Function<Integer, UnifierWithUnconsumedStatements>() { @Override public UnifierWithUnconsumedStatements apply(Integer k) { Unifier unifier = state.unifier().fork(); unifier.putBinding(key(), state.unconsumedStatements().subList(0, k)); List<? extends StatementTree> remaining = state.unconsumedStatements().subList(k, state.unconsumedStatements().size()); return UnifierWithUnconsumedStatements.create(unifier, remaining); } }); }
From source file:org.caleydo.view.crossword.api.ui.band.Route.java
private Iterable<Vec2f> shiftCurve(final IDoubleFunction radius) { final int last = curve.length - 1; final float distanceFactor = 1.f / distances[last]; return Iterables.transform(ContiguousSet.create(Range.closed(0, last), DiscreteDomain.integers()), new Function<Integer, Vec2f>() { @Override// ww w . jav a 2 s . co m public Vec2f apply(Integer input) { int i = input.intValue(); final float t = distances[i] * distanceFactor; final float r = (float) radius.apply(t); Vec2f p = curve[i].addScaled(r, normals[i]); return p; } }); }