( nodes?: FoldersTreeResponse, acc: FoldersTreeResponse[0][] = [], )
| 56 | } |
| 57 | |
| 58 | function flattenFolderTree( |
| 59 | nodes?: FoldersTreeResponse, |
| 60 | acc: FoldersTreeResponse[0][] = [], |
| 61 | ) { |
| 62 | if (!nodes) { |
| 63 | return acc |
| 64 | } |
| 65 | |
| 66 | nodes.forEach((folder) => { |
| 67 | acc.push(folder) |
| 68 | |
| 69 | if (folder.children?.length) { |
| 70 | flattenFolderTree(folder.children, acc) |
| 71 | } |
| 72 | }) |
| 73 | |
| 74 | return acc |
| 75 | } |
| 76 | |
| 77 | const flatFolderList = computed(() => flattenFolderTree(folders.value)) |
| 78 |
no outgoing calls
no test coverage detected