(dir1, dir2)
| 12 | } |
| 13 | |
| 14 | function assertDirEquivalent(dir1, dir2) { |
| 15 | const dir1Entries = []; |
| 16 | collectEntries(dir1, dir1Entries); |
| 17 | const dir2Entries = []; |
| 18 | collectEntries(dir2, dir2Entries); |
| 19 | assert.strictEqual(dir1Entries.length, dir2Entries.length); |
| 20 | for (const entry1 of dir1Entries) { |
| 21 | const entry2 = dir2Entries.find((entry) => { |
| 22 | return entry.name === entry1.name; |
| 23 | }); |
| 24 | assert(entry2, `entry ${entry2.name} not copied`); |
| 25 | if (entry1.isFile()) { |
| 26 | assert(entry2.isFile(), `${entry2.name} was not file`); |
| 27 | } else if (entry1.isDirectory()) { |
| 28 | assert(entry2.isDirectory(), `${entry2.name} was not directory`); |
| 29 | } else if (entry1.isSymbolicLink()) { |
| 30 | assert(entry2.isSymbolicLink(), `${entry2.name} was not symlink`); |
| 31 | } |
| 32 | } |
| 33 | } |
| 34 | |
| 35 | function collectEntries(dir, dirEntries) { |
| 36 | const newEntries = readdirSync(dir, mustNotMutateObjectDeep({ withFileTypes: true })); |
no test coverage detected
searching dependent graphs…