return arguments != null;
    }

    @SuppressWarnings("unchecked")
    @Override
    public <T> Class<T> getRawClass() {
        return (Class<T>) rawClass;
    }

    /**
     * Sets the raw class.
     *
     * @param rawClass
     *            The raw class. Must not be {@literal null}.
     */
    public void setRawClass(final Class<?> rawClass) {
        assertArgumentNotNull("rawClass", rawClass);

 */
@GwtCompatible
@NullMarked
public class RegularImmutableAsListTest extends TestCase {
  /**
   * RegularImmutableAsList should assume its input is null-free without checking, because it only
   * gets invoked from other immutable collections.
   */
  public void testDoesntCheckForNull() {
    ImmutableSet<Integer> set = ImmutableSet.of(1, 2, 3);
    ImmutableList<Integer> unused =

            cachedPathMappingList = new ArrayList<>();
        } catch (final Exception e) {
            logger.warn("Failed to load path mappings.", e);
        }
        return 0;
    }

    /**
     * Gets the list of process types.
     *
     * @return the list of process types
     */
    protected List<String> getProcessTypeList() {
        final List<String> ptList = new ArrayList<>();

@Experimental
public interface DependencyResolverResult extends Result<DependencyResolverRequest> {

    /**
     * Gets the exceptions that occurred while building the dependency graph.
     *
     * @return the exceptions that occurred, never {@code null}
     */
    @Nonnull
    List<Exception> getExceptions();

    /**
     * Gets the root node of the dependency graph.
     *

        }

        /**
         * Sets the text content of the XML node.
         *
         * @param value the text content of the XML node
         * @return this builder instance
         */
        public Builder value(String value) {
            this.value = value;
            return this;
        }

        /**
         * Sets the namespace URI of the XML node.
         *

MinIO divides the drives you provide into erasure-coding sets of *2 to 16* drives.  Therefore, the number of drives you present must be a multiple of one of these numbers.  Each object is written to a single erasure-coding set.

package jcifs;

/**
 * Internal API for managing reusable buffers
 *
 * @author mbechler
 *
 * <p>This interface is intended for internal use.</p>
 */
public interface BufferCache {

    /**
     * Gets a buffer from the cache or creates a new one if the cache is empty.
     *
     * @return a buffer from the cache, or a new one
     */
    byte[] getBuffer();

    /**
     * Return a buffer to the cache
     *

    /** The plexus role for this component. */
    String ROLE = ConflictResolverFactory.class.getName();

    // methods ----------------------------------------------------------------

    /**
     * Gets a conflict resolver of the specified type.
     *
     * @param type the type of conflict resolver to obtain
     * @return the conflict resolver
     * @throws ConflictResolverNotFoundException

 */
@Deprecated(since = "4.0.0")
public interface Toolchain {

    /**
     * get the type of toolchain.
     *
     * @return the toolchain type
     */
    String getType();

    /**
     * Gets the platform tool executable.
     *
     * @param toolName the tool platform independent tool name.
     * @return file representing the tool executable, or null if the tool can not be found
     */

        N nodeU = edge.nodeU();
        N nodeV = edge.nodeV();
        Set<EndpointPair<N>> endpointPairIncidentEdges =
            Sets.union(incidentEdges(nodeU), incidentEdges(nodeV));
        return nodePairInvalidatableSet(
            Sets.difference(endpointPairIncidentEdges, ImmutableSet.of(edge)), nodeU, nodeV);
      }

      @Override