+ redef fun n_id=(node)
+ do
+ _n_id = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_kwisset)
+ v.enter_visit(_n_expr)
+ v.enter_visit(_n_id)
+ end
+end
+redef class ADebugTypeExpr
+ init init_adebugtypeexpr (
+ n_kwdebug: nullable TKwdebug,
+ n_kwtype: nullable TKwtype,
+ n_expr: nullable AExpr,
+ n_type: nullable AType
+ )
+ do
+ _n_kwdebug = n_kwdebug.as(not null)
+ n_kwdebug.parent = self
+ _n_kwtype = n_kwtype.as(not null)
+ n_kwtype.parent = self
+ _n_expr = n_expr.as(not null)
+ n_expr.parent = self
+ _n_type = n_type.as(not null)
+ n_type.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_kwdebug == old_child then
+ n_kwdebug = new_child.as(TKwdebug)
+ return
+ end
+ if _n_kwtype == old_child then
+ n_kwtype = new_child.as(TKwtype)
+ return
+ end
+ if _n_expr == old_child then
+ n_expr = new_child.as(AExpr)
+ return
+ end
+ if _n_type == old_child then
+ n_type = new_child.as(AType)
+ return
+ end
+ end
+
+ redef fun n_kwdebug=(node)
+ do
+ _n_kwdebug = node
+ node.parent = self
+ end
+ redef fun n_kwtype=(node)
+ do
+ _n_kwtype = node
+ node.parent = self
+ end
+ redef fun n_expr=(node)
+ do
+ _n_expr = node
+ node.parent = self
+ end
+ redef fun n_type=(node)
+ do
+ _n_type = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_kwdebug)
+ v.enter_visit(_n_kwtype)
+ v.enter_visit(_n_expr)
+ v.enter_visit(_n_type)
+ end
+end
+redef class AVarargExpr
+ init init_avarargexpr (
+ n_expr: nullable AExpr,
+ n_dotdotdot: nullable TDotdotdot
+ )
+ do
+ _n_expr = n_expr.as(not null)
+ n_expr.parent = self
+ _n_dotdotdot = n_dotdotdot.as(not null)
+ n_dotdotdot.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_expr == old_child then
+ n_expr = new_child.as(AExpr)
+ return
+ end
+ if _n_dotdotdot == old_child then
+ n_dotdotdot = new_child.as(TDotdotdot)
+ return
+ end
+ end
+
+ redef fun n_expr=(node)
+ do
+ _n_expr = node
+ node.parent = self
+ end
+ redef fun n_dotdotdot=(node)
+ do
+ _n_dotdotdot = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_expr)
+ v.enter_visit(_n_dotdotdot)
+ end
+end
+redef class ANamedargExpr
+ init init_anamedargexpr (
+ n_id: nullable TId,
+ n_assign: nullable TAssign,
+ n_expr: nullable AExpr
+ )
+ do
+ _n_id = n_id.as(not null)
+ n_id.parent = self
+ _n_assign = n_assign.as(not null)
+ n_assign.parent = self
+ _n_expr = n_expr.as(not null)
+ n_expr.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_id == old_child then
+ n_id = new_child.as(TId)
+ return
+ end
+ if _n_assign == old_child then
+ n_assign = new_child.as(TAssign)
+ return
+ end
+ if _n_expr == old_child then
+ n_expr = new_child.as(AExpr)
+ return
+ end
+ end
+
+ redef fun n_id=(node)
+ do
+ _n_id = node
+ node.parent = self
+ end
+ redef fun n_assign=(node)
+ do
+ _n_assign = node
+ node.parent = self
+ end
+ redef fun n_expr=(node)
+ do
+ _n_expr = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_id)
+ v.enter_visit(_n_assign)
+ v.enter_visit(_n_expr)
+ end
+end
+redef class ATypeExpr
+ init init_atypeexpr (
+ n_type: nullable AType
+ )
+ do
+ _n_type = n_type.as(not null)
+ n_type.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_type == old_child then
+ n_type = new_child.as(AType)
+ return
+ end
+ end
+
+ redef fun n_type=(node)
+ do
+ _n_type = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_type)
+ end
+end
+redef class AMethidExpr
+ init init_amethidexpr (
+ n_expr: nullable AExpr,
+ n_id: nullable AMethid
+ )
+ do
+ _n_expr = n_expr.as(not null)
+ n_expr.parent = self
+ _n_id = n_id.as(not null)
+ n_id.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_expr == old_child then
+ n_expr = new_child.as(AExpr)
+ return
+ end
+ if _n_id == old_child then
+ n_id = new_child.as(AMethid)
+ return
+ end
+ end
+
+ redef fun n_expr=(node)
+ do
+ _n_expr = node
+ node.parent = self
+ end
+ redef fun n_id=(node)
+ do
+ _n_id = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_expr)
+ v.enter_visit(_n_id)
+ end
+end
+redef class AAtExpr
+ init init_aatexpr (
+ n_annotations: nullable AAnnotations
+ )
+ do
+ _n_annotations = n_annotations.as(not null)
+ n_annotations.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_annotations == old_child then
+ n_annotations = new_child.as(AAnnotations)
+ return
+ end
+ end
+
+ redef fun n_annotations=(node)
+ do
+ _n_annotations = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_annotations)
+ end
+end
+redef class AManyExpr
+ init init_amanyexpr (
+ n_exprs: Collection[Object] # Should be Collection[AExpr]
+ )
+ do
+ self.n_exprs.unsafe_add_all(n_exprs)
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if n_exprs.replace_child(old_child, new_child) then return
+ end
+
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ n_exprs.visit_all(v)
+ end
+end
+redef class AListExprs
+ init init_alistexprs (
+ n_exprs: Collection[Object] # Should be Collection[AExpr]
+ )
+ do
+ self.n_exprs.unsafe_add_all(n_exprs)
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if n_exprs.replace_child(old_child, new_child) then return
+ end
+
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ n_exprs.visit_all(v)
+ end
+end
+redef class AParExprs
+ init init_aparexprs (
+ n_opar: nullable TOpar,
+ n_exprs: Collection[Object], # Should be Collection[AExpr]
+ n_cpar: nullable TCpar
+ )
+ do
+ _n_opar = n_opar.as(not null)
+ n_opar.parent = self
+ self.n_exprs.unsafe_add_all(n_exprs)
+ _n_cpar = n_cpar.as(not null)
+ n_cpar.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_opar == old_child then
+ n_opar = new_child.as(TOpar)
+ return
+ end
+ if n_exprs.replace_child(old_child, new_child) then return
+ if _n_cpar == old_child then
+ n_cpar = new_child.as(TCpar)
+ return
+ end
+ end
+
+ redef fun n_opar=(node)
+ do
+ _n_opar = node
+ node.parent = self
+ end
+ redef fun n_cpar=(node)
+ do
+ _n_cpar = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_opar)
+ n_exprs.visit_all(v)
+ v.enter_visit(_n_cpar)
+ end
+end
+redef class ABraExprs
+ init init_abraexprs (
+ n_obra: nullable TObra,
+ n_exprs: Collection[Object], # Should be Collection[AExpr]
+ n_cbra: nullable TCbra
+ )
+ do
+ _n_obra = n_obra.as(not null)
+ n_obra.parent = self
+ self.n_exprs.unsafe_add_all(n_exprs)
+ _n_cbra = n_cbra.as(not null)
+ n_cbra.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_obra == old_child then
+ n_obra = new_child.as(TObra)
+ return
+ end
+ if n_exprs.replace_child(old_child, new_child) then return
+ if _n_cbra == old_child then
+ n_cbra = new_child.as(TCbra)
+ return
+ end
+ end
+
+ redef fun n_obra=(node)
+ do
+ _n_obra = node
+ node.parent = self
+ end
+ redef fun n_cbra=(node)
+ do
+ _n_cbra = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_obra)
+ n_exprs.visit_all(v)
+ v.enter_visit(_n_cbra)
+ end
+end
+redef class APlusAssignOp
+ init init_aplusassignop (
+ n_op: nullable TPluseq
+ )
+ do
+ _n_op = n_op.as(not null)
+ n_op.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_op == old_child then
+ n_op = new_child.as(TPluseq)
+ return
+ end
+ end
+
+ redef fun n_op=(node)
+ do
+ _n_op = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_op)
+ end
+end
+redef class AMinusAssignOp
+ init init_aminusassignop (
+ n_op: nullable TMinuseq
+ )
+ do
+ _n_op = n_op.as(not null)
+ n_op.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_op == old_child then
+ n_op = new_child.as(TMinuseq)
+ return
+ end
+ end
+
+ redef fun n_op=(node)
+ do
+ _n_op = node
+ node.parent = self
+ end
+
+
+ redef fun visit_all(v: Visitor)
+ do
+ v.enter_visit(_n_op)
+ end
+end
+redef class AStarAssignOp
+ init init_astarassignop (
+ n_op: nullable TStareq
+ )
+ do
+ _n_op = n_op.as(not null)
+ n_op.parent = self
+ end
+
+ redef fun replace_child(old_child: ANode, new_child: nullable ANode)
+ do
+ if _n_op == old_child then
+ n_op = new_child.as(TStareq)
+ return
+ end
+ end
+
+ redef fun n_op=(node)