exercism-javascript-answers/linked-list/linked-list.spec.js at master · SLIB53/exercism-javascript-answers · GitHub

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
108
109
110
111
112
113
114
115
116
117
118
119
import { LinkedList } from './linked-list';

describe('LinkedList', () => {
  test('add/extract elements to the end of the list with push/pop', () => {
    const list = new LinkedList();
    list.push(10);
    list.push(20);
    expect(list.pop()).toBe(20);
    expect(list.pop()).toBe(10);
  });
  test('extract elements from the beginning of the list with shift', () => {
    const list = new LinkedList();
    list.push(10);
    list.push(20);
    expect(list.shift()).toBe(10);
    expect(list.shift()).toBe(20);
  });
  test('add/extract elements from the beginning of the list with unshift/shift', () => {
    const list = new LinkedList();
    list.unshift(10);
    list.unshift(20);
    expect(list.shift()).toBe(20);
    expect(list.shift()).toBe(10);
  });
  test('unshift/pop', () => {
    const list = new LinkedList();
    list.unshift(10);
    list.unshift(20);
    expect(list.pop()).toBe(10);
    expect(list.pop()).toBe(20);
  });
  test('example', () => {
    const list = new LinkedList();
    list.push(10);
    list.push(20);
    expect(list.pop()).toBe(20);
    list.push(30);
    expect(list.shift()).toBe(10);
    list.unshift(40);
    list.push(50);
    expect(list.shift()).toBe(40);
    expect(list.pop()).toBe(50);
    expect(list.shift()).toBe(30);
  });
  test('can count its elements', () => {
    const list = new LinkedList();
    expect(list.count()).toBe(0);
    list.push(10);
    expect(list.count()).toBe(1);
    list.push(20);
    expect(list.count()).toBe(2);
  });
  test('sets head/tail after popping last element', () => {
    const list = new LinkedList();
    list.push(10);
    list.pop();
    list.unshift(20);
    expect(list.count()).toBe(1);
    expect(list.pop()).toBe(20);
  });
  test('sets head/tail after shifting last element', () => {
    const list = new LinkedList();
    list.unshift(10);
    list.shift();
    list.push(20);
    expect(list.count()).toBe(1);
    expect(list.shift()).toBe(20);
  });
  test('deletes the element with the specified value from the list', () => {
    const list = new LinkedList();
    list.push(10);
    list.push(20);
    list.push(30);
    list.delete(20);
    expect(list.count()).toBe(2);
    expect(list.pop()).toBe(30);
    expect(list.shift()).toBe(10);
  });
  test('deletes the only element', () => {
    const list = new LinkedList();
    list.push(10);
    list.delete(10);
    expect(list.count()).toBe(0);
  });
  test('deletes the first of two elements', () => {
    const list = new LinkedList();
    list.push(10);
    list.push(20);
    list.delete(10);
    expect(list.count()).toBe(1);
    expect(list.pop()).toBe(20);
  });
  test('deletes the second of two elements', () => {
    const list = new LinkedList();
    list.push(10);
    list.push(20);
    list.delete(20);
    expect(list.count()).toBe(1);
    expect(list.pop()).toBe(10);
  });
  test('delete does not modify the list if the element is not found', () => {
    const list = new LinkedList();
    list.push(10);
    list.delete(20);
    expect(list.count()).toBe(1);
  });
  test('deletes only the first occurence', () => {
    const list = new LinkedList();
    list.push(5);
    list.push(10);
    list.push(10);
    list.push(2);
    list.delete(10);
    expect(list.count()).toBe(3);
    expect(list.pop()).toBe(2);
    expect(list.pop()).toBe(10);
    expect(list.pop()).toBe(5);
  });
});