* 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
   */
  int degree(N node);

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

      ensureRoomFor(values.length());
      System.arraycopy(values.array, values.start, array, count, values.length());
      count += values.length();
      return this;
    }

    private void ensureRoomFor(int numberToAdd) {
      int newCount = count + numberToAdd; // TODO(kevinb): check overflow now?
      if (newCount > array.length) {

      ensureRoomFor(values.length());
      System.arraycopy(values.array, values.start, array, count, values.length());
      count += values.length();
      return this;
    }

    private void ensureRoomFor(int numberToAdd) {
      int newCount = count + numberToAdd; // TODO(kevinb): check overflow now?
      if (newCount > array.length) {

         * The number of deleted items.
         */
        protected long count = 1;

        /**
         * Sets the count of deleted items.
         * @param count The number of deleted items.
         * @return The ApiDeleteResponse instance.
         */
        public ApiDeleteResponse count(final long count) {
            this.count = count;
            return this;
        }

        @Override

        buffer[30] = 0x04;
        buffer[31] = 0x00;

        // Word count
        buffer[32] = 10; // 10 words = 20 bytes

        // Parameter words for transaction response
        // Total parameter count (2 bytes)
        buffer[33] = 0x00;
        buffer[34] = 0x00;

        // Total data count (2 bytes)
        buffer[35] = 0x00;
        buffer[36] = 0x00;

         * The number of shares in the array.
         */
        public int count;
        /**
         * Array of ShareInfo0 structures containing share information.
         */
        public ShareInfo0[] array;

        @Override
        public void encode(NdrBuffer _dst) throws NdrException {
            _dst.align(4);
            _dst.enc_ndr_long(this.count);
            _dst.enc_ndr_referent(this.array, 1);

public class SearchLogService {

    /** Date format pattern for parsing time ranges. */
    private static final String YYYY_MM_DD_HH_MM = "yyyy-MM-dd HH:mm";

    /** Field name for count values in aggregation results. */
    private static final String COUNT = "count";

    /** Field name for key values in aggregation results. */
    private static final String KEY = "key";

    /** Field name for ID values in aggregation results. */

    list.add(new MockRunnable(countDownLatch), exec);
    assertEquals(3L, countDownLatch.getCount());

    list.execute();

    // Verify that all of the runnables execute in a reasonable amount of time.
    assertTrue(countDownLatch.await(1L, SECONDS));
  }

  public void testExecute_idempotent() {
    AtomicInteger runCalled = new AtomicInteger();
    list.add(
        new Runnable() {

        assertEquals(State.CLOSED, circuitBreaker.getState(), "Initial state should be CLOSED");
        assertEquals(0, circuitBreaker.getFailureCount(), "Initial failure count should be 0");
        assertEquals(0, circuitBreaker.getSuccessCount(), "Initial success count should be 0");
    }

    @Test
    public void testSuccessfulOperation() throws CIFSException {

        // When & Then
        assertDoesNotThrow(() -> {
            int count = 0;
            while (emptyIterator.hasNext()) {
                emptyIterator.next();
                count++;
                if (count > 10)
                    break; // Safety check
            }
            assertEquals(0, count, "No iterations should occur for empty iterator");