def search(self, node): ''' 检索节点 打印出其父节点的name以及其下一层所有子节点的name ''' self.if_node_exist = False self.if_node_exist_recursion( self.tree, node, search=True, if_del=False) if self.if_node_exist: # 若需要检索的节点存在,返回其父节点以及所有子节点 print("%s's parent:" % node.name) pt(self.search_result_parent) print("%s's children:" % node.name) pt(self.search_result_children) print('*' * 30) else: # 若检索的节点不存在树中 print("Error: Node %s doesn't exist!" % node.name) print('*' * 30)
for i in range(4): a, b = b, a + b print a print filter(lambda c: c != 'i', 'qiwsir') a = [3, 9, 8, 5, 2] b = [1, 4, 9, 2, 6] print map(lambda x, y: x + y, a, b) print reduce(lambda x, y: x + y, map(lambda x, y: x * y, a, b)) from pprint import pprint as pt a = {}.fromkeys(("lang", "book", "1", "2", "3", "4", "5", "6"), "www.baidu.com") print a print pt(a) import sys pt(sys.__doc__) print "The file name: ", sys.argv[0] print "The number of argument ", len(sys.argv) print "The argument is: ", str(sys.argv) import os print os.listdir(os.getcwd()) p = os.getcwd() print os.stat(p) import time
# 引用的方式 : import modulename import pprint a = { "lang": "python", "book": "www.itdiffer.com", "teacher": "dream", "gobal": "from beginer to master" } pprint.pprint(a) from pprint import pprint print(a) from pprint import * import pprint as pr pr.pprint(a) from pprint import pprint as pt pt(a) import pprint print(dir(pprint)) [m for m in dir(pprint) if not m.startwith(".")] # 帮助,文档,源码 help() dir()