}

    private byte[] createMockBuffer(byte infoLevel) {
        switch (infoLevel) {
        case FileInformation.FILE_BASIC_INFO:
            return createMockFileBasicInfoBuffer();
        case FileInformation.FILE_STANDARD_INFO:
            return createMockFileStandardInfoBuffer();
        case FileInformation.FILE_INTERNAL_INFO:
            return createMockFileInternalInfoBuffer();
        default:

    /**
     * Map containing registered data store instances indexed by their names and class simple names.
     * All keys are stored in lowercase for case-insensitive lookup.
     */
    protected Map<String, DataStore> dataStoreMap = new LinkedHashMap<>();

    /**
     * Cached array of available data store names discovered from plugin JAR files.

        when(creds.isAnonymous()).thenReturn(false);

        // Case 1: share is IPC$ -> IPC
        SmbResourceLocatorImpl ipc = locator("smb://server/IPC$/");
        assertTrue(ipc.shouldForceSigning());

        // Case 2: config disabled
        when(config.isIpcSigningEnforced()).thenReturn(false);
        assertFalse(ipc.shouldForceSigning());

        // Case 3: anonymous credentials

    public Nature getNature() {
        if (metadata instanceof RepositoryMetadata repositoryMetadata) {
            return switch (repositoryMetadata.getNature()) {
                case RepositoryMetadata.RELEASE_OR_SNAPSHOT -> Nature.RELEASE_OR_SNAPSHOT;
                case RepositoryMetadata.SNAPSHOT -> Nature.SNAPSHOT;
                default -> Nature.RELEASE;
            };
        } else {
            return Nature.RELEASE;
        }

# sequenceMap: (NotRequired - Default map:{})
# 
# The relation mappings between sequence and table.
# If you don't specify the mappings, you cannot insert a record of the table by sequence. 
# The table names are treated as case insensitive.
# 
# Example:
# map:{
#     ; PURCHASE     = SEQ_PURCHASE
#     ; MEMBER       = SEQ_MEMBER
#     ; MEMBER_LOGIN = SEQ_MEMBER_LOGIN
#     ; PRODUCT      = SEQ_PRODUCT
# }
#

 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.common.collect;

import static com.google.common.base.Preconditions.checkArgument;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.collect.CollectPreconditions.checkNonnegative;
import static com.google.common.math.IntMath.sqrt;
import static java.lang.Math.max;

</p>

<pre>
switch tag {
default: s3()
case 0, 1, 2, 3: s1()
case 4, 5, 6, 7: s2()
}

switch x := f(); {  // missing switch expression means "true"
case x &lt; 0: return -x
default: return x
}

switch {
case x &lt; y: f1()
case x &lt; z: f2()
case x == 4: f3()
}
</pre>

<p>

   * is precisely representable as a {@code double}, its {@code double} value will be returned;
   * otherwise, the rounding will choose between the two nearest representable values with {@code
   * mode}.
   *
   * <p>For the case of {@link RoundingMode#HALF_DOWN}, {@code HALF_UP}, and {@code HALF_EVEN},
   * infinite {@code double} values are considered infinitely far away. For example, 2^2000 is not

		POLICY_INFO_ACCOUNT_DOMAIN = 5,
		POLICY_INFO_SERVER_ROLE    = 6,
		POLICY_INFO_MODIFICATION   = 9,
		POLICY_INFO_DNS_DOMAIN     = 12
	};

	typedef [switch_type(short)] union {
		[case(POLICY_INFO_ACCOUNT_DOMAIN)] LsarDomainInfo account_domain;
		[case(POLICY_INFO_DNS_DOMAIN)] LsarDnsDomainInfo dns_domain;
	} LsarPolicyInfo;

	typedef struct {
		sid_t *sid;
	} LsarSidPtr;

	typedef struct {
		[range(0,1000)] uint32_t num_sids;

		POLICY_INFO_ACCOUNT_DOMAIN = 5,
		POLICY_INFO_SERVER_ROLE    = 6,
		POLICY_INFO_MODIFICATION   = 9,
		POLICY_INFO_DNS_DOMAIN     = 12
	};

	typedef [switch_type(short)] union {
		[case(POLICY_INFO_ACCOUNT_DOMAIN)] LsarDomainInfo account_domain;
		[case(POLICY_INFO_DNS_DOMAIN)] LsarDnsDomainInfo dns_domain;
	} LsarPolicyInfo;

	typedef struct {
		sid_t *sid;
	} LsarSidPtr;

	typedef struct {
		[range(0,1000)] uint32_t num_sids;