/** * Unions a set of rangeSets, or returns null if the set is empty. */ public static <T extends Comparable<T>> RangeSet<T> unionRangeSets(final Iterable<RangeSet<T>> rangeSets) { final RangeSet<T> rangeSet = TreeRangeSet.create(); for (RangeSet<T> set : rangeSets) { rangeSet.addAll(set); } return rangeSet; }
@Override public RangeSet<String> getDimensionRangeSet(String dimension) { RangeSet<String> retSet = TreeRangeSet.create(); for (DimFilter field : fields) { RangeSet<String> rangeSet = field.getDimensionRangeSet(dimension); if (rangeSet == null) { return null; } else { retSet.addAll(rangeSet); } } return retSet; }
/** * Intersects a set of rangeSets, or returns null if the set is empty. */ public static <T extends Comparable<T>> RangeSet<T> intersectRangeSets(final Iterable<RangeSet<T>> rangeSets) { RangeSet<T> rangeSet = null; for (final RangeSet<T> set : rangeSets) { if (rangeSet == null) { rangeSet = TreeRangeSet.create(); rangeSet.addAll(set); } else { rangeSet.removeAll(set.complement()); } } return rangeSet; }
public void testAddAll() { RangeSet<Integer> rangeSet = TreeRangeSet.create(); rangeSet.add(Range.closed(3, 10)); rangeSet.addAll(Arrays.asList(Range.open(1, 3), Range.closed(5, 8), Range.closed(9, 11))); assertThat(rangeSet.asRanges()).containsExactly(Range.openClosed(1, 11)).inOrder(); }
private RangeSet<Integer> characterRanges(String input) { final RangeSet<Integer> characterRanges = TreeRangeSet.create(); if (parameters.lines().isEmpty() && parameters.offsets().isEmpty()) { characterRanges.add(Range.closedOpen(0, input.length())); return characterRanges; } characterRanges.addAll(Formatter.lineRangesToCharRanges(input, parameters.lines())); for (int i = 0; i < parameters.offsets().size(); i++) { Integer length = parameters.lengths().get(i); if (length == 0) { // 0 stands for "format the line under the cursor" length = 1; } characterRanges.add( Range.closedOpen(parameters.offsets().get(i), parameters.offsets().get(i) + length)); } return characterRanges; } }
public void testAddAllUnsupported() { RangeSet<Integer> rangeSet = ImmutableRangeSet.<Integer>builder() .add(Range.closed(5, 8)) .add(Range.closedOpen(1, 3)) .build(); try { rangeSet.addAll(ImmutableRangeSet.<Integer>of()); fail(); } catch (UnsupportedOperationException expected) { // success } }
/** * @see org.jclouds.googlecomputeengine.domain.Firewall.Rule#getPorts() */ public Builder ports(RangeSet<Integer> ports) { this.ports = TreeRangeSet.create(); this.ports.addAll(ports); return this; }
/** * @see org.jclouds.googlecomputeengine.domain.Firewall.Rule#getPorts() */ public Builder ports(RangeSet<Integer> ports) { this.ports = TreeRangeSet.create(); this.ports.addAll(ports); return this; }
/** * Unions a set of rangeSets, or returns null if the set is empty. */ public static <T extends Comparable<T>> RangeSet<T> unionRangeSets(final Iterable<RangeSet<T>> rangeSets) { final RangeSet<T> rangeSet = TreeRangeSet.create(); for (RangeSet<T> set : rangeSets) { rangeSet.addAll(set); } return rangeSet; }
public static IntervalBed merge(SAMSequenceDictionary dictionary, LinearGenomicCoordinate linear, Iterable<IntervalBed> list) { RangeSet<Long> blacklisted = TreeRangeSet.create(); for (IntervalBed bed : list) { // TODO assert dictionaries and linear coordinates match blacklisted.addAll(bed.intervals); } return new IntervalBed(dictionary, linear, blacklisted); } private static RangeSet<Long> toRangeSet(SAMSequenceDictionary dictionary, LinearGenomicCoordinate linear, File bed) throws IOException {
private static <T extends Passage> Map<String, RangeSet<Integer>> toUriSpans( Collection<T> passages) { Characteristics[] characters = new Collector.Characteristics[] { Collector.Characteristics.CONCURRENT, Collector.Characteristics.UNORDERED, Collector.Characteristics.IDENTITY_FINISH }; Collector<Passage, RangeSet<Integer>, RangeSet<Integer>> collector = Collector .<Passage, RangeSet<Integer>>of( () -> TreeRangeSet.create(), (s, p) -> s.add(TypeUtil.spanRangeInSection(p)), (s1, s2) -> { s1.addAll(s2); return s1; }, characters); return passages.parallelStream().collect(groupingBy(Passage::getUri, collector)); }
@Override public RangeSet<String> getDimensionRangeSet(String dimension) { RangeSet<String> retSet = TreeRangeSet.create(); for (DimFilter field : fields) { RangeSet<String> rangeSet = field.getDimensionRangeSet(dimension); if (rangeSet == null) { return null; } else { retSet.addAll(rangeSet); } } return retSet; }
@Override public RangeSet<String> getDimensionRangeSet(String dimension) { RangeSet<String> retSet = TreeRangeSet.create(); for (DimFilter field : fields) { RangeSet<String> rangeSet = field.getDimensionRangeSet(dimension); if (rangeSet == null) { return null; } else { retSet.addAll(rangeSet); } } return retSet; }
public static RangeSet<Integer> intersect(RangeSet<Integer> rs1, RangeSet<Integer> rs2) { RangeSet<Integer> rs = TreeRangeSet.create(); for (Range<Integer> r : rs1.asRanges()) { rs.addAll(rs2.subRangeSet(r)); } return rs; } /**
/** * Intersects a set of rangeSets, or returns null if the set is empty. */ public static <T extends Comparable<T>> RangeSet<T> intersectRangeSets(final Iterable<RangeSet<T>> rangeSets) { RangeSet<T> rangeSet = null; for (final RangeSet<T> set : rangeSets) { if (rangeSet == null) { rangeSet = TreeRangeSet.create(); rangeSet.addAll(set); } else { rangeSet.removeAll(set.complement()); } } return rangeSet; }
public static RangeSet<CharacterPosition> intersection(RangeSet<CharacterPosition> r1, RangeSet<CharacterPosition> r2) { RangeSet<CharacterPosition> inverse = TreeRangeSet.create(r1.complement()); inverse.addAll(r2.complement()); return inverse.complement(); }
private RangeSet<Integer> characterRanges(String input) { final RangeSet<Integer> characterRanges = TreeRangeSet.create(); if (parameters.lines().isEmpty() && parameters.offsets().isEmpty()) { characterRanges.add(Range.closedOpen(0, input.length())); return characterRanges; } characterRanges.addAll(Formatter.lineRangesToCharRanges(input, parameters.lines())); for (int i = 0; i < parameters.offsets().size(); i++) { Integer length = parameters.lengths().get(i); if (length == 0) { // 0 stands for "format the line under the cursor" length = 1; } characterRanges.add( Range.closedOpen(parameters.offsets().get(i), parameters.offsets().get(i) + length)); } return characterRanges; } }
public void testAddAll() { RangeSet<Integer> rangeSet = TreeRangeSet.create(); rangeSet.add(Range.closed(3, 10)); rangeSet.addAll(Arrays.asList(Range.open(1, 3), Range.closed(5, 8), Range.closed(9, 11))); assertThat(rangeSet.asRanges()) .containsExactly(Range.openClosed(1, 11)) .inOrder(); }
public void testAddAllUnsupported() { RangeSet<Integer> rangeSet = ImmutableRangeSet.<Integer>builder() .add(Range.closed(5, 8)) .add(Range.closedOpen(1, 3)) .build(); try { rangeSet.addAll(ImmutableRangeSet.<Integer>of()); fail(); } catch (UnsupportedOperationException expected) { // success } }
private void onVisibleLinesChange(Observable x, Range<Integer> o, Range<Integer> n) { RangeSet<Integer> toUpdate = TreeRangeSet.create(); RangeSet<Integer> toRelease = TreeRangeSet.create(); if (o != null && n != null) { RangeSet<Integer> hidden = TreeRangeSet.create(); hidden.add(o); hidden.remove(n); toRelease.addAll(hidden); } if (n != null) { toUpdate.add(getVisible()); } triggerUpdate(toUpdate); triggerRelease(toRelease); requestLayout(); }