for (int i = 0; i < reps; i++) {
      dummy += impl.create(values).size();
    }
    return dummy;
  }

  @Benchmark
  boolean createPopulateAndRemove(int reps) {
    boolean dummy = false;
    for (int i = 1; i < reps; i++) {
      Map<Element, Element> map = impl.create(values);
      for (Element value : values) {
        dummy |= map.remove(value) == null;
      }
    }
    return dummy;
  }

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

     * Gets the optional preprocessor for configuration values.
     *
     * @return The preprocessor for configuration values or {@code null} if none.
     */
    BeanConfigurationValuePreprocessor getValuePreprocessor();

    /**
     * Sets the optional preprocessor for configuration values.
     *
     * @param valuePreprocessor The preprocessor for configuration values, may be {@code null} if unneeded.

        @DisplayName("Should encode negative values as unsigned")
        void testEncodingWithNegativeValues() {
            long negativeOffset = -1L;
            long negativeLength = -100L;
            int negativeFlags = -1;

            lock = new Smb2Lock(negativeOffset, negativeLength, negativeFlags);
            lock.encode(buffer, 0);

            // Negative values should be encoded as unsigned

    }
  }

  @LazyInit private transient @Nullable Collection<V> values;

  @Override
  public Collection<V> values() {
    Collection<V> result = values;
    return (result == null) ? values = createValues() : result;
  }

  Collection<V> createValues() {
    return new Values();
  }

  Iterator<V> valuesIterator() {

    response = client.post("/tuple-form/", data={"values": ("1", "2")})
    assert response.status_code == 200, response.text
    assert response.json() == [1, 2]


def test_tuple_form_invalid():
    response = client.post("/tuple-form/", data={"values": ("1", "2", "3")})
    assert response.status_code == 422, response.text

    response = client.post("/tuple-form/", data={"values": ("1")})

 *       as that of its keys. This is sometimes called an "invertible map," since the restriction on
 *       values enables it to support an {@linkplain BiMap#inverse inverse view} -- which is another
 *       instance of {@code BiMap}.
 *   <dt>{@link Table}
 *   <dd>A new type, which is similar to {@link java.util.Map}, but which indexes its values by an

   * @param value the value to be associated with the specified key
   * @return the value that was previously associated with the key, or {@code null} if there was no
   *     previous entry. (If the bimap contains null values, then {@code forcePut}, like {@code
   *     put}, returns {@code null} both if the key is absent and if it is present with a null
   *     value.)
   */
  @CanIgnoreReturnValue

        }

        @ParameterizedTest
        @DisplayName("Should create instance with various offset values")
        @CsvSource({ "0, 0, 1024", "1024, 2048, 4096", "9223372036854775807, 9223372036854775807, 2147483647", // Max long values
                "-1, -1, -1", // Negative values (should still create instance)
                "0, 9223372036854775807, 0" // Edge cases
        })