Entry<K, V> entry = entryIterator.next();
      if (Objects.equals(entry.getKey(), key)) {
        V value = entry.getValue();
        entryIterator.remove();
        return value;
      }
    }
    return null;
  }

  /**
   * A sensible definition of {@link #clear} in terms of the {@code iterator} method of {@link
   * #entrySet}. In many cases, you may wish to override {@link #clear} to forward to this

   * Creates a new {@code AtomicDoubleArray} with the same length as, and all elements copied from,
   * the given array.
   *
   * @param array the array to copy elements from
   * @throws NullPointerException if array is null
   */
  public AtomicDoubleArray(double[] array) {
    int len = array.length;
    long[] longArray = new long[len];
    for (int i = 0; i < len; i++) {
      longArray[i] = doubleToRawLongBits(array[i]);
    }

5. Ensure all tests pass: `mvn test`
6. Check license headers: `mvn license:format`
7. Commit changes: `git commit -m 'Add amazing feature'`
8. Push to branch: `git push origin feature/amazing-feature`
9. Open a Pull Request

### Code Style

- Use Eclipse formatter configuration (`src/config/eclipse/formatter/java.xml`)
- Follow existing naming conventions
- Add comprehensive JavaDoc for public APIs

        try {
            storageClient.parsePath("");
            fail();
        } catch (final CrawlingAccessException e) {
            // ok
        }
        try {
            storageClient.parsePath(null);
            fail();
        } catch (final CrawlingAccessException e) {
            // ok
        }
    }

        } catch (Exception e) {
            assertTrue(true);
        }
    }

    public void test_addElevateWord_noReading() {
        try {
            suggestHelper.addElevateWord("test word", null, new String[] { "tag1" }, new String[] { "role1" }, 1.0f, true);
            assertTrue(true);
        } catch (Exception e) {
            assertTrue(true);
        }
    }

  /**
   * `source.length` may be longer than the max length of the variant's data frame. Implementations
   * must send multiple frames as necessary.
   *
   * @param source the buffer to draw bytes from. May be null if byteCount is 0.
   * @param byteCount must be between 0 and the minimum of `source.length` and [maxDataLength].
   */
  @Throws(IOException::class)
  fun data(
    outFinished: Boolean,
    streamId: Int,

    assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 2)).isEqualTo(0);
    assertThat(UnsignedLongs.remainder(0xfffffffffffffffeL, 5)).isEqualTo(4);
  }

  @GwtIncompatible // Too slow in GWT (~3min fully optimized)
  public void testDivideRemainderEuclideanProperty() {
    // Use a seed so that the test is deterministic:
    Random r = new Random(0L);
    for (int i = 0; i < 1000000; i++) {

                + "</doc>";

        final AccessResultDataImpl accessResultDataImpl = new AccessResultDataImpl();
        accessResultDataImpl.setData(null);
        accessResultDataImpl.setEncoding(Constants.UTF_8);
        accessResultDataImpl.setTransformerName("xpathTransformer");

        final Object obj = xpathTransformer.getData(accessResultDataImpl);

    assertThrows(UnsupportedOperationException.class, () -> sortedMultiset.pollFirstEntry());
  }

  @CollectionSize.Require(SEVERAL)
  public void testLower() {
    resetWithHole();
    assertEquals(null, sortedMultiset.headMultiset(a.getElement(), OPEN).lastEntry());
    assertEquals(a, sortedMultiset.headMultiset(b.getElement(), OPEN).lastEntry());
    assertEquals(a, sortedMultiset.headMultiset(c.getElement(), OPEN).lastEntry());

  }

  public void testEncloseAll_nullValue() {
    List<@Nullable Integer> nullFirst = Lists.newArrayList(null, 0);
    assertThrows(NullPointerException.class, () -> Range.encloseAll((List<Integer>) nullFirst));
    List<@Nullable Integer> nullNotFirst = Lists.newArrayList(0, null);
    assertThrows(NullPointerException.class, () -> Range.encloseAll((List<Integer>) nullNotFirst));
  }