// Test field with CustomSize annotation for testing
    @CustomSize(minKey = "test.min", maxKey = "test.max")
    private String testField;

    // Test field with only minKey
    @CustomSize(minKey = "test.min.only")
    private String testFieldMinOnly;

    // Test field with only maxKey
    @CustomSize(maxKey = "test.max.only")
    private String testFieldMaxOnly;

    // Test field with custom message

        }

        Map<String, String> props = readProperties(propsPath);

        List<String> missing = new ArrayList<>();
        List<String> empty = new ArrayList<>();

        for (String rawKey : args) {
            String key = rawKey.trim();
            if (key.isEmpty()) continue;
            if (!props.containsKey(key)) {
                missing.add(key);
                continue;
            }

   * default initial capacity and load factor.
   */
  public static <B extends @Nullable Object> MutableClassToInstanceMap<B> create() {
    return new MutableClassToInstanceMap<>(new HashMap<Class<? extends @NonNull B>, B>());
  }

  /**
   * Returns a new {@code MutableClassToInstanceMap} instance backed by a given empty {@code

      new Predicate<Entry<String, Integer>>() {
        @Override
        public boolean apply(Entry<String, Integer> entry) {
          return !Objects.equals(entry.getKey(), "badkey") && entry.getValue() != 55556;
        }
      };

  public MultimapsFilterEntriesAsMapTest() {
    super(true, true, false);
  }

  private Multimap<String, Integer> createMultimap() {

      new Predicate<Entry<String, Integer>>() {
        @Override
        public boolean apply(Entry<String, Integer> entry) {
          return !Objects.equals(entry.getKey(), "badkey") && entry.getValue() != 55556;
        }
      };

  public MultimapsFilterEntriesAsMapTest() {
    super(true, true, false);
  }

  private Multimap<String, Integer> createMultimap() {

sessionID []byte, ivKeyLen, keyLen, macKeyLen int, ) (ivKey, key, macKey []byte) { h := hash() generateKeyMaterial := func(tag []byte, length int) []byte { var key []byte for len(key) < length { h.Reset() h.Write(K) h.Write(H) if len(key) == 0 { h.Write(tag) h.Write(sessionID) } else { h.Write(key) } key = h.Sum(key) } return key[:length] } ivKey = generateKeyMaterial(d.ivTag, ivKeyLen) key = generateKeyMaterial(d.keyTag, keyLen) macKey = generateKeyMaterial(d.macKeyTag, macKeyLen) return } golang....

      other[size] = null;
    }
    copyIntoArray(other, 0);
    return other;
  }

  /** If this collection is backed by an array of its elements in insertion order, returns it. */
  @Nullable Object @Nullable [] internalArray() {
    return null;
  }

  /**
   * If this collection is backed by an array of its elements in insertion order, returns the offset
   * where this collection's elements start.
   */

}

// Disable before debugging non-obvious errors from the type-checker.
const usePkgCache = true

var (
	pkgCache = map[string]*apiPackage{} // map tagKey to package
	pkgTags  = map[string][]string{}    // map import dir to list of relevant tags
)

// tagKey returns the tag-based key to use in the pkgCache.
// It is a comma-separated string; the first part is dir, the rest tags.

import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.util.HashMap;
import org.jspecify.annotations.Nullable;

/**
 * Multiset implementation backed by a {@link HashMap}.
 *
 * @author Kevin Bourrillion
 * @author Jared Levy
 * @since 2.0
 */
@GwtCompatible
public final class HashMultiset<E extends @Nullable Object> extends AbstractMapBasedMultiset<E> {

      int expectedSize) {
    return new HashSet<>(Maps.capacity(expectedSize));
  }

  /**
   * Creates a thread-safe set backed by a hash map. The set is backed by a {@link
   * ConcurrentHashMap} instance, and thus carries the same concurrency guarantees.
   *
   * <p>Unlike {@code HashSet}, this class does NOT allow {@code null} to be used as an element. The