|
| 1 | +import { Identifier, Node } from './node'; |
| 2 | + |
| 3 | +type RemoteIdentifier = Identifier | null; |
| 4 | + |
| 5 | +type ModifiedIndex = number | null; |
| 6 | + |
| 7 | +export interface RemoteInsertOperation { |
| 8 | + prevId: Identifier | null; |
| 9 | + node: Node; |
| 10 | +} |
| 11 | + |
| 12 | +export interface RemoteDeleteOperation { |
| 13 | + targetId: Identifier | null; |
| 14 | + clock: number; |
| 15 | +} |
| 16 | + |
| 17 | +export default class LinkedList { |
| 18 | + head?: Node; |
| 19 | + |
| 20 | + insertByIndex( |
| 21 | + index: number, |
| 22 | + letter: string, |
| 23 | + id: Identifier, |
| 24 | + ): RemoteInsertOperation { |
| 25 | + const node = new Node(letter, id); |
| 26 | + |
| 27 | + try { |
| 28 | + // insertion to head |
| 29 | + if (!this.head || index === -1) { |
| 30 | + node.next = this.head; |
| 31 | + node.prev = null; |
| 32 | + |
| 33 | + this.head = node; |
| 34 | + |
| 35 | + return { prevId: null, node }; |
| 36 | + } |
| 37 | + |
| 38 | + const prevNode = this.findByIndex(index); |
| 39 | + |
| 40 | + node.next = prevNode.next; |
| 41 | + prevNode.next = node; |
| 42 | + |
| 43 | + const { id: prevId } = prevNode; |
| 44 | + |
| 45 | + node.prev = prevId; |
| 46 | + |
| 47 | + return { prevId, node }; |
| 48 | + } catch (e) { |
| 49 | + throw new Error(`insertByIndex 실패 ^^\n${e}`); |
| 50 | + } |
| 51 | + } |
| 52 | + |
| 53 | + deleteByIndex(index: number): RemoteIdentifier { |
| 54 | + try { |
| 55 | + // head deleted |
| 56 | + if (index === 0) { |
| 57 | + if (!this.head) throw new Error('head가 없는데 어떻게 삭제하셨나요 ^^'); |
| 58 | + |
| 59 | + if (!this.head.next) { |
| 60 | + this.head = undefined; |
| 61 | + return null; |
| 62 | + } |
| 63 | + |
| 64 | + this.head.next.prev = null; |
| 65 | + this.head = this.head.next; |
| 66 | + |
| 67 | + return null; |
| 68 | + } |
| 69 | + |
| 70 | + const prevNode = this.findByIndex(index - 1); |
| 71 | + |
| 72 | + const targetNode = prevNode.next; |
| 73 | + |
| 74 | + prevNode.next = targetNode?.next; |
| 75 | + |
| 76 | + if (!targetNode || !targetNode.id) return null; |
| 77 | + |
| 78 | + return targetNode.id; |
| 79 | + } catch (e) { |
| 80 | + throw new Error(`deleteByIndex 실패 ^^\n${e}`); |
| 81 | + } |
| 82 | + } |
| 83 | + |
| 84 | + insertById(id: RemoteIdentifier, node: Node): ModifiedIndex { |
| 85 | + try { |
| 86 | + let prevNode, prevIndex; |
| 87 | + |
| 88 | + // insertion to head |
| 89 | + if (id === null) { |
| 90 | + // 기존 head가 없거나 현재 node가 선행하는 경우 |
| 91 | + if (!this.head || node.precedes(this.head)) { |
| 92 | + node.next = this.head; |
| 93 | + this.head = node; |
| 94 | + |
| 95 | + return null; |
| 96 | + } |
| 97 | + |
| 98 | + prevNode = this.head; |
| 99 | + prevIndex = 0; |
| 100 | + } else { |
| 101 | + let { node: targetNode, index: targetIndex } = this.findById(id); |
| 102 | + |
| 103 | + prevNode = targetNode; |
| 104 | + prevIndex = targetIndex; |
| 105 | + } |
| 106 | + |
| 107 | + // prevNode에 연결된 노드가 현재 node에 선행하는 경우 |
| 108 | + while (prevNode.next && prevNode.next.precedes(node)) { |
| 109 | + prevNode = prevNode.next; |
| 110 | + prevIndex++; |
| 111 | + } |
| 112 | + |
| 113 | + node.next = prevNode.next; |
| 114 | + node.prev = prevNode.id; |
| 115 | + prevNode.next = node; |
| 116 | + |
| 117 | + return prevIndex + 1; |
| 118 | + } catch (e) { |
| 119 | + console.log(`insertById 실패 ^^\n${e}`); |
| 120 | + |
| 121 | + return null; |
| 122 | + } |
| 123 | + } |
| 124 | + |
| 125 | + deleteById(id: RemoteIdentifier): ModifiedIndex { |
| 126 | + try { |
| 127 | + if (!id) { |
| 128 | + if (!this.head) throw new Error('일어날 수 없는 일이 발생했어요 ^^'); |
| 129 | + |
| 130 | + this.head = this.head.next; |
| 131 | + |
| 132 | + return null; |
| 133 | + } |
| 134 | + |
| 135 | + const { node: targetNode, index: targetIndex } = this.findById(id); |
| 136 | + const prevNode = this.findByIndex(targetIndex - 1); |
| 137 | + |
| 138 | + prevNode.next = targetNode.next; |
| 139 | + |
| 140 | + return targetIndex; |
| 141 | + } catch (e) { |
| 142 | + console.log(`deleteById 실패 ^^\n${e}`); |
| 143 | + |
| 144 | + return null; |
| 145 | + } |
| 146 | + } |
| 147 | + |
| 148 | + stringify(): string { |
| 149 | + let node: Node | undefined = this.head; |
| 150 | + let result = ''; |
| 151 | + |
| 152 | + while (node) { |
| 153 | + result += node.value; |
| 154 | + node = node.next; |
| 155 | + } |
| 156 | + |
| 157 | + return result; |
| 158 | + } |
| 159 | + |
| 160 | + private findByIndex(index: number): Node { |
| 161 | + let count = 0; |
| 162 | + let currentNode: Node | undefined = this.head; |
| 163 | + |
| 164 | + while (count < index && currentNode) { |
| 165 | + currentNode = currentNode.next; |
| 166 | + count++; |
| 167 | + } |
| 168 | + |
| 169 | + if (!currentNode) throw new Error('없는 인덱스인데요 ^^'); |
| 170 | + |
| 171 | + return currentNode; |
| 172 | + } |
| 173 | + |
| 174 | + private findById(id: Identifier) { |
| 175 | + let count = 0; |
| 176 | + let currentNode: Node | undefined = this.head; |
| 177 | + |
| 178 | + while (currentNode) { |
| 179 | + if (JSON.stringify(currentNode.id) === JSON.stringify(id)) { |
| 180 | + return { node: currentNode, index: count }; |
| 181 | + } |
| 182 | + |
| 183 | + currentNode = currentNode.next; |
| 184 | + count++; |
| 185 | + } |
| 186 | + |
| 187 | + throw new Error('없는 노드인데요 ^^'); |
| 188 | + } |
| 189 | +} |
0 commit comments