dyaskur /
google-chat-shuffler
| Total Complexity | 1 |
| Complexity/F | 1 |
| Lines of Code | 13 |
| Function Count | 1 |
| Duplicated Lines | 0 |
| Ratio | 0 % |
| Changes | 0 | ||
| 1 | import {getRandomWinners} from '../src/helpers/utils.js'; |
||
| 2 | |||
| 3 | test('get the winner', () => { |
||
| 4 | const names = ['Ibrahim', 'Isa', 'Moses', 'Ismail']; |
||
| 5 | |||
| 6 | const winners = getRandomWinners(names); |
||
| 7 | |||
| 8 | expect(winners.length).toEqual(1); |
||
| 9 | |||
| 10 | const winners2 = getRandomWinners(names, 2); |
||
| 11 | |||
| 12 | expect(winners2.length).toEqual(2); |
||
| 13 | }); |
||
| 14 |
