mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2025-01-09 03:01:19 +00:00
5c90038007
* adds feature flag * aggregations/attestation package * better tests * bazel visibility issues * removes redundant code Co-authored-by: prylabs-bulldozer[bot] <58059840+prylabs-bulldozer[bot]@users.noreply.github.com>
104 lines
2.8 KiB
Go
104 lines
2.8 KiB
Go
package attestations
|
|
|
|
import (
|
|
"errors"
|
|
"reflect"
|
|
"testing"
|
|
|
|
ethpb "github.com/prysmaticlabs/ethereumapis/eth/v1alpha1"
|
|
"github.com/prysmaticlabs/go-bitfield"
|
|
"github.com/prysmaticlabs/prysm/shared/aggregation"
|
|
)
|
|
|
|
func TestAggregateAttestations_MaxCover_NewMaxCover(t *testing.T) {
|
|
type args struct {
|
|
atts []*ethpb.Attestation
|
|
}
|
|
tests := []struct {
|
|
name string
|
|
args args
|
|
want *aggregation.MaxCoverProblem
|
|
wantErr bool
|
|
expectedErr error
|
|
}{
|
|
{
|
|
name: "nil attestations",
|
|
args: args{
|
|
atts: nil,
|
|
},
|
|
want: nil,
|
|
wantErr: true,
|
|
expectedErr: ErrInvalidAttestationCount,
|
|
},
|
|
{
|
|
name: "no attestations",
|
|
args: args{
|
|
atts: []*ethpb.Attestation{},
|
|
},
|
|
want: nil,
|
|
wantErr: true,
|
|
expectedErr: ErrInvalidAttestationCount,
|
|
},
|
|
{
|
|
name: "attestations of different bitlist length",
|
|
args: args{
|
|
atts: []*ethpb.Attestation{
|
|
{AggregationBits: bitfield.NewBitlist(64)},
|
|
{AggregationBits: bitfield.NewBitlist(128)},
|
|
},
|
|
},
|
|
want: nil,
|
|
wantErr: true,
|
|
expectedErr: aggregation.ErrBitsDifferentLen,
|
|
},
|
|
{
|
|
name: "single attestation",
|
|
args: args{
|
|
atts: []*ethpb.Attestation{
|
|
{AggregationBits: bitfield.Bitlist{0b00001010, 0b1}},
|
|
},
|
|
},
|
|
want: &aggregation.MaxCoverProblem{
|
|
Candidates: aggregation.MaxCoverCandidates{
|
|
aggregation.NewMaxCoverCandidate(0, &bitfield.Bitlist{0b00001010, 0b1}),
|
|
},
|
|
},
|
|
wantErr: false,
|
|
},
|
|
{
|
|
name: "multiple attestations",
|
|
args: args{
|
|
atts: []*ethpb.Attestation{
|
|
{AggregationBits: bitfield.Bitlist{0b00001010, 0b1}},
|
|
{AggregationBits: bitfield.Bitlist{0b00101010, 0b1}},
|
|
{AggregationBits: bitfield.Bitlist{0b11111010, 0b1}},
|
|
{AggregationBits: bitfield.Bitlist{0b00000010, 0b1}},
|
|
{AggregationBits: bitfield.Bitlist{0b00000001, 0b1}},
|
|
},
|
|
},
|
|
want: &aggregation.MaxCoverProblem{
|
|
Candidates: aggregation.MaxCoverCandidates{
|
|
aggregation.NewMaxCoverCandidate(0, &bitfield.Bitlist{0b00001010, 0b1}),
|
|
aggregation.NewMaxCoverCandidate(1, &bitfield.Bitlist{0b00101010, 0b1}),
|
|
aggregation.NewMaxCoverCandidate(2, &bitfield.Bitlist{0b11111010, 0b1}),
|
|
aggregation.NewMaxCoverCandidate(3, &bitfield.Bitlist{0b00000010, 0b1}),
|
|
aggregation.NewMaxCoverCandidate(4, &bitfield.Bitlist{0b00000001, 0b1}),
|
|
},
|
|
},
|
|
wantErr: false,
|
|
},
|
|
}
|
|
for _, tt := range tests {
|
|
t.Run(tt.name, func(t *testing.T) {
|
|
got, err := NewMaxCover(tt.args.atts)
|
|
if (err != nil) != tt.wantErr || !errors.Is(err, tt.expectedErr) {
|
|
t.Errorf("NewMaxCoverProblem() unexpected error, got: %v, want: %v", err, tt.expectedErr)
|
|
return
|
|
}
|
|
if !reflect.DeepEqual(got, tt.want) {
|
|
t.Errorf("NewMaxCoverProblem() got: %v, want: %v", got, tt.want)
|
|
}
|
|
})
|
|
}
|
|
}
|