*
 * @param <B> The concrete type of this builder (the 'self-type'). All the Builder methods of this
 *     class (such as {@link #named}) return this type, so that Builder methods of more derived
 *     classes can be chained onto them without casting.
 * @param <G> The type of the generator to be passed to testers in the generated test suite. An
 *     instance of G should somehow provide an instance of the class under test, plus any other

import java.util.WeakHashMap;
import java.util.concurrent.ConcurrentHashMap;

/**
 * Utility class for easily creating and setting values in {@link Map} instances.
 * <p>
 * By statically importing this class, you can easily initialize {@literal Map} instances as follows:
 * </p>
 *
 * <pre>
 * import static org.codelibs.core.collection.Maps.*;
 *
 * Map&lt;String, Integer&gt; map = map("a", 1).$("b", 2).$("c", 3).$();
 * </pre>

        }, "Should throw IOException for an unknown protocol.");
    }

    @Test
    void testSetURLStreamHandlerFactory_SuccessFirstTime() {
        // This test verifies that a URLStreamHandlerFactory can be successfully set.
        URLStreamHandlerFactory mockFactory = mock(URLStreamHandlerFactory.class);
        assertDoesNotThrow(() -> Handler.setURLStreamHandlerFactory(mockFactory),

// Copyright (c) 2015-2021 MinIO, Inc.
//
// 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

//go:build linux
// +build linux

// Copyright (c) 2015-2021 MinIO, Inc.
//
// 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.
//

/*
 * © 2025 CodeLibs, Inc.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of

// Copyright (c) 2015-2024 MinIO, Inc.
//
// 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

    // are extracted to a separate file, and merged into the IDE-specific
    // Checkstyle config.
    Node xmlFragment = parseXml(checkstyleIdeFragment)

    // Edit the copy so that IntelliJ can copy with it
    modifyXml(checkstyleIdeConfig, { xml ->
      // Add all the nodes from the fragment file
      Node treeWalker = xml.module.find { it.'@name' == 'TreeWalker' }

 *
 * <h3>Relationship to {@code Ordering}</h3>
 *
 * <p>In light of the significant enhancements to {@code Comparator} in Java 8, the overwhelming
 * majority of usages of {@code Ordering} can be written using only built-in JDK APIs. This class is
 * intended to "fill the gap" and provide those features of {@code Ordering} not already provided by
 * the JDK.
 *
 * @since 21.0
 * @author Louis Wasserman
 */

// Copyright (c) 2015-2022 MinIO, Inc.
//
// 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