60 lines
1.2 KiB
C
60 lines
1.2 KiB
C
|
#include "mex.h"
|
||
|
|
|
||
|
|
#define search if (hashtable[i] == hashval){position[0] = i+1;break;};
|
||
|
|
#define BLOCKSIZE (4)
|
||
|
|
|
||
|
|
void mexFunction( int nlhs, mxArray *plhs[],int nrhs, const mxArray*prhs[])
|
||
|
|
{
|
||
|
|
int i, m, blocklimit;
|
||
|
|
double *position,*hashtable,*hashsearch,*tablesize,hashval;
|
||
|
|
|
||
|
|
hashtable = mxGetPr(prhs[0]);
|
||
|
|
hashsearch = mxGetPr(prhs[1]);
|
||
|
|
tablesize = mxGetPr(prhs[2]);
|
||
|
|
|
||
|
|
hashval = hashsearch[0];
|
||
|
|
|
||
|
|
plhs[0] = mxCreateDoubleMatrix(1, 1, mxREAL);
|
||
|
|
|
||
|
|
position = mxGetPr(plhs[0]);
|
||
|
|
position[0] = 0;
|
||
|
|
|
||
|
|
m = mxGetNumberOfElements(prhs[0]);
|
||
|
|
m = tablesize[0];
|
||
|
|
if (m==0)
|
||
|
|
{
|
||
|
|
plhs[0] = mxCreateDoubleMatrix(0, 0, mxREAL);
|
||
|
|
return;
|
||
|
|
}
|
||
|
|
i=0;
|
||
|
|
blocklimit = (m / BLOCKSIZE) * BLOCKSIZE;
|
||
|
|
|
||
|
|
/* Simple loop unrolling */
|
||
|
|
while (i<blocklimit)
|
||
|
|
{
|
||
|
|
search
|
||
|
|
i++;
|
||
|
|
search
|
||
|
|
i++;
|
||
|
|
search
|
||
|
|
i++;
|
||
|
|
search
|
||
|
|
i++;
|
||
|
|
}
|
||
|
|
|
||
|
|
if( i < m )
|
||
|
|
{
|
||
|
|
switch( m - i )
|
||
|
|
{
|
||
|
|
case 3 : search; i++;
|
||
|
|
case 2 : search; i++;
|
||
|
|
case 1 : search;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
if (position[0] == 0)
|
||
|
|
{
|
||
|
|
plhs[0] = mxCreateDoubleMatrix(0, 0, mxREAL);
|
||
|
|
}
|
||
|
|
}
|