-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgetLargestFileNameLengthInLevel.ts
76 lines (67 loc) · 2.51 KB
/
getLargestFileNameLengthInLevel.ts
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
import { Core } from "../../tree/types";
let maxDepthLevel = 0;
/** Recursively traverses through a treeCore to find the largest file name
* @param {Core[]} treeCore - Tree to traverse through
* @param {number} depthLevel - Level of nesting in the treeCore
* @param {number} depthLevelCounter - Next depth level
* @param {string[]} arrayOfPaths - List of paths in certain depth level
* @returns {void} - Doesn't return anything
*/
const traverseThroughTree = (
/* Recursively traverses through the treeCore and adds paths
to pathsInDepthLevel if they're in the inputted depthLevel of getLargestFileNameInLevel */
treeCore: Core[],
depthLevel: number,
depthLevelCounter = 0,
arrayOfPaths: string[]
): void => {
for (let index = 0; index < treeCore.length; index += 1) {
if (depthLevel === depthLevelCounter) {
arrayOfPaths.push(treeCore[index].path);
if (depthLevelCounter > maxDepthLevel) {
maxDepthLevel = depthLevel;
}
} else {
/* If depthLevel was not reached, recursively call function to
go one depthLevel deeper by adding 1 to the depthLevelCounter */
traverseThroughTree(
treeCore[index].treeCore,
depthLevel,
depthLevelCounter + 1,
arrayOfPaths
);
}
}
};
/** Recursively traverses through a treeCore to find the largest file name
* length for an inputted depthLevel so that comments can be aligned accordingly
* @param {Core[]} treeCore - entire tree that is input for analysis
* @param {number} depthLevel - level of nesting in the treeCore
* @returns {number} - the largest file name length in the level or -1 if the
* depth level inputted was greater than the max depth level of the treeCore
*/
export const getLargestFileNameLengthInLevel = (
treeCore: Core[],
depthLevel: number
): number => {
let largestFileNameLengthInLevel = 0;
// depthLevel is greater than maxDepthLevel of treeCore
const OUT_OF_BOUNDS = -1;
const pathsInDepthLevel: string[] = [];
traverseThroughTree(treeCore, depthLevel, 0, pathsInDepthLevel);
for (let index = 0; index < pathsInDepthLevel.length; index += 1) {
const filteredPath = pathsInDepthLevel[index].split("/");
if (
filteredPath[filteredPath.length - 1].length >
largestFileNameLengthInLevel
) {
largestFileNameLengthInLevel =
filteredPath[filteredPath.length - 1].length;
}
}
if (maxDepthLevel < depthLevel) {
return OUT_OF_BOUNDS;
}
return largestFileNameLengthInLevel;
};
export default getLargestFileNameLengthInLevel;