* limitations under the License.
 */

/**
 * An API for representing graph (node and edge) data. It is analogous to the Java Collections
 * Framework APIs for lists, maps, sets, etc.
 *
 * <p>This package is a part of the open-source <a href="https://github.com/google/guava">Guava</a>
 * library.
 */
@CheckReturnValue
@NullMarked
package com.google.common.graph;

import com.google.errorprone.annotations.CheckReturnValue;

//go:build freebsd || openbsd || netbsd
// +build freebsd openbsd netbsd

// 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.
//

// 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-2023 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.
//

        String encodedFieldName = BaseEncoding.base64().encode(originalFieldName.getBytes(StandardCharsets.UTF_8));
        String fullFieldName = Constants.FACET_FIELD_PREFIX + encodedFieldName;

        // Extract the encoded part
        String extractedEncoded = fullFieldName.substring(Constants.FACET_FIELD_PREFIX.length());
        assertEquals(encodedFieldName, extractedEncoded);

        // Decode back to original

    signifFloor &= SIGNIFICAND_MASK; // remove the implied bit

    /*
     * We round up if either the fractional part of signif is strictly greater than 0.5 (which is
     * true if the 0.5 bit is set and any lower bit is set), or if the fractional part of signif is
     * >= 0.5 and signifFloor is odd (which is true if both the 0.5 bit and the 1 bit are set).
     */
    boolean increment =

 * limitations under the License.
 */

package com.google.common.collect.testing;

import org.jspecify.annotations.Nullable;
import org.junit.Ignore;

/** Support class added to a suite as part of {@link FeatureSpecificTestSuiteBuilderTest}. */
/*
 * @Ignore affects the Android test runner (and only the Android test runner): It respects JUnit 4
 * annotations even on JUnit 3 tests.
 *

                return null;
            }
            String[] array = className.split("\\.");
            return array.length > 0 ? decapitalizeName(array[array.length - 1]) : null;
        }

        // Not part of interface
        public String fromComponentNameToClassName(String componentName) {
            if (componentName == null) {
                return null;
            }
            return capitalizeName(componentName);

//go:build unix && !darwin && !freebsd

// 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.
//

          the Derivative Works; and

      (d) If the Work includes a "NOTICE" text file as part of its
          distribution, then any Derivative Works that You distribute must
          include a readable copy of the attribution notices contained
          within such NOTICE file, excluding those notices that do not
          pertain to any part of the Derivative Works, in at least one