}

        // Simple heuristic based on data entropy
        // In practice, this would be more sophisticated
        int uniqueBytes = countUniqueBytes(data);
        double entropy = (double) uniqueBytes / 256.0;

        // Estimate compression ratio based on entropy
        // Lower entropy = better compression
        return 0.3 + (entropy * 0.6); // Range from 30% to 90%
    }

    @Override

            uniqueCounters.add(bytesToHex(counter));
        }

        // All nonces should be unique (high entropy from SecureRandom)
        assertEquals(sampleSize, uniqueCounters.size(), "All nonces should have unique values");

        // Verify that nonces have good entropy (not predictable)
        // With SecureRandom + counter XOR, they should all be different
        Set<String> uniqueNonces = new HashSet<>();

      int expectedEntrySetHash = 0;
      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());

  }

  @Override
  protected void expectMissing(Entry<K, V>... entries) {
    for (Entry<K, V> entry : entries) {
      assertFalse("Should not contain entry " + entry, actualContents().contains(entry));
      assertFalse(
          "Should not contain key " + entry.getKey() + " mapped to value " + entry.getValue(),
          equal(getMap().get(entry.getKey()), entry.getValue()));
    }
  }

          reverse(samples.e4()));
    }

    private Entry<V, K> reverse(Entry<K, V> entry) {
      checkNotNull(entry);
      return mapEntry(entry.getValue(), entry.getKey());
    }

    @SuppressWarnings("unchecked")
    @Override
    public BiMap<V, K> create(Object... elements) {
      Entry<?, ?>[] entries = new Entry<?, ?>[elements.length];
      for (int i = 0; i < elements.length; i++) {

  static <K extends @Nullable Object, V extends @Nullable Object> Entry<V, K> reverseEntry(
      Entry<K, V> entry) {
    return mapEntry(entry.getValue(), entry.getKey());
  }

  @Override
  protected void expectContents(Collection<Entry<K, V>> expected) {
    super.expectContents(expected);
    List<Entry<V, K>> reversedEntries = new ArrayList<>();
    for (Entry<K, V> entry : expected) {
      reversedEntries.add(reverseEntry(entry));

    }

    /**
     * Get cache entry for a directory
     *
     * @param directoryPath directory path
     * @return cache entry or null
     */
    public DirectoryCacheEntry getCacheEntry(String directoryPath) {
        DirectoryCacheEntry entry = directoryCache.get(directoryPath);

        // Check if cache entry is valid
        if (entry != null && entry.needsRefresh()) {

        private final Entry<K, V> entry;

        private Map1(K key, V value) {
            this.entry = new SimpleImmutableEntry<>(key, value);
        }

        @Override
        public Set<Entry<K, V>> entrySet() {
            return new AbstractImmutableSet<>() {
                @Override
                public Iterator<Entry<K, V>> iterator() {

  public @Nullable Entry<E> pollFirstEntry() {
    Iterator<Entry<E>> entryIterator = entryIterator();
    if (entryIterator.hasNext()) {
      Entry<E> result = entryIterator.next();
      result = Multisets.immutableEntry(result.getElement(), result.getCount());
      entryIterator.remove();
      return result;
    }
    return null;
  }

  @Override
  public @Nullable Entry<E> pollLastEntry() {

    /**
     * Adds user attributes to the LDAP entry for user creation.
     *
     * @param entry the BasicAttributes to add user attributes to
     * @param user the user object containing attribute values
     */
    protected void addUserAttributes(final BasicAttributes entry, final User user) {
        entry.put(new BasicAttribute("cn", user.getName()));