@Override public K lastKey() { return delegate.lastKey(); }
@Override public K firstKey() { return forward().lastKey(); }
/** * Returns the last element in this set. * @exception NoSuchElementException when this TreeSet is empty */ public E last() { return backingMap.lastKey(); }
@Override public K firstKey() { return forward().lastKey(); }
@Override public TrackingToken createHeadToken() { if (events.size() == 0) { return null; } return events.lastKey(); }
@Override public K firstKey() { return forward().lastKey(); }
@Override public K firstKey() { return forward().lastKey(); }
@Override public K lastKey() { assertTrue(Thread.holdsLock(mutex)); return delegate().lastKey(); }
public void testLastKey() { NavigableMap<String, Integer> map = create(); map.put("a", 1); map.lastKey(); }
/** * Returns the tracking token to use for the next event to be stored. * * @return the tracking token for the next event */ protected GlobalSequenceTrackingToken nextTrackingToken() { return events.isEmpty() ? new GlobalSequenceTrackingToken(0) : ((GlobalSequenceTrackingToken) events.lastKey()).next(); }
this.topVer = topVer; if (!topHist.isEmpty() && topVer <= topHist.lastKey()) { if (log.isDebugEnabled()) log.debug("Skip topology update since topology already updated [msg=" + msg + ", lastHistKey=" + topHist.lastKey() + ", topVer=" + topVer + ", locNode=" + locNode + ']'); assert topHist.isEmpty() || topHist.lastKey() == topVer - 1 : "lastVer=" + (topHist.isEmpty() ? null : topHist.lastKey()) + ", newVer=" + topVer + ", locNode=" + locNode + topHist.pollFirstEntry(); assert topHist.lastKey() == topVer; assert topHist.size() <= spi.topHistSize;
int getMaxLoad() { return getServersByLoad().lastKey().getLoad(); }
@Override public K lastKey() { return isEmpty() ? null : entries().lastKey(); }
/** * Gets the next node line from the firstNodesOnLines map unless there is no next line, in * which case, it returns the last line. * * @param firstNodesOnLines NavigableMap of lines and their first nodes. * @param node the node for which to find the next node line * @return the line number of the next line in the map */ private static Integer getNextNodeLine( NavigableMap<Integer, DetailAST> firstNodesOnLines, DetailAST node) { Integer nextNodeLine = firstNodesOnLines.higherKey(node.getLastChild().getLineNo()); if (nextNodeLine == null) { nextNodeLine = firstNodesOnLines.lastKey(); } return nextNodeLine; }
private ReadOnlyCursor createReadOnlyCursor(PositionImpl startPosition) { if (ledgers.isEmpty()) { lastConfirmedEntry = PositionImpl.earliest; } else if (ledgers.lastEntry().getValue().getEntries() > 0) { // Last ledger has some of the entries lastConfirmedEntry = new PositionImpl(ledgers.lastKey(), ledgers.lastEntry().getValue().getEntries() - 1); } else { // Last ledger is empty. If there is a previous ledger, position on the last entry of that ledger if (ledgers.size() > 1) { long lastLedgerId = ledgers.lastKey(); LedgerInfo li = ledgers.headMap(lastLedgerId, false).lastEntry().getValue(); lastConfirmedEntry = new PositionImpl(li.getLedgerId(), li.getEntries() - 1); } else { lastConfirmedEntry = PositionImpl.earliest; } } ReadOnlyCursorImpl cursor = new ReadOnlyCursorImpl(bookKeeper, config, this, startPosition, "read-only-cursor"); return cursor; }
final long id = ledgers.lastKey(); OpenCallback opencb = (rc, lh, ctx1) -> { executor.executeOrdered(name, safeRun(() -> { initializeBookKeeper(callback); } else if (rc == BKException.Code.NoSuchLedgerExistsException) { log.warn("[{}] Ledger not found: {}", name, ledgers.lastKey()); ledgers.remove(ledgers.lastKey()); initializeBookKeeper(callback); } else {
protected boolean needsBalance(Cluster c) { ClusterLoadState cs = new ClusterLoadState(c.clusterState); if (cs.getNumServers() < MIN_SERVER_BALANCE) { if (LOG.isDebugEnabled()) { LOG.debug("Not running balancer because only " + cs.getNumServers() + " active regionserver(s)"); } return false; } if(areSomeRegionReplicasColocated(c)) return true; // Check if we even need to do any load balancing // HBASE-3681 check sloppiness first float average = cs.getLoadAverage(); // for logging int floor = (int) Math.floor(average * (1 - slop)); int ceiling = (int) Math.ceil(average * (1 + slop)); if (!(cs.getMaxLoad() > ceiling || cs.getMinLoad() < floor)) { NavigableMap<ServerAndLoad, List<RegionInfo>> serversByLoad = cs.getServersByLoad(); if (LOG.isTraceEnabled()) { // If nothing to balance, then don't say anything unless trace-level logging. LOG.trace("Skipping load balancing because balanced cluster; " + "servers=" + cs.getNumServers() + " regions=" + cs.getNumRegions() + " average=" + average + " mostloaded=" + serversByLoad.lastKey().getLoad() + " leastloaded=" + serversByLoad.firstKey().getLoad()); } return false; } return true; }
/** Fails if the map's last key is not equal to the given key. */ public void hasLastKey(@NullableDecl Object key) { if (actualAsNavigableMap().isEmpty()) { fail("has last key", key); return; } if (!Objects.equal(actualAsNavigableMap().lastKey(), key)) { if (actualAsNavigableMap().containsKey(key)) { failWithoutActual( simpleFact( lenientFormat( "Not true that %s has last key <%s>. " + "It does contain this key, but the last key is <%s>", actualAsString(), key, actualAsNavigableMap().lastKey()))); return; } failWithoutActual( simpleFact( lenientFormat( "Not true that %s has last key <%s>. " + "It does not contain this key, and the last key is <%s>", actualAsString(), key, actualAsNavigableMap().lastKey()))); } }
EdgeIteratorState edge = graph.edge(timeNodes.get(timeNodes.lastKey()), timeNodes.get(timeNodes.firstKey())); edge.setFlags(encoder.setAccess(edge.getFlags(), true, false)); int rolloverTime = 24 * 60 * 60 - timeNodes.lastKey() + timeNodes.firstKey(); setEdgeTypeAndClearDistance(edge, GtfsStorage.EdgeType.OVERNIGHT); edge.setName(toStop.stop_name);
long lastLedgerId = ledgers.lastKey();