%load_ext biteymagic

%%bitey
int fib(int n) {
  if (n < 3) {
    return 1;
  } else {
    return fib(n-2) + fib(n-1);
  }
}

map(fib, xrange(1,10))

%%bitey
void mutate_int(int *x) {
  *x *= 2;
}

import ctypes
x = ctypes.c_int(2)
mutate_int(x)
x.value

%%bitey
#include <math.h>

struct Point {
  double x;
  double y;
};

double distance(struct Point *p1, struct Point *p2) {
  return sqrt((p1->x - p2->x)*(p1->x - p2->x) + 
	      (p1->y - p2->y)*(p1->y - p2->y));
}

p1 = Point(3,4)
p2 = Point(6,8)
print distance(p1,p2)
print p1.e0, p1.e1

%%bitey -03
/* A function that determines if an integer is a prime number or not.
   This is just a naive implementation--there are faster ways to do it */

int isprime(int n) {
  int factor = 3;
  /* Special case for 2 */
  if (n == 2) {
    return 1;
  }
  /* Check for even numbers */
  if ((n % 2) == 0) {
    return 0;
  }
  /* Check for everything else */
  while (factor*factor < n) {
    if ((n % factor) == 0) {
      return 0;
    }
    factor += 2;
  }
  return 1;
}

%%timeit
isprime(10143937)

%%bitey
double sum1d(double* x, int n)
{
  int i;
  double ret;
  ret = 0.0;
  for(i=0; i<n; i++)
    ret = ret + x[i];
  return ret;
}

%%bitey -O2
double sum1d_O2(double* x, int n)
{
  int i;
  double ret;
  ret = 0.0;
  for(i=0; i<n; i++)
    ret = ret + x[i];
  return ret;
}

import numpy as np
n = 1000
A = np.random.rand(n)
x = np.ctypeslib.as_ctypes(A)
print('sum1d:')
%timeit sum1d(x, n)
print('sum1d_O2:')
%timeit sum1d_O2(x, n)

%%bitey -O2 -x c++
#include <numeric>
extern "C" double sum1d_cpp(double* x, int n)
{
  return std::accumulate(x, x+n, 0.0);
}

print('sum1d_cpp')
%timeit sum1d_cpp(x, n)