( tree: MinimisedTree<T>, walker: (v: T, path: string[]) => void, version: number, origin: string[] = [] )
| 28 | const enableLegacyPaths = (version: number) => version < 1; |
| 29 | |
| 30 | function traverse<T>( |
| 31 | tree: MinimisedTree<T>, |
| 32 | walker: (v: T, path: string[]) => void, |
| 33 | version: number, |
| 34 | origin: string[] = [] |
| 35 | ): void { |
| 36 | if (!tree) { |
| 37 | return; |
| 38 | } |
| 39 | |
| 40 | const legacyPaths = enableLegacyPaths(version); |
| 41 | if (!isArray(tree)) { |
| 42 | forEach(tree, (subtree, key) => |
| 43 | traverse(subtree, walker, version, [ |
| 44 | ...origin, |
| 45 | ...parsePath(key, legacyPaths), |
| 46 | ]) |
| 47 | ); |
| 48 | return; |
| 49 | } |
| 50 | |
| 51 | const [nodeValue, children] = tree; |
| 52 | if (children) { |
| 53 | forEach(children, (child, key) => { |
| 54 | traverse(child, walker, version, [ |
| 55 | ...origin, |
| 56 | ...parsePath(key, legacyPaths), |
| 57 | ]); |
| 58 | }); |
| 59 | } |
| 60 | |
| 61 | walker(nodeValue, origin); |
| 62 | } |
| 63 | |
| 64 | export function applyValueAnnotations( |
| 65 | plain: any, |
no test coverage detected
searching dependent graphs…