2020-10-25 20:18:24 +01:00
|
|
|
package main
|
|
|
|
|
|
|
|
|
|
import "time"
|
|
|
|
|
|
2020-10-29 17:05:40 +01:00
|
|
|
const txSeqBufLength = 300 * time.Millisecond
|
2020-10-29 15:55:21 +01:00
|
|
|
|
2020-10-25 20:18:24 +01:00
|
|
|
type txSeqBufStruct struct {
|
|
|
|
|
entries []seqBufEntry
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func (s *txSeqBufStruct) add(seq seqNum, p []byte) {
|
|
|
|
|
s.entries = append(s.entries, seqBufEntry{
|
|
|
|
|
seq: seq,
|
|
|
|
|
data: p,
|
|
|
|
|
addedAt: time.Now(),
|
|
|
|
|
})
|
|
|
|
|
s.purgeOldEntries()
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func (s *txSeqBufStruct) purgeOldEntries() {
|
2020-10-29 17:05:40 +01:00
|
|
|
for len(s.entries) > 0 && time.Since(s.entries[0].addedAt) > txSeqBufLength*2 {
|
2020-10-25 20:18:24 +01:00
|
|
|
s.entries = s.entries[1:]
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
func (s *txSeqBufStruct) get(seq seqNum) (d []byte) {
|
|
|
|
|
if len(s.entries) == 0 {
|
|
|
|
|
return nil
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Searching from backwards, as we expect most queries for latest entries.
|
|
|
|
|
for i := len(s.entries) - 1; i >= 0; i-- {
|
|
|
|
|
if s.entries[i].seq == seq {
|
|
|
|
|
d = s.entries[i].data
|
|
|
|
|
break
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
s.purgeOldEntries()
|
|
|
|
|
return d
|
|
|
|
|
}
|