final String key = e.getKey();
            String value = e.getValue();
            for (final Map.Entry<String, String> entry : paramEnvMap.entrySet()) {
                value = value.replace("${" + entry.getKey() + "}", entry.getValue());
            }
            return new Pair<>(key, value);
        }).collect(Collectors.toMap(Pair<String, String>::getFirst, Pair<String, String>::getSecond));

import org.apache.maven.api.annotations.Nonnull;

/**
 * Registry for extensible enum values that allows looking up enum instances by their identifiers.
 * <p>
 * This service provides access to all registered instances of a specific extensible enum type.
 * It's used internally by Maven and can also be used by plugins and extensions to access
 * custom enum values that have been registered through SPI providers.
 *

    @BeforeEach
    void setUp() {
        notifyInfo = new FileNotifyInformationImpl();
    }

    @Test
    @DisplayName("Test default constructor creates instance with null values")
    void testDefaultConstructor() {
        assertNotNull(notifyInfo);
        assertEquals(0, notifyInfo.getAction());
        assertNull(notifyInfo.getFileName());
        assertEquals(0, notifyInfo.getNextEntryOffset());

        @DisplayName("Should handle boundary values for structure size")
        void testBoundaryValuesForStructureSize() {
            // Test boundary values around 4
            int[] boundaryValues = { 3, 4, 5 };

            for (int value : boundaryValues) {
                byte[] buffer = new byte[10];
                SMBUtil.writeInt2(value, buffer, 0);

                if (value == 4) {
                    // Should succeed

      } else if (value instanceof OptionalInt) {
        return !((OptionalInt) value).isPresent();
      } else if (value instanceof OptionalLong) {
        return !((OptionalLong) value).isPresent();
      } else if (value instanceof OptionalDouble) {
        return !((OptionalDouble) value).isPresent();
      } else if (value instanceof Optional) {
        return !((Optional) value).isPresent();

   * SortedSet} values.
   */
  @Override
  public Map<K, Collection<V>> asMap() {
    return super.asMap();
  }

  /**
   * {@inheritDoc}
   *
   * <p>Consequently, the values do not follow their natural ordering or the ordering of the value
   * comparator.
   */
  @Override
  public Collection<V> values() {
    return super.values();
  }

	values := make(url.Values)
	values.Set(peerRESTMetricsTypes, strconv.FormatUint(uint64(t), 10))
	for disk := range opts.disks {
		values.Add(peerRESTDisk, disk)
	}
	for host := range opts.hosts {
		values.Add(peerRESTHost, host)
	}
	values.Set(peerRESTJobID, opts.jobID)
	values.Set(peerRESTDepID, opts.depID)

  }

  @Override
  public boolean containsKey(@Nullable Object key) {
    return get(key) != null;
  }

  @Override
  public boolean containsValue(@Nullable Object value) {
    return values().contains(value);
  }

  private transient @Nullable ImmutableSet<Entry<K, V>> cachedEntrySet = null;

  @Override
  public final ImmutableSet<Entry<K, V>> entrySet() {
    if (cachedEntrySet != null) {

        int bytesRead = response.readParameterWordsWireFormat(buffer, bufferIndex);

        // Should still read 37 bytes regardless of reserved byte values
        assertEquals(37, bytesRead);
    }

    @Test
    @DisplayName("Test handling of maximum values")
    void testMaximumValues() throws Exception {
        byte[] buffer = new byte[100];
        int bufferIndex = 0;

        // Reserved bytes

   * is precisely representable as a {@code double}, its {@code double} value will be returned;
   * otherwise, the rounding will choose between the two nearest representable values with {@code
   * mode}.
   *
   * <p>For the case of {@link RoundingMode#HALF_DOWN}, {@code HALF_UP}, and {@code HALF_EVEN},
   * infinite {@code double} values are considered infinitely far away. For example, 2^2000 is not