forked from knownsec/ksubdomain
-
Notifications
You must be signed in to change notification settings - Fork 0
/
localStruct.go
85 lines (76 loc) · 1.76 KB
/
localStruct.go
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
package core
import (
"errors"
"sync"
"time"
)
type (
LocalStruct struct {
items []localNode
lock sync.RWMutex
}
localNode struct {
v StatusTable
index uint32
}
LocalRetryStruct struct {
v StatusTable
index uint32
}
)
// Create a new stack
func NewLocalStruct() *LocalStruct {
return &LocalStruct{[]localNode{}, sync.RWMutex{}}
}
// Return the number of items in the stack
func (this *LocalStruct) Len() int {
this.lock.RLock()
defer this.lock.RUnlock()
return len(this.items)
}
func (this *LocalStruct) Empty() bool {
return this.Len() == 0
}
func (this *LocalStruct) Append(node *StatusTable, index uint32) {
this.lock.Lock()
defer this.lock.Unlock()
newNode := localNode{*node, index}
this.items = append(this.items, newNode)
}
// 搜索并删除节点
func (this *LocalStruct) SearchFromIndexAndDelete(index uint32) (LocalRetryStruct, error) {
this.lock.Lock()
defer this.lock.Unlock()
for i := 0; i < len(this.items); i++ {
if this.items[i].index == index {
ret := LocalRetryStruct{this.items[i].v, index}
this.items = append(this.items[:i], this.items[i+1:]...)
return ret, nil
}
}
return LocalRetryStruct{}, errors.New("data not found")
}
// 从链表中取出超时的数据,可选每次取出最多多少数据
func (this *LocalStruct) GetTimeoutData(max int) []LocalRetryStruct {
this.lock.Lock()
defer this.lock.Unlock()
currentTime := time.Now().Unix()
index := 0
var tables []LocalRetryStruct
j := 0
for i := 0; i < len(this.items); i++ {
if currentTime-this.items[i].v.Time < 5 {
break
}
if index > max {
break
}
index++
j = i
tables = append(tables, LocalRetryStruct{this.items[i].v, this.items[i].index})
}
if len(tables) > 0 {
this.items = append(this.items[j+1:])
}
return tables
}