*/
    protected Proxy proxy;

    /**
     * The character encoding for the request.
     */
    protected String encoding = "UTF-8";

    /**
     * The threshold size for the request body.
     */
    protected int threshold = 1024 * 1024; // 1MB

    /**
     * The HTTP method for the request.
     */
    protected Method method;

    /**

   * size.
   *
   * @param chunkSize the number of bytes available per {@link #process(ByteBuffer)} invocation;
   *     must be at least 4
   */
  protected AbstractStreamingHasher(int chunkSize) {
    this(chunkSize, chunkSize);
  }

  /**
   * Constructor for use by subclasses. This hasher instance will process chunks of the specified

     * If not set or invalid, returns the default page size.
     *
     * @return the page size
     */
    public int getPageSize() {
        if (pageSize <= 0) {
            pageSize = getDefaultPageSize();
        }
        return pageSize;
    }

    /**
     * Sets the number of records per page.
     *
     * @param pageSize the page size
     */
    public void setPageSize(final int pageSize) {

        Map<String, Object> responseDataMap = new HashMap<>();
        responseDataMap.put("b", "B1");

        indexUpdateCallback.mergeResponseData(dataMap, responseDataMap);

        assertEquals(2, dataMap.size());
        assertEquals("A0", dataMap.get("a"));
        assertEquals("B1", dataMap.get("b"));
    }

    /** Case 2: Key conflict (without .overwrite) → Overwrite with value from responseDataMap */

   */

  /**
   * Contains the link pointers corresponding with the entries, in the range of [0, size()). The
   * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
   * (pointing to the nextEntry entry in the linked list). The pointers in [size(), entries.length)
   * are all "null" (UNSET).
   *

        map = new CaseInsensitiveMap<>(initialCapacity);
    }

    @Override
    public Iterator<String> iterator() {
        return map.keySet().iterator();
    }

    @Override
    public int size() {
        return map.size();
    }

    @Override
    public boolean isEmpty() {
        return map.isEmpty();
    }

    @Override
    public boolean contains(final Object o) {
        return map.containsKey(o);

        assertNotSame(collector1, collector2);
        assertEquals(0, collector1.getProblems().size());
        assertEquals(1, collector2.getProblems().size());
    }

    @Test
    void testAddProblem() {
        ProblemCollector collector = ProblemCollectorFactory.newInstance(null);
        collector.setSource("pom.xml");

        assertNotNull(queryFieldConfig.apiResponseFieldSet);
        assertTrue(queryFieldConfig.apiResponseFieldSet.size() > 0);

        // Verify not analyzed field set is initialized
        assertNotNull(queryFieldConfig.notAnalyzedFieldSet);
        assertTrue(queryFieldConfig.notAnalyzedFieldSet.size() > 0);
    }

    public void test_init_withExistingFields() {
        // Set existing fields before initialization

      builder.put(key, list);
      size += list.size();
    }

    return new ImmutableListMultimap<>(builder.buildOrThrow(), size);
  }

  ImmutableListMultimap(ImmutableMap<K, ImmutableList<V>> map, int size) {
    super(map, size);
  }

  // views

  /**

   * which is given by {@code keySet().size()} or {@code asMap().size()}. See the opening section of
   * the {@link Multimap} class documentation for clarification.
   */
  int size();

  /**
   * Returns {@code true} if this multimap contains no key-value pairs. Equivalent to {@code size()
   * == 0}, but can in some cases be more efficient.
   */
  boolean isEmpty();