* writes.
   *
   * @return a serializable concurrent map having the requested features
   */
  public <K, V> ConcurrentMap<K, V> makeMap() {
    if (!useCustomMap) {
      return new ConcurrentHashMap<>(getInitialCapacity(), 0.75f, getConcurrencyLevel());
    }
    return MapMakerInternalMap.create(this);
  }

  /**

    public FessIntervalController() {
        super();
    }

    /**
     * Gets the delay time in milliseconds after processing a URL.
     *
     * @return the delay time in milliseconds after processing
     */
    public long getDelayMillisAfterProcessing() {
        return delayMillisAfterProcessing;
    }

    /**
     * Sets the delay time in milliseconds after processing a URL.
     *

    }

    @Override
    protected Queue<T> delegate() {
      return mmHeap;
    }

    @Override
    public @Nullable T poll() {
      return mmHeap.pollLast();
    }
  }

  public enum HeapType {
    MIN_MAX {
      @Override
      public Queue<Integer> create(Comparator<Integer> comparator) {
        return MinMaxPriorityQueue.orderedBy(comparator).create();
      }
    },

    }

    @Override
    protected Queue<T> delegate() {
      return mmHeap;
    }

    @Override
    public @Nullable T poll() {
      return mmHeap.pollLast();
    }
  }

  public enum HeapType {
    MIN_MAX {
      @Override
      public Queue<Integer> create(Comparator<Integer> comparator) {
        return MinMaxPriorityQueue.orderedBy(comparator).create();
      }
    },

    }

    /**
     * Test getErrorCode() method.
     */
    @Test
    void testGetErrorCode() {
        int errorCode = 0x00000005; // DCERPC_FAULT_ACCESS_DENIED
        DcerpcException exception = new DcerpcException(errorCode);
        assertEquals(errorCode, exception.getErrorCode(), "getErrorCode() should return the correct error code.");
    }

        termynals = termynals.filter(termynal => {
            if (termynal.container.getBoundingClientRect().top - innerHeight <= 0) {
                termynal.init();
                return false;
            }
            return true;
        });
    }
    window.addEventListener("scroll", loadVisibleTermynals);
    createTermynals();
    loadVisibleTermynals();
}

function shuffle(array) {

    @Override
    public void close() throws Exception {
        client.close();
    }

    /**
     * Returns the underlying CrawlerClient.
     * @return The CrawlerClient instance.
     */
    public CrawlerClient getCrawlerClient() {
        return client;
    }

    /**
     * Sets the underlying CrawlerClient.
     * @param client The CrawlerClient instance to set.
     */

                        return builder.setScript(script);
                    }
                } catch (final Exception e) {
                    logger.warn("Failed to process search hit: {}", hit, e);
                }
                return null;
            });
            resultBuf.append(count).append(" documents").append("\n");

    assertFalse(
        "setCount() with a too-small oldCount should return false",
        getMultiset().setCount(e0(), 1, 5));
    expectContents(nCopies(3, e0()));
  }

  /*
   * TODO: test that unmodifiable multisets either throw UOE or return false
   * when both are valid options. Currently we test the UOE cases and the
   * return-false cases but not their intersection
   */

        for (; index < iterators.length; ++index) {
            if (iterators[index].hasNext()) {
                return true;
            }
        }
        return false;
    }

    @Override
    public E next() {
        if (!hasNext()) {
            throw new NoSuchElementException();
        }
        return iterators[index].next();
    }

    @Override
    public void remove() {