try { positions.stream() .filter(position -> individualDeletedMessages.contains((PositionImpl) position) || ((PositionImpl) position).compareTo(markDeletePosition) < 0) .forEach(alreadyAcknowledgedPositions::add);
boolean includeEntry = !individualDeletedMessages.contains((PositionImpl) entry.getPosition()); if (!includeEntry) { if (log.isDebugEnabled()) {
public void testRangeContaining2() { RangeSet<Integer> rangeSet = TreeRangeSet.create(); rangeSet.add(Range.closed(3, 10)); rangeSet.remove(Range.open(5, 7)); assertEquals(Range.closed(3, 5), rangeSet.rangeContaining(5)); assertTrue(rangeSet.contains(5)); assertEquals(Range.closed(7, 10), rangeSet.rangeContaining(8)); assertTrue(rangeSet.contains(8)); assertNull(rangeSet.rangeContaining(6)); assertFalse(rangeSet.contains(6)); }
/** * Expand a token range to start and end on acceptable boundaries for re-formatting. * * @param iRange the {@link Range} of tokens * @return the expanded token range */ private Range<Integer> expandToBreakableRegions(Range<Integer> iRange) { // The original line range. int loTok = iRange.lowerEndpoint(); int hiTok = iRange.upperEndpoint() - 1; // Expand the token indices to formattable boundaries (e.g. edges of statements). if (!partialFormatRanges.contains(loTok) || !partialFormatRanges.contains(hiTok)) { return EMPTY_RANGE; } loTok = partialFormatRanges.rangeContaining(loTok).lowerEndpoint(); hiTok = partialFormatRanges.rangeContaining(hiTok).upperEndpoint(); return Range.closedOpen(loTok, hiTok + 1); }
private Optional<Description> generateFix(String replacement) { int startPosition = getStartPosition(getCurrentPath().getLeaf(), state); if (emittedFixes.contains(startPosition)) { // We already emitted a fix surrounding this location. return Optional.empty(); } Range<Integer> containingPre = preTags.rangeContaining(startPosition); if (containingPre == null) { return reportAll ? Optional.of(replacementFix(replacement)) : Optional.empty(); } if (emittedFixes.intersects(containingPre)) { return Optional.empty(); } emittedFixes.add(containingPre); SuggestedFix fix = wrapInCodeTag(containingPre); return Optional.of( buildDescription(diagnosticPosition(getCurrentPath(), state)) .setMessage( "This HTML entity is invalid. Enclosing the code in this <pre>/<code> tag with" + " a {@code } block will force Javadoc to interpret HTML literally.") .addFix(fix) .build()); }
while (it.hasNext()) { Token token = it.next(); if (!tokenRanges.contains(token.getTok().getIndex())) { continue;
if (individualDeletedMessages.contains(position) || position.compareTo(markDeletePosition) <= 0) { if (log.isDebugEnabled()) { log.debug("[{}] [{}] Position was already deleted {}", ledger.getName(), name, position);
&& newMarkDeletePosition.getEntryId() == oldMarkDeletePosition.getEntryId() + 1) { skippedEntries = individualDeletedMessages.contains(newMarkDeletePosition) ? 0 : 1; } else { skippedEntries = getNumberOfEntries(Range.openClosed(oldMarkDeletePosition, newMarkDeletePosition)); if (individualDeletedMessages.contains(positionAfterNewMarkDelete)) { Range<PositionImpl> rangeToBeMarkDeleted = individualDeletedMessages .rangeContaining(positionAfterNewMarkDelete);
void testViewAgainstExpected(RangeSet<Integer> expected, RangeSet<Integer> view) { assertEquals(expected, view); assertEquals(expected.asRanges(), view.asRanges()); assertEquals(expected.isEmpty(), view.isEmpty()); if (!expected.isEmpty()) { assertEquals(expected.span(), view.span()); } for (int i = MIN_BOUND - 1; i <= MAX_BOUND + 1; i++) { assertEquals(expected.contains(i), view.contains(i)); assertEquals(expected.rangeContaining(i), view.rangeContaining(i)); } testEnclosing(view); if (view instanceof TreeRangeSet) { testRangesByLowerBounds((TreeRangeSet<Integer>) view, expected.asRanges()); } }
assertEquals(expected.contains(i), subRangeSet.contains(i));
if ( data.rangeSet.contains( linesRead ) ) { if ( data.addlineField ) { data.outputRow[data.NrPrevFields] = getLinesRead();
assertEquals(mutable.contains(i), built.contains(i));
private void validate(final N value) { if (rangeConstraints != null) { checkArgument(rangeConstraints.contains(value), "Value '%s' is not in required ranges %s", value, rangeConstraints); } }
void validate(final String str) { if (lengthConstraint != null) { checkArgument(lengthConstraint.getAllowedRanges().contains(str.length()), "String '%s' does not match allowed length constraint %s", lengthConstraint); } } }
@Override void validate(final byte[] value) { // FIXME: throw an exception capturing the constraint violation checkArgument(lengthConstraint.getAllowedRanges().contains(value.length), "Value length %s does not match constraint %s", value.length, lengthConstraint); } }
@Override public void postEstimate(AbstractQueryContext ctx) throws LensException { if (!allowedCosts.contains((T) ctx.getDriverQueryCost(getDriver()))) { throw new LensException("Driver " + getDriver() + " doesn't accept query " + "with cost " + ctx.getSelectedDriverQueryCost() + ". Allowed ranges: " + allowedCosts); } } }
public void testRangeContaining2() { RangeSet<Integer> rangeSet = TreeRangeSet.create(); rangeSet.add(Range.closed(3, 10)); rangeSet.remove(Range.open(5, 7)); assertEquals(Range.closed(3, 5), rangeSet.rangeContaining(5)); assertTrue(rangeSet.contains(5)); assertEquals(Range.closed(7, 10), rangeSet.rangeContaining(8)); assertTrue(rangeSet.contains(8)); assertNull(rangeSet.rangeContaining(6)); assertFalse(rangeSet.contains(6)); }