for (Iterator<Principal> ite = pr.iterator(); ite.hasNext();) {
                try {
                    KerberosPrincipal entry = (KerberosPrincipal) ite.next();
                    return entry.getRealm();
                } catch (Exception e) {
                    continue;
                }
            }
        }

        if (this.realm != null) {

   */
  public static double meanOf(Iterator<? extends Number> values) {
    checkArgument(values.hasNext());
    long count = 1;
    double mean = values.next().doubleValue();
    while (values.hasNext()) {
      double value = values.next().doubleValue();
      count++;
      if (isFinite(value) && isFinite(mean)) {
        // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15)

   * {@link Ordering#leastOf(Iterator, int)}, which provides a simpler API for that use case.
   */
  public void offerAll(Iterator<? extends T> elements) {
    while (elements.hasNext()) {
      offer(elements.next());
    }
  }

  /**
   * Returns the top {@code k} elements offered to this {@code TopKSelector}, or all elements if
   * fewer than {@code k} have been offered, in the order specified by the factory used to create

static get Default() {\n    return Default\n  }\n\n  // Public\n  next() {\n    if (!this._isSliding) {\n      this._slide(DIRECTION_NEXT)\n    }\n  }\n\n  nextWhenVisible() {\n    const $element = $(this._element)\n    // Don't call next when the page isn't visible\n    // or the carousel or its parent isn't visible\n    if (!document.hidden &&\n      ($element.is(':visible') && $element.css('visibility') !== 'hidden')) {\n      this.next()\n    }\n  }\n\n  prev() {\n    if (!this._isSliding) {\n   ...

      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.

            assertEquals("0123456789", new String(buffer, 0, bytesRead, "UTF-8"));

            // Read next chunk
            bytesRead = in.read(buffer);
            assertEquals(10, bytesRead, "Should read next chunk");
            assertEquals("ABCDEFGHIJ", new String(buffer, 0, bytesRead, "UTF-8"));
        }
    }

    @Test

        }
        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();
    }

    /**

$element.attr(SELECTOR_ARIA_ATTR)\n    const $body = $element.next(SELECTOR_EXPANDABLE_BODY).children().first().children()\n\n    $body.stop()\n    if ($type === 'true') {\n      $body.slideUp(time, () => {\n        $element.next(SELECTOR_EXPANDABLE_BODY).addClass('d-none')\n      })\n      $element.attr(SELECTOR_ARIA_ATTR, 'false')\n      $element.trigger($.Event(EVENT_COLLAPSED))\n    } else if ($type === 'false') {\n      $element.next(SELECTOR_EXPANDABLE_BODY).removeClass('d-none')\n      $body.slideDown(time)\n...

    /**
     * SMB TRANS2 subcommand for finding first matching files
     */
    public static final byte TRANS2_FIND_FIRST2 = (byte) 0x01;
    /**
     * SMB TRANS2 subcommand for finding next matching files
     */
    public static final byte TRANS2_FIND_NEXT2 = (byte) 0x02;
    /**
     * SMB TRANS2 subcommand for querying file system information
     */

        CacheBuilder.newBuilder().expireAfterWrite(1000, MILLISECONDS).ticker(fakeTicker).build();

    cache.put(10, 20);
    Iterator<Integer> iterator = cache.asMap().values().iterator();
    iterator.next();
    iterator.remove();

    assertThat(cache.size()).isEqualTo(0);
  }