// A huge file has all the integers starting from 0 that it can hold in the amount of space it takes... i.e. 32GB worth of integers.// One of the integers is missing
// Find the missing number in a file

int FindTheMissingNumber (int * intFilePointer, int numInts, int maxBits) {

#include <cstdio>
#include <cstdlib>

typedef int val_t;

#include <cstdlib>
#include <cstdio>


int main (int argc, char ** argv) {

import random
import numpy
import matplotlib.pyplot as plt 

GOODNUMBERS = [2,3,5,6,8,10,12]

#include <boost/thread.hpp>
#include <iostream>

void hello()
{

import sys 
import glob
# CDF is of my own creation
from ColumnDataFile import ColumnDataFile as CDF 
import matplotlib.pyplot as plt 

import nlopt
from numpy import *

def myfunc(x, grad):
    if grad.size > 0:

''' Brute force calculation of the correlation function '''
def ManualCorrelate(func,tau,x,y=None):
    Nstep = float(len(x))
    Ncorr = tau
    Nshift = 1

def ManualCorrelate(func,tau,x,y=None):
    Nstep = float(len(x))
    Ncorr = tau
    Nshift = 1
    Nav = int((Nstep-Ncorr)/Nshift)

-- Easy vector routines
module HaskellMD.Vector
(Position,
 Coordinates,

import numpy

# Here's how I do autocorrelation. There's no ensemble average going on here, yet.
# Given a list of discrete data points, returns the ACF
def autocorr(x):

#include <cstdlib>
#include <stdio.h>
#include <iostream>
#include <mkl_cblas.h>

    using namespace boost::numeric::ublas;
    typedef matrix<double> matrix_t;
    typedef matrix_slice<matrix_t> submatrix;

    using namespace boost::numeric::ublas;
    typedef matrix<double> matrix_t;
    typedef matrix_slice<matrix_t> submatrix;