* allowed to be reclaimed if nobody is holding on to them. This is useful, for example, if one
 * wants to create a {@code Striped<Lock>} of many locks, but worries that in most cases only a
 * small portion of these would be in use.
 *
 * <p>Prior to this class, one might be tempted to use {@code Map<K, Lock>}, where {@code K}

		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;

		parser := NewParser(ctxt, arch, tokenizer)

		err := tryParse(t, func() {
			parser.Parse()
		})

		switch {
		case err == nil:
			t.Errorf("#%d: %q: want error %q; have none", i, test.input, test.error)
		case !strings.Contains(err.Error(), test.error):
			t.Errorf("#%d: %q: want error %q; have %q", i, test.input, test.error, err)
		}
	}

		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;

    # /- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    # o isTableNameCamelCase: (NotRequired - Default false)
    #  Is the table name camel case?
    #  Basically you don't need this if the style of table name is like 'FOO_STATUS'.
    #    [true]
    #      The table name is camel case.
    #      e.g. If the table name is 'OrderDetail', the class name is 'OrderDetail'.
    #
    #    [false]

                String pos = null;
                switch (values.length) {
                case 4:
                    pos = values[3];
                case 3:
                    reading = values[2];
                case 2:
                    segmentation = values[1];
                case 1:
                    token = values[0];
                default:
                    break;
                }

  /**
   * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it
   * also becomes a successor. Associates {@code value} with the edge connecting the two nodes.
   */
  void addPredecessor(N node, V value);

  /**
   * Add {@code node} as a successor to the origin node. In the case of an undirected graph, it also

	hstats.totalS3Requests.Inc(api)
	code := w.StatusCode

	switch {
	case code == 0:
	case code == 499:
		// 499 is a good error, shall be counted as canceled.
		hstats.totalS3Canceled.Inc(api)
	case code >= http.StatusBadRequest:
		if code >= http.StatusInternalServerError {
			hstats.totalS35xxErrors.Inc(api)
		} else {

		if err != nil {
			switch err.(type) {
			case ObjectNotFound, BucketNotFound:
				r, err = store.GetObjectNInfo(ctx, dataUsageBucket, name, nil, http.Header{}, ObjectOptions{NoLock: true})
				if err != nil {
					switch err.(type) {
					case ObjectNotFound, BucketNotFound:
						return false, nil
					case InsufficientReadQuorum, StorageErr:
						return true, nil
					}

		switch {
		case !ok:
			// Cgroup did not contain a container ID.
			continue
		case containerID == "":
			// This is the first container ID found so far.
			podUID = candidatePodUID
			containerID = candidateContainerID
		case containerID != candidateContainerID:
			// More than one container ID found in the cgroups.