annotate toolboxes/FullBNT-1.0.7/bnt/potentials/Tables/marg_tableC.c @ 0:cc4b1211e677 tip

initial commit to HG from Changeset: 646 (e263d8a21543) added further path and more save "camirversion.m"
author Daniel Wolff
date Fri, 19 Aug 2016 13:07:06 +0200
parents
children
rev   line source
Daniel@0 1 /* marg_table.c ../potential/tables */
Daniel@0 2
Daniel@0 3
Daniel@0 4 /******************************************/
Daniel@0 5 /* 5 input & 1 output */
Daniel@0 6 /* Big table */
Daniel@0 7 /* Big domain */
Daniel@0 8 /* Big sizes */
Daniel@0 9 /* onto */
Daniel@0 10 /* maximize, if missed, maximize=0 */
Daniel@0 11 /* */
Daniel@0 12 /* small table */
Daniel@0 13 /******************************************/
Daniel@0 14
Daniel@0 15 #include "mex.h"
Daniel@0 16
Daniel@0 17 void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[]){
Daniel@0 18 int i, j, count, NB, NS, siz_b, siz_s, ndim, temp, maximize;
Daniel@0 19 int *mask, *sx, *sy, *cpsy, *subs, *s, *cpsy2, *ssize;
Daniel@0 20 double *pb, *ps, *bp, *sp, *pbd;
Daniel@0 21
Daniel@0 22
Daniel@0 23 siz_b = mxGetNumberOfElements(prhs[1]);
Daniel@0 24 siz_s = mxGetNumberOfElements(prhs[3]);
Daniel@0 25 pb = mxGetPr(prhs[1]);
Daniel@0 26 ps = mxGetPr(prhs[3]);
Daniel@0 27
Daniel@0 28 NB = mxGetNumberOfElements(prhs[0]);
Daniel@0 29 bp = mxGetPr(prhs[0]);
Daniel@0 30
Daniel@0 31 pbd = mxGetPr(prhs[2]);
Daniel@0 32
Daniel@0 33 if(nrhs < 5) maximize = 0;
Daniel@0 34 else maximize = (int)mxGetScalar(prhs[4]);
Daniel@0 35
Daniel@0 36 if(siz_s == 0){
Daniel@0 37 plhs[0] = mxCreateDoubleMatrix(1, 1, mxREAL);
Daniel@0 38 sp = mxGetPr(plhs[0]);
Daniel@0 39 if(maximize){
Daniel@0 40 for(i=0; i<NB; i++){
Daniel@0 41 *sp = (*sp < bp[i])? bp[i] : *sp;
Daniel@0 42 }
Daniel@0 43 }
Daniel@0 44 else{
Daniel@0 45 for(i=0; i<NB; i++){
Daniel@0 46 *sp += bp[i];
Daniel@0 47 }
Daniel@0 48 }
Daniel@0 49 return;
Daniel@0 50 }
Daniel@0 51
Daniel@0 52 mask = malloc(siz_s * sizeof(int));
Daniel@0 53 ssize = malloc(siz_s * sizeof(int));
Daniel@0 54 count = 0;
Daniel@0 55 for(i=0; i<siz_s; i++){
Daniel@0 56 for(j=0; j<siz_b; j++){
Daniel@0 57 if(ps[i] == pb[j]){
Daniel@0 58 mask[count] = j;
Daniel@0 59 count++;
Daniel@0 60 break;
Daniel@0 61 }
Daniel@0 62 }
Daniel@0 63 }
Daniel@0 64
Daniel@0 65 ndim = siz_b;
Daniel@0 66 sx = (int *)malloc(sizeof(int)*ndim);
Daniel@0 67 sy = (int *)malloc(sizeof(int)*ndim);
Daniel@0 68 for(i=0; i<ndim; i++){
Daniel@0 69 sx[i] = (int)pbd[i];
Daniel@0 70 sy[i] = 1;
Daniel@0 71 }
Daniel@0 72 for(i=0; i<siz_s; i++){
Daniel@0 73 temp = mask[i];
Daniel@0 74 sy[temp] = sx[temp];
Daniel@0 75 ssize[i] = sx[temp];
Daniel@0 76 }
Daniel@0 77
Daniel@0 78 NS = 1;
Daniel@0 79 for(i=0; i<ndim; i++){
Daniel@0 80 NS *= sy[i];
Daniel@0 81 }
Daniel@0 82
Daniel@0 83 plhs[0] = mxCreateNumericArray(siz_s, ssize, mxDOUBLE_CLASS, mxREAL);
Daniel@0 84 sp = mxGetPr(plhs[0]);
Daniel@0 85
Daniel@0 86 if(NS == 1){
Daniel@0 87 if(maximize){
Daniel@0 88 for(i=0; i<NB; i++){
Daniel@0 89 *sp = (*sp < bp[i])? bp[i] : *sp;
Daniel@0 90 }
Daniel@0 91 }
Daniel@0 92 else{
Daniel@0 93 for(i=0; i<NB; i++){
Daniel@0 94 *sp += bp[i];
Daniel@0 95 }
Daniel@0 96 }
Daniel@0 97 free(mask);
Daniel@0 98 free(sx);
Daniel@0 99 free(sy);
Daniel@0 100 free(ssize);
Daniel@0 101 return;
Daniel@0 102 }
Daniel@0 103
Daniel@0 104 if(NS == NB){
Daniel@0 105 for(i=0; i<NB; i++) *sp++ = *bp++;
Daniel@0 106 free(mask);
Daniel@0 107 free(sx);
Daniel@0 108 free(sy);
Daniel@0 109 free(ssize);
Daniel@0 110 return;
Daniel@0 111 }
Daniel@0 112
Daniel@0 113 s = (int *)malloc(sizeof(int)*ndim);
Daniel@0 114 *(cpsy = (int *)malloc(sizeof(int)*ndim)) = 1;
Daniel@0 115 subs = (int *)malloc(sizeof(int)*ndim);
Daniel@0 116 cpsy2 = (int *)malloc(sizeof(int)*ndim);
Daniel@0 117 for(i = 0; i < ndim; i++){
Daniel@0 118 subs[i] = 0;
Daniel@0 119 s[i] = sx[i] - 1;
Daniel@0 120 }
Daniel@0 121
Daniel@0 122 for(i = 0; i < ndim-1; i++){
Daniel@0 123 cpsy[i+1] = cpsy[i]*sy[i]--;
Daniel@0 124 cpsy2[i] = cpsy[i]*sy[i];
Daniel@0 125 }
Daniel@0 126 cpsy2[ndim-1] = cpsy[ndim-1]*(--sy[ndim-1]);
Daniel@0 127
Daniel@0 128 if(maximize){
Daniel@0 129 for(j=0; j<NB; j++){
Daniel@0 130 *sp = (*sp < *bp)? *bp : *sp;
Daniel@0 131 bp++;
Daniel@0 132 for(i = 0; i < ndim; i++){
Daniel@0 133 if(subs[i] == s[i]){
Daniel@0 134 subs[i] = 0;
Daniel@0 135 if(sy[i])
Daniel@0 136 sp -= cpsy2[i];
Daniel@0 137 }
Daniel@0 138 else{
Daniel@0 139 subs[i]++;
Daniel@0 140 if(sy[i])
Daniel@0 141 sp += cpsy[i];
Daniel@0 142 break;
Daniel@0 143 }
Daniel@0 144 }
Daniel@0 145 }
Daniel@0 146 }
Daniel@0 147 else{
Daniel@0 148 for(j=0; j<NB; j++){
Daniel@0 149 *sp += *bp++;
Daniel@0 150 for(i = 0; i < ndim; i++){
Daniel@0 151 if(subs[i] == s[i]){
Daniel@0 152 subs[i] = 0;
Daniel@0 153 if(sy[i])
Daniel@0 154 sp -= cpsy2[i];
Daniel@0 155 }
Daniel@0 156 else{
Daniel@0 157 subs[i]++;
Daniel@0 158 if(sy[i])
Daniel@0 159 sp += cpsy[i];
Daniel@0 160 break;
Daniel@0 161 }
Daniel@0 162 }
Daniel@0 163 }
Daniel@0 164 }
Daniel@0 165
Daniel@0 166 free(sx);
Daniel@0 167 free(sy);
Daniel@0 168 free(s);
Daniel@0 169 free(cpsy);
Daniel@0 170 free(subs);
Daniel@0 171 free(cpsy2);
Daniel@0 172 free(mask);
Daniel@0 173 free(ssize);
Daniel@0 174 }
Daniel@0 175