test_swig.py

#!/usr/bin/env python
# coding=utf-8
""" Python wrapper to time the SWIG wrapper for computing the nth fibonacci number
in a non-recursive fashion and compare it to the pure Python implementation.
"""
import fibonacci
import fib_python

if __name__ == '__main__':
    import sys
    import timeit

    n = 20
    try:
        n = int(sys.argv[1])
    except Exception:
        pass

    number_of_times = 100000
    try:
        number_of_times = int(sys.argv[2])
    except Exception:
        pass

    fib_py = fib_python.compute_fibonacci(n)
    fib_swig = fibonacci.compute_fibonacci(n)
    if fib_py != fib_swig:
        raise (ValueError(fib_swig))

    py_tot = timeit.timeit("compute_fibonacci({})".format(n),
                           setup="from fib_python import compute_fibonacci",
                           number=number_of_times)
    swig_tot = timeit.timeit("compute_fibonacci({})".format(n),
                             setup="from fibonacci import compute_fibonacci",
                             number=number_of_times)
    py_avg = py_tot / number_of_times
    swig_avg = swig_tot / number_of_times

    print("fib({}) = {}".format(n, fib_py))
    print("Python average time:  {0:.2g}".format(py_avg))
    print("SWIG/C average time:  {0:.2g}".format(swig_avg))
    print("SWIG/C speedup: {0:.2g} times".format(py_avg / swig_avg))

    # MetaData struct
    md = fibonacci.populate_struct(1, 2, 3)
    print("md.type = {},  md.job = {},  md.size = {}".format(md.type, md.job, md.size))