File size: 2,774 Bytes
bc20498 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 |
import Entry from './entry';
export function validateSortedUnique(entries: Entry[]) {
for (let i = 1; i < entries.length; i++) {
let previous = entries[i - 1].relativePath;
let current = entries[i].relativePath;
if (previous < current) {
continue;
} else {
throw new Error('expected entries[' + (i -1) + ']: `' + previous +
'` to be < entries[' + i + ']: `' + current + '`, but was not. Ensure your input is sorted and has no duplicate paths');
}
}
}
export function commonPrefix(a: string, b: string, term?: string) {
let max = Math.min(a.length, b.length);
let end = -1;
for(var i = 0; i < max; ++i) {
if (a[i] !== b[i]) {
break;
} else if (a[i] === term) {
end = i;
}
}
return a.substr(0, end + 1);
}
export function basename(entry: Entry) {
const path = entry.relativePath;
const end = path.length - 2;
for (let i = end; i >= 0; --i) {
if (path[i] === '/') {
return path.substr(0, i + 1);
}
}
return '';
}
export function computeImpliedEntries(basePath: string, relativePath: string) {
let rv = [];
for (var i=0; i < relativePath.length; ++i) {
if (relativePath[i] === '/') {
let path = basePath + relativePath.substr(0, i + 1);
rv.push(new Entry(path, 0, 0));
}
}
return rv;
}
export function compareByRelativePath(entryA: Entry, entryB: Entry) {
const pathA = entryA.relativePath;
const pathB = entryB.relativePath;
if (pathA < pathB) {
return -1;
} else if (pathA > pathB) {
return 1;
}
return 0;
}
export function sortAndExpand(entries: Entry[]) {
entries.sort(compareByRelativePath);
let path = '';
for (let i=0; i<entries.length; ++i) {
const entry = entries[i];
// update our path eg
// path = a/b/c/d/
// entry = a/b/q/r/s/
// path' = a/b/
path = commonPrefix(path, entry.relativePath, '/');
// a/b/ -> a/
// a/b -> a/
const base = basename(entry);
// base - path
const entryBaseSansCommon = base.substr(path.length);
// determine what intermediate directories are missing eg
// path = a/b/
// entryBaseSansCommon = c/d/e/
// impliedEntries = [a/b/c/, a/b/c/d/, a/b/c/d/e/]
const impliedEntries = computeImpliedEntries(path, entryBaseSansCommon);
// actually add our implied entries to entries
if (impliedEntries.length > 0) {
entries.splice(i, 0, ...impliedEntries);
i += impliedEntries.length;
}
// update path. Now that we've created all the intermediate directories, we
// don't need to recreate them for subsequent entries.
if (entry.isDirectory()) {
path = entry.relativePath;
} else {
path = base;
}
}
return entries;
}
|