mirror of
https://github.com/nodejs/node.git
synced 2025-05-05 15:32:15 +00:00
1aa47d8e83
* check that empty linked lists have identical properties * `assert.equal()` -> `assert.strictEqual()` * `var` -> `const` PR-URL: https://github.com/nodejs/node/pull/8193 Reviewed-By: Jeremiah Senkpiel <fishrock123@rocketmail.com> Reviewed-By: James M Snell <jasnell@gmail.com> Reviewed-By: Michaël Zasso <mic.besace@gmail.com> Reviewed-By: Franziska Hinkelmann <franziska.hinkelmann@gmail.com>
112 lines
2.3 KiB
JavaScript
112 lines
2.3 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);
|
|
|
|
const list = { name: 'list' };
|
|
const A = { name: 'A' };
|
|
const B = { name: 'B' };
|
|
const C = { name: 'C' };
|
|
const D = { name: 'D' };
|
|
|
|
|
|
L.init(list);
|
|
L.init(A);
|
|
L.init(B);
|
|
L.init(C);
|
|
L.init(D);
|
|
|
|
assert.ok(L.isEmpty(list));
|
|
assert.strictEqual(null, L.peek(list));
|
|
|
|
L.append(list, A);
|
|
// list -> A
|
|
assert.strictEqual(A, L.peek(list));
|
|
|
|
L.append(list, B);
|
|
// list -> A -> B
|
|
assert.strictEqual(A, L.peek(list));
|
|
|
|
L.append(list, C);
|
|
// list -> A -> B -> C
|
|
assert.strictEqual(A, L.peek(list));
|
|
|
|
L.append(list, D);
|
|
// list -> A -> B -> C -> D
|
|
assert.strictEqual(A, L.peek(list));
|
|
|
|
assert.strictEqual(A, L.shift(list));
|
|
// list -> B -> C -> D
|
|
assert.strictEqual(B, L.peek(list));
|
|
|
|
assert.strictEqual(B, L.shift(list));
|
|
// list -> C -> D
|
|
assert.strictEqual(C, L.peek(list));
|
|
|
|
// B is already removed, so removing it again shouldn't hurt.
|
|
L.remove(B);
|
|
// list -> C -> D
|
|
assert.strictEqual(C, L.peek(list));
|
|
|
|
// Put B back on the list
|
|
L.append(list, B);
|
|
// list -> C -> D -> B
|
|
assert.strictEqual(C, L.peek(list));
|
|
|
|
L.remove(C);
|
|
// list -> D -> B
|
|
assert.strictEqual(D, L.peek(list));
|
|
|
|
L.remove(B);
|
|
// list -> D
|
|
assert.strictEqual(D, L.peek(list));
|
|
|
|
L.remove(D);
|
|
// list
|
|
assert.strictEqual(null, L.peek(list));
|
|
|
|
|
|
assert.ok(L.isEmpty(list));
|
|
|
|
|
|
L.append(list, D);
|
|
// list -> D
|
|
assert.strictEqual(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.strictEqual(D, L.shift(list));
|
|
// list -> B -> A -> C
|
|
assert.strictEqual(B, L.peek(list));
|
|
assert.strictEqual(B, L.shift(list));
|
|
// list -> A -> C
|
|
assert.strictEqual(A, L.peek(list));
|
|
assert.strictEqual(A, L.shift(list));
|
|
// list -> C
|
|
assert.strictEqual(C, L.peek(list));
|
|
assert.strictEqual(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));
|
|
|
|
// Objects should have identical keys/properties, but be different objects.
|
|
assert.deepStrictEqual(list2, list3);
|
|
assert.notStrictEqual(list2, list3);
|