mirror of
https://github.com/crazybber/awesome-patterns.git
synced 2024-11-25 06:16:03 +03:00
pub sub
This commit is contained in:
parent
08f341f9af
commit
baaf67974d
31
channel/producer_consumer/main.go
Normal file
31
channel/producer_consumer/main.go
Normal file
@ -0,0 +1,31 @@
|
||||
package main
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"os"
|
||||
"os/signal"
|
||||
"syscall"
|
||||
)
|
||||
|
||||
func main() {
|
||||
ch := make(chan int, 64) // 成果队列
|
||||
go Producer(3, ch) // 生成 3 的倍数的序列
|
||||
go Producer(5, ch) // 生成 5 的倍数的序列
|
||||
go Consumer(ch) // 消费 生成的队列
|
||||
// Ctrl+C 退出
|
||||
sig := make(chan os.Signal, 1)
|
||||
signal.Notify(sig, syscall.SIGINT, syscall.SIGTERM)
|
||||
fmt.Printf("quit (%v)\n", <-sig)
|
||||
}
|
||||
|
||||
func Producer(factor int, out chan<- int) {
|
||||
for i := 0; ; i++ {
|
||||
out <- i * factor
|
||||
}
|
||||
}
|
||||
|
||||
func Consumer(in <-chan int) {
|
||||
for v := range in {
|
||||
fmt.Println(v)
|
||||
}
|
||||
}
|
117
channel/pubsub/main.go
Normal file
117
channel/pubsub/main.go
Normal file
@ -0,0 +1,117 @@
|
||||
package main
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"strings"
|
||||
"sync"
|
||||
"time"
|
||||
)
|
||||
|
||||
/**在发布订阅模型中,每条消息都会传送给多个订阅者。发布者通常不会知道、也不关心哪一
|
||||
个订阅者正在接收主题消息。订阅者和发布者可以在运行时动态添加是一种松散的耦合关
|
||||
心,这使得系统的复杂性可以随时间的推移而增长。在现实生活中,不同城市的象天气预报
|
||||
之类的应用就可以应用这个并发模式。
|
||||
*/
|
||||
func main() {
|
||||
p := NewPublisher(100*time.Millisecond, 10)
|
||||
defer p.Close()
|
||||
all := p.SubscribeTopic(nil)
|
||||
golang := p.SubscribeTopic(func(v interface{}) bool {
|
||||
if s, ok := v.(string); ok {
|
||||
return strings.Contains(s, "golang")
|
||||
}
|
||||
return false
|
||||
})
|
||||
p.Publish("hello, world!")
|
||||
p.Publish("hello, golang!")
|
||||
go func() {
|
||||
for msg := range all {
|
||||
fmt.Println("all:", msg)
|
||||
}
|
||||
}()
|
||||
go func() {
|
||||
for msg := range golang {
|
||||
fmt.Println("golang:", msg)
|
||||
}
|
||||
}()
|
||||
// 运行一定时间后退出
|
||||
time.Sleep(3 * time.Second)
|
||||
}
|
||||
|
||||
type (
|
||||
subscriber chan interface{} // 订阅者为一个管道
|
||||
topicFunc func(v interface{}) bool // 主题为一个过滤器
|
||||
)
|
||||
|
||||
// 发布者对象
|
||||
type Publisher struct {
|
||||
m sync.RWMutex // 读写锁
|
||||
buffer int // 订阅队列的缓存大小
|
||||
timeout time.Duration // 发布超时时间
|
||||
subscribers map[subscriber]topicFunc // 订阅者信息
|
||||
}
|
||||
|
||||
// 构建一个发布者对象, 可以设置发布超时时间和缓存队列的长度
|
||||
func NewPublisher(publishTimeout time.Duration, buffer int) *Publisher {
|
||||
return &Publisher{
|
||||
buffer: buffer,
|
||||
timeout: publishTimeout,
|
||||
subscribers: make(map[subscriber]topicFunc),
|
||||
}
|
||||
}
|
||||
|
||||
// 添加一个新的订阅者,订阅全部主题
|
||||
func (p *Publisher) Subscribe() chan interface{} {
|
||||
return p.SubscribeTopic(nil)
|
||||
}
|
||||
|
||||
// 添加一个新的订阅者,订阅过滤器筛选后的主题
|
||||
func (p *Publisher) SubscribeTopic(topic topicFunc) chan interface{} {
|
||||
ch := make(chan interface{}, p.buffer)
|
||||
p.m.Lock()
|
||||
p.subscribers[ch] = topic
|
||||
p.m.Unlock()
|
||||
return ch
|
||||
}
|
||||
|
||||
// 退出订阅
|
||||
func (p *Publisher) Evict(sub chan interface{}) {
|
||||
p.m.Lock()
|
||||
defer p.m.Unlock()
|
||||
delete(p.subscribers, sub)
|
||||
close(sub)
|
||||
}
|
||||
|
||||
// 发布一个主题
|
||||
func (p *Publisher) Publish(v interface{}) {
|
||||
p.m.RLock()
|
||||
defer p.m.RUnlock()
|
||||
var wg sync.WaitGroup
|
||||
for sub, topic := range p.subscribers {
|
||||
wg.Add(1)
|
||||
go p.sendTopic(sub, topic, v, &wg)
|
||||
}
|
||||
wg.Wait()
|
||||
}
|
||||
|
||||
// 关闭发布者对象,同时关闭所有的订阅者管道。
|
||||
func (p *Publisher) Close() {
|
||||
p.m.Lock()
|
||||
defer p.m.Unlock()
|
||||
for sub := range p.subscribers {
|
||||
delete(p.subscribers, sub)
|
||||
close(sub)
|
||||
}
|
||||
}
|
||||
|
||||
// 发送主题,可以容忍一定的超时
|
||||
func (p *Publisher) sendTopic(sub subscriber, topic topicFunc, v interface{}, wg *sync.WaitGroup) {
|
||||
defer wg.Done()
|
||||
if topic != nil && !topic(v) {
|
||||
return
|
||||
}
|
||||
select {
|
||||
case sub <- v:
|
||||
case <-time.After(p.timeout):
|
||||
}
|
||||
}
|
Loading…
Reference in New Issue
Block a user