Repository navigation
Expand file tree
/
Copy pathnode.go
More file actions
69 lines (63 loc) · 1.36 KB
/
Copy pathnode.go
File metadata and controls
69 lines (63 loc) · 1.36 KB
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
package main
type Node[K comparable, V any] struct {
prev *Node[K, V]
next *Node[K, V]
val V
key K
}
func MoveNode[K comparable, V any](cache *Cache[K, V], node *Node[K, V]) {
if node == nil || cache == nil || node.prev == nil {
return
} else if cache.head == nil {
cache.head = node
cache.tail = node
return
}
if node.next != nil {
node.next.prev = node.prev
node.prev.next = node.next
} else {
node.prev.next = nil
cache.tail = node.prev
}
node.next = cache.head
node.prev = nil
cache.head.prev = node
cache.head = node
}
func RemoveNode[K comparable, V any](node *Node[K, V], cache *Cache[K, V]) {
if node == nil || cache == nil {
return
}
if node == cache.head && node == cache.tail {
cache.tail = nil
cache.head = nil
} else if node == cache.head {
cache.head = node.next
cache.head.prev = nil
} else if node == cache.tail {
cache.tail = node.prev
cache.tail.next = nil
} else {
node.prev.next = node.next
node.next.prev = node.prev
}
node.next = nil
node.prev = nil
delete(cache.buf, node.key)
}
func AddNode[K comparable, V any](node *Node[K, V], cache *Cache[K, V]) {
if node == nil || cache == nil {
return
}
if cache.head == nil && cache.tail == nil {
node.next = nil
node.prev = nil
cache.head = node
cache.tail = node
} else {
cache.head.prev = node
node.next = cache.head
cache.head = node
}
}