@@ -98,32 +98,32 @@ func (n *node) isDeletingDependents() bool {
98
98
return n .deletingDependents
99
99
}
100
100
101
- func (ownerNode * node ) addDependent (dependent * node ) {
102
- ownerNode .dependentsLock .Lock ()
103
- defer ownerNode .dependentsLock .Unlock ()
104
- ownerNode .dependents [dependent ] = struct {}{}
101
+ func (n * node ) addDependent (dependent * node ) {
102
+ n .dependentsLock .Lock ()
103
+ defer n .dependentsLock .Unlock ()
104
+ n .dependents [dependent ] = struct {}{}
105
105
}
106
106
107
- func (ownerNode * node ) deleteDependent (dependent * node ) {
108
- ownerNode .dependentsLock .Lock ()
109
- defer ownerNode .dependentsLock .Unlock ()
110
- delete (ownerNode .dependents , dependent )
107
+ func (n * node ) deleteDependent (dependent * node ) {
108
+ n .dependentsLock .Lock ()
109
+ defer n .dependentsLock .Unlock ()
110
+ delete (n .dependents , dependent )
111
111
}
112
112
113
- func (ownerNode * node ) dependentsLength () int {
114
- ownerNode .dependentsLock .RLock ()
115
- defer ownerNode .dependentsLock .RUnlock ()
116
- return len (ownerNode .dependents )
113
+ func (n * node ) dependentsLength () int {
114
+ n .dependentsLock .RLock ()
115
+ defer n .dependentsLock .RUnlock ()
116
+ return len (n .dependents )
117
117
}
118
118
119
119
// Note that this function does not provide any synchronization guarantees;
120
120
// items could be added to or removed from ownerNode.dependents the moment this
121
121
// function returns.
122
- func (ownerNode * node ) getDependents () []* node {
123
- ownerNode .dependentsLock .RLock ()
124
- defer ownerNode .dependentsLock .RUnlock ()
122
+ func (n * node ) getDependents () []* node {
123
+ n .dependentsLock .RLock ()
124
+ defer n .dependentsLock .RUnlock ()
125
125
var ret []* node
126
- for dep := range ownerNode .dependents {
126
+ for dep := range n .dependents {
127
127
ret = append (ret , dep )
128
128
}
129
129
return ret
0 commit comments