(elements []string)
| 816 | } |
| 817 | |
| 818 | func removeDuplicates(elements []string) (result []string) { |
| 819 | seen := make(map[string]struct{}) |
| 820 | |
| 821 | for v := range elements { |
| 822 | val := elements[v] |
| 823 | if _, ok := seen[val]; !ok { |
| 824 | seen[val] = struct{}{} |
| 825 | result = append(result, val) |
| 826 | } |
| 827 | } |
| 828 | |
| 829 | return result |
| 830 | } |
| 831 | |
| 832 | // Party returns a new child Party which inherites its |
| 833 | // parent's options and middlewares. |
no outgoing calls
no test coverage detected
searching dependent graphs…