* Returns the value of the request header.
     * @return The value of the request header.
     */
    public String getValue() {
        return value;
    }

    /**
     * Sets the value of the request header.
     * @param value The value of the request header.
     */
    public void setValue(final String value) {
        this.value = value;
    }

    /**
     * Checks if the request header is valid.

                return entry;
              }

              @Override
              @ParametricNullness
              public V setValue(@ParametricNullness V newValue) {
                checkArgument(apply(getKey(), newValue));
                return super.setValue(newValue);
              }
            };
          }
        };
      }
    }

    @Override
    Set<K> createKeySet() {

        assertNull(param.getCrawlingInfoId());
        assertNull(param.getKey());
        assertNull(param.getValue());
        assertNull(param.getCreatedTime());

        param.setId("param-id");
        param.setCrawlingInfoId("crawling-info-id");
        param.setKey("docs_processed");
        param.setValue("1000");
        param.setCreatedTime(777777777L);

        assertEquals("param-id", param.getId());

    assertThat(entry.getValue()).isEqualTo("World");
    assertTrue(iter.hasNext());

    entry = iter.next();
    assertThat(entry.getKey()).isEqualTo("first");
    assertThat(entry.getValue()).isEqualTo("second");
    assertTrue(iter.hasNext());

    entry = iter.next();
    assertThat(entry.getKey()).isEqualTo("polygene");
    assertThat(entry.getValue()).isEqualTo("lubricants");

      for (Entry<K, V> entry : entrySet) {
        assertTrue(map.containsKey(entry.getKey()));
        assertTrue(map.containsValue(entry.getValue()));
        int expectedHash =
            (entry.getKey() == null ? 0 : entry.getKey().hashCode())
                ^ (entry.getValue() == null ? 0 : entry.getValue().hashCode());
        assertEquals(expectedHash, entry.hashCode());
        expectedEntrySetHash += expectedHash;
      }

          if (entry.getValue().containsKey(columnKey)) {
            @WeakOuter
            final class EntryImpl extends AbstractMapEntry<R, V> {
              @Override
              public R getKey() {
                return entry.getKey();
              }

              @Override
              public V getValue() {
                return entry.getValue().get(columnKey);
              }

    }

    @Override
    public V getValue() {
      assertTrue(Thread.holdsLock(mutex));
      return super.getValue();
    }

    @Override
    public int hashCode() {
      assertTrue(Thread.holdsLock(mutex));
      return super.hashCode();
    }

    @Override
    public V setValue(V value) {
      assertTrue(Thread.holdsLock(mutex));
      return super.setValue(value);
    }

      assertEquals(2 * i, (int) inverse.get(2 * i - 1));
    }
    Set<Entry<Integer, Integer>> entries = bimap.entrySet();
    for (Entry<Integer, Integer> entry : entries) {
      entry.setValue(entry.getValue() + 2 * N);
    }
    for (int i = 0; i < N; i++) {
      assertEquals(2 * N + 2 * i - 1, (int) bimap.get(2 * i));
    }
  }

  public void testBiMapEntrySetIteratorRemove() {

  public void testIteratorSetValueAndRemove() {
    Iterator<Entry<K, V>> entryItr = getMap().entrySet().iterator();
    while (entryItr.hasNext()) {
      Entry<K, V> entry = entryItr.next();
      entry.setValue(e3().getValue());
      entryItr.remove();
    }
    assertTrue(getMap().isEmpty());
  }

  public void testContainsEntryWithIncomparableKey() {
    try {

  public void testIteratorSetValueAndRemove() {
    Iterator<Entry<K, V>> entryItr = getMap().entrySet().iterator();
    while (entryItr.hasNext()) {
      Entry<K, V> entry = entryItr.next();
      entry.setValue(e3().getValue());
      entryItr.remove();
    }
    assertTrue(getMap().isEmpty());
  }

  public void testContainsEntryWithIncomparableKey() {
    try {