return Iterators.pollNext(descendingIterator());
  }

  @ParametricNullness
  protected E standardFirst() {
    return iterator().next();
  }

  @ParametricNullness
  protected E standardLast() {
    return descendingIterator().next();
  }

  @Override
  public NavigableSet<E> descendingSet() {
    return delegate().descendingSet();
  }

  /**

            }
            return ff.accept((SmbFile) resource);
        })) {

            final List<String> list = new ArrayList<>();
            while (it.hasNext()) {
                try (SmbResource n = it.next()) {
                    list.add(n.getName());
                }
            }
            return list.toArray(new String[list.size()]);
        } catch (final CIFSException e) {

   * its runtime check.
   *
   * <p>An example use case for this method is in implementing an {@code Iterator<T>} whose {@code
   * next} field is lazily initialized. The type of that field would be {@code @Nullable T}, and the
   * code would be responsible for populating a "real" {@code T} (which might still be the value

              throw new AssertionError(e);
            }
          }

          private void mutateDelegate() {
            allStates.add(ImmutableList.copyOf(delegate));
            remainingActions.next().perform(delegate);
            allStates.add(ImmutableList.copyOf(delegate));
          }
        };

    @SuppressWarnings("unchecked")
    ConcurrentlyMutatedList<Integer> list =

     *
     * @param config the configuration
     * @param fid the file identifier
     * @param offset the file offset to read from
     * @param maxCount the maximum number of bytes to read
     * @param andx the next command in the chain
     */
    public SmbComReadAndX(final Configuration config, final int fid, final long offset, final int maxCount, final ServerMessageBlock andx) {
        super(config, SMB_COM_READ_ANDX, andx);

    // ...and then putIfAbsent. Simulate failure on both
    when(backingMap.putIfAbsent(eq(KEY), isA(AtomicInteger.class))).thenReturn(existing);

    // next map.get()
    when(backingMap.get(KEY)).thenReturn(existingZero);
    // since get returned zero, try a replace; that fails due to a simulated race

        @Override
        public boolean hasNext() {
          return nextOrNull != null;
        }

        @Override
        public Entry<K, V> next() {
          if (nextOrNull == null) {
            throw new NoSuchElementException();
          }
          try {
            return nextOrNull;
          } finally {
            toRemove = nextOrNull;

        @Override
        public boolean hasNext() {
          return nextOrNull != null;
        }

        @Override
        public Entry<K, V> next() {
          if (nextOrNull == null) {
            throw new NoSuchElementException();
          }
          try {
            return nextOrNull;
          } finally {
            toRemove = nextOrNull;

     * The mappings are loaded from the crawler.document.mimetype.extension.overrides property,
     * where each line contains a mapping in the format ".ext=mime/type".
     */
    @PostConstruct
    public void init() {
        final String overrides = ComponentUtil.getFessConfig().getCrawlerDocumentMimetypeExtensionOverrides();
        if (StringUtil.isNotBlank(overrides)) {

        while (fromSpliterator.tryAdvance(this)) {
          try {
            // The cast is safe because tryAdvance puts a T into `holder`.
            T next = uncheckedCastNullableTToT(holder);
            if (predicate.test(next)) {
              action.accept(next);
              return true;
            }
          } finally {
            holder = null;
          }
        }
        return false;
      }