redef class PNode
# Parent of the node in the AST
- readable writable attr _parent: nullable PNode
+ readable writable var _parent: nullable PNode
# Remove a child from the AST
- meth remove_child(child: PNode)
+ fun remove_child(child: PNode)
do
replace_child(child, null)
end
# Replace a child with an other node in the AST
- meth replace_child(old_child: PNode, new_child: nullable PNode) is abstract
+ fun replace_child(old_child: PNode, new_child: nullable PNode) is abstract
# Replace itself with an other node in the AST
- meth replace_with(node: PNode)
+ fun replace_with(node: PNode)
do
if (_parent != null) then
_parent.replace_child(self, node)
# Visit all nodes in order.
# Thus, call "v.visit(e)" for each node e
- meth visit_all(v: Visitor) is abstract
+ fun visit_all(v: Visitor) is abstract
# Visit all nodes in reverse order.
# Thus, call "v.visit(e)" for each node e starting from the last child
- meth visit_all_reverse(v: Visitor) is abstract
+ fun visit_all_reverse(v: Visitor) is abstract
# Give a human readable location of the node.
- meth locate: String is abstract
+ fun locate: String is abstract
# Return only the line number of the node
- meth line_number: Int is abstract
+ fun line_number: Int is abstract
# Debug method: output a message prefixed with the location.
- meth printl(str: String)
+ fun printl(str: String)
do
print("{locate}: {str}\n")
end
end
redef class Token
- redef meth visit_all(v: Visitor) do end
- redef meth visit_all_reverse(v: Visitor) do end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode) do end
+ redef fun visit_all(v: Visitor) do end
+ redef fun visit_all_reverse(v: Visitor) do end
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode) do end
- redef meth locate: String
+ redef fun locate: String
do
return "{filename}:{line},{pos}"
end
- redef meth line_number do return line
+ redef fun line_number do return line
end
redef class Prod
# The first token of the production node
- readable writable attr _first_token: nullable Token
+ readable writable var _first_token: nullable Token
# The last token of the production node
- readable writable attr _last_token: nullable Token
+ readable writable var _last_token: nullable Token
- redef meth locate: String
+ redef fun locate: String
do
if first_token == null then
return "????"
end
end
- redef meth replace_with(n: PNode)
+ redef fun replace_with(n: PNode)
do
super
assert n isa Prod
n.last_token = last_token
end
- redef meth line_number
+ redef fun line_number
do
if first_token != null then
return first_token.line
# Ask the visitor to visit a given node.
# Usually automatically called by visit_all* methods.
# Concrete visitors should redefine this method.
- meth visit(e: nullable PNode) is abstract
+ fun visit(e: nullable PNode) is abstract
end
redef class AModule
- redef meth n_packagedecl=(n)
+ redef fun n_packagedecl=(n)
do
_n_packagedecl = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_packagedecl == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_packagedecl != null then
v.visit(_n_packagedecl.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_packagedecl != null then
v.visit(_n_packagedecl.as(not null))
end
end
redef class APackagedecl
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwpackage=(n)
+ redef fun n_kwpackage=(n)
do
_n_kwpackage = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
n_id.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
v.visit(_n_id)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class AImport
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwimport=(n)
+ redef fun n_kwimport=(n)
do
_n_kwimport = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
n_id.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_visibility == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_visibility)
v.visit(_n_kwimport)
v.visit(_n_id)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_visibility)
v.visit(_n_kwimport)
end
end
redef class ANoImport
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwimport=(n)
+ redef fun n_kwimport=(n)
do
_n_kwimport = n
n.parent = self
end
- redef meth n_kwend=(n)
+ redef fun n_kwend=(n)
do
_n_kwend = n
n.parent = self
n_kwend.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_visibility == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_visibility)
v.visit(_n_kwimport)
v.visit(_n_kwend)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_visibility)
v.visit(_n_kwimport)
empty_init
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
end
end
redef class APrivateVisibility
- redef meth n_kwprivate=(n)
+ redef fun n_kwprivate=(n)
do
_n_kwprivate = n
n.parent = self
n_kwprivate.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwprivate == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwprivate)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwprivate)
end
end
redef class AProtectedVisibility
- redef meth n_kwprotected=(n)
+ redef fun n_kwprotected=(n)
do
_n_kwprotected = n
n.parent = self
n_kwprotected.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwprotected == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwprotected)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwprotected)
end
end
redef class AIntrudeVisibility
- redef meth n_kwintrude=(n)
+ redef fun n_kwintrude=(n)
do
_n_kwintrude = n
n.parent = self
n_kwintrude.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwintrude == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwintrude)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwintrude)
end
end
redef class AClassdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_classkind=(n)
+ redef fun n_classkind=(n)
do
_n_classkind = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
for i in [0.._n_propdefs.length[ do
if _n_propdefs[i] == old_child then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
for n in _n_propdefs do
v.visit(n)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
do
var i = _n_propdefs.length
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
for i in [0.._n_propdefs.length[ do
if _n_propdefs[i] == old_child then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
for n in _n_propdefs do
v.visit(n)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
do
var i = _n_propdefs.length
end
end
redef class AConcreteClasskind
- redef meth n_kwclass=(n)
+ redef fun n_kwclass=(n)
do
_n_kwclass = n
n.parent = self
n_kwclass.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwclass == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwclass)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwclass)
end
end
redef class AAbstractClasskind
- redef meth n_kwabstract=(n)
+ redef fun n_kwabstract=(n)
do
_n_kwabstract = n
n.parent = self
end
- redef meth n_kwclass=(n)
+ redef fun n_kwclass=(n)
do
_n_kwclass = n
n.parent = self
n_kwclass.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwabstract == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwabstract)
v.visit(_n_kwclass)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwabstract)
v.visit(_n_kwclass)
end
end
redef class AInterfaceClasskind
- redef meth n_kwinterface=(n)
+ redef fun n_kwinterface=(n)
do
_n_kwinterface = n
n.parent = self
n_kwinterface.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwinterface == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwinterface)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwinterface)
end
end
redef class AUniversalClasskind
- redef meth n_kwuniversal=(n)
+ redef fun n_kwuniversal=(n)
do
_n_kwuniversal = n
n.parent = self
n_kwuniversal.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwuniversal == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwuniversal)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwuniversal)
end
end
redef class AFormaldef
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_id == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_id)
if _n_type != null then
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_id)
if _n_type != null then
end
end
redef class ASuperclass
- redef meth n_kwspecial=(n)
+ redef fun n_kwspecial=(n)
do
_n_kwspecial = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
n.parent = self
n_type.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwspecial == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwspecial)
v.visit(_n_type)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwspecial)
v.visit(_n_type)
end
end
redef class AAttrPropdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_readable=(n)
+ redef fun n_readable=(n)
do
_n_readable = n
if n != null then
n.parent = self
end
end
- redef meth n_writable=(n)
+ redef fun n_writable=(n)
do
_n_writable = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwattr=(n)
+ redef fun n_kwattr=(n)
do
_n_kwattr = n
if n != null then
n.parent = self
end
end
- redef meth n_kwvar=(n)
+ redef fun n_kwvar=(n)
do
_n_kwvar = n
if n != null then
n.parent = self
end
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
if n != null then
n.parent = self
end
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class AMethPropdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_methid=(n)
+ redef fun n_methid=(n)
do
_n_methid = n
n.parent = self
end
- redef meth n_signature=(n)
+ redef fun n_signature=(n)
do
_n_signature = n
n.parent = self
n_signature.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
v.visit(_n_signature)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class ADeferredMethPropdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwmeth=(n)
+ redef fun n_kwmeth=(n)
do
_n_kwmeth = n
n.parent = self
end
- redef meth n_methid=(n)
+ redef fun n_methid=(n)
do
_n_methid = n
n.parent = self
end
- redef meth n_signature=(n)
+ redef fun n_signature=(n)
do
_n_signature = n
n.parent = self
n_signature.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
v.visit(_n_signature)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class AInternMethPropdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwmeth=(n)
+ redef fun n_kwmeth=(n)
do
_n_kwmeth = n
n.parent = self
end
- redef meth n_methid=(n)
+ redef fun n_methid=(n)
do
_n_methid = n
n.parent = self
end
- redef meth n_signature=(n)
+ redef fun n_signature=(n)
do
_n_signature = n
n.parent = self
n_signature.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
v.visit(_n_signature)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class AExternMethPropdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwmeth=(n)
+ redef fun n_kwmeth=(n)
do
_n_kwmeth = n
n.parent = self
end
- redef meth n_methid=(n)
+ redef fun n_methid=(n)
do
_n_methid = n
n.parent = self
end
- redef meth n_signature=(n)
+ redef fun n_signature=(n)
do
_n_signature = n
n.parent = self
end
- redef meth n_extern=(n)
+ redef fun n_extern=(n)
do
_n_extern = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class AConcreteMethPropdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwmeth=(n)
+ redef fun n_kwmeth=(n)
do
_n_kwmeth = n
n.parent = self
end
- redef meth n_methid=(n)
+ redef fun n_methid=(n)
do
_n_methid = n
n.parent = self
end
- redef meth n_signature=(n)
+ redef fun n_signature=(n)
do
_n_signature = n
n.parent = self
end
- redef meth n_block=(n)
+ redef fun n_block=(n)
do
_n_block = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class AConcreteInitPropdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwinit=(n)
+ redef fun n_kwinit=(n)
do
_n_kwinit = n
n.parent = self
end
- redef meth n_methid=(n)
+ redef fun n_methid=(n)
do
_n_methid = n
if n != null then
n.parent = self
end
end
- redef meth n_signature=(n)
+ redef fun n_signature=(n)
do
_n_signature = n
n.parent = self
end
- redef meth n_block=(n)
+ redef fun n_block=(n)
do
_n_block = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class AMainMethPropdef
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_block=(n)
+ redef fun n_block=(n)
do
_n_block = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwredef == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_kwredef != null then
v.visit(_n_kwredef.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_kwredef != null then
v.visit(_n_kwredef.as(not null))
end
end
redef class ATypePropdef
- redef meth n_doc=(n)
+ redef fun n_doc=(n)
do
_n_doc = n
if n != null then
n.parent = self
end
end
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_visibility=(n)
+ redef fun n_visibility=(n)
do
_n_visibility = n
n.parent = self
end
- redef meth n_kwtype=(n)
+ redef fun n_kwtype=(n)
do
_n_kwtype = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
n.parent = self
n_type.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_doc == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
v.visit(_n_type)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_doc != null then
v.visit(_n_doc.as(not null))
end
end
redef class AReadAble
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_kwreadable=(n)
+ redef fun n_kwreadable=(n)
do
_n_kwreadable = n
n.parent = self
n_kwreadable.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwredef == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_kwredef != null then
v.visit(_n_kwredef.as(not null))
v.visit(_n_kwreadable)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_kwredef != null then
v.visit(_n_kwredef.as(not null))
end
end
redef class AWriteAble
- redef meth n_kwredef=(n)
+ redef fun n_kwredef=(n)
do
_n_kwredef = n
if n != null then
n.parent = self
end
end
- redef meth n_kwwritable=(n)
+ redef fun n_kwwritable=(n)
do
_n_kwwritable = n
n.parent = self
n_kwwritable.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwredef == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_kwredef != null then
v.visit(_n_kwredef.as(not null))
v.visit(_n_kwwritable)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_kwredef != null then
v.visit(_n_kwredef.as(not null))
end
end
redef class AIdMethid
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
n_id.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_id == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_id)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_id)
end
end
redef class APlusMethid
- redef meth n_plus=(n)
+ redef fun n_plus=(n)
do
_n_plus = n
n.parent = self
n_plus.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_plus == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_plus)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_plus)
end
end
redef class AMinusMethid
- redef meth n_minus=(n)
+ redef fun n_minus=(n)
do
_n_minus = n
n.parent = self
n_minus.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_minus == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_minus)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_minus)
end
end
redef class AStarMethid
- redef meth n_star=(n)
+ redef fun n_star=(n)
do
_n_star = n
n.parent = self
n_star.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_star == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_star)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_star)
end
end
redef class ASlashMethid
- redef meth n_slash=(n)
+ redef fun n_slash=(n)
do
_n_slash = n
n.parent = self
n_slash.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_slash == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_slash)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_slash)
end
end
redef class APercentMethid
- redef meth n_percent=(n)
+ redef fun n_percent=(n)
do
_n_percent = n
n.parent = self
n_percent.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_percent == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_percent)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_percent)
end
end
redef class AEqMethid
- redef meth n_eq=(n)
+ redef fun n_eq=(n)
do
_n_eq = n
n.parent = self
n_eq.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_eq == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_eq)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_eq)
end
end
redef class ANeMethid
- redef meth n_ne=(n)
+ redef fun n_ne=(n)
do
_n_ne = n
n.parent = self
n_ne.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_ne == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_ne)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_ne)
end
end
redef class ALeMethid
- redef meth n_le=(n)
+ redef fun n_le=(n)
do
_n_le = n
n.parent = self
n_le.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_le == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_le)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_le)
end
end
redef class AGeMethid
- redef meth n_ge=(n)
+ redef fun n_ge=(n)
do
_n_ge = n
n.parent = self
n_ge.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_ge == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_ge)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_ge)
end
end
redef class ALtMethid
- redef meth n_lt=(n)
+ redef fun n_lt=(n)
do
_n_lt = n
n.parent = self
n_lt.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_lt == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_lt)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_lt)
end
end
redef class AGtMethid
- redef meth n_gt=(n)
+ redef fun n_gt=(n)
do
_n_gt = n
n.parent = self
n_gt.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_gt == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_gt)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_gt)
end
end
redef class ABraMethid
- redef meth n_obra=(n)
+ redef fun n_obra=(n)
do
_n_obra = n
n.parent = self
end
- redef meth n_cbra=(n)
+ redef fun n_cbra=(n)
do
_n_cbra = n
n.parent = self
n_cbra.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_obra == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_obra)
v.visit(_n_cbra)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_obra)
v.visit(_n_cbra)
end
end
redef class AStarshipMethid
- redef meth n_starship=(n)
+ redef fun n_starship=(n)
do
_n_starship = n
n.parent = self
n_starship.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_starship == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_starship)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_starship)
end
end
redef class AAssignMethid
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_assign=(n)
+ redef fun n_assign=(n)
do
_n_assign = n
n.parent = self
n_assign.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_id == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_id)
v.visit(_n_assign)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_id)
v.visit(_n_assign)
end
end
redef class ABraassignMethid
- redef meth n_obra=(n)
+ redef fun n_obra=(n)
do
_n_obra = n
n.parent = self
end
- redef meth n_cbra=(n)
+ redef fun n_cbra=(n)
do
_n_cbra = n
n.parent = self
end
- redef meth n_assign=(n)
+ redef fun n_assign=(n)
do
_n_assign = n
n.parent = self
n_assign.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_obra == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_obra)
v.visit(_n_cbra)
v.visit(_n_assign)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_obra)
v.visit(_n_cbra)
end
end
redef class ASignature
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
for i in [0.._n_params.length[ do
if _n_params[i] == old_child then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
for n in _n_params do
v.visit(n)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
do
var i = _n_params.length
end
end
redef class AParam
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
if n != null then
n.parent = self
end
end
- redef meth n_dotdotdot=(n)
+ redef fun n_dotdotdot=(n)
do
_n_dotdotdot = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_id == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_id)
if _n_type != null then
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_id)
if _n_type != null then
end
end
redef class AClosureDecl
- redef meth n_kwwith=(n)
+ redef fun n_kwwith=(n)
do
_n_kwwith = n
n.parent = self
end
- redef meth n_kwbreak=(n)
+ redef fun n_kwbreak=(n)
do
_n_kwbreak = n
if n != null then
n.parent = self
end
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_signature=(n)
+ redef fun n_signature=(n)
do
_n_signature = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwwith == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwwith)
if _n_kwbreak != null then
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwwith)
if _n_kwbreak != null then
end
end
redef class AType
- redef meth n_kwnullable=(n)
+ redef fun n_kwnullable=(n)
do
_n_kwnullable = n
if n != null then
n.parent = self
end
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwnullable == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_kwnullable != null then
v.visit(_n_kwnullable.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_kwnullable != null then
v.visit(_n_kwnullable.as(not null))
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
for i in [0.._n_expr.length[ do
if _n_expr[i] == old_child then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
for n in _n_expr do
v.visit(n)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
do
var i = _n_expr.length
end
end
redef class AVardeclExpr
- redef meth n_kwvar=(n)
+ redef fun n_kwvar=(n)
do
_n_kwvar = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
if n != null then
n.parent = self
end
end
- redef meth n_assign=(n)
+ redef fun n_assign=(n)
do
_n_assign = n
if n != null then
n.parent = self
end
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwvar == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwvar)
v.visit(_n_id)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwvar)
v.visit(_n_id)
end
end
redef class AReturnExpr
- redef meth n_kwreturn=(n)
+ redef fun n_kwreturn=(n)
do
_n_kwreturn = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwreturn == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwreturn)
if _n_expr != null then
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwreturn)
if _n_expr != null then
end
end
redef class ABreakExpr
- redef meth n_kwbreak=(n)
+ redef fun n_kwbreak=(n)
do
_n_kwbreak = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwbreak == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwbreak)
if _n_expr != null then
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwbreak)
if _n_expr != null then
end
end
redef class AAbortExpr
- redef meth n_kwabort=(n)
+ redef fun n_kwabort=(n)
do
_n_kwabort = n
n.parent = self
n_kwabort.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwabort == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwabort)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwabort)
end
end
redef class AContinueExpr
- redef meth n_kwcontinue=(n)
+ redef fun n_kwcontinue=(n)
do
_n_kwcontinue = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwcontinue == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwcontinue)
if _n_expr != null then
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwcontinue)
if _n_expr != null then
end
end
redef class ADoExpr
- redef meth n_kwdo=(n)
+ redef fun n_kwdo=(n)
do
_n_kwdo = n
n.parent = self
end
- redef meth n_block=(n)
+ redef fun n_block=(n)
do
_n_block = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwdo == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwdo)
if _n_block != null then
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwdo)
if _n_block != null then
end
end
redef class AIfExpr
- redef meth n_kwif=(n)
+ redef fun n_kwif=(n)
do
_n_kwif = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_then=(n)
+ redef fun n_then=(n)
do
_n_then = n
if n != null then
n.parent = self
end
end
- redef meth n_else=(n)
+ redef fun n_else=(n)
do
_n_else = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwif == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwif)
v.visit(_n_expr)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwif)
v.visit(_n_expr)
end
end
redef class AIfexprExpr
- redef meth n_kwif=(n)
+ redef fun n_kwif=(n)
do
_n_kwif = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_kwthen=(n)
+ redef fun n_kwthen=(n)
do
_n_kwthen = n
n.parent = self
end
- redef meth n_then=(n)
+ redef fun n_then=(n)
do
_n_then = n
n.parent = self
end
- redef meth n_kwelse=(n)
+ redef fun n_kwelse=(n)
do
_n_kwelse = n
n.parent = self
end
- redef meth n_else=(n)
+ redef fun n_else=(n)
do
_n_else = n
n.parent = self
n_else.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwif == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwif)
v.visit(_n_expr)
v.visit(_n_else)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwif)
v.visit(_n_expr)
end
end
redef class AWhileExpr
- redef meth n_kwwhile=(n)
+ redef fun n_kwwhile=(n)
do
_n_kwwhile = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_kwdo=(n)
+ redef fun n_kwdo=(n)
do
_n_kwdo = n
n.parent = self
end
- redef meth n_block=(n)
+ redef fun n_block=(n)
do
_n_block = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwwhile == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwwhile)
v.visit(_n_expr)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwwhile)
v.visit(_n_expr)
end
end
redef class AForExpr
- redef meth n_kwfor=(n)
+ redef fun n_kwfor=(n)
do
_n_kwfor = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_kwdo=(n)
+ redef fun n_kwdo=(n)
do
_n_kwdo = n
n.parent = self
end
- redef meth n_block=(n)
+ redef fun n_block=(n)
do
_n_block = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwfor == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwfor)
v.visit(_n_id)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwfor)
v.visit(_n_id)
end
end
redef class AAssertExpr
- redef meth n_kwassert=(n)
+ redef fun n_kwassert=(n)
do
_n_kwassert = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
if n != null then
n.parent = self
end
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
n_expr.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwassert == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwassert)
if _n_id != null then
v.visit(_n_expr)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwassert)
if _n_id != null then
end
end
redef class AOnceExpr
- redef meth n_kwonce=(n)
+ redef fun n_kwonce=(n)
do
_n_kwonce = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
n_expr.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwonce == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwonce)
v.visit(_n_expr)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwonce)
v.visit(_n_expr)
end
end
redef class ASendExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
n_expr.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
end
end
redef class ABinopExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AOrExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AAndExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class ANotExpr
- redef meth n_kwnot=(n)
+ redef fun n_kwnot=(n)
do
_n_kwnot = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
n_expr.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwnot == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwnot)
v.visit(_n_expr)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwnot)
v.visit(_n_expr)
end
end
redef class AEqExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AEeExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class ANeExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class ALtExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class ALeExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AGtExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AGeExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AIsaExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
n.parent = self
n_type.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_type)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_type)
end
end
redef class APlusExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AMinusExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AStarshipExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AStarExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class ASlashExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class APercentExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AUminusExpr
- redef meth n_minus=(n)
+ redef fun n_minus=(n)
do
_n_minus = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
n_expr.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_minus == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_minus)
v.visit(_n_expr)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_minus)
v.visit(_n_expr)
end
end
redef class ANewExpr
- redef meth n_kwnew=(n)
+ redef fun n_kwnew=(n)
do
_n_kwnew = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwnew == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwnew)
v.visit(_n_type)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwnew)
v.visit(_n_type)
end
end
redef class AAttrExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
n_id.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
end
end
redef class AAttrAssignExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_assign=(n)
+ redef fun n_assign=(n)
do
_n_assign = n
n.parent = self
end
- redef meth n_value=(n)
+ redef fun n_value=(n)
do
_n_value = n
n.parent = self
n_value.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
v.visit(_n_value)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
end
end
redef class AAttrReassignExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_assign_op=(n)
+ redef fun n_assign_op=(n)
do
_n_assign_op = n
n.parent = self
end
- redef meth n_value=(n)
+ redef fun n_value=(n)
do
_n_value = n
n.parent = self
n_value.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
v.visit(_n_value)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
end
end
redef class ACallExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
end
end
redef class ACallAssignExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_assign=(n)
+ redef fun n_assign=(n)
do
_n_assign = n
n.parent = self
end
- redef meth n_value=(n)
+ redef fun n_value=(n)
do
_n_value = n
n.parent = self
n_value.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
v.visit(_n_value)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
end
end
redef class ACallReassignExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_assign_op=(n)
+ redef fun n_assign_op=(n)
do
_n_assign_op = n
n.parent = self
end
- redef meth n_value=(n)
+ redef fun n_value=(n)
do
_n_value = n
n.parent = self
n_value.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
v.visit(_n_value)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_id)
end
end
redef class ASuperExpr
- redef meth n_qualified=(n)
+ redef fun n_qualified=(n)
do
_n_qualified = n
if n != null then
n.parent = self
end
end
- redef meth n_kwsuper=(n)
+ redef fun n_kwsuper=(n)
do
_n_kwsuper = n
n.parent = self
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_qualified == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_qualified != null then
v.visit(_n_qualified.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_qualified != null then
v.visit(_n_qualified.as(not null))
end
end
redef class AInitExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_kwinit=(n)
+ redef fun n_kwinit=(n)
do
_n_kwinit = n
n.parent = self
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_kwinit)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_kwinit)
end
end
redef class ABraExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
for n in _n_args do
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
do
end
end
redef class ABraAssignExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_assign=(n)
+ redef fun n_assign=(n)
do
_n_assign = n
n.parent = self
end
- redef meth n_value=(n)
+ redef fun n_value=(n)
do
_n_value = n
n.parent = self
n_value.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
for n in _n_args do
v.visit(_n_value)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
do
end
end
redef class ABraReassignExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_assign_op=(n)
+ redef fun n_assign_op=(n)
do
_n_assign_op = n
n.parent = self
end
- redef meth n_value=(n)
+ redef fun n_value=(n)
do
_n_value = n
n.parent = self
n_value.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
for n in _n_args do
v.visit(_n_value)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
do
end
end
redef class AClosureCallExpr
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_id == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_id)
for n in _n_args do
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_id)
do
end
end
redef class AVarExpr
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
n_id.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_id == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_id)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_id)
end
end
redef class AVarAssignExpr
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_assign=(n)
+ redef fun n_assign=(n)
do
_n_assign = n
n.parent = self
end
- redef meth n_value=(n)
+ redef fun n_value=(n)
do
_n_value = n
n.parent = self
n_value.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_id == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_id)
v.visit(_n_assign)
v.visit(_n_value)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_id)
v.visit(_n_assign)
end
end
redef class AVarReassignExpr
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
end
- redef meth n_assign_op=(n)
+ redef fun n_assign_op=(n)
do
_n_assign_op = n
n.parent = self
end
- redef meth n_value=(n)
+ redef fun n_value=(n)
do
_n_value = n
n.parent = self
n_value.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_id == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_id)
v.visit(_n_assign_op)
v.visit(_n_value)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_id)
v.visit(_n_assign_op)
end
end
redef class ARangeExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class ACrangeExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
redef class AOrangeExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_expr2=(n)
+ redef fun n_expr2=(n)
do
_n_expr2 = n
n.parent = self
n_expr2.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_expr2)
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
for i in [0.._n_exprs.length[ do
if _n_exprs[i] == old_child then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
for n in _n_exprs do
v.visit(n)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
do
var i = _n_exprs.length
end
end
redef class ASelfExpr
- redef meth n_kwself=(n)
+ redef fun n_kwself=(n)
do
_n_kwself = n
n.parent = self
n_kwself.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwself == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwself)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwself)
end
empty_init
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
end
end
redef class ATrueExpr
- redef meth n_kwtrue=(n)
+ redef fun n_kwtrue=(n)
do
_n_kwtrue = n
n.parent = self
n_kwtrue.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwtrue == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwtrue)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwtrue)
end
end
redef class AFalseExpr
- redef meth n_kwfalse=(n)
+ redef fun n_kwfalse=(n)
do
_n_kwfalse = n
n.parent = self
n_kwfalse.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwfalse == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwfalse)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwfalse)
end
end
redef class ANullExpr
- redef meth n_kwnull=(n)
+ redef fun n_kwnull=(n)
do
_n_kwnull = n
n.parent = self
n_kwnull.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwnull == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwnull)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwnull)
end
end
redef class AIntExpr
- redef meth n_number=(n)
+ redef fun n_number=(n)
do
_n_number = n
n.parent = self
n_number.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_number == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_number)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_number)
end
end
redef class AFloatExpr
- redef meth n_float=(n)
+ redef fun n_float=(n)
do
_n_float = n
n.parent = self
n_float.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_float == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_float)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_float)
end
end
redef class ACharExpr
- redef meth n_char=(n)
+ redef fun n_char=(n)
do
_n_char = n
n.parent = self
n_char.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_char == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_char)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_char)
end
end
redef class AStringExpr
- redef meth n_string=(n)
+ redef fun n_string=(n)
do
_n_string = n
n.parent = self
n_string.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_string == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_string)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_string)
end
end
redef class AStartStringExpr
- redef meth n_string=(n)
+ redef fun n_string=(n)
do
_n_string = n
n.parent = self
n_string.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_string == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_string)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_string)
end
end
redef class AMidStringExpr
- redef meth n_string=(n)
+ redef fun n_string=(n)
do
_n_string = n
n.parent = self
n_string.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_string == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_string)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_string)
end
end
redef class AEndStringExpr
- redef meth n_string=(n)
+ redef fun n_string=(n)
do
_n_string = n
n.parent = self
n_string.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_string == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_string)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_string)
end
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
for i in [0.._n_exprs.length[ do
if _n_exprs[i] == old_child then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
for n in _n_exprs do
v.visit(n)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
do
var i = _n_exprs.length
end
end
redef class AParExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
n_expr.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
end
end
redef class AAsCastExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_kwas=(n)
+ redef fun n_kwas=(n)
do
_n_kwas = n
n.parent = self
end
- redef meth n_type=(n)
+ redef fun n_type=(n)
do
_n_type = n
n.parent = self
n_type.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_kwas)
v.visit(_n_type)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_kwas)
end
end
redef class AAsNotnullExpr
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_kwas=(n)
+ redef fun n_kwas=(n)
do
_n_kwas = n
n.parent = self
end
- redef meth n_kwnot=(n)
+ redef fun n_kwnot=(n)
do
_n_kwnot = n
n.parent = self
end
- redef meth n_kwnull=(n)
+ redef fun n_kwnull=(n)
do
_n_kwnull = n
n.parent = self
n_kwnull.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_expr == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_kwas)
v.visit(_n_kwnull)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_expr)
v.visit(_n_kwas)
end
end
redef class AIssetAttrExpr
- redef meth n_kwisset=(n)
+ redef fun n_kwisset=(n)
do
_n_kwisset = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
n.parent = self
end
- redef meth n_id=(n)
+ redef fun n_id=(n)
do
_n_id = n
n.parent = self
n_id.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwisset == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwisset)
v.visit(_n_expr)
v.visit(_n_id)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwisset)
v.visit(_n_expr)
end
end
redef class APlusAssignOp
- redef meth n_pluseq=(n)
+ redef fun n_pluseq=(n)
do
_n_pluseq = n
n.parent = self
n_pluseq.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_pluseq == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_pluseq)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_pluseq)
end
end
redef class AMinusAssignOp
- redef meth n_minuseq=(n)
+ redef fun n_minuseq=(n)
do
_n_minuseq = n
n.parent = self
n_minuseq.parent = self
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_minuseq == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_minuseq)
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_minuseq)
end
end
redef class AClosureDef
- redef meth n_kwwith=(n)
+ redef fun n_kwwith=(n)
do
_n_kwwith = n
n.parent = self
end
- redef meth n_kwdo=(n)
+ redef fun n_kwdo=(n)
do
_n_kwdo = n
n.parent = self
end
- redef meth n_expr=(n)
+ redef fun n_expr=(n)
do
_n_expr = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_kwwith == old_child then
if new_child != null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
v.visit(_n_kwwith)
for n in _n_id do
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
v.visit(_n_kwwith)
do
end
end
redef class AQualified
- redef meth n_classid=(n)
+ redef fun n_classid=(n)
do
_n_classid = n
if n != null then
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
for i in [0.._n_id.length[ do
if _n_id[i] == old_child then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
for n in _n_id do
v.visit(n)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
do
var i = _n_id.length
end
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
for i in [0.._n_comment.length[ do
if _n_comment[i] == old_child then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
for n in _n_comment do
v.visit(n)
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
do
var i = _n_comment.length
_n_eof = n_eof
end
- redef meth replace_child(old_child: PNode, new_child: nullable PNode)
+ redef fun replace_child(old_child: PNode, new_child: nullable PNode)
do
if _n_base == old_child then
if new_child == null then
end
end
- redef meth visit_all(v: Visitor)
+ redef fun visit_all(v: Visitor)
do
if _n_base != null then
v.visit(_n_base.as(not null))
end
end
- redef meth visit_all_reverse(v: Visitor)
+ redef fun visit_all_reverse(v: Visitor)
do
if _n_base != null then
v.visit(_n_base.as(not null))