(sequences, expectedKeys)
| 22 | |
| 23 | |
| 24 | function addTest(sequences, expectedKeys) { |
| 25 | if (!Array.isArray(sequences)) { |
| 26 | sequences = [ sequences ]; |
| 27 | } |
| 28 | |
| 29 | if (!Array.isArray(expectedKeys)) { |
| 30 | expectedKeys = [ expectedKeys ]; |
| 31 | } |
| 32 | |
| 33 | expectedKeys = expectedKeys.map(extend); |
| 34 | |
| 35 | keys = []; |
| 36 | |
| 37 | for (const sequence of sequences) { |
| 38 | fi.write(sequence); |
| 39 | } |
| 40 | assert.deepStrictEqual(keys, expectedKeys); |
| 41 | } |
| 42 | |
| 43 | // Simulate key interval test cases |
| 44 | // Returns a function that takes `next` test case and returns a thunk |
no test coverage detected
searching dependent graphs…