}

        @Test
        void knownErrorCodes() {
            assertEquals(71, WinError.ERROR_REQ_NOT_ACCEP, "ERROR_REQ_NOT_ACCEP expected 71");
            assertEquals(230, WinError.ERROR_BAD_PIPE, "ERROR_BAD_PIPE expected 230");
            assertEquals(6118, WinError.ERROR_NO_BROWSER_SERVERS_FOUND, "ERROR_NO_BROWSER_SERVERS_FOUND expected 6118");
        }
    }

    @Nested
    @DisplayName("Array content checks")

   * Range.closed(lower, upper)}.)
   *
   * @throws IllegalArgumentException if {@code lower} is greater than {@code upper}
   * @since 23.0
   */
  public static ContiguousSet<Integer> closed(int lower, int upper) {
    return create(Range.closed(lower, upper), DiscreteDomain.integers());
  }

  /**

   * Range.closed(lower, upper)}.)
   *
   * @throws IllegalArgumentException if {@code lower} is greater than {@code upper}
   * @since 23.0
   */
  public static ContiguousSet<Integer> closed(int lower, int upper) {
    return create(Range.closed(lower, upper), DiscreteDomain.integers());
  }

  /**

        assertAll(() -> assertEquals(0, WinError.ERROR_SUCCESS), () -> assertEquals(5, WinError.ERROR_ACCESS_DENIED),
                () -> assertEquals(71, WinError.ERROR_REQ_NOT_ACCEP), () -> assertEquals(230, WinError.ERROR_BAD_PIPE),
                () -> assertEquals(231, WinError.ERROR_PIPE_BUSY), () -> assertEquals(232, WinError.ERROR_NO_DATA),

 * href="https://github.com/google/guava/wiki/GraphsExplained#notes-for-implementors">notes for
 * implementors</a>
 *
 * @author Joshua O'Madadhain
 * @author Jens Nyman
 * @param <N> Node parameter type
 * @since 23.0
 */
@Beta
@DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
public interface PredecessorsFunction<N> {

  /**

 * href="https://github.com/google/guava/wiki/GraphsExplained#notes-for-implementors">notes for
 * implementors</a>
 *
 * @author Joshua O'Madadhain
 * @author Jens Nyman
 * @param <N> Node parameter type
 * @since 23.0
 */
@Beta
@DoNotMock("Implement with a lambda, or use GraphBuilder to build a Graph with the desired edges")
public interface SuccessorsFunction<N> {

  /**

 *
 * <p>As of Guava 23.0, this class is thread-safe and lock-free. It internally uses atomics and
 * compare-and-swap to ensure correctness when multiple threads are used to access it.
 *
 * @param <T> the type of instances that the {@code BloomFilter} accepts
 * @author Dimitris Andreou
 * @author Kevin Bourrillion
 * @since 11.0 (thread-safe since 23.0)
 */
@Beta

   * equivalent to {@code nodes().contains(nodeU) && successors(nodeU).contains(nodeV)}.
   *
   * <p>In an undirected graph, this is equal to {@code hasEdgeConnecting(nodeV, nodeU)}.
   *
   * @since 23.0
   */
  boolean hasEdgeConnecting(N nodeU, N nodeV);

  /**
   * Returns true if there is an edge that directly connects {@code endpoints} (in the order, if

    if (buckets < 2
        || buckets > Ints.MAX_POWER_OF_TWO
        || Integer.highestOneBit(buckets) != buckets) {
      throw new IllegalArgumentException("must be power of 2 between 2^1 and 2^30: " + buckets);
    }
    if (buckets <= BYTE_MAX_SIZE) {
      return new byte[buckets];
    } else if (buckets <= SHORT_MAX_SIZE) {
      return new short[buckets];
    } else {
      return new int[buckets];

    /** Access is denied */
    int ERROR_ACCESS_DENIED = 5;
    /** No more connections can be made to this remote computer */
    int ERROR_REQ_NOT_ACCEP = 71;
    /** The pipe state is invalid */
    int ERROR_BAD_PIPE = 230;
    /** All pipe instances are busy */
    int ERROR_PIPE_BUSY = 231;
    /** The pipe is being closed */
    int ERROR_NO_DATA = 232;
    /** No process is on the other end of the pipe */