Python runtest.compile_function函数代码示例

def test_bool_return():
    def bool_return_False():
        return False
    def bool_return_True():
        return True
    f_false = compile_function(bool_return_False, [])
    assert f_false() == bool_return_False()
    f_true  = compile_function(bool_return_True , [])
    assert f_true()  == bool_return_True()    

 def test_slice(self):
     def one_slice(s):
         return s[1:]
         
     def two_slice(s):
         return s[2:]
     
     fn = compile_function(one_slice, [str])
     assert fn("dupa") == "upa"
     fn = compile_function(two_slice, [str])
     assert fn("kupa") == "pa"

def test_is():
    def testfn():
        l1 = []
        return l1 is l1
    fn = compile_function(testfn, [])
    result = fn()
    assert result == True
    def testfn():
        l1 = []
        return l1 is None
    fn = compile_function(testfn, [])
    result = fn()
    assert result == False

def test_get_set_del_slice():
    def get_set_del_nonneg_slice(): # no neg slices for now!
        l = [ord('a'), ord('b'), ord('c'), ord('d'), ord('e'), ord('f'), ord('g'), ord('h'), ord('i'), ord('j')]
        del l[:1]
        bound = len(l)-1
        if bound >= 0:
            del l[bound:]
        del l[2:4]
        #l[:1] = [3]
        #bound = len(l)-1
        #assert bound >= 0
        #l[bound:] = [9]    no setting slice into lists for now
        #l[2:4] = [8,11]
        l[0], l[-1], l[2], l[3] = 3, 9, 8, 11

        list_3_c = l[:2]
        list_9 = l[5:]
        list_11_h = l[3:5]
        return list((len(l), l[0], l[1], l[2], l[3], l[4], l[5],
                     len(list_3_c),  list_3_c[0],  list_3_c[1],
                     len(list_9),    list_9[0],
                     len(list_11_h), list_11_h[0], list_11_h[1]))
    
    def wrapper():
        res = get_set_del_nonneg_slice()
        expected = [6, 3, ord('c'), 8, 11, ord('h'), 9,
                    2, 3, ord('c'),
                    1, 9,
                    2, 11, ord('h')]
    
        return res == expected

    fn = compile_function(wrapper, [])
    result = fn()
    assert result 

 def test_global_instance(self): #issue we restart every test with a fresh set of globals
     f = compile_function(llvmsnippet.global_instance, [int])
     assert f(-1) == llvmsnippet.global_instance(-1)
     for i in range(20):
         x = f(i)
         y = llvmsnippet.global_instance(i)
         assert x == y

def test_circular_class():
    def circular_class():
        b = A(a)
        return b.b
    
    fn = compile_function(circular_class, [])
    assert fn() == 3

 def test_ackermann(self):
     f = compile_function(llvmsnippet.ackermann, [int, int])
     for i in range(4):  # (otherwise too much recursion) max 4 in Safari, max 7 in Firefox, IE allows more recursion
         assert f(0, i) == i + 1
         assert f(1, i) == i + 2
         assert f(2, i) == 2 * i + 3
         assert f(3, i) == 2 ** (i + 3) - 3

 def test_pbc_function1(self):
     #py.test.skip("Method mapping not implemented")
     f = compile_function(llvmsnippet.pbc_function1, [int])
     assert f(0) == 2
     assert f(1) == 4
     assert f(2) == 6
     assert f(3) == 8

 def test_time_waster(self):
     #py.test.skip("Loop error in loop detection software")
     f = compile_function(test.time_waster, [int])
     assert f(1) == 1
     assert f(2) == 2
     assert f(3) == 6
     assert f(4) == 12

def test_simple3():
    def raise_(i):
        if i == 0:
            raise TestException()
        elif i == 1:
            raise MyException(42)
        else:
            return 3
    def fn(i):
        try:
            a = raise_(i) + 11
            b = raise_(i) + 12
            c = raise_(i) + 13
            return a+b+c
        except TestException: 
            return 7
        except MyException: 
            return 123
        except:
            return 22
        return 66
    f = compile_function(fn, [int])
    assert f(0) == fn(0)
    assert f(1) == fn(1)
    assert f(2) == fn(2)

 def test_normal_list(self):
     def normal_list():
         l = [1,2,3]
         return l[1]
     
     fn = compile_function(normal_list, [])
     assert fn() == 2

def test_raise_outside_testfn():
    def raiser(n):
        if n < 0:
            raise ValueError("hello")
        else:
            raise MyException("world")

    def intermediate(n):
        raiser(n)
        
    def testfn(n):
        try:
            intermediate(n)
        except ValueError:
            return 1
        except Exception:
            return 2
        return 0

    saved = no_magic()
    try:
        f = compile_function(testfn, [int])
        assert f(1) == testfn(1)
        assert f(-1) == testfn(-1)
    finally:
        restore_magic(saved)

 def test_init_0(self):
     def l_init():
         l = [0] * 100
         return l[38]
     
     fn = compile_function(l_init, [])
     assert fn() == 0

 def test_upperlower(self):
     def upperlower():
         s = "aBaF"
         return s.upper() + s.lower()
     
     fn = compile_function(upperlower, [])
     assert fn() == "ABAFabaf"

def test_basicexternal_element():
    def be_fun():
        b = B()
        b.a = a
        b.a.some_code("aa")
    
    fun = compile_function(be_fun, [])
    assert check_source_contains(fun, "\.some_code")