* concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary,
   * non-deterministic behavior at an undetermined time in the future.
   *
   * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally
   * speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent

    /** Policy information level for server role. */
    public static final int POLICY_INFO_SERVER_ROLE = 6;
    /** Policy information class for modification. */
    /** Policy information level for modification details. */
    public static final int POLICY_INFO_MODIFICATION = 9;
    /** Policy information class for DNS domain. */
    /** Policy information level for DNS domain information. */

 * requested entries may be evicted on each cache modification.
 *
 * <p>If {@link #expireAfterWrite expireAfterWrite} or {@link #expireAfterAccess expireAfterAccess}
 * is requested entries may be evicted on each cache modification, on occasional cache accesses, or
 * on calls to {@link Cache#cleanUp}. Expired entries may be counted by {@link Cache#size}, but will

 * present in the map to be reclaimed by the garbage collector. Entries with reclaimed keys or
 * values may be removed from the map on each map modification or on occasional map accesses; such
 * entries may be counted by {@link Map#size}, but will never be visible to read or write
 * operations. A partially-reclaimed entry is never exposed to the user. Any {@link Map.Entry}

 * will change the table.
 *
 * <p>All methods that modify the table are optional, and the views returned by the table may or may
 * not be modifiable. When modification isn't supported, those methods will throw an {@link
 * UnsupportedOperationException}.
 *
 * <h3>Implementations</h3>
 *
 * <ul>
 *   <li>{@link ImmutableTable}
 *   <li>{@link HashBasedTable}

                    for (int j = 0; j < urlsPerThread; j++) {
                        // Access is synchronized internally in the actual implementation
                        // Here we just verify no concurrent modification exceptions occur
                        String url = "http://example.com/thread" + threadIndex + "/doc" + j;
                        // Simulate the synchronized access that happens in deleteDocument()

   * concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary,
   * non-deterministic behavior at an undetermined time in the future.
   *
   * <p>Note that the fail-fast behavior of an iterator cannot be guaranteed as it is, generally
   * speaking, impossible to make any hard guarantees in the presence of unsynchronized concurrent

        CharMappingItem item = result.get(0);
        assertArrayEquals(new String[] { "x", "y" }, item.getInputs());
        assertEquals("z", item.getOutput());
    }

    // Test concurrent modification
    @Test
    public void test_concurrentModification() throws Exception {
        writeTestFile("a,b => c\nd,e => f\n");

        // Get an item

        assertTrue(greater + ".compareTo(" + t + ')', greater.compareTo(t) > 0);
        assertFalse(greater.equals(t));
      }
    }
  }

  /**
   * Returns a collection that simulates concurrent modification by having its size method return
   * incorrect values. This is useful for testing methods that must treat the return value from
   * size() as a hint only.
   *

    List<RemovalNotification<Object, Object>> notifications = new ArrayList<>();
    RemovalListener<Object, Object> removalListener = notifications::add;
    Cache<Object, Object> cache =
        CacheBuilder.newBuilder().removalListener(removalListener).build();
    cache.put("a", "b");
    cache.asMap().computeIfAbsent("a", k -> "c");
    assertThat(notifications).isEmpty();
  }