-
Notifications
You must be signed in to change notification settings - Fork 26
/
Copy pathLinkedList.ps1
162 lines (127 loc) · 3.79 KB
/
LinkedList.ps1
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
. $PSScriptRoot\LinkedListNode.ps1
. $PSScriptRoot\..\..\utils\comparator\Comparator.ps1
class LinkedList {
$head
$tail
$compare
# default ctor
LinkedList() {
$this.compare = New-Object Comparator
}
LinkedList($comparatorFunction) {
$this.compare = New-Object Comparator $comparatorFunction
}
[object] Append($value) {
$newNode = New-Object LinkedListNode $value
# If there is no head yet let's make new node a head.
if (!$this.head) {
$this.head = $newNode
$this.tail = $newNode
return $this
}
# Attach new node to the end of linked list.
$this.tail.next = $newNode
$this.tail = $newNode
return $this
}
[object] Prepend($value) {
# Make new node to be a head.
$this.head = New-Object LinkedListNode $value, $this.head
return $this
}
hidden [object] Find($value, [scriptblock]$callback) {
if (!$this.head) {
return $null
}
$currentNode = $this.head
while ($currentNode) {
if ($callback -and (&$callback $currentNode.value)) {
return $currentNode
}
if ($value -ne $null -and $this.compare.equal($currentNode.value, $value)) {
return $currentNode
}
$currentNode = $currentNode.next
}
return $null
}
[object] deleteHead() {
if (!$this.head) {
return $null
}
$deletedHead = $this.head
if ($this.head.next) {
$this.head = $this.head.next
}
else {
$this.head = $null
$this.tail = $null
}
return $deletedHead;
}
[object] deleteTail() {
if ($this.head -eq $this.tail) {
$deletedTail = $this.tail
$this.head = $null
$this.tail = $null
return $deletedTail
}
$deletedTail = $this.tail
# Rewind to the last node and delete "next" link for the node before the last one.
$currentNode = $this.head
while ($currentNode.next) {
if (!$currentNode.next.next) {
$currentNode.next = $null
}
else {
$currentNode = $currentNode.next
}
}
$this.tail = $currentNode
return $deletedTail
}
[object] Delete($value) {
if (!$this.head) {
return $null
}
$deletedNode = $null
# If the head must be deleted then make 2nd node to be a head.
while ($this.head -and ($this.head.value -eq $value)) {
$deletedNode = $this.head
$this.head = $this.head.next
}
$currentNode = $this.head
if ($currentNode -ne $null) {
# If next node must be deleted then make next node to be a next next one.
while ($currentNode.next) {
if ($currentNode.next.value -eq $value) {
$deletedNode = $currentNode.next
$currentNode.next = $currentNode.next.next
}
else {
$currentNode = $currentNode.next
}
}
}
# Check if tail must be deleted.
if ($this.tail.value -eq $value) {
$this.tail = $currentNode
}
return $deletedNode
}
[object] ToArray() {
$nodes = @()
$currentNode = $this.head
while ($currentNode) {
$nodes += ($currentNode)
$currentNode = $currentNode.next
}
return $nodes
}
[string] ToString() {
return $this.ToString($null)
}
[string] ToString($callback) {
return ($this.ToArray() -join ",")
}
}