Function matchFile

complete.go:242–303

(s string, dirOnly bool, escape, unescape func(string) string)

}

func matchFile(s string, dirOnly bool, escape, unescape func(string) string) (matches []compMatch, longest string) {
	dir, file := filepath.Split(unescape(replaceTilde(s)))

	d := dir
	if dir == "" {
		d = "."
	}
	files, err := os.ReadDir(d)
	if err != nil {
		log.Printf("reading directory: %s", err)
		longest = s
		return
	}

	var longestName string

	for _, f := range files {
		isDir := false
		if f.IsDir() {
			isDir = true
		} else if f.Type()&os.ModeSymlink != 0 {
			if stat, err := os.Stat(filepath.Join(d, f.Name())); err == nil && stat.IsDir() {
				isDir = true
			}
		}

		if !isDir && dirOnly {
			continue
		}

		if !strings.HasPrefix(strings.ToLower(f.Name()), strings.ToLower(file)) {
			continue
		}

		name := f.Name()
		if isDir {
			name += string(filepath.Separator)
		}
		matches = append(matches, compMatch{name, escape(dir + name)})

		if len(matches) == 1 {
			longestName = name
		} else {
			// Match case-insensitively without changing the prefix's case.
			p := getLongest(strings.ToLower(longestName), strings.ToLower(name))
			longestName = string([]rune(longestName)[:len([]rune(p))])
		}
	}

	switch len(matches) {
	case 0:
		longest = s
	case 1:
		longest = escape(dir + longestName)
		if !strings.HasSuffix(longestName, string(filepath.Separator)) {
			longest += " "
		}
	default: