factory, args, i, generateDummyArg(param, newFreshValueGenerator()))) {
        // If the implementation uses identityHashCode(), referential equality is
        // probably intended. So no point in using an equal-but-different factory argument.
        // We check twice to avoid confusion caused by accidental hash collision.
        equalArgs.set(i, shouldBeEqualArg);
      }
    }
    return equalArgs;
  }

       *
       * We store `localFuturesOrNull` inside the listener because `this.futures` might be nulled
       * out by the time the listener runs for the final future -- at which point we need to check
       * all inputs for exceptions *if* we're collecting values. If we're not, then the listener
       * doesn't need access to the futures again, so we can just pass `null`.
       *

        // Then
        int bodyOffset = Smb2Constants.SMB2_HEADER_LENGTH;
        int securityBufferOffset = SMBUtil.readInt2(buffer, bodyOffset + 12);

        // The offset should point to the location after the fixed structure (relative to header start)
        int expectedOffset = Smb2Constants.SMB2_HEADER_LENGTH + 24;
        while ((expectedOffset % 8) != 0) {
            expectedOffset++; // Account for pad8

     */
    public static int enc_floatbe(final float f, final byte[] dst, final int di) {
        return enc_uint32be(Float.floatToIntBits(f), dst, di);
    }

    /*
     * Decode floating point numbers
     */

    /**
     * Decodes a float value from little-endian byte order.
     *
     * @param src the source byte array
     * @param si the starting index in the source array

     * A B node only broadcasts name queries. This is the default if a
     * nameserver such as WINS or Samba is not specified.
     */

    public static final int B_NODE = 0;

    /**
     * A Point-to-Point node, or P node, unicasts queries to a nameserver
     * only. Natrually the <code>jcifs.smb1.netbios.nameserver</code> property must
     * be set.
     */

    public static final int P_NODE = 1;

    /**

                        }
                        if (resolverType == ResolverType.RESOLVER_WINS) {
                            /*
                             * If WINS reports negative, no point in retry
                             */
                            break;
                        }
                    }
                    break;
                default:
                    break;

     * true value. Therefore, we perform at least one Newton iteration to get a guess that's
     * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point.
     */
    BigInteger sqrt0;
    int log2 = log2(x, FLOOR);
    if (log2 < Double.MAX_EXPONENT) {
      sqrt0 = sqrtApproxWithDoubles(x);
    } else {

     */
    public static int enc_floatbe(final float f, final byte[] dst, final int di) {
        return enc_uint32be(Float.floatToIntBits(f), dst, di);
    }

    /* Decode floating point numbers
     */

    /**
     * Decodes a float value from little-endian byte order.
     *
     * @param src the source byte array
     * @param si the starting index in the source array

- Implement `post-filter` extension point for scheduling framework ([#78097](https://github.com/kubernetes/kubernetes/pull/78097), [@draveness](https://github.com/draveness))
- Add Bind extension point of the scheduling framework ([#78513](https://github.com/kubernetes/kubernetes/pull/78513), [@chenchun](https://github.com/chenchun))

    }
  }

  @Override
  protected void tearDown() throws Exception {
    // We don't want to leave stray threads running after each test. At this point, every thread
    // launched by this test is either:
    //
    // (a) Blocked attempting to enter the monitor.
    // (b) Waiting for the single guard to become satisfied.