* self-loops incident to {@code node}).
   *
   * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}.
   *
   * @throws IllegalArgumentException if {@code node} is not an element of this graph
   */
  @Override
  int degree(N node);

  /**
   * Returns the count of {@code node}'s incoming edges (equal to {@code predecessors(node).size()})

        final Vector<String> vector = new Vector<String>();
        vector.add("a");
        vector.add("b");
        int count = 0;
        for (final String s : iterable(vector.elements())) {
            ++count;
        }
        assertThat(count, is(2));
    }

    /**
     * Test method for
     * {@link org.codelibs.core.collection.EnumerationIterator#EnumerationIterator(Enumeration)}

    }

    /**
     * Gets the total number of records.
     *
     * @return The total record count
     */
    public int getAllRecordCount() {
        return allRecordCount;
    }

    /**
     * Sets the total number of records.
     *
     * @param allRecordCount The total record count
     */
    public void setAllRecordCount(final int allRecordCount) {

        assertEquals(8, next.maxParameterCount, "Max parameter count should be 8");
        assertEquals(Trans2FindFirst2.LIST_SIZE, next.maxDataCount, "Max data count should use LIST_SIZE");
        assertEquals((byte) 0x00, next.maxSetupCount, "Max setup count must be 0");

        // Information level defaults to BOTH_DIRECTORY_INFO (0x104) — check via parameters encoding

    void testJoinWithVariousElementCounts(int count) {
        CharSequence[] elements = new CharSequence[count];
        for (int i = 0; i < count; i++) {
            elements[i] = String.valueOf(i);
        }
        String result = StringUtil.join(",", elements);

        // Verify result contains all elements
        String[] parts = result.split(",");
        assertEquals(count, parts.length);

          count++;
          if (count > maxCount) {
            Assert.fail(
                "2-bit delta ("
                    + i
                    + ", "
                    + j
                    + ") is likely a "
                    + "characteristic for this hash. This was "
                    + "determined after "
                    + count
                    + " trials");

        } 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 {

        }
        @SuppressWarnings("unchecked") // we only put Ts in it
        @Nullable T[] array = (@Nullable T[]) new Object[size];
        int count = 0;
        for (; count < size && iterator.hasNext(); count++) {
          array[count] = iterator.next();
        }
        for (int i = count; i < size; i++) {
          array[i] = null; // for GWT
        }

        List<@Nullable T> list = unmodifiableList(asList(array));

            assertDoesNotThrow(() -> request.setOffset(1024L));
            assertDoesNotThrow(() -> request.setOffset(Long.MAX_VALUE));
        }

        @Test
        @DisplayName("Should set minimum count correctly")
        void testSetMinimumCount() {
            assertDoesNotThrow(() -> request.setMinimumCount(0));
            assertDoesNotThrow(() -> request.setMinimumCount(512));

                    }
                    filteredContexts[count++] = ctx;
                }
            }

            if (count > 0) {
                CreateContextRequest[] newContexts = new CreateContextRequest[count];
                System.arraycopy(filteredContexts, 0, newContexts, 0, count);
                this.createContexts = newContexts;
            } else {