@@ -43,17 +43,11 @@ func (eds *ExtendedDataSquare) UnmarshalJSON(b []byte) error {
43
43
return err
44
44
}
45
45
46
- var treeConstructor TreeConstructorFn
47
46
if aux .Tree == "" {
48
47
aux .Tree = DefaultTreeName
49
48
}
50
49
51
- treeConstructor , err = TreeFn (aux .Tree )
52
- if err != nil {
53
- return err
54
- }
55
-
56
- importedEds , err := ImportExtendedDataSquare (aux .DataSquare , codecs [aux .Codec ], treeConstructor )
50
+ importedEds , err := ImportExtendedDataSquare (aux .DataSquare , codecs [aux .Codec ], aux .Tree )
57
51
if err != nil {
58
52
return err
59
53
}
@@ -66,7 +60,7 @@ func (eds *ExtendedDataSquare) UnmarshalJSON(b []byte) error {
66
60
func ComputeExtendedDataSquare (
67
61
data [][]byte ,
68
62
codec Codec ,
69
- treeCreatorFn TreeConstructorFn ,
63
+ treeName string ,
70
64
) (* ExtendedDataSquare , error ) {
71
65
if len (data ) > codec .MaxChunks () {
72
66
return nil , errors .New ("number of chunks exceeds the maximum" )
@@ -78,14 +72,14 @@ func ComputeExtendedDataSquare(
78
72
return nil , err
79
73
}
80
74
81
- ds , err := newDataSquare ( data , treeCreatorFn , uint ( chunkSize ) )
75
+ treeCreatorFn , err := TreeFn ( treeName )
82
76
if err != nil {
83
77
return nil , err
84
78
}
85
79
86
- treeName := getTreeNameFromConstructorFn ( treeCreatorFn )
87
- if treeName == "" {
88
- return nil , errors . New ( "tree name not found" )
80
+ ds , err := newDataSquare ( data , treeCreatorFn , uint ( chunkSize ) )
81
+ if err != nil {
82
+ return nil , err
89
83
}
90
84
91
85
eds := ExtendedDataSquare {dataSquare : ds , codec : codec , treeName : treeName }
@@ -101,7 +95,7 @@ func ComputeExtendedDataSquare(
101
95
func ImportExtendedDataSquare (
102
96
data [][]byte ,
103
97
codec Codec ,
104
- treeCreatorFn TreeConstructorFn ,
98
+ treeName string ,
105
99
) (* ExtendedDataSquare , error ) {
106
100
if len (data ) > 4 * codec .MaxChunks () {
107
101
return nil , errors .New ("number of chunks exceeds the maximum" )
@@ -113,14 +107,14 @@ func ImportExtendedDataSquare(
113
107
return nil , err
114
108
}
115
109
116
- ds , err := newDataSquare ( data , treeCreatorFn , uint ( chunkSize ) )
110
+ treeCreatorFn , err := TreeFn ( treeName )
117
111
if err != nil {
118
112
return nil , err
119
113
}
120
114
121
- treeName := getTreeNameFromConstructorFn ( treeCreatorFn )
122
- if treeName == "" {
123
- return nil , errors . New ( "tree name not found" )
115
+ ds , err := newDataSquare ( data , treeCreatorFn , uint ( chunkSize ) )
116
+ if err != nil {
117
+ return nil , err
124
118
}
125
119
126
120
eds := ExtendedDataSquare {dataSquare : ds , codec : codec , treeName : treeName }
@@ -254,7 +248,7 @@ func (eds *ExtendedDataSquare) erasureExtendCol(codec Codec, i uint) error {
254
248
}
255
249
256
250
func (eds * ExtendedDataSquare ) deepCopy (codec Codec ) (ExtendedDataSquare , error ) {
257
- imported , err := ImportExtendedDataSquare (eds .Flattened (), codec , eds .createTreeFn )
251
+ imported , err := ImportExtendedDataSquare (eds .Flattened (), codec , eds .treeName )
258
252
return * imported , err
259
253
}
260
254
0 commit comments