mirror of
https://github.com/kaspanet/kaspad.git
synced 2025-06-02 20:26:43 +00:00

* [NOD-1575] Implement Clone and Equal for all model types * [NOD-1575] Add assertion for transaction ID equality * [NOD-1575] Use DomainTransaction.Equal to compare to expected coinbase transaction * [NOD-1575] Add TestDomainBlockHeader_Clone * [NOD-1575] Don't clone nil values * [NOD-1575] Add type assertions * [NOD-1575] Don't clone nil values * [NOD-1575] Add missing Equals * [NOD-1575] Add length checks * [NOD-1575] Update comment * [NOD-1575] Check length for TransactionAcceptanceData * [NOD-1575] Explicitly clone nils where needed * [NOD-1575] Clone tx id * [NOD-1575] Flip condition * Nod 1576 make coverage tests for equal clone inside model externalapi (#1177) * [NOD-1576] Make coverage tests for equal and clone inside model and externalapi * Some formatting and naming fixes * Made transactionToCompare type exported * Added some tests and made some changes to the tests code * No changes made * Some formatting and naming changes made * Made better test coverage for externalapi clone and equal functions * Changed expected result for two cases * Added equal and clone functions tests for ghostdag and utxodiff * Added tests * [NOD-1576] Implement reachabilitydata equal/clone unit tests * [NOD-1576] Full coverage of reachabilitydata equal/clone unit tests * Made changes and handling panic to transaction_equal_clone_test.go and formating of utxodiff_equal_clone_test.go * Added recoverForEqual2 for handling panic to transaction_equal_clone_test.go * [NOD-1576] Full coverage of transaction equal unit test * [NOD-1576] Add expects panic * [NOD-1576] Allow composites in go vet * [NOD-1576] Code review fixes (#1223) * [NOD-1576] Code review fixes * [NOD-1576] Code review fixes part 2 * [NOD-1576] Fix wrong name Co-authored-by: karim1king <karimkaspersky@yahoo.com> Co-authored-by: Ori Newman <orinewman1@gmail.com> Co-authored-by: Karim <karim1king@users.noreply.github.com> * Fix merge errors * Use Equal where possible * Use Equal where possible * Use Equal where possible Co-authored-by: andrey-hash <74914043+andrey-hash@users.noreply.github.com> Co-authored-by: karim1king <karimkaspersky@yahoo.com> Co-authored-by: Karim <karim1king@users.noreply.github.com>
297 lines
6.9 KiB
Go
297 lines
6.9 KiB
Go
package model
|
|
|
|
import (
|
|
"github.com/kaspanet/kaspad/domain/consensus/model/externalapi"
|
|
"reflect"
|
|
"testing"
|
|
)
|
|
|
|
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{{1}, {2}}, // Changed
|
|
&externalapi.DomainHash{},
|
|
&ReachabilityInterval{},
|
|
},
|
|
FutureCoveringTreeNodeSet{},
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{},
|
|
&externalapi.DomainHash{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{{1}, {2}}, // Changed
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
},
|
|
},
|
|
// Test filled data
|
|
{
|
|
baseData: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}, {3}},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{100, 200},
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
dataToCompareTo: []dataToCompare{
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}, {3}},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{100, 200},
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
expectedResult: true,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}, {3}},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{100, 200},
|
|
},
|
|
FutureCoveringTreeNodeSet{}, // Changed
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}, {3}},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{200, 200}, // Changed start
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}, {3}},
|
|
&externalapi.DomainHash{1},
|
|
nil, //Changed
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}, {3}},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{100, 100}, // Changed end
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{}, // Changed
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{100, 200},
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}},
|
|
&externalapi.DomainHash{}, // Changed
|
|
&ReachabilityInterval{100, 200},
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{}, // Changed
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
expectedResult: false,
|
|
},
|
|
{
|
|
data: &ReachabilityData{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}},
|
|
&externalapi.DomainHash{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{{1}, {2}},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{100, 200},
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{100, 200},
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{{1}, {2}},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{},
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {2}},
|
|
},
|
|
{
|
|
&ReachabilityTreeNode{
|
|
[]*externalapi.DomainHash{},
|
|
&externalapi.DomainHash{1},
|
|
&ReachabilityInterval{100, 200},
|
|
},
|
|
FutureCoveringTreeNodeSet{{1}, {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)
|
|
}
|
|
}
|
|
}
|