int key0Count = multimap().get(k0()).size();
    assertEquals(key0Count > 0, multimap().keySet().remove(k0()));
    assertEquals(getNumElements() - key0Count, multimap().size());
    assertGet(k0());
  }

  @CollectionSize.Require(absent = ZERO)
  @CollectionFeature.Require(SUPPORTS_ITERATOR_REMOVE)
  public void testKeySetIteratorRemove() {
    int key0Count = multimap().get(k0()).size();

    List<E> expectedList = copyToList(expectedCollection);
    // Avoid expectEquals() here to delay reason manufacture until necessary.
    if (getList().size() != expectedList.size()) {
      fail("size mismatch: " + reportContext(expectedList));
    }
    for (int i = 0; i < expectedList.size(); i++) {
      E expected = expectedList.get(i);
      E actual = getList().get(i);

   * size() as a hint only.
   *
   * @param delta the difference between the true size of the collection and the values returned by
   *     the size method
   */
  public static <T extends @Nullable Object> Collection<T> misleadingSizeCollection(int delta) {
    // It would be nice to be able to return a real concurrent
    // collection like ConcurrentLinkedQueue, so that e.g. concurrent

        count,
        getMultiset().count(element));

    int size = 0;
    for (Multiset.Entry<E> entry : getMultiset().entrySet()) {
      size += entry.getCount();
    }
    assertEquals(
        "multiset.size() should be the sum of the counts of all entries",
        size,
        getMultiset().size());
  }

  /** Call the {@code setCount()} method under test, and check its return value. */

        Map<String, Dependency> normalized = new LinkedHashMap<>(dependencies.size() * 2);

        for (Dependency dependency : dependencies) {
            normalized.put(dependency.getManagementKey(), dependency);
        }

        if (dependencies.size() != normalized.size()) {
            model.setDependencies(new ArrayList<>(normalized.values()));
        }
    }

    /**

            UpgradeContext context = createMockContext();

            Set<Coordinates> gavs = InferenceStrategy.computeAllArtifactCoordinates(context, pomMap);

            assertEquals(2, gavs.size());
            assertTrue(gavs.contains(Coordinates.of("com.example", "parent-project", "1.0.0")));
            assertTrue(gavs.contains(Coordinates.of("com.example", "child-project", "1.0.0")));
        }

        @Test

            FileUtil.deleteInBackground(tempFile);
        }

        return new ExtractData(buf.toString().trim());
    }

    /**
     * Sets the maximum content size for extraction.
     *
     * @param maxContentSize the maximum content size to set (-1 for no limit)
     */
    public void setMaxContentSize(final long maxContentSize) {
        this.maxContentSize = maxContentSize;
    }

     * @return estimated compression ratio (0.0 to 1.0, where 0.5 means 50% size reduction)
     */
    double estimateCompressionRatio(byte[] data, int algorithm);

    /**
     * Gets the minimum data size threshold for compression.
     * Data smaller than this threshold should not be compressed.
     *
     * @return minimum size in bytes for compression to be beneficial
     */
    int getMinCompressionSize();

     * Should correctly parse the raw bytes.
     */
    @Test
    void testAvSingleHostRawConstructor() {
        byte[] rawData = new byte[48]; // 8 (size/zero) + 8 (customData) + 32 (machineId)
        // Simulate some data
        rawData[0] = 48; // size
        rawData[16] = 0x01; // machineId start
        rawData[17] = 0x02;

        AvSingleHost avSingleHost = new AvSingleHost(rawData);

        assertEquals(0, leaseContext.getLeaseFlags());
    }

    @Test
    @DisplayName("Should calculate correct size")
    void testSize() {
        int expectedSize = 16 + 4 + 4 + 32; // header + name + padding + data
        assertEquals(expectedSize, leaseContext.size());
    }

    @Test
    @DisplayName("Should set and get lease key")
    void testLeaseKeyAccessors() {