diff options
author | Florian Dold <florian.dold@gmail.com> | 2017-05-28 00:38:50 +0200 |
---|---|---|
committer | Florian Dold <florian.dold@gmail.com> | 2017-05-28 00:40:43 +0200 |
commit | 7fff4499fd915bcea3fa93b1aa8b35f4fe7a6027 (patch) | |
tree | 6de9a1aebd150a23b7f8c273ec657a5d0a18fe3e /node_modules/common-path-prefix/index.js | |
parent | 963b7a41feb29cc4be090a2446bdfe0c1f1bcd81 (diff) | |
download | wallet-core-7fff4499fd915bcea3fa93b1aa8b35f4fe7a6027.tar.xz |
add linting (and some initial fixes)
Diffstat (limited to 'node_modules/common-path-prefix/index.js')
-rw-r--r-- | node_modules/common-path-prefix/index.js | 46 |
1 files changed, 46 insertions, 0 deletions
diff --git a/node_modules/common-path-prefix/index.js b/node_modules/common-path-prefix/index.js new file mode 100644 index 000000000..c62acea9c --- /dev/null +++ b/node_modules/common-path-prefix/index.js @@ -0,0 +1,46 @@ +'use strict' + +function getDirectoryComponents (path, sep) { + var components = path.split(sep) + + // Remove any trailing separators and the base component. + var last = '' + while (last === '') { + last = components.pop() + } + + return components +} + +module.exports = function commonPathPrefix (paths, sep) { + if (!sep) { + var m = /(\/|\\)/.exec(paths[0]) + // The first path did not contain any directory components. Bail now. + if (!m) return '' + sep = m[0] + } + + // Object to hold prefix strings formed of the directory components of each + // path. The value for each prefix string is the number of times that prefix + // occurred in the `paths` array. + var prefixes = Object.create(null) + for (var i = 0; i < paths.length; i++) { + var dirComponents = getDirectoryComponents(paths[i], sep) + var prefix = '' + for (var j = 0; j < dirComponents.length; j++) { + prefix += dirComponents[j] + sep + prefixes[prefix] = (prefixes[prefix] || 0) + 1 + } + } + + // Find the prefixes that occurred for each path and sort them by length + // (longest first). + var common = Object.keys(prefixes).filter(function (prefix) { + return prefixes[prefix] === paths.length + }).sort(function (a, b) { + return b.length - a.length + }) + + // Return the longest common path prefix, or the empty string. + return common[0] || '' +} |