()
| 188 | } |
| 189 | |
| 190 | func getTaskPath() (string, error) { |
| 191 | if info, err := os.Stat("./bin/task"); err == nil { |
| 192 | return info.Name(), nil |
| 193 | } |
| 194 | |
| 195 | if path, err := exec.LookPath("task"); err == nil { |
| 196 | return path, nil |
| 197 | } |
| 198 | |
| 199 | return "", errors.New("task: \"task\" binary was not found!") |
| 200 | } |
| 201 | |
| 202 | // Return the difference of the two lists: the elements that are present in the first |
| 203 | // list, but not in the second one. The notion of presence is not with `=` but with |
no test coverage detected
searching dependent graphs…