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
|
package client
import (
"fmt"
"sync"
)
// channels is a generic structure that holds a map of keys and channels.
// It is protected by mutex
type channels[K comparable, V any] struct {
sync.Mutex
chans map[K]chan<- V
bufferSize int
}
// newChannels creates a new channels
func newChannels[K comparable, V any](bufferSize int) channels[K, V] {
chans := make(map[K]chan<- V)
return channels[K, V]{
chans: chans,
bufferSize: bufferSize,
}
}
// add adds a new channel and returns the receiving channel
func (c *channels[K, V]) add(key K) <-chan V {
c.Lock()
defer c.Unlock()
ch := make(chan V, c.bufferSize)
c.chans[key] = ch
return ch
}
// length returns the number of channels
func (c *channels[K, V]) length() int {
c.Lock()
defer c.Unlock()
return len(c.chans)
}
// notify notifies the channel with the given key
func (c *channels[K, V]) notify(key K, msg V) error {
c.Lock()
defer c.Unlock()
if ch, ok := c.chans[key]; ok {
ch <- msg
return nil
}
return fmt.Errorf("Channel not found")
}
// remove removes and returns the channel.
func (c *channels[K, V]) remove(key K) chan<- V {
c.Lock()
defer c.Unlock()
if ch, ok := c.chans[key]; ok {
delete(c.chans, key)
return ch
}
return nil
}
// clear close all the channels and remove them from the map
func (c *channels[K, V]) clear() {
c.Lock()
defer c.Unlock()
for k, ch := range c.chans {
close(ch)
delete(c.chans, k)
}
}
|
