@@ -66,7 +66,6 @@ namespace arith {
66
66
*/
67
67
class IterMapExprNode : public PrimExprNode {
68
68
public:
69
- static constexpr bool _type_has_method_visit_attrs = false ;
70
69
static constexpr const char * _type_key = " arith.IterMapExpr" ;
71
70
static constexpr const uint32_t _type_child_slots = 2 ;
72
71
TVM_DECLARE_BASE_OBJECT_INFO (IterMapExprNode, PrimExprNode);
@@ -106,8 +105,6 @@ class IterMarkNode : public Object {
106
105
.def_ro (" extent" , &IterMarkNode::extent);
107
106
}
108
107
109
- static constexpr bool _type_has_method_visit_attrs = false ;
110
-
111
108
bool SEqualReduce (const IterMarkNode* other, SEqualReducer equal) const {
112
109
equal->MarkGraphNode ();
113
110
return equal (source, other->source ) && equal (extent, other->extent );
@@ -167,8 +164,6 @@ class IterSplitExprNode : public IterMapExprNode {
167
164
.def_ro (" scale" , &IterSplitExprNode::scale);
168
165
}
169
166
170
- static constexpr bool _type_has_method_visit_attrs = false ;
171
-
172
167
bool SEqualReduce (const IterSplitExprNode* other, SEqualReducer equal) const {
173
168
return equal (source, other->source ) && equal (lower_factor, other->lower_factor ) &&
174
169
equal (extent, other->extent ) && equal (scale, other->scale );
@@ -235,8 +230,6 @@ class IterSumExprNode : public IterMapExprNode {
235
230
.def_ro (" base" , &IterSumExprNode::base);
236
231
}
237
232
238
- static constexpr bool _type_has_method_visit_attrs = false ;
239
-
240
233
bool SEqualReduce (const IterSumExprNode* other, SEqualReducer equal) const {
241
234
return equal (args, other->args ) && equal (base, other->base );
242
235
}
@@ -307,8 +300,6 @@ class IterMapResultNode : public Object {
307
300
.def_ro (" padding_predicate" , &IterMapResultNode::padding_predicate);
308
301
}
309
302
310
- static constexpr bool _type_has_method_visit_attrs = false ;
311
-
312
303
static constexpr const char * _type_key = " arith.IterMapResult" ;
313
304
TVM_DECLARE_FINAL_OBJECT_INFO (IterMapResultNode, Object);
314
305
};
0 commit comments