golang heap container balance request

package main
import (
	"container/heap"
	"fmt"
	"log"
	"math/rand"
	"time"
)
const (
	MaxQueueLength = 10
	MaxRequesters = 2
	Seconds = 2e9
)
type Request func()
func main() {
	requests := make(chan Request)
	for i := 0; i < MaxRequesters; i++ {
		go requester(requests)
	}
	NewBalancer(2).Balance(requests)
}
func requester(work chan Request) {
	for {
		time.Sleep(time.Duration(rand.Int63n(MaxRequesters * Seconds)))
		work <- func() {
			r := rand.Int63n(MaxRequesters*Seconds) + 10
			time.Sleep(time.Duration(r))
		}
	}
}
func NewBalancer(size int) *Balancer {
	done := make(chan *Worker, size)
	b := &Balancer{
		pool: make(Pool, 0, size),
		done: done,
	}
	for i := 0; i < size; i++ {
		w := &Worker{id: i, requests: make(chan Request, MaxQueueLength)}
		heap.Push(&b.pool, w)
		go w.work(done)
	}
	return b
}
type Balancer struct {
	pool Pool
	done chan *Worker
}
func (b *Balancer) Balance(requests chan Request) {
	for {
		select {
		case req := <-requests:
			b.dispatch(req)
			log.Printf("New request, %s", b.pool)
		case w := <-b.done:
			b.completed(w)
			log.Printf("Request finished, %s", b.pool)
		}
	}
}
func (b *Balancer) dispatch(req Request) {
	w := heap.Pop(&b.pool).(*Worker)
	w.requests <- req
	w.pending++
	heap.Push(&b.pool, w)
}
// drain the heap
func (b *Balancer) completed(w *Worker) {
	w.pending--
	heap.Remove(&b.pool, w.index)
	heap.Push(&b.pool, w)
}
type Pool []*Worker
type Worker struct {
	id int
	pending int
	requests chan Request
	index int
}
func (w *Worker) work(done chan *Worker) {
	for {
		req := <-w.requests //req is therefore of type Request, it is a function
		req() //we execute it!
		done <- w
	}
}
func (w *Worker) String() string {
	return fmt.Sprintf("W%d{pending: %d}", w.id, w.pending)
}
func (p Pool) Len() int {
	return len(p)
}
func (p Pool) Less(i, j int) bool {
	return p[i].pending < p[j].pending
}
func (p *Pool) Swap(i, j int) {
	a := *p
	a[i], a[j] = a[j], a[i]
	a[i].index = i
	a[j].index = j
}
func (p *Pool) Push(i interface{}) {
	w := i.(*Worker)
	a := *p
	n := len(a)
	w.index = n
	a = append(a, w)
	*p = a
}
func (p *Pool) Pop() interface{} {
	a := *p
	n := len(a)
	w := a[n-1]
	w.index = -1
	*p = a[0 : n-1]
	return w
}

heap 作为一种数据结构,不要和操作系统里面的堆栈之类的搞混。

常见的用法为堆排序以及优先级队列

关键的操作是堆的初始化,以及插入元素和删除元素

+10
level:2
exp:20/50

本文来自:博客园

感谢作者:bnbqian

查看原文:golang heap container balance request

• 编辑
• 预览