func ParseNodeAffinityLabels()

in cli_tools/common/utils/compute/node_affinity_label_parser.go [29:71]
40 lines of code
9 McCabe index (conditional complexity)

func ParseNodeAffinityLabels(labels []string) ([]*compute.SchedulingNodeAffinity, []*computeBeta.SchedulingNodeAffinity, error) {
	var nodeAffinities []*compute.SchedulingNodeAffinity
	var nodeAffinitiesBeta []*computeBeta.SchedulingNodeAffinity

	for _, label := range labels {
		labelParts := strings.Split(label, ",")
		if len(labelParts) < 3 {
			return nil, nil, daisy.Errf(
				"node affinity label `%v` should be of <key>,<operator>,<values> format", label)
		}
		key := strings.TrimSpace(labelParts[0])
		if key == "" {
			return nil, nil, daisy.Errf("affinity label key cannot be empty")
		}
		operator := strings.TrimSpace(labelParts[1])
		if operator != "IN" && operator != "NOT_IN" && operator != "OPERATOR_UNSPECIFIED" {
			return nil, nil, daisy.Errf(
				"node affinity label operator should be one of: `IN`, `NOT_IN` or `OPERATOR_UNSPECIFIED`, but instead received `%v`",
				operator,
			)
		}

		values := labelParts[2:]
		for i, value := range values {
			values[i] = strings.TrimSpace(value)
			if values[i] == "" {
				return nil, nil, daisy.Errf("affinity label value cannot be empty")
			}
		}
		nodeAffinities = append(nodeAffinities, &compute.SchedulingNodeAffinity{
			Key:      key,
			Operator: operator,
			Values:   values,
		})
		nodeAffinitiesBeta = append(nodeAffinitiesBeta, &computeBeta.SchedulingNodeAffinity{
			Key:      key,
			Operator: operator,
			Values:   values,
		})

	}
	return nodeAffinities, nodeAffinitiesBeta, nil
}