Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 | 1x 1x 1x 1x 7x 14x 7x 7x 7x 7x 7x 7x 7x 7x 7x 3x 3x 3x 4x 8x 6x 4x 4x 4x | import * as fs from "fs";
import * as path from "path";
import { RecursiveTravelDirectoriesInput } from "@types";
import { isObjectADirectory } from "./isObjectADirectory";
/**
* recursive travel all directory
* Params:
* directory: absolute path
* travelCallback: call with each directory that have been travled
* completeCallback: call when finish travel
*
* Just like travel a tree using DFS algorithm
*/
export const recursiveTravelDirectory = ({
rootDirectory,
currentTravelDirectory = rootDirectory,
travelCallBack
}: RecursiveTravelDirectoriesInput) => {
return new Promise(resolve => {
fs.readdir(currentTravelDirectory, (err, objs) => {
Iif (err) {
throw err;
}
// get child branches of current branch
const childDirectories = objs.filter(obj =>
isObjectADirectory({ directory: currentTravelDirectory, obj })
);
const childFiles = objs.filter(
obj => !isObjectADirectory({ directory: currentTravelDirectory, obj })
);
// travel the the deepst of node of the branch
if (childDirectories.length === 0) {
travelCallBack({
directory: currentTravelDirectory,
childFiles,
childDirectories
});
resolve();
return;
}
// for each branch in child branch, continue travel deep down
const promises = [];
for (let directory of childDirectories) {
promises.push(
recursiveTravelDirectory({
travelCallBack,
currentTravelDirectory: path.join(
currentTravelDirectory,
directory
),
rootDirectory
})
);
}
/**
* wait until all child directory have been travlled
* use for testing purpuse...
*/
Promise.all(promises).then(() => {
travelCallBack({
directory: currentTravelDirectory,
childFiles,
childDirectories
});
resolve();
});
});
});
};
|