/
tests.performance.js
171 lines (142 loc) · 6.9 KB
/
tests.performance.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
Enumerable = Linqer.Enumerable;
const largeNumber = 10000000;
// performance tests
QUnit.module('performance tests');
QUnit.test( "Use only items that are required - standard", function( assert ) {
const largeArray = Array(largeNumber).fill(10);
const startTime = performance.now();
const someCalculation = largeArray.filter(x=>x===10).map(x=>'v'+x).slice(100,110);
Array.from(someCalculation);
const endTime = performance.now();
assert.ok(true,'Standard array use took '+(endTime-startTime)+'milliseconds');
});
QUnit.test( "Use only items that are required - Enumerable", function( assert ) {
const largeArray = Array(largeNumber).fill(10);
const startTime = performance.now();
const someCalculation = Enumerable.from(largeArray).where(x=>x===10).select(x=>'v'+x).skip(100).take(10).toArray();
Array.from(someCalculation);
const endTime = performance.now();
assert.ok(true,'Enumerable use took '+(endTime-startTime)+'milliseconds');
});
QUnit.test( "OrderBy performance random", function( assert ) {
const size = largeNumber;
const largeArray1 = Enumerable.range(1,size).shuffle().toArray();
let startTime = performance.now();
const result1 = Array.from(largeArray1).sort((i1,i2)=>i2-i1);
let endTime = performance.now();
assert.ok(true,'Order '+size+' items using Array.from then .sort took '+(endTime-startTime)+' milliseconds');
startTime = performance.now();
const result2 = Enumerable.from(largeArray1).orderBy(i=>size-i).useBrowserSort().toArray();
endTime = performance.now();
assert.ok(true,'Order '+size+' items using browser sort internally took '+(endTime-startTime)+' milliseconds');
for (let i=0; i<size; i++) {
if (result1[i]!=result2[i]) {
assert.ok(false,'Arrays are not the same at index '+i+': '+result1[i]+' != '+result2[i]);
break;
}
}
startTime = performance.now();
const result3 = Enumerable.from(largeArray1).orderBy(i=>size-i).useQuickSort().toArray();
endTime = performance.now();
assert.ok(true,'Order '+size+' items using QuickSort took '+(endTime-startTime)+' milliseconds');
for (let i=0; i<size; i++) {
if (result1[i]!=result3[i]) {
assert.ok(false,'Arrays are not the same at index '+i+': '+result1[i]+' != '+result3[i]);
break;
}
}
});
QUnit.test( "OrderBy performance already ordered", function( assert ) {
const size = largeNumber;
const largeArray1 = Enumerable.range(1,size).toArray();
let startTime = performance.now();
const result1 = Array.from(largeArray1).sort((i1,i2)=>i2-i1);
let endTime = performance.now();
assert.ok(true,'Order '+size+' items using Array.from then .sort took '+(endTime-startTime)+' milliseconds');
startTime = performance.now();
const result2 = Enumerable.from(largeArray1).orderBy(i=>size-i).useBrowserSort().toArray();
endTime = performance.now();
assert.ok(true,'Order '+size+' items using browser sort internally took '+(endTime-startTime)+' milliseconds');
for (let i=0; i<size; i++) {
if (result1[i]!=result2[i]) {
assert.ok(false,'Arrays are not the same at index '+i+': '+result1[i]+' != '+result2[i]);
break;
}
}
startTime = performance.now();
const result3 = Enumerable.from(largeArray1).orderBy(i=>size-i).useQuickSort().toArray();
endTime = performance.now();
assert.ok(true,'Order '+size+' items using QuickSort took '+(endTime-startTime)+' milliseconds');
for (let i=0; i<size; i++) {
if (result1[i]!=result3[i]) {
assert.ok(false,'Arrays are not the same at index '+i+': '+result1[i]+' != '+result3[i]);
break;
}
}
});
QUnit.test( "OrderBy performance same value", function( assert ) {
const size = largeNumber;
const largeArray1 = Enumerable.repeat(1,size).toArray();
let startTime = performance.now();
const result1 = Array.from(largeArray1).sort((i1,i2)=>i2-i1);
let endTime = performance.now();
assert.ok(true,'Order '+size+' items using Array.from then .sort took '+(endTime-startTime)+' milliseconds');
startTime = performance.now();
const result2 = Enumerable.from(largeArray1).orderBy(i=>size-i).useBrowserSort().toArray();
endTime = performance.now();
assert.ok(true,'Order '+size+' items using browser sort internally took '+(endTime-startTime)+' milliseconds');
for (let i=0; i<size; i++) {
if (result1[i]!=result2[i]) {
assert.ok(false,'Arrays are not the same at index '+i+': '+result1[i]+' != '+result2[i]);
break;
}
}
startTime = performance.now();
const result3 = Enumerable.from(largeArray1).orderBy(i=>size-i).useQuickSort().toArray();
endTime = performance.now();
assert.ok(true,'Order '+size+' items using QuickSort took '+(endTime-startTime)+' milliseconds');
for (let i=0; i<size; i++) {
if (result1[i]!=result3[i]) {
assert.ok(false,'Arrays are not the same at index '+i+': '+result1[i]+' != '+result3[i]);
break;
}
}
});
QUnit.test( "OrderBy take performance random", function( assert ) {
const size = largeNumber;
const largeArray1 = Enumerable.range(1,size).shuffle().toArray();
const largeArray2 = Array.from(largeArray1);
let startTime = performance.now();
let result1 = Enumerable.from(largeArray1.sort((i1,i2)=>i2-i1)).skip(100000).take(10000).toArray();
let endTime = performance.now();
assert.ok(true,'Order '+size+' items skip and take using .sort took '+(endTime-startTime)+' milliseconds');
startTime = performance.now();
let result2 = Enumerable.from(largeArray2).orderBy(i=>size-i).skip(100000).take(10000).toArray();
endTime = performance.now();
assert.ok(true,'Order '+size+' items skip and take using QuickSort took '+(endTime-startTime)+' milliseconds');
for (let i=0; i<size; i++) {
if (result1[i]!=result2[i]) {
assert.ok(false,'Arrays are not the same at index '+i+': '+result1[i]+' != '+result2[i]);
break;
}
}
});
QUnit.test( "sort in place performance random", function( assert ) {
const size = largeNumber;
const largeArray1 = Enumerable.range(1,size).shuffle().toArray();
const largeArray2 = Array.from(largeArray1);
let startTime = performance.now();
const result1 = largeArray1.sort(Linqer._defaultComparer);
let endTime = performance.now();
assert.ok(true,'Sort inline '+size+' items using Array.sort took '+(endTime-startTime)+' milliseconds');
startTime = performance.now();
const result2 = Enumerable.sort(largeArray2);
endTime = performance.now();
assert.ok(true,'Sort inline '+size+' items using QuickSort '+(endTime-startTime)+' milliseconds');
for (let i=0; i<size; i++) {
if (result1[i]!=result2[i]) {
assert.ok(false,'Arrays are not the same at index '+i+': '+result1[i]+' != '+result2[i]);
break;
}
}
});