Mirroristas/kaspad
2
0
Fork 0
mirror of https://github.com/kaspanet/kaspad.git synced 2025-06-02 04:06:42 +00:00
Code Issues Packages Projects Releases Wiki Activity
kaspad/domain/consensus/model/reachabilitydata_equal_clone_test.go
Svarog 05941a76e7
Make DomainHash and TransactionID read-only structs (#1282) 
* Increase size of reachability cache

* Change DomainHash to struct with unexported hashArray

* Fixing compilation errors stemming from new DomainHash structure

* Remove obsolete Read/WriteElement methods in appmessage

* Fix all tests

* Fix all tests

* Add comments

* A few renamings

* go mod tidy
2020-12-24 16:15:23 +02:00

355 lines
12 KiB
Go
Raw Blame History

package model
import (
"reflect"
"testing"
"github.com/kaspanet/kaspad/domain/consensus/model/externalapi"
)
func TestReachabilityData_Equal(t *testing.T) {
type dataToCompare struct {
data *ReachabilityData
expectedResult bool
}
tests := []struct {
baseData *ReachabilityData
dataToCompareTo []dataToCompare
}{
// Test nil data
{
baseData: nil,
dataToCompareTo: nil,
},
// Test empty data
{
baseData: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
&externalapi.DomainHash{},
&ReachabilityInterval{},
},
FutureCoveringTreeNodeSet{},
},
dataToCompareTo: []dataToCompare{
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
&externalapi.DomainHash{},
&ReachabilityInterval{},
},
FutureCoveringTreeNodeSet{},
},
expectedResult: true,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2}),
}, // Changed
&externalapi.DomainHash{},
&ReachabilityInterval{},
},
FutureCoveringTreeNodeSet{},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}), // Changed
&ReachabilityInterval{},
},
FutureCoveringTreeNodeSet{},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
&externalapi.DomainHash{},
&ReachabilityInterval{100, 0}, // Changed start
},
FutureCoveringTreeNodeSet{},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
&externalapi.DomainHash{},
&ReachabilityInterval{0, 100}, // Changed end
},
FutureCoveringTreeNodeSet{},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
&externalapi.DomainHash{},
&ReachabilityInterval{},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})}, // Changed
},
expectedResult: false,
},
},
},
// Test filled data
{
baseData: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{3})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
dataToCompareTo: []dataToCompare{
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{3})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
expectedResult: true,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{3})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{}, // Changed
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{3})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{200, 200}, // Changed start
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{3})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
nil, //Changed
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{3})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 100}, // Changed end
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{}, // Changed
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
&externalapi.DomainHash{}, // Changed
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{}, // Changed
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
expectedResult: false,
},
{
data: &ReachabilityData{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{}, // Changed
},
expectedResult: false,
},
{
data: &ReachabilityData{
nil,
FutureCoveringTreeNodeSet{},
},
expectedResult: false,
},
{
data: nil,
expectedResult: false,
},
},
},
}
for i, test := range tests {
for j, subTest := range test.dataToCompareTo {
result1 := test.baseData.Equal(subTest.data)
if result1 != subTest.expectedResult {
t.Fatalf("Test #%d:%d: Expected %t but got %t", i, j, subTest.expectedResult, result1)
}
result2 := subTest.data.Equal(test.baseData)
if result2 != subTest.expectedResult {
t.Fatalf("Test #%d:%d: Expected %t but got %t", i, j, subTest.expectedResult, result2)
}
}
}
}
func TestReachabilityData_Clone(t *testing.T) {
testData := []*ReachabilityData{
{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
&externalapi.DomainHash{},
&ReachabilityInterval{},
},
FutureCoveringTreeNodeSet{},
},
{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
{
&ReachabilityTreeNode{
[]*externalapi.DomainHash{},
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
&ReachabilityInterval{100, 200},
},
FutureCoveringTreeNodeSet{
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{1}),
externalapi.NewDomainHashFromByteArray(&[externalapi.DomainHashSize]byte{2})},
},
}
for i, data := range testData {
clone := data.Clone()
if !clone.Equal(data) {
t.Fatalf("Test #%d: clone should be equal to the original", i)
}
if !reflect.DeepEqual(data, clone) {
t.Fatalf("Test #%d: clone should be equal to the original", i)
}
}
}
Reference in New Issue View Git Blame Copy Permalink