Code example for NavigableMap

Methods: removelastEntry

0
    return Iterables.concat(waitlist.values()).iterator();
  } 
 
  @Override 
  public AbstractState pop() { 
    Entry<K, Waitlist> highestEntry = waitlist.lastEntry();
    Waitlist localWaitlist = highestEntry.getValue();
    assert !localWaitlist.isEmpty();
    AbstractState result = localWaitlist.pop();
    if (localWaitlist.isEmpty()) {
      waitlist.remove(highestEntry.getKey());
    } 
    size--;
    return result;
  } 
 
  @Override 
  public boolean remove(AbstractState pState) {
    K key = getSortKey(pState);
    Waitlist localWaitlist = waitlist.get(key);
Experience pair programming with AI  Get Codota for Java