RangeMap<Integer, Integer> copy = TreeRangeMap.copyOf(rangeMap);

    assertEquals(rangeMap.asMapOfRanges(), copy.asMapOfRanges());
  }

  // Overriding testEquals because it seems that we get spurious failures when it things empty
  // should be unequal to empty.
  public void testEquals() {
    TreeRangeMap<Integer, Integer> empty = TreeRangeMap.create();

    // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure
    // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it.

    if (graph.isDirected()) {
      // Note: works for both directed and undirected graphs, but we only use in the directed case.
      for (N node : graph.nodes()) {

    // Every node is, at a minimum, reachable from itself. Since the resulting transitive closure
    // will have no isolated nodes, we can skip adding nodes explicitly and let putEdge() do it.

    if (graph.isDirected()) {
      // Note: works for both directed and undirected graphs, but we only use in the directed case.
      for (N node : graph.nodes()) {

// This file is part of MinIO Object Storage stack
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of

        }

        infoMap = null;
    }

    /**
     * Adds a key-value pair to the information map.
     * Initializes the info map as a synchronized LinkedHashMap if it doesn't exist.
     *
     * @param key the parameter key to store
     * @param value the parameter value to store
     */
    public synchronized void putToInfoMap(final String key, final String value) {

                values[values.length - 1] = value;
                dataMap.put(key, values);
            }
        }
    }

    /**
     * Puts data into the result data map after processing it through a template script.
     * The template is evaluated using the specified script engine with the value and context.
     *
     * @param dataMap the data map to modify

        queryContext.setQueryBuilder(initialQuery);

        queryContext.addQuery(boolQuery -> {
            // Don't add any clauses
        });

        // When no clauses are added to a non-MatchAllQuery, it still wraps in BoolQuery
        QueryBuilder result = queryContext.getQueryBuilder();
        assertTrue(result instanceof BoolQueryBuilder);
        BoolQueryBuilder boolResult = (BoolQueryBuilder) result;

        // Test that inherited properties are accessible

        // Test dataCount property - using public method
        response.setDataCount(100);
        // Note: getDataCount() is protected, so we can't test it directly

        // Test subCommand property
        assertEquals(SmbComTransaction.TRANS2_SET_FILE_INFORMATION, response.getSubCommand());

        // Test status property - getStatus() is public

        // Test negative values - should throw NullPointerException in private method via BigInteger.valueOf
        try {
            MemoryUtil.byteCountToDisplaySize(-1L);
            // If no exception, verify it handles negative as expected
        } catch (Exception e) {
            // Expected for negative values
        }

        // Test boundary values

      TestCharSource okSource = new TestCharSource(STRING);
      assertThrows(IOException.class, () -> okSource.copyTo(new TestCharSink(option)));
      // ensure reader was closed IF it was opened (depends on implementation whether or not it's
      // opened at all if sink.newWriter() throws).
      assertTrue(
          "stream not closed when copying to sink with option: " + option,