* Sort path patterns. * If a module name can be matched with multiple patterns then pattern with the longest prefix will be picked.
(arr: Array<string>)
| 54 | * If a module name can be matched with multiple patterns then pattern with the longest prefix will be picked. |
| 55 | */ |
| 56 | function sortByLongestPrefix(arr: Array<string>): Array<string> { |
| 57 | return arr |
| 58 | .concat() |
| 59 | .sort((a: string, b: string) => getPrefixLength(b) - getPrefixLength(a)); |
| 60 | } |
| 61 | |
| 62 | function getPrefixLength(pattern: string): number { |
| 63 | const prefixLength = pattern.indexOf("*"); |
no test coverage detected
searching dependent graphs…