109 lines
2.7 KiB
Go
109 lines
2.7 KiB
Go
package complete
|
|
|
|
import (
|
|
"io/ioutil"
|
|
"os"
|
|
"path/filepath"
|
|
"strings"
|
|
|
|
"github.com/posener/complete/match"
|
|
)
|
|
|
|
// PredictDirs will search for directories in the given started to be typed
|
|
// path, if no path was started to be typed, it will complete to directories
|
|
// in the current working directory.
|
|
func PredictDirs(pattern string) Predictor {
|
|
return files(pattern, false)
|
|
}
|
|
|
|
// PredictFiles will search for files matching the given pattern in the started to
|
|
// be typed path, if no path was started to be typed, it will complete to files that
|
|
// match the pattern in the current working directory.
|
|
// To match any file, use "*" as pattern. To match go files use "*.go", and so on.
|
|
func PredictFiles(pattern string) Predictor {
|
|
return files(pattern, true)
|
|
}
|
|
|
|
func files(pattern string, allowFiles bool) PredictFunc {
|
|
|
|
// search for files according to arguments,
|
|
// if only one directory has matched the result, search recursively into
|
|
// this directory to give more results.
|
|
return func(a Args) (prediction []string) {
|
|
prediction = predictFiles(a, pattern, allowFiles)
|
|
|
|
// if the number of prediction is not 1, we either have many results or
|
|
// have no results, so we return it.
|
|
if len(prediction) != 1 {
|
|
return
|
|
}
|
|
|
|
// only try deeper, if the one item is a directory
|
|
if stat, err := os.Stat(prediction[0]); err != nil || !stat.IsDir() {
|
|
return
|
|
}
|
|
|
|
a.Last = prediction[0]
|
|
return predictFiles(a, pattern, allowFiles)
|
|
}
|
|
}
|
|
|
|
func predictFiles(a Args, pattern string, allowFiles bool) []string {
|
|
if strings.HasSuffix(a.Last, "/..") {
|
|
return nil
|
|
}
|
|
|
|
dir := a.Directory()
|
|
files := listFiles(dir, pattern, allowFiles)
|
|
|
|
// add dir if match
|
|
files = append(files, dir)
|
|
|
|
return PredictFilesSet(files).Predict(a)
|
|
}
|
|
|
|
// PredictFilesSet predict according to file rules to a given set of file names
|
|
func PredictFilesSet(files []string) PredictFunc {
|
|
return func(a Args) (prediction []string) {
|
|
// add all matching files to prediction
|
|
for _, f := range files {
|
|
f = fixPathForm(a.Last, f)
|
|
|
|
// test matching of file to the argument
|
|
if match.File(f, a.Last) {
|
|
prediction = append(prediction, f)
|
|
}
|
|
}
|
|
return
|
|
}
|
|
}
|
|
|
|
func listFiles(dir, pattern string, allowFiles bool) []string {
|
|
// set of all file names
|
|
m := map[string]bool{}
|
|
|
|
// list files
|
|
if files, err := filepath.Glob(filepath.Join(dir, pattern)); err == nil {
|
|
for _, f := range files {
|
|
if stat, err := os.Stat(f); err != nil || stat.IsDir() || allowFiles {
|
|
m[f] = true
|
|
}
|
|
}
|
|
}
|
|
|
|
// list directories
|
|
if dirs, err := ioutil.ReadDir(dir); err == nil {
|
|
for _, d := range dirs {
|
|
if d.IsDir() {
|
|
m[filepath.Join(dir, d.Name())] = true
|
|
}
|
|
}
|
|
}
|
|
|
|
list := make([]string, 0, len(m))
|
|
for k := range m {
|
|
list = append(list, k)
|
|
}
|
|
return list
|
|
}
|