Refine search
public JavaNode getJavaNodeByLine(int line) { Map.Entry<Integer, JavaNode> entry = map.floorEntry(line); if (entry == null) { return null; } return entry.getValue(); } }
@Override public boolean encloses(Range<C> range) { checkNotNull(range); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); return floorEntry != null && floorEntry.getValue().encloses(range); }
@Override public @Nullable Range<C> rangeContaining(C value) { checkNotNull(value); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value)); if (floorEntry != null && floorEntry.getValue().contains(value)) { return floorEntry.getValue(); } else { // TODO(kevinb): revisit this design choice return null; } }
private @Nullable Range<C> rangeEnclosing(Range<C> range) { checkNotNull(range); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); return (floorEntry != null && floorEntry.getValue().encloses(range)) ? floorEntry.getValue() : null; }
private static FontGroup lookup(int codepoint) { // Do a lookup for a match in UCS_RANGES Map.Entry<Integer,Range> entry = UCS_RANGES.floorEntry(codepoint); Range range = (entry != null) ? entry.getValue() : null; return (range != null && codepoint <= range.upper) ? range.fontGroup : EAST_ASIAN; } }
@Override public boolean encloses(Range<C> range) { checkNotNull(range); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); return floorEntry != null && floorEntry.getValue().encloses(range); }
private static class Range { public int upper, value; ... } NavigableMap<Integer, Range> map = new TreeMap<Integer, Range>(); map.put(0, new Range(3, 0)); // 0..3 => 0 map.put(5, new Range(10, 1)); // 5..10 => 1 map.put(100, new Range(200, 2)); // 100..200 => 2 // To do a lookup for some value in 'key' Map.Entry<Integer,Range> entry = map.floorEntry(key); if (entry == null) { // too small } else if (key <= entry.getValue().upper) { return entry.getValue().value; } else { // too large or in a hole }
@Override public @Nullable Entry<Range<K>, V> getEntry(K key) { Entry<Cut<K>, RangeMapEntry<K, V>> mapEntry = entriesByLowerBound.floorEntry(Cut.belowValue(key)); if (mapEntry != null && mapEntry.getValue().contains(key)) { return mapEntry.getValue(); } else { return null; } }
boolean includesMarker(Marker marker) { requireNonNull(marker, "marker is null"); checkTypeCompatibility(marker); Map.Entry<Marker, Range> floorEntry = lowIndexedRanges.floorEntry(marker); return floorEntry != null && floorEntry.getValue().includes(marker); }
boolean includesMarker(Marker marker) { requireNonNull(marker, "marker is null"); checkTypeCompatibility(marker); Map.Entry<Marker, Range> floorEntry = lowIndexedRanges.floorEntry(marker); return floorEntry != null && floorEntry.getValue().includes(marker); }
@Override public boolean encloses(Range<C> range) { checkNotNull(range); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); return floorEntry != null && floorEntry.getValue().encloses(range); }
@Override @NullableDecl public Range<C> rangeContaining(C value) { checkNotNull(value); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value)); if (floorEntry != null && floorEntry.getValue().contains(value)) { return floorEntry.getValue(); } else { // TODO(kevinb): revisit this design choice return null; } }
@NullableDecl private Range<C> rangeEnclosing(Range<C> range) { checkNotNull(range); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); return (floorEntry != null && floorEntry.getValue().encloses(range)) ? floorEntry.getValue() : null; }
@Override public boolean encloses(Range<C> range) { checkNotNull(range); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); return floorEntry != null && floorEntry.getValue().encloses(range); }
/** * Returns the index of the last segment in the log. * * @param index the compaction index * @return the starting index of the last segment in the log */ public long getCompactableIndex(long index) { Map.Entry<Long, JournalSegment<E>> segmentEntry = segments.floorEntry(index); return segmentEntry != null ? segmentEntry.getValue().index() : 0; }
@Override public Object next() { double randomOffset = RandomUtils.nextDouble(workingRandom, probabilityWeightTotal); Map.Entry<Double, Object> entry = cachedEntityMap.floorEntry(randomOffset); // entry is never null because randomOffset < probabilityWeightTotal return entry.getValue(); }
@Override public Move next() { double randomOffset = RandomUtils.nextDouble(workingRandom, probabilityWeightTotal); Map.Entry<Double, Move> entry = cachedMoveMap.floorEntry(randomOffset); // entry is never null because randomOffset < probabilityWeightTotal return entry.getValue(); }
@Override public Object next() { double randomOffset = RandomUtils.nextDouble(workingRandom, probabilityWeightTotal); Map.Entry<Double, Object> entry = cachedEntityMap.floorEntry(randomOffset); // entry is never null because randomOffset < probabilityWeightTotal return entry.getValue(); }
@NullableDecl private Range<C> rangeEnclosing(Range<C> range) { checkNotNull(range); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); return (floorEntry != null && floorEntry.getValue().encloses(range)) ? floorEntry.getValue() : null; }
@Override @NullableDecl public Range<C> rangeContaining(C value) { checkNotNull(value); Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value)); if (floorEntry != null && floorEntry.getValue().contains(value)) { return floorEntry.getValue(); } else { // TODO(kevinb): revisit this design choice return null; } }