(in []string)
| 401 | } |
| 402 | |
| 403 | func dedupStrings(in []string) []string { |
| 404 | if len(in) < 2 { |
| 405 | return in |
| 406 | } |
| 407 | seen := make(map[string]bool, len(in)) |
| 408 | out := in[:0] |
| 409 | for _, s := range in { |
| 410 | if !seen[s] { |
| 411 | seen[s] = true |
| 412 | out = append(out, s) |
| 413 | } |
| 414 | } |
| 415 | return out |
| 416 | } |
| 417 | |
| 418 | // tarjanSCC runs Tarjan's strongly-connected-components algorithm on the |
| 419 | // dependency graph and returns SCCs. Each SCC's members are returned in the |
no outgoing calls
no test coverage detected