/
linklist.go
129 lines (111 loc) · 2.24 KB
/
linklist.go
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
// Copyright 2021 Matrix Origin
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package common
import "sync"
type ISLLNode interface {
IRef
}
type ISSLLNode interface {
Insert(ISSLLNode)
GetNext() ISSLLNode
SetNext(ISSLLNode)
ReleaseNextNode() ISSLLNode
ReleaseFollowing() ISSLLNode
}
type SSLLNode struct {
next ISSLLNode
}
func NewSSLLNode() *SSLLNode {
return new(SSLLNode)
}
func (n *SSLLNode) Insert(nn ISSLLNode) {
next := n.next
n.next = nn
nn.SetNext(next)
}
func (n *SSLLNode) SetNext(next ISSLLNode) {
n.next = next
}
func (n *SSLLNode) GetNext() ISSLLNode {
return n.next
}
func (n *SSLLNode) ReleaseNextNode() ISSLLNode {
if n.next != nil {
next := n.next.GetNext()
r := n.next
n.next = next
return r
}
return nil
}
func (n *SSLLNode) ReleaseFollowing() ISSLLNode {
if n.next != nil {
next := n.next
n.next = nil
return next
}
return nil
}
// SLLNode represent a single node in linked list.
// It is thread-safe.
type SLLNode struct {
RefHelper
*sync.RWMutex
Next ISLLNode
}
func NewSLLNode(mu *sync.RWMutex) *SLLNode {
mtx := mu
if mtx == nil {
mtx = &sync.RWMutex{}
}
return &SLLNode{
RWMutex: mtx,
}
}
func (l *SLLNode) SetNextNode(next ISLLNode) {
l.Lock()
defer l.Unlock()
l.SetNextNodeNoLock(next)
}
func (l *SLLNode) SetNextNodeNoLock(next ISLLNode) {
if l.Next != nil {
l.Next.Unref()
}
l.Next = next
}
func (l *SLLNode) Insert(n ISLLNode) {
l.Lock()
defer l.Unlock()
next := l.Next
l.Next = n
n.(*SLLNode).Next = next
}
func (l *SLLNode) GetNextNode() ISLLNode {
var r ISLLNode
l.RLock()
if l.Next != nil {
l.Next.Ref()
r = l.Next
}
l.RUnlock()
return r
}
func (l *SLLNode) ReleaseNextNode() {
l.Lock()
defer l.Unlock()
if l.Next != nil {
l.Next.Unref()
l.Next = nil
}
}