(entry)
| 6832 | } |
| 6833 | |
| 6834 | async function transformToFileSystemhandles(entry) { |
| 6835 | const entries = []; |
| 6836 | function readEntries(directoryReader, resolve, reject) { |
| 6837 | directoryReader.readEntries(async (entriesPart) => { |
| 6838 | if (!entriesPart.length) { |
| 6839 | resolve(entries); |
| 6840 | } else { |
| 6841 | for (const entry of entriesPart) { |
| 6842 | entries.push(await transformToFileSystemhandle(entry)); |
| 6843 | } |
| 6844 | readEntries(directoryReader, resolve, reject); |
| 6845 | } |
| 6846 | }, reject); |
| 6847 | } |
| 6848 | await new Promise((resolve, reject) => |
| 6849 | readEntries(entry.createReader(), resolve, reject) |
| 6850 | ); |
| 6851 | return { |
| 6852 | [Symbol.iterator]() { |
| 6853 | let entryIndex = 0; |
| 6854 | return { |
| 6855 | next() { |
| 6856 | const result = { |
| 6857 | value: entries[entryIndex], |
| 6858 | done: entryIndex == entries.length |
| 6859 | }; |
| 6860 | entryIndex++; |
| 6861 | return result; |
| 6862 | } |
| 6863 | }; |
| 6864 | } |
| 6865 | }; |
| 6866 | } |
| 6867 | |
| 6868 | function resetFS(fs) { |
| 6869 | fs.entries = []; |
no test coverage detected
searching dependent graphs…