Repository navigation
Expand file tree
/
Copy pathuntyped.go
More file actions
145 lines (125 loc) · 2.4 KB
/
Copy pathuntyped.go
File metadata and controls
145 lines (125 loc) · 2.4 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
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
// Package eosc SPDX-License-Identifier: Apache-2.0
package eosc
import (
"sync"
)
type Untyped[K comparable, T any] interface {
Set(k K, v T)
Get(k K) (T, bool)
Del(k K) (T, bool)
Dels(k ...K) []T
List() []T
Keys() []K
All() map[K]T
Clone() Untyped[K, T]
Count() int
}
func BuildUntyped[K comparable, T any]() Untyped[K, T] {
return &tUntyped[K, T]{
data: map[K]T{},
mutex: &sync.RWMutex{},
sort: nil,
}
}
type tUntyped[K comparable, T any] struct {
data map[K]T
sort []K
mutex *sync.RWMutex
}
func (u *tUntyped[K, T]) Count() int {
return len(u.sort)
}
func cloneUntyped[K comparable, T any](data map[K]T, sort []K) *tUntyped[K, T] {
return &tUntyped[K, T]{
data: data,
sort: sort,
mutex: &sync.RWMutex{},
}
}
func (u *tUntyped[K, T]) Dels(names ...K) []T {
if len(names) == 0 {
return nil
}
rs := make([]T, 0, len(names))
u.mutex.Lock()
defer u.mutex.Unlock()
for _, name := range names {
v, ok := u.data[name]
if ok {
u.sort = remove(u.sort, name)
delete(u.data, name)
}
rs = append(rs, v)
}
return rs
}
func (u *tUntyped[K, T]) Del(name K) (T, bool) {
u.mutex.Lock()
v, ok := u.data[name]
if ok {
u.sort = remove(u.sort, name)
delete(u.data, name)
}
u.mutex.Unlock()
return v, ok
}
func (u *tUntyped[K, T]) Set(name K, v T) {
u.mutex.Lock()
_, has := u.data[name]
if !has {
u.sort = append(u.sort, name)
}
u.data[name] = v
u.mutex.Unlock()
}
func (u *tUntyped[K, T]) Get(name K) (T, bool) {
u.mutex.RLock()
v, ok := u.data[name]
u.mutex.RUnlock()
return v, ok
}
func (u *tUntyped[K, T]) Clone() Untyped[K, T] {
u.mutex.RLock()
res := make(map[K]T, len(u.data))
for k, v := range u.data {
res[k] = v
}
sort := make([]K, len(u.sort))
copy(sort, u.sort)
u.mutex.RUnlock()
return cloneUntyped(res, sort)
}
func (u *tUntyped[K, T]) All() map[K]T {
u.mutex.RLock()
res := make(map[K]T, len(u.data))
for k, v := range u.data {
res[k] = v
}
u.mutex.RUnlock()
return res
}
func (u *tUntyped[K, T]) Keys() []K {
u.mutex.RLock()
res := make([]K, len(u.data))
copy(res, u.sort)
u.mutex.RUnlock()
return res
}
func (u *tUntyped[K, T]) List() []T {
u.mutex.RLock()
res := make([]T, len(u.data))
for i, k := range u.sort {
res[i] = u.data[k]
}
u.mutex.RUnlock()
return res
}
func remove[K comparable](src []K, t K) []K {
for i, v := range src {
if v == t {
copy(src[i:], src[i+1:])
return src[:len(src)-1]
}
}
return src
}