-
Notifications
You must be signed in to change notification settings - Fork 29.8k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
assert: typed array deepequal performance fix
assert.deepEqual: when actual and expected are typed arrays, wrap them in a new Buffer each to increase performance significantly. Fixes: #4294
- Loading branch information
1 parent
b3313aa
commit a6a874b
Showing
5 changed files
with
135 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
'use strict'; | ||
var common = require('../common.js'); | ||
var assert = require('assert'); | ||
var bench = common.createBenchmark(main, { | ||
prim: [ | ||
null, | ||
undefined, | ||
'a', | ||
1, | ||
true, | ||
{0: 'a'}, | ||
[1, 2, 3], | ||
new Array([1, 2, 3]) | ||
], | ||
n: [25] | ||
}); | ||
|
||
function main(conf) { | ||
var prim = conf.prim; | ||
var n = +conf.n; | ||
var primArray; | ||
var primArrayCompare; | ||
var x; | ||
|
||
primArray = new Array(); | ||
primArrayCompare = new Array(); | ||
for (x = 0; x < (1e5); x++) { | ||
primArray.push(prim); | ||
primArrayCompare.push(prim); | ||
} | ||
|
||
bench.start(); | ||
for (x = 0; x < n; x++) { | ||
assert.deepEqual(primArray, primArrayCompare); | ||
} | ||
bench.end(n); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,30 @@ | ||
'use strict'; | ||
var common = require('../common.js'); | ||
var assert = require('assert'); | ||
var bench = common.createBenchmark(main, { | ||
prim: [ | ||
null, | ||
undefined, | ||
'a', | ||
1, | ||
true, | ||
{0: 'a'}, | ||
[1, 2, 3], | ||
new Array([1, 2, 3]) | ||
], | ||
n: [1e5] | ||
}); | ||
|
||
function main(conf) { | ||
var prim = conf.prim; | ||
var n = +conf.n; | ||
var x; | ||
|
||
bench.start(); | ||
|
||
for (x = 0; x < n; x++) { | ||
assert.deepEqual(new Array([prim]), new Array([prim])); | ||
} | ||
|
||
bench.end(n); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
'use strict'; | ||
var common = require('../common.js'); | ||
var assert = require('assert'); | ||
var bench = common.createBenchmark(main, { | ||
type: ('Int8Array Uint8Array Int16Array Uint16Array Int32Array Uint32Array ' + | ||
'Float32Array Float64Array Uint8ClampedArray').split(' '), | ||
n: [1] | ||
}); | ||
|
||
function main(conf) { | ||
var type = conf.type; | ||
var clazz = global[type]; | ||
var n = +conf.n; | ||
|
||
bench.start(); | ||
var actual = new clazz(n * 1e6); | ||
var expected = new clazz(n * 1e6); | ||
|
||
assert.deepEqual(actual, expected); | ||
|
||
bench.end(n); | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
'use strict'; | ||
|
||
const common = require('../common'); | ||
const assert = require('assert'); | ||
const a = require('assert'); | ||
|
||
function makeBlock(f) { | ||
var args = Array.prototype.slice.call(arguments, 1); | ||
return function() { | ||
return f.apply(this, args); | ||
}; | ||
} | ||
|
||
const equalArrayPairs = [ | ||
[new Uint8Array(1e5), new Uint8Array(1e5)], | ||
[new Uint16Array(1e5), new Uint16Array(1e5)], | ||
[new Uint32Array(1e5), new Uint32Array(1e5)], | ||
[new Uint8ClampedArray(1e5), new Uint8ClampedArray(1e5)], | ||
[new Int8Array(1e5), new Int8Array(1e5)], | ||
[new Int16Array(1e5), new Int16Array(1e5)], | ||
[new Int32Array(1e5), new Int32Array(1e5)], | ||
[new Float32Array(1e5), new Float32Array(1e5)], | ||
[new Float64Array(1e5), new Float64Array(1e5)] | ||
]; | ||
|
||
const notEqualArrayPairs = [ | ||
[new Uint8Array(2), new Uint8Array(3)], | ||
[new Uint8Array([1, 2, 3]), new Uint8Array([4, 5, 6])], | ||
[new Uint8ClampedArray([300, 2, 3]), new Uint8Array([300, 2, 3])] | ||
]; | ||
|
||
equalArrayPairs.forEach((arrayPair) => { | ||
assert.deepEqual(arrayPair[0], arrayPair[1]); | ||
}); | ||
|
||
notEqualArrayPairs.forEach((arrayPair) => { | ||
assert.throws( | ||
makeBlock(a.deepEqual, arrayPair[0], arrayPair[1]), | ||
a.AssertionError | ||
); | ||
}); |