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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
|
// Copyright 2022 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
package cache
import (
"strings"
"golang.org/x/tools/gopls/internal/lsp/source"
"golang.org/x/tools/gopls/internal/span"
"golang.org/x/tools/internal/persistent"
)
// TODO(euroelessar): Use generics once support for go1.17 is dropped.
type filesMap struct {
impl *persistent.Map
}
// uriLessInterface is the < relation for "any" values containing span.URIs.
func uriLessInterface(a, b interface{}) bool {
return a.(span.URI) < b.(span.URI)
}
func newFilesMap() filesMap {
return filesMap{
impl: persistent.NewMap(uriLessInterface),
}
}
func (m filesMap) Clone() filesMap {
return filesMap{
impl: m.impl.Clone(),
}
}
func (m filesMap) Destroy() {
m.impl.Destroy()
}
func (m filesMap) Get(key span.URI) (source.FileHandle, bool) {
value, ok := m.impl.Get(key)
if !ok {
return nil, false
}
return value.(source.FileHandle), true
}
func (m filesMap) Range(do func(key span.URI, value source.FileHandle)) {
m.impl.Range(func(key, value interface{}) {
do(key.(span.URI), value.(source.FileHandle))
})
}
func (m filesMap) Set(key span.URI, value source.FileHandle) {
m.impl.Set(key, value, nil)
}
func (m filesMap) Delete(key span.URI) {
m.impl.Delete(key)
}
func parseKeyLessInterface(a, b interface{}) bool {
return parseKeyLess(a.(parseKey), b.(parseKey))
}
func parseKeyLess(a, b parseKey) bool {
if a.mode != b.mode {
return a.mode < b.mode
}
if a.file.Hash != b.file.Hash {
return a.file.Hash.Less(b.file.Hash)
}
return a.file.URI < b.file.URI
}
type isActivePackageCacheMap struct {
impl *persistent.Map
}
func newIsActivePackageCacheMap() isActivePackageCacheMap {
return isActivePackageCacheMap{
impl: persistent.NewMap(func(a, b interface{}) bool {
return a.(PackageID) < b.(PackageID)
}),
}
}
func (m isActivePackageCacheMap) Clone() isActivePackageCacheMap {
return isActivePackageCacheMap{
impl: m.impl.Clone(),
}
}
func (m isActivePackageCacheMap) Destroy() {
m.impl.Destroy()
}
func (m isActivePackageCacheMap) Get(key PackageID) (bool, bool) {
value, ok := m.impl.Get(key)
if !ok {
return false, false
}
return value.(bool), true
}
func (m isActivePackageCacheMap) Set(key PackageID, value bool) {
m.impl.Set(key, value, nil)
}
type parseKeysByURIMap struct {
impl *persistent.Map
}
func newParseKeysByURIMap() parseKeysByURIMap {
return parseKeysByURIMap{
impl: persistent.NewMap(uriLessInterface),
}
}
func (m parseKeysByURIMap) Clone() parseKeysByURIMap {
return parseKeysByURIMap{
impl: m.impl.Clone(),
}
}
func (m parseKeysByURIMap) Destroy() {
m.impl.Destroy()
}
func (m parseKeysByURIMap) Get(key span.URI) ([]parseKey, bool) {
value, ok := m.impl.Get(key)
if !ok {
return nil, false
}
return value.([]parseKey), true
}
func (m parseKeysByURIMap) Range(do func(key span.URI, value []parseKey)) {
m.impl.Range(func(key, value interface{}) {
do(key.(span.URI), value.([]parseKey))
})
}
func (m parseKeysByURIMap) Set(key span.URI, value []parseKey) {
m.impl.Set(key, value, nil)
}
func (m parseKeysByURIMap) Delete(key span.URI) {
m.impl.Delete(key)
}
func packageKeyLessInterface(x, y interface{}) bool {
return packageKeyLess(x.(packageKey), y.(packageKey))
}
func packageKeyLess(x, y packageKey) bool {
if x.mode != y.mode {
return x.mode < y.mode
}
return x.id < y.id
}
type knownDirsSet struct {
impl *persistent.Map
}
func newKnownDirsSet() knownDirsSet {
return knownDirsSet{
impl: persistent.NewMap(func(a, b interface{}) bool {
return a.(span.URI) < b.(span.URI)
}),
}
}
func (s knownDirsSet) Clone() knownDirsSet {
return knownDirsSet{
impl: s.impl.Clone(),
}
}
func (s knownDirsSet) Destroy() {
s.impl.Destroy()
}
func (s knownDirsSet) Contains(key span.URI) bool {
_, ok := s.impl.Get(key)
return ok
}
func (s knownDirsSet) Range(do func(key span.URI)) {
s.impl.Range(func(key, value interface{}) {
do(key.(span.URI))
})
}
func (s knownDirsSet) SetAll(other knownDirsSet) {
s.impl.SetAll(other.impl)
}
func (s knownDirsSet) Insert(key span.URI) {
s.impl.Set(key, nil, nil)
}
func (s knownDirsSet) Remove(key span.URI) {
s.impl.Delete(key)
}
// analysisKeyLessInterface is the less-than relation for analysisKey
// values wrapped in an interface.
func analysisKeyLessInterface(a, b interface{}) bool {
x, y := a.(analysisKey), b.(analysisKey)
if cmp := strings.Compare(x.analyzerNames, y.analyzerNames); cmp != 0 {
return cmp < 0
}
return x.pkgid < y.pkgid
}
|
