1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
// -*- Mode: Go; indent-tabs-mode: t -*-
/*
* Copyright (C) 2018 Canonical Ltd
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 3 as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
package advisor
import (
"os"
)
type Command struct {
Snap string
Version string `json:"Version,omitempty"`
Command string
}
func FindCommand(command string) ([]Command, error) {
finder, err := newFinder()
if err != nil && os.IsNotExist(err) {
return nil, nil
}
if err != nil {
return nil, err
}
defer finder.Close()
return finder.FindCommand(command)
}
const (
minLen = 3
maxLen = 256
)
// based on CommandNotFound.py:similar_words.py
func similarWords(word string) []string {
const alphabet = "abcdefghijklmnopqrstuvwxyz-_0123456789"
similar := make(map[string]bool, 2*len(word)+2*len(word)*len(alphabet))
// deletes
for i := range word {
similar[word[:i]+word[i+1:]] = true
}
// transpose
for i := 0; i < len(word)-1; i++ {
similar[word[:i]+word[i+1:i+2]+word[i:i+1]+word[i+2:]] = true
}
// replaces
for i := range word {
for _, r := range alphabet {
similar[word[:i]+string(r)+word[i+1:]] = true
}
}
// inserts
for i := range word {
for _, r := range alphabet {
similar[word[:i]+string(r)+word[i:]] = true
}
}
// convert for output
ret := make([]string, 0, len(similar))
for w := range similar {
ret = append(ret, w)
}
return ret
}
func FindMisspelledCommand(command string) ([]Command, error) {
if len(command) < minLen || len(command) > maxLen {
return nil, nil
}
finder, err := newFinder()
if err != nil && os.IsNotExist(err) {
return nil, nil
}
if err != nil {
return nil, err
}
defer finder.Close()
alternatives := make([]Command, 0, 32)
for _, w := range similarWords(command) {
res, err := finder.FindCommand(w)
if err != nil {
return nil, err
}
if len(res) > 0 {
alternatives = append(alternatives, res...)
}
}
return alternatives, nil
}
|
