assertThat(state()).isEqualTo(Service.State.STOPPING);
            notifyStopped();
          }

          @Override
          protected void doStop() {
            throw new AssertionError(); // Should not be called.
          }
        };

    ServiceManager manager = new ServiceManager(asList(a));
    manager.startAsync();
    manager.stopAsync();

            len += rem;
        }

        haveResponse(buffer, start, len);

        if ((this.nextCommand != 0 && this.next != null) && (this.nextCommand % 8 != 0)) {
            throw new SMBProtocolDecodingException("Chained command is not aligned");
        }
        return len;
    }

    /**
     * Checks if this message has an error status.
     *

        // So we also need to support a1/a2/a3/b/c1/c2/c3

        String[] testParts = fullTestName.split("/");
        if(testParts.length < 3 ){
            throw new IllegalArgumentException("To skip tests, all 3 parts [folder/file/test name] must be defined. found [" + fullTestName + "]");
        }

        PatternSet skippedPatternSet = patternSetFactory.create();

    List<Integer> nums = asList(1, 2, 3, 4, 5);
    List<Integer> collection =
        new ArrayList<Integer>(nums) {
          @Override
          public Iterator<Integer> iterator() {
            throw new AssertionFailedError("Don't iterate me!");
          }
        };
    assertEquals(5, Iterables.size(collection));
  }

  private static <T extends @Nullable Object> Iterable<T> iterable(T... elements) {

                    prop.setProperty("job.runtime.name", job.getName());
                }
            }
            prop.store(out, cmdList.toString());
        } catch (final IOException e) {
            throw new IORuntimeException(e);
        }
    }

    /**
     * Generates a log name using the specified prefix, execution type, and suffix.
     *
     * @param logPrefix the prefix for the log name

          return oldValue;
        }
        next = getNext(entry);
      } while (next != UNSET);
      entries[last] = swapNext(entry, newEntryIndex);
    }
    if (newEntryIndex == Integer.MAX_VALUE) {
      throw new IllegalStateException("Cannot contain more than Integer.MAX_VALUE elements!");
    }
    int newSize = newEntryIndex + 1;
    resizeMeMaybe(newSize);
    insertEntry(newEntryIndex, key, value, hash);

    checkNotNull(keyFunction);
    checkNotNull(valueFunction);
    return Collector.of(
        () ->
            new EnumMapAccumulator<K, V>(
                (v1, v2) -> {
                  throw new IllegalArgumentException("Multiple values for key: " + v1 + ", " + v2);
                }),
        (accum, t) -> {
          /*

      case UNORDERED:
        orderedNodeConnections = null;
        break;
      case STABLE:
        orderedNodeConnections = new ArrayList<>();
        break;
      default:
        throw new AssertionError(incidentEdgeOrder.type());
    }

    return new DirectedGraphConnections<>(
        /* adjacentNodeValues= */ new HashMap<N, Object>(initialCapacity, INNER_LOAD_FACTOR),
        orderedNodeConnections,

    try {
      in.copyTo(out);
      fail();
    } catch (IOException expected) {
      return expected.getSuppressed().length;
    }
    throw new AssertionError(); // can't happen
  }

  private static ByteSource newNormalByteSource() {
    return ByteSource.wrap(new byte[10]);
  }

  private static ByteSink newNormalByteSink() {

    checkNotNull(keyFunction);
    checkNotNull(valueFunction);
    return Collector.of(
        () ->
            new EnumMapAccumulator<K, V>(
                (v1, v2) -> {
                  throw new IllegalArgumentException("Multiple values for key: " + v1 + ", " + v2);
                }),
        (accum, t) -> {
          /*