def visit_namespace(self ):
self.print_decl_header()
if self.__recursive:
for decl in self.__inst.declarations:
prn = self.clone()
prn.instance = decl
algorithm.apply_visitor( prn, decl )
def visit_namespace(self):
self.print_decl_header()
if self.__recursive:
for decl in self.__inst.declarations:
prn = self.clone()
prn.instance = decl
algorithm.apply_visitor(prn, decl)
def print_members(members_type, members, curr_level):
self.writer( ' ' * curr_level * self.INDENT_SIZE + members_type.ljust( self.JUSTIFY ))
if self.__recursive:
curr_level += 1
for member in members:
prn = self.clone()
prn.instance = member
algorithm.apply_visitor( prn, member )
def print_members(members_type, members, curr_level):
self.writer( ' ' * curr_level * self.INDENT_SIZE + members_type.ljust( self.JUSTIFY ) + os.linesep )
if self.__recursive:
curr_level += 1
for member in members:
prn = self.clone()
prn.instance = member
algorithm.apply_visitor( prn, member )
def visit_namespace(self ):
if self.verbose == False and not self.__inst.declarations:
return #don't print info about empty namespaces
self.print_decl_header()
if self.__recursive:
for decl in self.__inst.declarations:
if self.is_builtin_decl( decl ):
continue
prn = self.clone()
prn.instance = decl
algorithm.apply_visitor( prn, decl )
def print_declarations( decls, detailed=True, recursive=True, writer=sys.stdout.write ):
""" Print decl tree rooted at each of the included nodes.
decls - either a single decl or a list of decls.
"""
prn = decl_printer_t(0, detailed, recursive, writer)
if type(decls) is not list:
decls = [decls]
for d in decls:
prn.level = 0
prn.instance = d
algorithm.apply_visitor(prn, d)
def print_declarations( decls, detailed=True, recursive=True, writer=sys.stdout.write ):
""" Print decl tree rooted at each of the included nodes.
decls - either a single decl or a list of decls.
"""
prn = decl_printer_t(0, detailed, recursive, writer)
if type(decls) is not list:
decls = [decls]
for d in decls:
prn.level = 0
prn.instance = d
algorithm.apply_visitor(prn, d)
def visit_namespace(self):
if self.verbose == False and not self.__inst.declarations:
return #don't print info about empty namespaces
self.print_decl_header()
if self.__recursive:
for decl in self.__inst.declarations:
if self.is_builtin_decl(decl):
continue
prn = self.clone()
prn.instance = decl
algorithm.apply_visitor(prn, decl)
def print_declarations(decls,
detailed=True,
recursive=True,
writer=lambda x: sys.stdout.write(x + os.linesep),
verbose=True):
"""
print declarations tree rooted at each of the included nodes.
:param decls: either a single :class:declaration_t object or list of :class:declaration_t objects
"""
prn = decl_printer_t(0, detailed, recursive, writer, verbose=verbose)
if type(decls) is not list:
decls = [decls]
for d in decls:
prn.level = 0
prn.instance = d
algorithm.apply_visitor(prn, d)
