List of usage examples for com.google.common.collect Range contains
public boolean contains(C value)
From source file:org.obm.push.mail.bean.MessageSet.java
public boolean contains(long uid) { for (Range<Long> range : ranges) { if (range.contains(uid)) { return true; }/* ww w. j a va2s . c o m*/ } return false; }
From source file:net.sf.mzmine.modules.visualization.spectra.datasets.ScanDataSet.java
/** * This function finds highest data point intensity in given m/z range. It * is important for normalizing isotope patterns. *//*from w w w. j a va 2 s .com*/ public double getHighestIntensity(Range<Double> mzRange) { double maxIntensity = 0; for (DataPoint dp : dataPoints) { if ((mzRange.contains(dp.getMZ())) && (dp.getIntensity() > maxIntensity)) maxIntensity = dp.getIntensity(); } return maxIntensity; }
From source file:net.sf.mzmine.modules.peaklistmethods.alignment.path.scorer.RTScore.java
public boolean matches(AlignmentPath path, PeakListRow peak, ParameterSet parameters) { rtTolerance = parameters.getParameter(PathAlignerParameters.RTTolerance).getValue(); mzTolerance = parameters.getParameter(PathAlignerParameters.MZTolerance).getValue(); Range<Double> rtRange = rtTolerance.getToleranceRange(path.getRT()); Range<Double> mzRange = mzTolerance.getToleranceRange(path.getMZ()); if (!rtRange.contains(peak.getAverageRT()) || !mzRange.contains(peak.getAverageMZ())) { return false; }/* w w w . j a v a 2s. c o m*/ return true; }
From source file:com.google.errorprone.bugpatterns.ParameterName.java
private void checkArguments(Tree tree, List<? extends ExpressionTree> arguments, VisitorState state) { if (arguments.isEmpty()) { return;/*from w ww. j ava 2 s .co m*/ } MethodSymbol sym = (MethodSymbol) ASTHelpers.getSymbol(tree); if (NamedParameterComment.containsSyntheticParameterName(sym)) { return; } int start = ((JCTree) tree).getStartPosition(); int end = state.getEndPosition(getLast(arguments)); if (start == Position.NOPOS || end == Position.NOPOS) { // best effort work-around for https://github.com/google/error-prone/issues/780 return; } String source = state.getSourceCode().subSequence(start, end).toString(); if (!source.contains("/*")) { // fast path if the arguments don't contain anything that looks like a comment return; } Deque<ErrorProneToken> tokens = new ArrayDeque<>(ErrorProneTokens.getTokens(source, state.context)); forEachPair(sym.getParameters().stream(), arguments.stream(), (p, a) -> { while (!tokens.isEmpty() && ((start + tokens.peekFirst().pos()) < ((JCTree) a).getStartPosition())) { tokens.removeFirst(); } if (tokens.isEmpty()) { return; } Range<Integer> argRange = Range.closedOpen(((JCTree) a).getStartPosition(), state.getEndPosition(a)); if (!argRange.contains(start + tokens.peekFirst().pos())) { return; } checkArgument(p, a, start, tokens.removeFirst(), state); }); }
From source file:com.google.errorprone.bugpatterns.BooleanParameter.java
private void checkParameter(VarSymbol paramSym, ExpressionTree a, int start, Deque<ErrorProneToken> tokens, VisitorState state) {/* ww w . j av a 2 s . c om*/ if (!isBooleanLiteral(a)) { return; } if (state.getTypes().unboxedTypeOrType(paramSym.type).getTag() != TypeTag.BOOLEAN) { // don't suggest on non-boolean (e.g., generic) parameters) return; } String name = paramSym.getSimpleName().toString(); if (name.length() < 2) { // single-character parameter names aren't helpful return; } if (EXCLUDED_NAMES.contains(name)) { return; } while (!tokens.isEmpty() && ((start + tokens.peekFirst().pos()) < ((JCTree) a).getStartPosition())) { tokens.removeFirst(); } if (tokens.isEmpty()) { return; } Range<Integer> argRange = Range.closedOpen(((JCTree) a).getStartPosition(), state.getEndPosition(a)); if (!argRange.contains(start + tokens.peekFirst().pos())) { return; } if (hasParameterComment(tokens.removeFirst())) { return; } state.reportMatch( describeMatch(a, SuggestedFix.prefixWith(a, String.format("/* %s= */", paramSym.getSimpleName())))); }
From source file:io.horizondb.model.core.blocks.AbstractDataBlock.java
/** * {@inheritDoc}//w w w.j ava 2 s .c o m */ @Override public final RangeMap<Field, DataBlock> split(TimeSeriesDefinition definition) throws IOException { Range<Field> range = BlockHeaderUtils.getRange(getHeader()); Range<Field> partitionRange = definition.getPartitionTimeRange(range.lowerEndpoint()); if (partitionRange.contains(range.upperEndpoint())) { return ImmutableRangeMap.<Field, DataBlock>of(partitionRange, this); } TimeSeriesRecord[] records = definition.newRecords(); ImmutableRangeMap.Builder<Field, DataBlock> builder = ImmutableRangeMap.builder(); RecordAppender appender = new RecordAppender(definition, Buffers.getDefaultAllocator(), records); Field[] timestamps = new Field[records.length]; for (int i = 0; i < timestamps.length; i++) { timestamps[i] = definition.newField(Record.TIMESTAMP_FIELD_NAME); } try (BinaryTimeSeriesRecordIterator iterator = new BinaryTimeSeriesRecordIterator(definition, singleton(this))) { while (iterator.hasNext()) { Record record = iterator.next(); Field timestamp = timestamps[record.getType()]; if (record.isDelta()) { timestamp.add(record.getField(Record.TIMESTAMP_FIELD_INDEX)); } else { record.getField(Record.TIMESTAMP_FIELD_INDEX).copyTo(timestamp); } if (!partitionRange.contains(timestamp)) { builder.put(partitionRange, appender.getDataBlock()); partitionRange = definition.getPartitionTimeRange(timestamp); appender = new RecordAppender(definition, Buffers.getDefaultAllocator(), records); } appender.append(record); } builder.put(partitionRange, appender.getDataBlock()); } return builder.build(); }
From source file:net.sf.mzmine.modules.peaklistmethods.identification.complexsearch.ComplexSearchTask.java
/** * Check if candidate peak may be a possible complex of given two peaks * /*from w ww .j a v a2 s . c om*/ */ private boolean checkComplex(PeakListRow complexRow, PeakListRow row1, PeakListRow row2) { // Check retention time condition Range<Double> rtRange = rtTolerance.getToleranceRange(complexRow.getAverageRT()); if (!rtRange.contains(row1.getAverageRT())) return false; if (!rtRange.contains(row2.getAverageRT())) return false; // Check mass condition double expectedMass = row1.getAverageMZ() + row2.getAverageMZ() - (2 * ionType.getAddedMass()); double detectedMass = complexRow.getAverageMZ() - ionType.getAddedMass(); Range<Double> mzRange = mzTolerance.getToleranceRange(detectedMass); if (!mzRange.contains(expectedMass)) return false; // Check height condition if ((complexRow.getAverageHeight() > row1.getAverageHeight() * maxComplexHeight) || (complexRow.getAverageHeight() > row2.getAverageHeight() * maxComplexHeight)) return false; return true; }
From source file:com.bigdata.dastor.dht.BootStrapper.java
/** get potential sources for each range, ordered by proximity (as determined by EndPointSnitch) */ Multimap<Range, InetAddress> getRangesWithSources(String table) { assert tokenMetadata.sortedTokens().size() > 0; final AbstractReplicationStrategy strat = StorageService.instance.getReplicationStrategy(table); Collection<Range> myRanges = strat.getPendingAddressRanges(tokenMetadata, token, address, table); Multimap<Range, InetAddress> myRangeAddresses = ArrayListMultimap.create(); Multimap<Range, InetAddress> rangeAddresses = strat.getRangeAddresses(tokenMetadata, table); for (Range myRange : myRanges) { for (Range range : rangeAddresses.keySet()) { if (range.contains(myRange)) { List<InetAddress> preferred = DatabaseDescriptor.getEndPointSnitch(table) .getSortedListByProximity(address, rangeAddresses.get(range)); myRangeAddresses.putAll(myRange, preferred); break; }// w w w.j a va 2s.c o m } assert myRangeAddresses.keySet().contains(myRange); } return myRangeAddresses; }
From source file:org.eclipse.fx.ui.controls.styledtext.internal.LineHelper.java
public int getCaret(int index) { int globalCaret = getCaretOffset(); Range<Integer> range = getRange(index); if (range.contains(Integer.valueOf(globalCaret))) { return mapToLocal(index, globalCaret); } else {/*from w ww . j a v a 2 s . c om*/ return -1; } }
From source file:net.sf.mzmine.modules.peaklistmethods.identification.glycerophospholipidsearch.GPLipidSearchTask.java
/** * Check if candidate peak may be a possible adduct of a given main peak * //from w w w . ja va 2s .c o m * @param mainPeak * @param possibleFragment */ private void findPossibleGPL(GPLipidIdentity lipid, PeakListRow rows[]) { final double lipidIonMass = lipid.getMass() + ionizationType.getAddedMass(); logger.finest("Searching for lipid " + lipid.getDescription() + ", " + lipidIonMass + " m/z"); for (int rowIndex = 0; rowIndex < rows.length; rowIndex++) { if (isCanceled()) return; Range<Double> mzTolRange = mzTolerance.getToleranceRange(rows[rowIndex].getAverageMZ()); if (mzTolRange.contains(lipidIonMass)) { rows[rowIndex].addPeakIdentity(lipid, false); // Notify the GUI about the change in the project MZmineCore.getProjectManager().getCurrentProject().notifyObjectChanged(rows[rowIndex], false); } } }