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 */

    /** 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 */

        do {
            final int octet = s.read();
            if (octet < 0) {
                throw new EOFException("EOF found reading length");
            }

            if (length >>> 23 != 0) {
                throw new IOException("long form definite-length more than 31 bits");
            }

            length = (length << 8) + octet;
        } while (++octetsPos < octetsCount);

   * 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
   */
  @Override
  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];

   * byte written, {@code bytes.limit() - 1} is the last. The position of the buffer will be equal
   * to the limit when this method returns.
   *
   * @param bytes a byte buffer
   * @return this instance
   * @since 23.0
   */
  @CanIgnoreReturnValue
  PrimitiveSink putBytes(ByteBuffer bytes);

  /** Puts a short into this sink. */
  @CanIgnoreReturnValue
  PrimitiveSink putShort(short s);

  /** Puts an int into this sink. */

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

  /**

   *     to {@code nodeV}
   * @throws IllegalArgumentException if {@code nodeU} or {@code nodeV} is not an element of this
   *     network
   * @since 23.0
   */
  @Nullable E edgeConnectingOrNull(N nodeU, N nodeV);

  /**
   * Returns the single edge that directly connects {@code endpoints} (in the order, if any,

        message[18] = 0;
        message[19] = 0;

        // NT Response (24 bytes at offset 88)
        message[20] = 24; // Length
        message[21] = 0;
        message[22] = 24; // Max Length
        message[23] = 0;
        message[24] = 88; // Offset
        message[25] = 0;
        message[26] = 0;
        message[27] = 0;

        // Domain (12 bytes "DOMAIN" in Unicode at offset 112)