You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
|
|
|
package tools
|
|
|
|
|
|
|
|
import (
|
|
|
|
"log"
|
|
|
|
"time"
|
|
|
|
)
|
|
|
|
|
|
|
|
var LimitQueue map[string][]int64
|
|
|
|
var ok bool
|
|
|
|
|
|
|
|
func init() {
|
|
|
|
cleanLimitQueue()
|
|
|
|
}
|
|
|
|
func cleanLimitQueue() {
|
|
|
|
go func() {
|
|
|
|
for {
|
|
|
|
log.Println("cleanLimitQueue start...")
|
|
|
|
LimitQueue = nil
|
|
|
|
now := time.Now()
|
|
|
|
// 计算下一个零点
|
|
|
|
next := now.Add(time.Hour * 24)
|
|
|
|
next = time.Date(next.Year(), next.Month(), next.Day(), 0, 0, 0, 0, next.Location())
|
|
|
|
t := time.NewTimer(next.Sub(now))
|
|
|
|
<-t.C
|
|
|
|
}
|
|
|
|
}()
|
|
|
|
}
|
|
|
|
|
|
|
|
//单机时间滑动窗口限流法
|
|
|
|
func LimitFreqSingle(queueName string, count uint, timeWindow int64) bool {
|
|
|
|
currTime := time.Now().Unix()
|
|
|
|
if LimitQueue == nil {
|
|
|
|
LimitQueue = make(map[string][]int64)
|
|
|
|
}
|
|
|
|
if _, ok = LimitQueue[queueName]; !ok {
|
|
|
|
LimitQueue[queueName] = make([]int64, 0)
|
|
|
|
}
|
|
|
|
//队列未满
|
|
|
|
if uint(len(LimitQueue[queueName])) < count {
|
|
|
|
LimitQueue[queueName] = append(LimitQueue[queueName], currTime)
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
//队列满了,取出最早访问的时间
|
|
|
|
earlyTime := LimitQueue[queueName][0]
|
|
|
|
//说明最早期的时间还在时间窗口内,还没过期,所以不允许通过
|
|
|
|
if currTime-earlyTime <= timeWindow {
|
|
|
|
return false
|
|
|
|
} else {
|
|
|
|
//说明最早期的访问应该过期了,去掉最早期的
|
|
|
|
LimitQueue[queueName] = LimitQueue[queueName][1:]
|
|
|
|
LimitQueue[queueName] = append(LimitQueue[queueName], currTime)
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|