try {
        map = makePopulatedMap();
      } catch (UnsupportedOperationException e) {
        return;
      }
      String keyToRemove = map.keySet().iterator().next();
      if (supportsRemove) {
        int initialSize = map.size();
        // var oldValue = map.get(keyToRemove);
        map.remove(keyToRemove);
        // This line doesn't hold - see the Javadoc comments above.

  public @Nullable E higher(E e) {
    return Iterables.<@Nullable E>getFirst(tailSet(e, false), null);
  }

  @Override
  public E first() {
    return iterator().next();
  }

  @Override
  public E last() {
    return descendingIterator().next();
  }

  /**
   * Guaranteed to throw an exception and leave the set unmodified.
   *
   * @since 12.0
   * @throws UnsupportedOperationException always

        protected String recordCountRelation;
        /**
         * The total number of pages in the search results.
         */
        protected int pageCount;
        /**
         * Indicates if there is a next page of search results.
         */
        protected boolean nextPage;
        /**
         * Indicates if there is a previous page of search results.
         */
        protected boolean prevPage;
        /**

   *     cause loss of precision)
   */
  public void addAll(Iterator<? extends Number> values) {
    while (values.hasNext()) {
      add(values.next().doubleValue());
    }
  }

  /**
   * Adds the given values to the dataset.
   *
   * @param values a series of values
   */
  public void addAll(double... values) {

    // Use floor(log2(num)) + 1 to prevent overflow of multiplication.
    int productBits = LongMath.log2(product, FLOOR) + 1;
    int bits = LongMath.log2(startingNumber, FLOOR) + 1;
    // Check for the next power of two boundary, to save us a CLZ operation.
    int nextPowerOfTwo = 1 << (bits - 1);

    // Iteratively multiply the longs as big as they can go.
    for (long num = startingNumber; num <= n; num++) {

        }

        private WindowBucket getCurrentBucket() {
            long now = System.currentTimeMillis();

            // Check if we need to advance to next bucket
            if (now - lastBucketTime >= bucketSizeInMillis) {
                currentBucketIndex = (currentBucketIndex + 1) % numberOfBuckets;
                buckets[currentBucketIndex].reset(now);

        }
        return OptionalThing.of(pipeline);
    }

    /**
     * Refreshes the crawling configuration cache by invalidating all cached entries.
     * This forces the next access to reload configurations from the underlying services.
     */
    public void refresh() {
        crawlingConfigCache.invalidateAll();
    }

    /**

   * ...
   * synchronized (table) {  // Synchronizing on table, not row!
   *   Iterator<Entry<C, V>> i = row.entrySet().iterator(); // Must be in synchronized block
   *   while (i.hasNext()) {
   *     foo(i.next());
   *   }
   * }
   * }
   *
   * <p>Failure to follow this advice may result in non-deterministic behavior.
   *
   * <p>The returned table will be serializable if the specified table is serializable.

{!../../docs_src/bigger_applications/app/routers/items.py!}
```

#### How relative imports work { #how-relative-imports-work }

/// tip

If you know perfectly how imports work, continue to the next section below.

///

A single dot `.`, like in:

```Python
from .dependencies import get_token_header
```

would mean:

   * ...
   * synchronized (multimap) {  // Synchronizing on multimap, not values!
   *   Iterator<V> i = values.iterator(); // Must be in synchronized block
   *   while (i.hasNext()) {
   *     foo(i.next());
   *   }
   * }
   * }
   *
   * <p>Failure to follow this advice may result in non-deterministic behavior.
   *
   * <p>Note that the generated multimap's {@link Multimap#removeAll} and {@link