Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 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 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 | 36x 1x 9x 9x 9x 9x 32x 23x 7x 25x 25x 8x 8x 17x 17x 17x 25x 9x 14x 3x 3x 11x 11x 3x 3x 8x 8x 8x 11x 9x 4x 3x 1x 1x 2x 2x 3x 9x 4x 3x 1x 1x 2x 2x 3x 9x 4x 4x 9x 6x 6x 3x 2x 1x 1x 1x 3x 1x 9x 1x 1x 1x 9x 5x 5x 9x 8x 8x 1x 4x 9x 1x 1x 6x 6x 9x 1x 1x 1x 1x 4x 4x 4x 1x 9x 8x 9x 7x 1x | interface Node {
value: any;
next: Node | null;
prev: Node | null;
}
type ForEachFunction = (value: any) => void;
const createNode = (value: any): Node => ({
value,
next: null,
prev: null,
});
const createDoublyLinkedList = () => {
let head: Node | null = null;
let tail: Node | null = null;
let size = 0;
const addFirst = (value: any | any[]) => {
if (Array.isArray(value)) {
value.reduceRight((_, v) => addFirst(v), null);
return;
}
const node: Node = createNode(value);
if (head == null) {
head = node;
tail = node;
} else {
head.prev = node;
node.next = head;
head = node;
}
size += 1;
};
const addLast = (value: any) => {
if (Array.isArray(value)) {
value.forEach(addLast);
return;
}
const node: Node = createNode(value);
if (head == null || tail == null) {
head = node;
tail = node;
} else {
tail.next = node;
node.prev = tail;
tail = node;
}
size += 1;
};
const removeFirst = () => {
if (!head) return;
if (!head.next) {
head = null;
tail = null;
} else {
head.next.prev = null;
head = head.next;
}
size -= 1;
};
const removeLast = () => {
if (!tail) return;
if (!tail.prev) {
head = null;
tail = null;
} else {
tail.prev.next = null;
tail = tail.prev;
}
size -= 1;
};
const remove = (value: any): boolean => {
let current: Node | null = head;
while (current != null) {
if (!Object.is(current.value, value)) {
current = current.next;
continue;
}
if (!current.prev) removeFirst();
else if (!current.next) removeLast();
else {
current.prev.next = current.next;
current.next.prev = current.prev;
size -= 1;
}
return true;
}
return false;
};
const clear = () => {
head = null;
tail = null;
size = 0;
};
const contains = (value: any): boolean => {
let current: Node | null = head;
while (current != null) {
if (!Object.is(current.value, value)) {
current = current.next;
continue;
}
return true;
}
return false;
};
const forEach = (fn: ForEachFunction) => {
let current: Node | null = head;
while (current != null) {
fn(current.value);
current = current.next;
}
};
const copyTo = () => {
let current: Node | null = head;
let index = 0;
const result = Array(size);
while (current != null) {
result[index] = current.value;
current = current.next;
index += 1;
}
return result;
}
return {
get head() {
return head;
},
get tail() {
return tail;
},
get size() {
return size;
},
addFirst,
addLast,
removeFirst,
removeLast,
remove,
clear,
contains,
forEach,
copyTo,
__proto__: null
};
}
export default createDoublyLinkedList;
|