WARNING! Access to this system is limited to authorised users only.
Unauthorised users may be subject to prosecution.
Unauthorised access to this system is a criminal offence under Australian law (Federal Crimes Act 1914 Part VIA)
It is a criminal offence to:
(1) Obtain access to data without authority. -Penalty 2 years imprisonment.
(2) Damage, delete, alter or insert data without authority. -Penalty 10 years imprisonment.
User activity is monitored and recorded. Anyone using this system expressly consents to such monitoring and recording.

Commit 1da9ac53 authored by John Zhang's avatar John Zhang
Browse files

refactor; added quicksort test

parent 4bd070a0
......@@ -3,17 +3,22 @@ from rpython.translator.interactive import Translation
import ctypes
def test_add():
def add(a, b):
return a + b
t = Translation(add, [rffi.ULONGLONG, rffi.ULONGLONG],
def getfncptr(entry_fnc, argtypes):
t = Translation(entry_fnc, argtypes,
backend='mu', muimpl='fast', mucodegen='api', mutestjit=True)
db, bdlgen, fnc_name = t.compile_mu()
bdlgen.mu.compile_to_sharedlib('libtesting.dylib', [])
lib = ctypes.CDLL('emit/libtesting.dylib')
fnc = getattr(lib, fnc_name)
assert fnc(1, 2) == 3
fnp = getattr(lib, fnc_name)
return fnp
def test_add():
def add(a, b):
return a + b
fn = getfncptr(add, [rffi.LONGLONG, rffi.LONGLONG])
assert fn(1, 2) == 3
def test_find_min():
......@@ -25,21 +30,46 @@ def test_find_min():
m = x
return m
t = Translation(find_min, [rffi.CArrayPtr(rffi.LONGLONG), rffi.INT],
backend='mu', muimpl='fast', mucodegen='api', mutestjit=True)
fnc = getfncptr(find_min, [rffi.CArrayPtr(rffi.LONGLONG), rffi.UINTPTR_T])
db, bdlgen, fnc_name = t.compile_mu()
bdlgen.mu.compile_to_sharedlib('libtesting.dylib', [])
lib = ctypes.CDLL('emit/libtesting.dylib')
fnc = getattr(lib, fnc_name)
arr = (ctypes.c_longlong * 5)(23, 100, 0, 78, -5)
assert fnc(ctypes.byref(arr), 5) == -5
def test_quicksort():
# algorithm taken from Wikipedia
def swap(arr, i, j):
t = arr[i]
arr[i] = arr[j]
arr[j] = t
def partition(arr, idx_low, idx_high):
pivot = arr[idx_high]
i = idx_low
for j in range(idx_low, idx_high):
if arr[j] < pivot:
swap(arr, i, j)
i += 1
swap(arr, i, idx_high)
return i
def quicksort(arr, start, end):
if start < end:
p = partition(arr, start, end)
quicksort(arr, start, p - 1)
quicksort(arr, p + 1, end)
lst = [23, 100, 0, 78, -5]
arr = lltype.malloc(rffi.CArray(rffi.LONGLONG), 5, flavor='raw')
for i, n in enumerate(lst):
arr[i] = n
fnc = getfncptr(quicksort, [rffi.CArrayPtr(rffi.LONGLONG), rffi.UINTPTR_T, rffi.UINTPTR_T])
assert fnc(arr, 5) == -5
lltype.free(arr, flavor='raw')
from random import getrandbits
from struct import pack, unpack
n = 20
lst = [unpack('i', pack('I', getrandbits(32)))[0] for i in range(n)]
arr = (ctypes.c_longlong * n)(*lst)
fnc(ctypes.byref(arr), 0, n - 1) # inplace sort
lst_s = sorted(lst)
for i in range(n):
assert lst_s[i] == arr[i]
if __name__ == '__main__':
import argparse
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment