keepsorted/options.go

// Copyright 2023 Google LLC
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

package keepsorted

import (
	"cmp"
	"errors"
	"fmt"
	"iter"
	"maps"
	"math/big"
	"reflect"
	"regexp"
	"slices"
	"strconv"
	"strings"
	"unicode"

	yaml "gopkg.in/yaml.v3"
)

// IntOrBool can be unmarshaled from a boolean or an integer value.
// true is unmarshaled as 1, false as 0.
type IntOrBool int

type ByRegexOption struct {
	Pattern  *regexp.Regexp
	Template *string
}

type BlockOptions struct {
	opts blockOptions
}

func DefaultBlockOptions() BlockOptions {
	return BlockOptions{defaultOptions}
}

func ParseBlockOptions(options string) (BlockOptions, error) {
	opts, warns := parseBlockOptions( /*commentMarker=*/ "", options, blockOptions{})
	if err := errors.Join(warns...); err != nil {
		return BlockOptions{}, err
	}
	return BlockOptions{opts}, nil
}

func (opts BlockOptions) String() string {
	return opts.opts.String()
}

// blockOptions enable/disable extra features that control how a block of lines is sorted.
//
// Options support the following types:
//   - bool:             key=yes, key=true, key=no, key=false
//   - []string:         key=a,b,c,d
//   - map[string]bool:  key=a,b,c,d
//   - int:              key=123
//   - ByRegexOptions    key=a,b,c,d, key=[yaml_list]
type blockOptions struct {
	// AllowYAMLLists determines whether list.set valued options are allowed to be specified by YAML.
	AllowYAMLLists bool `key:"allow_yaml_lists"`

	///////////////////////////
	//  Pre-sorting options  //
	///////////////////////////

	// SkipLines is the number of lines to ignore before sorting.
	SkipLines int `key:"skip_lines"`
	// Group determines whether we group lines together based on increasing indentation.
	Group bool
	// GroupPrefixes tells us about other types of lines that should be added to a group.
	GroupPrefixes map[string]bool `key:"group_prefixes"`
	// Block opts us into a more complicated algorithm to try and understand blocks of code.
	Block bool
	// StickyComments tells us to attach comments to the line immediately below them while sorting.
	StickyComments bool `key:"sticky_comments"`
	// StickyPrefixes tells us about other types of lines that should behave as sticky comments.
	StickyPrefixes map[string]bool `key:"sticky_prefixes"`

	///////////////////////
	//  Sorting options  //
	///////////////////////

	// CaseSensitive is whether we're case sensitive while sorting.
	CaseSensitive bool `key:"case"`
	// Numeric indicates that the contents should be sorted like numbers.
	Numeric bool
	// PrefixOrder allows the user to explicitly order lines based on their matching prefix.
	PrefixOrder []string `key:"prefix_order"`
	// IgnorePrefixes is a slice of prefixes that we do not consider when sorting lines.
	IgnorePrefixes []string `key:"ignore_prefixes"`
	// ByRegex is a slice of regexes that are used to extract the pieces of the line group that keep-sorted should sort by.
	ByRegex []ByRegexOption `key:"by_regex"`

	////////////////////////////
	//  Post-sorting options  //
	////////////////////////////

	// NewlineSeparated indicates that the groups should be separated with newlines.
	// User can specify either an integer, or a boolean (to be backward compatible).
	// 'no' or '0', it means no newlines should be added;
	// 'yes' or '1', it means one newline should be added;
	// Any other positive integer specifies the number of newlines to separate the groups.
	NewlineSeparated IntOrBool `key:"newline_separated"`
	// RemoveDuplicates determines whether we drop lines that are an exact duplicate.
	RemoveDuplicates bool `key:"remove_duplicates"`

	// Syntax used to start a comment for keep-sorted annotation, e.g. "//".
	commentMarker string
}

var (
	defaultOptions = blockOptions{
		AllowYAMLLists:   true,
		Group:            true,
		StickyComments:   true,
		StickyPrefixes:   nil, // Will be populated with the comment marker of the start directive.
		CaseSensitive:    true,
		RemoveDuplicates: true,
	}

	fieldIndexByKey map[string]int
)

func init() {
	fieldIndexByKey = make(map[string]int)
	typ := reflect.TypeFor[blockOptions]()
	for i := 0; i < typ.NumField(); i++ {
		field := typ.Field(i)
		if !field.IsExported() {
			continue
		}
		key := key(field)
		if !keyRegex.MatchString(key + "=") {
			panic(fmt.Errorf("key %q for blockOptions.%s would not be matched by parser (regex: %v)", key, field.Name, keyRegex))
		}
		fieldIndexByKey[key] = i
	}
}

func key(f reflect.StructField) string {
	key := strings.ToLower(f.Name)
	if k, ok := f.Tag.Lookup("key"); ok {
		key = k
	}
	return key
}

func parseBlockOptions(commentMarker, options string, defaults blockOptions) (_ blockOptions, warnings []error) {
	ret := defaults
	opts := reflect.ValueOf(&ret).Elem()
	var warns []error
	parser := newParser(options)
	for {
		parser.allowYAMLLists = ret.AllowYAMLLists
		key, ok := parser.popKey()
		if !ok {
			break
		}
		fieldIdx, ok := fieldIndexByKey[key]
		if !ok {
			warns = append(warns, fmt.Errorf("unrecognized option %q", key))
			continue
		}

		field := opts.Field(fieldIdx)
		val, err := parser.popValue(field.Type())
		if err != nil {
			warns = append(warns, fmt.Errorf("while parsing option %q: %w", key, err))
			continue
		}
		field.Set(val)
	}

	if cm := guessCommentMarker(commentMarker); cm != "" {
		ret.setCommentMarker(cm)
	}
	// Look at longer prefixes first, in case one of these prefixes is a prefix of another.
	longestFirst := comparing(func(s string) int { return len(s) }).reversed()
	slices.SortFunc(ret.IgnorePrefixes, longestFirst)

	if warn := validate(&ret); len(warn) > 0 {
		warns = append(warns, warn...)
	}

	return ret, warns
}

func formatValue(val reflect.Value) (string, error) {
	switch val.Type() {
	case reflect.TypeFor[bool]():
		return boolString[val.Bool()], nil
	case reflect.TypeFor[[]string]():
		return formatList(val.Interface().([]string))
	case reflect.TypeFor[map[string]bool]():
		return formatList(slices.Sorted(maps.Keys(val.Interface().(map[string]bool))))
	case reflect.TypeFor[IntOrBool]():
		return strconv.Itoa(int(val.Int())), nil
	case reflect.TypeFor[int]():
		return strconv.Itoa(int(val.Int())), nil
	case reflect.TypeFor[[]ByRegexOption]():
		opts := val.Interface().([]ByRegexOption)
		vals := make([]string, 0, len(opts))
		seenTemplate := false
		for _, opt := range opts {
			if opt.Template != nil {
				seenTemplate = true
				vals = append(vals, fmt.Sprintf(`%q: %q`, opt.Pattern.String(), *opt.Template))
				continue
			}
			vals = append(vals, opt.Pattern.String())
		}
		if seenTemplate {
			// always presented as a yaml sequence to preserve any `k:v` items
			return fmt.Sprintf("[%s]", strings.Join(vals, ", ")), nil
		}
		return formatList(vals)
	}

	panic(fmt.Errorf("unsupported blockOptions type: %v", val.Type()))
}

func formatList(vals []string) (string, error) {
	var specialChars bool
	if len(vals) > 0 && strings.HasPrefix(vals[0], "[") {
		specialChars = true
	} else {
		for _, val := range vals {
			if strings.ContainsAny(val, ", ") {
				specialChars = true
				break
			}
		}
	}

	if !specialChars {
		return strings.Join(vals, ","), nil
	}

	node := new(yaml.Node)
	if err := node.Encode(vals); err != nil {
		return "", fmt.Errorf("while converting list to YAML: %w", err)
	}
	node.Style |= yaml.FlowStyle
	out, err := yaml.Marshal(node)
	if err != nil {
		return "", fmt.Errorf("while formatting YAML: %w", err)
	}
	return strings.TrimSpace(string(out)), nil
}

func guessCommentMarker(startLine string) string {
	startLine = strings.TrimSpace(startLine)
	for _, marker := range []string{"//", "#", "/*", "--", ";", "<!--"} {
		if strings.HasPrefix(startLine, marker) {
			return marker
		}
	}
	return ""
}

func (opts *blockOptions) setCommentMarker(marker string) {
	opts.commentMarker = marker
	if opts.StickyComments {
		if opts.StickyPrefixes == nil {
			opts.StickyPrefixes = make(map[string]bool)
		}
		opts.StickyPrefixes[marker] = true
	}
}

func validate(opts *blockOptions) (warnings []error) {
	var warns []error
	if opts.SkipLines < 0 {
		warns = append(warns, fmt.Errorf("skip_lines has invalid value: %v", opts.SkipLines))
		opts.SkipLines = 0
	}

	if opts.NewlineSeparated < 0 {
		warns = append(warns, fmt.Errorf("newline_separated has invalid value: %v", opts.NewlineSeparated))
		opts.NewlineSeparated = 0
	}

	if opts.GroupPrefixes != nil && !opts.Group {
		warns = append(warns, fmt.Errorf("group_prefixes may not be used with group=no"))
		opts.GroupPrefixes = nil
	}

	if len(opts.ByRegex) > 0 && len(opts.IgnorePrefixes) > 0 {
		var pre []string
		for _, p := range opts.IgnorePrefixes {
			pre = append(pre, regexp.QuoteMeta(p))
		}
		suggestion := "(?:" + strings.Join(pre, "|") + ")"
		warns = append(warns, fmt.Errorf("by_regex cannot be used with ignore_prefixes (consider adding a non-capturing group to the start of your regex instead of ignore_prefixes: %q)", suggestion))
		opts.IgnorePrefixes = nil
	}

	return warns
}

func (opts blockOptions) String() string {
	var s []string
	val := reflect.ValueOf(opts)
	var errs []error
	for _, key := range slices.Sorted(maps.Keys(fieldIndexByKey)) {
		field := val.Type().Field(fieldIndexByKey[key])
		fieldVal := val.FieldByIndex(field.Index)
		if fieldVal.IsZero() {
			continue
		}
		val, err := formatValue(fieldVal)
		if err != nil {
			errs = append(errs, err)
		} else {
			s = append(s, fmt.Sprintf("%s=%s", key, val))
		}
	}

	if err := errors.Join(errs...); err != nil {
		panic(err)
	}

	return strings.Join(s, " ")
}

// hasPrefix returns the first prefix that s starts with.
func (opts blockOptions) hasPrefix(s string, prefixes iter.Seq[string]) (string, bool) {
	p, _, ok := opts.cutFirstPrefix(s, prefixes)
	return p, ok
}

// cutFirstPrefix finds the first prefix that s starts with and returns both the prefix and s without the prefix.
// If s does not start with any prefix, returns "", s, false.
func (opts blockOptions) cutFirstPrefix(s string, prefixes iter.Seq[string]) (pre string, after string, ok bool) {
	// Don't modify s since we want to return it exactly if it doesn't start with
	// any of the prefixes.
	t := strings.TrimLeftFunc(s, unicode.IsSpace)
	if !opts.CaseSensitive {
		t = strings.ToLower(t)
	}
	for p := range prefixes {
		q := p
		if !opts.CaseSensitive {
			// Ditto: Don't modify the prefix since we'll want to return it exactly.
			q = strings.ToLower(p)
		}
		if strings.HasPrefix(t, q) {
			after = s
			// Remove leading whitepace (t already has its leading whitespace removed).
			after = strings.TrimLeftFunc(after, unicode.IsSpace)
			// Remove the prefix.
			after = after[len(p):]
			// Check again for leading whitespace.
			after = strings.TrimLeftFunc(after, unicode.IsSpace)
			return p, after, true
		}
	}
	return "", s, false
}

// hasStickyPrefix determines if s has one of the StickyPrefixes.
func (opts blockOptions) hasStickyPrefix(s string) bool {
	_, ok := opts.hasPrefix(s, maps.Keys(opts.StickyPrefixes))
	return ok
}

// hasGroupPrefix determines if s has one of the GroupPrefixes.
func (opts blockOptions) hasGroupPrefix(s string) bool {
	_, ok := opts.hasPrefix(s, maps.Keys(opts.GroupPrefixes))
	return ok
}

// trimIgnorePrefix removes the first matching IgnorePrefixes from s, if s
// matches one of the IgnorePrefixes.
func (opts blockOptions) trimIgnorePrefix(s string) string {
	_, s, _ = opts.cutFirstPrefix(s, slices.Values(opts.IgnorePrefixes))
	return s
}

// matchRegexes applies ByRegex to s.
// If ByRegex is empty, returns a slice that contains just s.
// Otherwise, applies each regex to s in sequence:
// If a regex has capturing groups, the capturing groups will be added to the
// resulting slice.
// If a regex does not have capturing groups, all matched text will be added to
// the resulting slice.
func (opts blockOptions) matchRegexes(s string) []regexMatch {
	if len(opts.ByRegex) == 0 {
		return []regexMatch{{s}}
	}

	var ret []regexMatch
	for _, p := range opts.ByRegex {
		regex := p.Pattern

		if p.Template != nil {
			var result []byte
			m := regex.FindAllStringSubmatchIndex(s, -1)
			if m == nil {
				ret = append(ret, regexDidNotMatch)
				continue
			}
			for _, submatches := range m {
				result = regex.ExpandString(result, *p.Template, s, submatches)
			}
			ret = append(ret, regexMatch{string(result)})
			continue
		}

		m := regex.FindStringSubmatch(s)
		if m == nil {
			ret = append(ret, regexDidNotMatch)
			continue
		}
		if len(m) == 1 {
			// No capturing groups. Consider all matched text.
			ret = append(ret, m)
		} else {
			// At least one capturing group. Only consider the capturing groups.
			ret = append(ret, m[1:])
		}
	}
	return ret
}

// regexMatch is the result of matching a regex to a string. It has 3 forms:
//  1. If the regex matched and the regex had capturing groups, it's the value
//     of those capturing groups.
//  2. If the regex matched and the regex didn't have capturing groups, it's the
//     value of the matched string as a singleton slice.
//  3. If the regex didn't match, it's regexDidNotMatch / nil.
type regexMatch []string

var regexDidNotMatch regexMatch = nil

func compareRegexMatches(fn cmpFunc[[]string]) cmpFunc[[]regexMatch] {
	alwaysLast := comparingFunc(func(t regexMatch) bool { return t == nil }, falseFirst())
	delegate := comparingFunc(func(t regexMatch) []string { return t }, fn)
	return lexicographically(alwaysLast.andThen(delegate))
}

var (
	mixedNumberPattern = regexp.MustCompile(`([0-9]+)|([^0-9]+)`)
)

// maybeParseNumeric handles the Numeric option.
//
// If Numeric is true, the string will be parsed into subsequences of strings and numeric values.
// If Numeric is false, the result will just be a single token of the unchanged string.
func (opts blockOptions) maybeParseNumeric(s string) numericTokens {
	if !opts.Numeric {
		return numericTokens{[]string{s}, nil}
	}

	var t numericTokens
	m := mixedNumberPattern.FindAllStringSubmatch(s, -1)
	for _, sm := range m {
		if sm[1] != "" { // Numeric token
			if t.len() == 0 {
				// Make sure numericTokens "starts" with a string.
				// See the comment on numericTokens for more details.
				t.s = append(t.s, "")
			}
			i := new(big.Int)
			if _, ok := i.SetString(sm[1], 10); !ok {
				panic(fmt.Errorf("mixedNumberPattern yielded an unparseable int: %q", sm[1]))
			}
			t.i = append(t.i, i)
		} else /* sm[2] != "" */ { // String token
			t.s = append(t.s, sm[2])
		}
	}
	return t
}

// numericTokens is the result of parsing all numeric tokens out of a string.
//
// e.g. a string like "Foo_123" becomes
//
//	s: []string{"Foo_"},
//	i: []int64{123},
//
// To make comparisons possible, numericTokens _always_ "start" with a string,
// even if the string naturally starts with a number e.g. a string like
// "123_Foo" becomes
//
//	s: []string{"", "_Foo"},
//	i: []int64{123},
type numericTokens struct {
	s []string
	i []*big.Int
}

func (t numericTokens) DebugString() string {
	s := make([]string, 0, t.len())
	for i := 0; i < t.len(); i++ {
		if i%2 == 0 {
			val := t.s[i/2]
			if i == 0 && val == "" {
				continue
			}
			s = append(s, fmt.Sprintf("%#v", t.s[i/2]))
		} else {
			s = append(s, fmt.Sprintf("%#v", t.i[i/2]))
		}
	}
	if len(s) == 1 {
		return s[0]
	}
	return fmt.Sprintf("%v", s)
}

func (t numericTokens) len() int {
	return len(t.s) + len(t.i)
}

func (t numericTokens) compare(o numericTokens) int {
	for i := 0; i < min(t.len(), o.len()); i++ {
		if i%2 == 0 { // Start by comparing strings.
			if c := strings.Compare(t.s[i/2], o.s[i/2]); c != 0 {
				return c
			}
		} else { // Alternate by comparing with numbers.
			if c := t.i[i/2].Cmp(o.i[i/2]); c != 0 {
				return c
			}
		}
	}

	// If the numericTokens are all the same, whichever numericTokens that's
	// smaller is less than the other.
	return t.len() - o.len()
}

type prefixOrder struct {
	opts          blockOptions
	prefixWeights map[string]int
	prefixes      []string
}

func newPrefixOrder(opts blockOptions) *prefixOrder {
	if len(opts.PrefixOrder) == 0 {
		return nil
	}

	// Assign a weight to each prefix so that they will be sorted into their
	// predetermined order.
	// Weights are negative so that entries with matching prefixes are put before
	// any non-matching line (which will have a weight of 0).
	//
	// An empty prefix can be used to move "non-matching" entries to a position
	// between other prefixes.
	prefixWeights := make(map[string]int)
	for i, p := range opts.PrefixOrder {
		prefixWeights[p] = i - len(opts.PrefixOrder)
	}
	// Sort prefixes longest -> shortest to find the most appropriate weight.
	longestFirst := comparing(func(s string) int { return len(s) }).reversed()
	prefixes := slices.SortedStableFunc(slices.Values(opts.PrefixOrder), longestFirst)

	return &prefixOrder{opts, prefixWeights, prefixes}
}

func (o *prefixOrder) match(s string) orderedPrefix {
	if o == nil {
		return orderedPrefix{}
	}

	pre, _ := o.opts.hasPrefix(s, slices.Values(o.prefixes))
	return orderedPrefix{pre, o.prefixWeights[pre]}
}

type orderedPrefix struct {
	prefix string
	weight int
}

func (pre orderedPrefix) compare(other orderedPrefix) int {
	return cmp.Compare(pre.weight, other.weight)
}