zoukankan      html  css  js  c++  java
  • python ast


    import ast

    print ast.literal_eval('[1, 2, 3]')
    print eval("2 + 3 * len('hello')") == 17
    print eval("__import__('os').system('dir')", {})

    s = """
    (lambda fc=(
    lambda n: [
    c for c in
    ().__class__.__bases__[0].__subclasses__()
    if c.__name__ == n
    ][0]
    ):
    fc("function")(
    fc("code")(
    0,0,0,0,"KABOOM",(),(),(),"","",0,""
    ),{}
    )()
    )()
    """
    #print eval(s, {'__builtins__':{}})

    print ().__class__.__bases__[0]
    print type(().__class__.__bases__[0].__subclasses__())

    for i in ().__class__.__bases__[0].__subclasses__():
    print ' '
    print i

    for i in ().__class__.__bases__:
    print "***************** "
    print i
    print ' '
    ALL_CLASSES = ().__class__.__bases__[0].__subclasses__()
    #print [c for c in ALL_CLASSES if c.__name__ == n][0]
    g = lambda x: x*2

    print g(3)

    #[c for c in ALL_CLASSES if c.__name__ == "operator.attrgetter" ][0]
    #[c for c in ALL_CLASSES if c.__name__ == "operator.attrgetter" ][0]

    #ff = lambda n: [c for c in ALL_CLASSES ][0]
    #a = ff("function")

    print [c for c in ALL_CLASSES][0]
  • 相关阅读:
    hdu2476
    zoj3469 区间dp好题
    区间dp好题cf149d 括号匹配
    cf1108e 线段树区间更新+扫描线
    完全背包记录路径poj1787 好题
    cf1104d二分+数学
    01背包专题
    hdu1069线性dp
    有源汇的上下界最大流
    有源汇的上下界最大流
  • 原文地址:https://www.cnblogs.com/flintlovesam/p/5913290.html
Copyright © 2011-2022 走看看