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
|
// Copyright Joyent, Inc. and other Node contributors.
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to permit
// persons to whom the Software is furnished to do so, subject to the
// following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
// USE OR OTHER DEALINGS IN THE SOFTWARE.
'use strict';
// Flags: --expose-internals
require('../common');
const assert = require('assert');
const L = require('internal/linkedlist');
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(L.peek(list), null);
L.append(list, A);
// list -> A
assert.strictEqual(L.peek(list), A);
L.append(list, B);
// list -> A -> B
assert.strictEqual(L.peek(list), A);
L.append(list, C);
// list -> A -> B -> C
assert.strictEqual(L.peek(list), A);
L.append(list, D);
// list -> A -> B -> C -> D
assert.strictEqual(L.peek(list), A);
L.remove(A);
L.remove(B);
// B is already removed, so removing it again shouldn't hurt.
L.remove(B);
// list -> C -> D
assert.strictEqual(L.peek(list), C);
// Put B back on the list
L.append(list, B);
// list -> C -> D -> B
assert.strictEqual(L.peek(list), C);
L.remove(C);
// list -> D -> B
assert.strictEqual(L.peek(list), D);
L.remove(B);
// list -> D
assert.strictEqual(L.peek(list), D);
L.remove(D);
// list
assert.strictEqual(L.peek(list), null);
assert.ok(L.isEmpty(list));
L.append(list, D);
// list -> D
assert.strictEqual(L.peek(list), D);
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(L.peek(list), D);
assert.strictEqual(L.peek(D), B);
assert.strictEqual(L.peek(B), A);
assert.strictEqual(L.peek(A), C);
assert.strictEqual(L.peek(C), list);
|
