refactor: path-searcher to remove superflous code
This commit is contained in:
@ -31,15 +31,9 @@ func main() {
|
|||||||
query := os.Args[1:]
|
query := os.Args[1:]
|
||||||
|
|
||||||
for _, q := range query {
|
for _, q := range query {
|
||||||
search:
|
|
||||||
for i, w := range words {
|
for i, w := range words {
|
||||||
q, w = strings.ToLower(q), strings.ToLower(w)
|
q, w = strings.ToLower(q), strings.ToLower(w)
|
||||||
|
|
||||||
switch q {
|
|
||||||
case "and", "or", "the":
|
|
||||||
break search
|
|
||||||
}
|
|
||||||
|
|
||||||
if strings.Index(w, q) != notFound {
|
if strings.Index(w, q) != notFound {
|
||||||
fmt.Printf("#%-2d: %q\n", i+1, w)
|
fmt.Printf("#%-2d: %q\n", i+1, w)
|
||||||
}
|
}
|
||||||
|
Reference in New Issue
Block a user