Total Complexity | 9 |
Complexity/F | 2.25 |
Lines of Code | 39 |
Function Count | 4 |
Duplicated Lines | 0 |
Ratio | 0 % |
Changes | 0 |
1 | class Sorter { |
||
2 | constructor(key, direction) { |
||
3 | this.key = key; |
||
4 | this.moveDirection = direction === 'desc' ? -1 : 1; |
||
5 | } |
||
6 | |||
7 | order(original) { |
||
8 | return original.sort(this.compare.bind(this)); |
||
9 | } |
||
10 | |||
11 | compare(firstElement, secondElement) { |
||
12 | let nameA = firstElement[this.key]; |
||
13 | let nameB = secondElement[this.key]; |
||
14 | |||
15 | if (typeof nameA === 'string') { |
||
16 | nameA = nameA.toUpperCase(); |
||
17 | } |
||
18 | |||
19 | if (typeof nameB === 'string') { |
||
20 | nameB = nameB.toUpperCase(); |
||
21 | } |
||
22 | |||
23 | if (nameA < nameB) { |
||
24 | return -1 * this.moveDirection; |
||
25 | } |
||
26 | |||
27 | if (nameA > nameB) { |
||
28 | return 1 * this.moveDirection; |
||
29 | } |
||
30 | |||
31 | return 0; |
||
32 | } |
||
33 | } |
||
34 | |||
35 | module.exports = function multisort(original, key, direction) { |
||
36 | const sorter = new Sorter(key, direction); |
||
37 | |||
38 | return sorter.order(original); |
||
39 | }; |
||
40 |