super(size);
    }

    /**
     * Associates {@code key} with {@code value} in the built bimap. Duplicate keys or values are
     * not allowed, and will cause {@link #build} to fail.
     */
    @CanIgnoreReturnValue
    @Override
    public Builder<K, V> put(K key, V value) {
      super.put(key, value);
      return this;
    }

    /**

    return optional.orElse(null);
  }

  /**
   * Returns the minimum of the two values. If the values compare as 0, the first is returned.
   *
   * <p>The recommended solution for finding the {@code minimum} of some values depends on the type
   * of your data and the number of elements you have. Read more in the Guava User Guide article on

 * key. A {@link HashMap} associates each key with an {@link ArrayList} of values.
 *
 * <p>When iterating through the collections supplied by this class, the ordering of values for a
 * given key agrees with the order in which the values were added.
 *
 * <p>This multimap allows duplicate key-value pairs. After adding a new key-value pair equal to an

      return Sets.equalsImpl(this, o);
    }
  }

  @Override
  public @Nullable Range<C> rangeContaining(C value) {
    checkNotNull(value);
    Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(Cut.belowValue(value));
    if (floorEntry != null && floorEntry.getValue().contains(value)) {
      return floorEntry.getValue();
    } else {
      // TODO(kevinb): revisit this design choice
      return null;

    @DisplayName("Test sflags field with various byte values")
    public void testSflagsField(byte value) {
        // When
        serverData.sflags = value;

        // Then
        assertEquals(value, serverData.sflags);
    }

    /**
     * Test setting and getting int fields
     */
    @Test
    @DisplayName("Test int fields with various values")
    public void testIntFields() {
        // When

  /**
   * Returns {@code true} if this BiMap contains an entry whose value is equal to {@code value} (or,
   * equivalently, if this inverse view contains a key that is equal to {@code value}).
   *
   * <p>Due to the property that values in a BiMap are unique, this will tend to execute in
   * faster-than-linear time.
   *
   * @param value the object to search for in the values of this BiMap

/**
 * Tests for SpnegoConstants interface.
 * Verifies constant values, modifiers, types, and structural properties.
 */
class SpnegoConstantsTest {

    // Simple OID format: numbers separated by dots (at least one dot)
    private static final Pattern OID_PATTERN = Pattern.compile("\\d+(?:\\.\\d+)+");

    @Test
    @DisplayName("Constant values match expected OIDs")
    void constantValues() {

  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,
  // 0x89abcd80. To this is added (or'd) the `next` value, which is an index within `entries`
  // (and therefore within `keys` and `values`) of another entry that has the same short hash

        offset += 4;
        buffer[offset++] = (byte) 0xFF; // Non-zero value for deletePending
        buffer[offset++] = (byte) 0x80; // Non-zero value for directory

        // Decode
        int bytesDecoded = fileStandardInfo.decode(buffer, 0, buffer.length);

        // Verify - non-zero values should be treated as true
        assertEquals(22, bytesDecoded);

    }

    /**
     * Returns the result data body for multiple values.
     * @param name The name of the field.
     * @param values The list of values for the field.
     * @return The result data body.
     */
    protected String getResultDataBody(final String name, final List<String> values) {