add backend

dot/parachain/dispute/backend.go

@@ -41,10 +41,11 @@ type Dispute struct {
 	disputeStatus *Status
 }
 
-func NewCandidateVotes() *CandidateVotes {
-	return &CandidateVotes{
-		valid:   treemap.NewWithIntComparator(),
-		invalid: treemap.NewWithIntComparator(),
+func NewCandidateVotesFromReceipt(receipt parachain.CandidateReceipt) CandidateVotes {
+	return CandidateVotes{
+		valid:            treemap.NewWithIntComparator(),
+		invalid:          treemap.NewWithIntComparator(),
+		candidateReceipt: receipt,
 	}
 }
 
@@ -133,7 +134,7 @@ type Backend interface {
 	GetCandidateVotes(session parachain.SessionIndex, candidateHash CandidateHash) (*CandidateVotes, error)
 
 	// GetActiveDisputes returns the active disputes, if any.
-	GetActiveDisputes() (*btree.BTree, error)
+	GetActiveDisputes(now int64) (*btree.BTree, error)
 
 	// TODO: need to explore further to see if we need these
 	SetEarliestSession(session parachain.SessionIndex)
@@ -202,13 +203,13 @@ func (b backend) SetCandidateVotes(session parachain.SessionIndex, candidateHash
 
 const ActiveDuration = 180 * time.Second
 
-func (b backend) GetActiveDisputes() (*btree.BTree, error) {
+func (b backend) GetActiveDisputes(now int64) (*btree.BTree, error) {
 	activeDisputes := btree.New(32)
 
 	b.recentDisputes.Ascend(func(i btree.Item) bool {
 		d := i.(*Dispute)
 		concludedAt, err := d.disputeStatus.ConcludedAt()
-		if err == nil && concludedAt != nil && *concludedAt+uint64(ActiveDuration.Seconds()) > uint64(time.Now().Unix()) {
+		if err == nil && concludedAt != nil && *concludedAt+uint64(ActiveDuration.Seconds()) > uint64(now) {
 			activeDisputes.ReplaceOrInsert(d)
 		}
 		return true