mirror of
https://github.com/nodejs/node.git
synced 2025-05-04 15:02:25 +00:00
6f75b6672c
Save the setImmediate() callback arguments into an array instead of a closure, and invoke the callback on the arguments from an optimizable function. 60% faster setImmediate with 0 args (15% if self-recursive) 4x faster setImmediate with 1-3 args, 2x with > 3 seems to be faster with less memory pressure when memory is tight Changes: - use L.create() to build faster lists - use runCallback() from within tryOnImmediate() - save the arguments and do not build closures for the callbacks PR-URL: https://github.com/nodejs/node/pull/6436 Reviewed-By: Benjamin Gruenbaum <benjamingr@gmail.com> Reviewed-By: Jeremiah Senkpiel <fishrock123@rocketmail.com>
111 lines
2.1 KiB
JavaScript
111 lines
2.1 KiB
JavaScript
'use strict';
|
|
|
|
// Flags: --expose-internals
|
|
|
|
require('../common');
|
|
const assert = require('assert');
|
|
const L = require('_linklist'); // eslint-disable-line no-restricted-modules
|
|
const internalL = require('internal/linkedlist');
|
|
|
|
assert.strictEqual(L, internalL);
|
|
|
|
var list = { name: 'list' };
|
|
var A = { name: 'A' };
|
|
var B = { name: 'B' };
|
|
var C = { name: 'C' };
|
|
var D = { name: 'D' };
|
|
|
|
|
|
L.init(list);
|
|
L.init(A);
|
|
L.init(B);
|
|
L.init(C);
|
|
L.init(D);
|
|
|
|
assert.ok(L.isEmpty(list));
|
|
assert.equal(null, L.peek(list));
|
|
|
|
L.append(list, A);
|
|
// list -> A
|
|
assert.equal(A, L.peek(list));
|
|
|
|
L.append(list, B);
|
|
// list -> A -> B
|
|
assert.equal(A, L.peek(list));
|
|
|
|
L.append(list, C);
|
|
// list -> A -> B -> C
|
|
assert.equal(A, L.peek(list));
|
|
|
|
L.append(list, D);
|
|
// list -> A -> B -> C -> D
|
|
assert.equal(A, L.peek(list));
|
|
|
|
var x = L.shift(list);
|
|
assert.equal(A, x);
|
|
// list -> B -> C -> D
|
|
assert.equal(B, L.peek(list));
|
|
|
|
x = L.shift(list);
|
|
assert.equal(B, x);
|
|
// list -> C -> D
|
|
assert.equal(C, L.peek(list));
|
|
|
|
// B is already removed, so removing it again shouldn't hurt.
|
|
L.remove(B);
|
|
// list -> C -> D
|
|
assert.equal(C, L.peek(list));
|
|
|
|
// Put B back on the list
|
|
L.append(list, B);
|
|
// list -> C -> D -> B
|
|
assert.equal(C, L.peek(list));
|
|
|
|
L.remove(C);
|
|
// list -> D -> B
|
|
assert.equal(D, L.peek(list));
|
|
|
|
L.remove(B);
|
|
// list -> D
|
|
assert.equal(D, L.peek(list));
|
|
|
|
L.remove(D);
|
|
// list
|
|
assert.equal(null, L.peek(list));
|
|
|
|
|
|
assert.ok(L.isEmpty(list));
|
|
|
|
|
|
L.append(list, D);
|
|
// list -> D
|
|
assert.equal(D, L.peek(list));
|
|
|
|
L.append(list, C);
|
|
L.append(list, B);
|
|
L.append(list, A);
|
|
// list -> D -> C -> B -> A
|
|
|
|
// Append should REMOVE C from the list and append it to the end.
|
|
L.append(list, C);
|
|
|
|
// list -> D -> B -> A -> C
|
|
assert.equal(D, L.shift(list));
|
|
// list -> B -> A -> C
|
|
assert.equal(B, L.peek(list));
|
|
assert.equal(B, L.shift(list));
|
|
// list -> A -> C
|
|
assert.equal(A, L.peek(list));
|
|
assert.equal(A, L.shift(list));
|
|
// list -> C
|
|
assert.equal(C, L.peek(list));
|
|
assert.equal(C, L.shift(list));
|
|
// list
|
|
assert.ok(L.isEmpty(list));
|
|
|
|
const list2 = L.create();
|
|
const list3 = L.create();
|
|
assert.ok(L.isEmpty(list2));
|
|
assert.ok(L.isEmpty(list3));
|
|
assert.ok(list2 != list3);
|