public void testRemoveIfWithConcurrentModification() {
    LocalCache<Integer, Integer> map =
        makeLocalCache(createCacheBuilder().concurrencyLevel(1).initialCapacity(1));
    map.put(1, 1);
    map.put(2, 1);
    map.put(3, 1);
    map.entrySet()
        .removeIf(
            entry -> {
              if (entry.getValue().equals(1)) {
                map.put(entry.getKey(), 2);
                return true;

        '?'.code,
        '@'.code,
        '['.code,
        '\\'.code,
        ']'.code,
      )
      .override(
        // java.net.URL got stricter
        if (PlatformVersion.majorVersion >= 21) Encoding.SKIP else Encoding.IDENTITY,
        '\"'.code,
        '<'.code,
        '>'.code,
        '^'.code,
        '`'.code,
        '{'.code,
        '|'.code,
        '}'.code,
      )

  /**
   * Negative Acknowledge: A communication control character transmitted by a receiver as a negative
   * response to the sender.
   *
   * @since 8.0
   */
  public static final byte NAK = 21;

  /**
   * Synchronous Idle: A communication control character used by a synchronous transmission system
   * in the absence of any other character to provide a signal from which synchronism may be

        assertEquals("太郎", extractData.getValues("dc:creator")[0]);
        assertEquals("かいしゃ", extractData.getValues("extended-properties:Company")[0]);
        assertEquals("2010-07-22T00:21:00Z", extractData.getValues("dcterms:created")[0]);
        assertEquals("1", extractData.getValues("meta:line-count")[0]);
        assertEquals("2012-05-18T22:44:00Z", extractData.getValues("dcterms:modified")[0]);

   * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
   * value} is greater than {@code max}, {@code max} is returned.
   *
   * <p><b>Java 21+ users:</b> Use {@code Math.clamp} instead.
   *
   * @param value the {@code float} value to constrain
   * @param min the lower bound (inclusive) of the range to constrain {@code value} to

   * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
   * value} is greater than {@code max}, {@code max} is returned.
   *
   * <p><b>Java 21+ users:</b> Use {@code Math.clamp} instead.
   *
   * @param value the {@code double} value to constrain
   * @param min the lower bound (inclusive) of the range to constrain {@code value} to

   * unchanged. If {@code value} is less than {@code min}, {@code min} is returned, and if {@code
   * value} is greater than {@code max}, {@code max} is returned.
   *
   * <p><b>Java 21+ users:</b> Use {@code Math.clamp} instead.
   *
   * @param value the {@code float} value to constrain
   * @param min the lower bound (inclusive) of the range to constrain {@code value} to

//	}
//	var sph sparseHoles = []sparseEntry{
//		{Offset: 0,  Length: 2},  // Hole fragment for 0..1
//		{Offset: 7,  Length: 11}, // Hole fragment for 7..17
//		{Offset: 21, Length: 4},  // Hole fragment for 21..24
//	}
//
// Then the content of the resulting sparse file with a Header.Size of 25 is:
//
//	var sparseFile = "\x00"*2 + "abcde" + "\x00"*11 + "fgh" + "\x00"*4
type (

## Version 3.14.7

_2020-02-24_

 *  Fix: Don't crash on Android 11 due to use of restricted methods. This prevents a crash with the
    exception, "Expected Android API level 21+ but was 29".


## Version 3.14.6

_2020-01-11_

 *  Fix: Don't crash if the connection is closed when sending a degraded ping. This fixes a
    regression that was introduced in OkHttp 3.14.5.

 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of