}
    }

    @Nested
    @DisplayName("Hex Conversion Tests")
    class HexConversionTests {

        @Test
        @DisplayName("Various byte values are converted to uppercase hex")
        void testHexConversion() {
            byte[] challenge = new byte[] { (byte) 0x00, (byte) 0x0F, (byte) 0x10, (byte) 0x7F, (byte) 0x80, (byte) 0xFF };

    entries.add(entry(k3(), null));

    resetContainer(getSubjectGenerator().create(entries.toArray()));
    assertTrue(
        "A Map should equal any other Map containing the same entries,"
            + " even if some values are null.",
        getMap().equals(newHashMap(entries)));
  }

  @CollectionSize.Require(absent = CollectionSize.ZERO)
  public void testEquals_otherContainsNullValue() {

            return roundFloorAsDouble;
          } else if (diff > 0) { // closer to ceiling
            return roundCeilingAsDouble;
          }
          // halfway between the representable values; do the half-whatever logic
          switch (mode) {
            case HALF_EVEN:
              // roundFloorAsDouble and roundCeilingAsDouble are neighbors, so precisely

 *
 * <p>Like any other {@code Map<Class, Object>}, this map may contain entries for primitive types,
 * and a primitive type and its corresponding wrapper type may map to different values.
 *
 * @param <B> the common supertype that all entries must share; often this is simply {@link Object}
 * @author Ben Yu
 * @since 13.0
 */
@DoNotMock("Use ImmutableTypeToInstanceMap or MutableTypeToInstanceMap")

 *
 * <p>Like any other {@code Map<Class, Object>}, this map may contain entries for primitive types,
 * and a primitive type and its corresponding wrapper type may map to different values.
 *
 * @param <B> the common supertype that all entries must share; often this is simply {@link Object}
 * @author Ben Yu
 * @since 13.0
 */
@DoNotMock("Use ImmutableTypeToInstanceMap or MutableTypeToInstanceMap")

/**
 * CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order,
 * maintained with a doubly linked list through the entries. All optional operations (put and
 * remove) are supported. Null keys and values are supported.
 *
 * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and
 * amortized) constant time operations. Expected in the hashtable sense (depends on the hash

 * way of "cutting" a "number line" (actually of instances of type {@code C}, not necessarily
 * "numbers") into two sections; this can be done below a certain value, above a certain value,
 * below all values or above all values. With this object defined in this way, an interval can
 * always be represented by a pair of {@code Cut} instances.
 *
 * @author Kevin Bourrillion
 */

                NegTokenInit.SEQUENCE_CHECKING, NegTokenInit.ANONYMITY, NegTokenInit.CONFIDENTIALITY, NegTokenInit.INTEGRITY })
        @DisplayName("Individual flag values are correctly set and retrieved")
        void testIndividualFlagValues(int flag) {
            NegTokenInit init = new NegTokenInit();

            // Initially false
            assertFalse(init.getContextFlag(flag));

        assertEquals(3, getNumEntries(response));
        assertEquals(5, getTotalAvailableEntries(response));
    }

    @ParameterizedTest
    @DisplayName("Test readParametersWireFormat with various status values")
    @ValueSource(ints = { 0, 1, 100, 255, 32767, 65535 })
    void testReadParametersWireFormatWithVariousStatus(int status) throws Exception {
        byte[] buffer = new byte[8];
        int bufferIndex = 0;

    /**
     * Array of property names to exclude from the operation.
     */
    protected final List<String> excludePropertyNames = newArrayList();

    /**
     * Whether to exclude properties with null values from the operation.
     */
    protected boolean excludesNull = false;

    /**
     * Whether to exclude strings that consist only of whitespace from the operation.
     */