public long getAddress() { return address; }
    public int getSize() { return buffer.remaining(); }
    
    public boolean hasAccess(RdmaAccess access) {
        return accessFlags.contains(access);
    }
    
    /**
     * Invalidate this memory region
     */
    public abstract void invalidate();
    
    protected abstract int generateLocalKey();

      }

      @Override
      public boolean remove(@Nullable Object o) {
        if (!contains(o)) {
          return false;
        }
        // requireNonNull is safe because of the contains check.
        Map.Entry<?, ?> entry = requireNonNull((Map.Entry<?, ?>) o);
        removeValuesForKey(entry.getKey());
        return true;
      }
    }

      }

      @Override
      public boolean remove(@Nullable Object o) {
        if (!contains(o)) {
          return false;
        }
        // requireNonNull is safe because of the contains check.
        Map.Entry<?, ?> entry = requireNonNull((Map.Entry<?, ?>) o);
        removeValuesForKey(entry.getKey());
        return true;
      }
    }

        urlSet.add("http://overflow.com/robots.txt");
        assertEquals(10000, urlSet.size());
        assertTrue(urlSet.contains("http://overflow.com/robots.txt"));
        assertFalse(urlSet.contains("http://example0.com/robots.txt")); // First one should be evicted
    }

    /**
     * Test activeThreadCountLock getter
     */

     */
    @Nonnull
    Collection<ProducedArtifact> getAttachedArtifacts(@Nonnull Project project);

    /**
     * Returns project's all artifacts as an immutable ordered collection. The collection contains:
     * <ul>
     *   <li>The project's artifacts ({@link Project#getArtifacts()}):
     *     <ul>
     *       <li>The POM artifact (always present)</li>

     *
     * @param value the comma-separated string of pruned tag configurations
     * @return an array of PrunedTag objects parsed from the input string
     * @throws FessSystemException if the input string contains invalid tag patterns
     */
    public static PrunedTag[] parse(final String value) {
        return split(value, ",").get(stream -> stream.filter(StringUtil::isNotBlank).map(v -> {

 * matches the insertion order. All optional operations (adding and removing) are supported. All
 * elements, including {@code null}, are permitted.
 *
 * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized)
 * constant time operations. Expected in the hashtable sense (depends on the hash function doing a

        assertEquals(complexObject, dataStoreParams.get("complexKey"));

        String asString = dataStoreParams.getAsString("complexKey");
        assertNotNull(asString);
        assertTrue(asString.contains("nested"));
    }

    // Test overwriting existing values
    public void test_overwriteValues() {
        dataStoreParams.put("key1", "originalValue");

    assertEquals("B", peekingIterator.next());
    peekingIterator.remove();
    assertEquals("Should have removed an element", 2, list.size());
    assertFalse("Second element should be gone", list.contains("B"));
  }

  static class ThrowsAtEndException extends RuntimeException {
    /* nothing */
  }

  /**
   * This Iterator claims to have more elements than the underlying iterable, but when you try to

  }

  /**
   * A sensible implementation of {@link SortedMultiset#elementSet} in terms of the following
   * methods: {@link SortedMultiset#clear}, {@link SortedMultiset#comparator}, {@link
   * SortedMultiset#contains}, {@link SortedMultiset#containsAll}, {@link SortedMultiset#count},
   * {@link SortedMultiset#firstEntry} {@link SortedMultiset#headMultiset}, {@link