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
|
var DLL = require('../lib/internal/DoublyLinkedList').default;
var expect = require('chai').expect;
describe('DoublyLinkedList', function () {
it('toArray', function() {
var list = new DLL();
expect(list.toArray()).to.eql([]);
for (var i = 0; i < 5; i++) {
list.push({data: i});
}
expect(list.toArray()).to.eql([0, 1, 2, 3, 4]);
});
it('remove', function() {
var list = new DLL();
for (var i = 0; i < 5; i++) {
list.push({data: i});
}
list.remove(function (node) {
return node.data === 3;
})
expect(list.toArray()).to.eql([0, 1, 2, 4]);
});
it('remove (head)', function() {
var list = new DLL();
for (var i = 0; i < 5; i++) {
list.push({data: i});
}
list.remove(function (node) {
return node.data === 0;
})
expect(list.toArray()).to.eql([1, 2, 3, 4]);
});
it('remove (tail)', function() {
var list = new DLL();
for (var i = 0; i < 5; i++) {
list.push({data: i});
}
list.remove(function (node) {
return node.data === 4;
})
expect(list.toArray()).to.eql([0, 1, 2, 3]);
});
it('remove (all)', function() {
var list = new DLL();
for (var i = 0; i < 5; i++) {
list.push({data: i});
}
list.remove(function (node) {
return node.data < 5;
})
expect(list.toArray()).to.eql([]);
});
it('empty', function() {
var list = new DLL();
for (var i = 0; i < 5; i++) {
list.push({data: i});
}
var empty = list.empty();
expect(list).to.equal(empty);
expect(list.toArray()).to.eql([]);
});
});
|