} catch (final SQLException ex) {
            throw new SQLRuntimeException(ex);
        }
    }

    /**
     * Returns the update count.
     *
     * @param statement
     *            {@link Statement}. Must not be {@literal null}.
     * @return The update count.
     */
    public static int getUpdateCount(final Statement statement) {
        assertArgumentNotNull("statement", statement);

        try {

            logger.debug("Initializing {}", this.getClass().getSimpleName());
        }
        fessConfig = ComponentUtil.getFessConfig();
    }

    /**
     * Gets the account ID from a SID.
     * @param sid The SID.
     * @return The account ID.
     */
    public String getAccountId(final SID sid) {
        final int type = sid.getType();
        if (logger.isDebugEnabled()) {
            try {

	for i := 1; i < len(totalSizes); i++ {
		result = gcd(result, totalSizes[i])
	}
	return result
}

// isValidSetSize - checks whether given count is a valid set size for erasure coding.
var isValidSetSize = func(count uint64) bool {
	return (count >= setSizes[0] && count <= setSizes[len(setSizes)-1])
}

func commonSetDriveCount(divisibleSize uint64, setCounts []uint64) (setSize uint64) {

    /** The key of the message: by Click Count (asc) */
    public static final String LABELS_search_result_sort_click_count_asc = "{labels.search_result_sort_click_count_asc}";

    /** The key of the message: by Click Count (desc) */
    public static final String LABELS_search_result_sort_click_count_desc = "{labels.search_result_sort_click_count_desc}";

    /** The key of the message: by Favorite Count (asc) */

        method.setAccessible(true);
        final boolean result = (boolean) method.invoke(crawlerThread, urlQueue);

        assertFalse(result);
    }

    /**
     * Test isContinue method when thread check count is below max.
     */
    public void test_isContinue_belowMaxThreadCheckCount() throws Exception {
        // Use reflection to access protected method

        @Test
        @DisplayName("acquire should increment usage count")
        void shouldIncrementUsageCount() {
            long initial = transport.getUsageCount();
            transport.acquire();
            assertEquals(initial + 1, transport.getUsageCount());
        }

        @Test
        @DisplayName("release should decrement usage count")
        void shouldDecrementUsageCount() {

     */
    @Test
    void testGetEntries() {
        // Given
        MsrpcDfsRootEnum dfsRootEnum = new MsrpcDfsRootEnum("test-server");
        DfsEnumArray200 dfsEnumArray = new DfsEnumArray200();
        dfsEnumArray.count = 2;
        dfsEnumArray.s = new DfsInfo200[2];
        dfsEnumArray.s[0] = new DfsInfo200();
        dfsEnumArray.s[0].dfs_name = "\\domain\share1";
        dfsEnumArray.s[1] = new DfsInfo200();

  DescendingImmutableSortedMultiset(ImmutableSortedMultiset<E> forward) {
    this.forward = forward;
  }

  @Override
  public int count(@Nullable Object element) {
    return forward.count(element);
  }

  @Override
  public @Nullable Entry<E> firstEntry() {
    return forward.lastEntry();
  }

  @Override
  public @Nullable Entry<E> lastEntry() {

            jvmGcObj.count = c.getCollectionCount();
            jvmGcObj.time = c.getCollectionTime().getMillis();
            return jvmGcObj;
        }).toArray(n -> new JvmGcObj[n]);
        final Threads threads = jvmStats.getThreads();
        final JvmThreadsObj jvmThreadsObj = new JvmThreadsObj();
        jvmObj.threads = jvmThreadsObj;
        jvmThreadsObj.count = threads.getCount();

    Node<K, V> head;
    Node<K, V> tail;
    int count;

    KeyList(Node<K, V> firstNode) {
      this.head = firstNode;
      this.tail = firstNode;
      firstNode.previousSibling = null;
      firstNode.nextSibling = null;
      this.count = 1;
    }
  }

  private transient @Nullable Node<K, V> head; // the head for all keys