diff options
author | siddhu8990 | 2017-06-21 15:18:15 +0530 |
---|---|---|
committer | siddhu8990 | 2017-06-21 15:18:15 +0530 |
commit | 9abc909f1a02c7c0262e2d53b13504c7ee324fda (patch) | |
tree | ba4dfe442b9735204ede017eb0d20f179a5c4b4e /2.3-1/src/c/interpolation/interp1 | |
parent | 34bffcd2d147db6733499af5b6f32996d847a733 (diff) | |
parent | 5efb98c6773576e39a33df5cfc89979c07031a6a (diff) | |
download | Scilab2C-9abc909f1a02c7c0262e2d53b13504c7ee324fda.tar.gz Scilab2C-9abc909f1a02c7c0262e2d53b13504c7ee324fda.tar.bz2 Scilab2C-9abc909f1a02c7c0262e2d53b13504c7ee324fda.zip |
Merged Ukasha's work, code generation for control loop changed
Diffstat (limited to '2.3-1/src/c/interpolation/interp1')
-rw-r--r-- | 2.3-1/src/c/interpolation/interp1/dinterp13a.c | 75 |
1 files changed, 75 insertions, 0 deletions
diff --git a/2.3-1/src/c/interpolation/interp1/dinterp13a.c b/2.3-1/src/c/interpolation/interp1/dinterp13a.c new file mode 100644 index 00000000..7b755e1c --- /dev/null +++ b/2.3-1/src/c/interpolation/interp1/dinterp13a.c @@ -0,0 +1,75 @@ +/* Copyright (C) 2016 - IIT Bombay - FOSSEE + + This file must be used under the terms of the CeCILL. + This source file is licensed as described in the file COPYING, which + you should have received as part of this distribution. The terms + are also available at + http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt + Author: Ukasha Noor + Organization: FOSSEE, IIT Bombay + Email: toolbox@scilab.in +*/ + + +#include "interp1.h" +#include <string.h> + +void dinterp13a(double *x,int size1,double *fx,int size2,double *q,int size3,char *ch,int size4,double *out) +{ + int i,j,k,f; + double a,b; + if(strcmp(ch,"linear")==0) + { + for(i=0;i<size3;i++) + { + f=0; + for(j=0;j<size1;j++) + { + if(q[i]==x[j]) + { + out[i]=fx[j]; + f=1; + break; + } + } + if(f==0) + { + j=0; + while(q[i]>x[j]) + { + j++; + } + a=x[j-1]; + b=x[j]; + out[i]=fx[j-1]+(q[i]-a)*((fx[j]-fx[j-1])/(b-a)); + } + } + } + else if(strcmp(ch,"nearest")==0) + { + for(i=0;i<size3;i++) + { + f=0; + for(j=0;j<size1;j++) + { + if(q[i]==x[j]) + { + out[i]=fx[j]; + f=1; + break; + } + } + if(f==0) + { + j=0; + while(q[i]>x[j]) + { + j++; + } + out[i]=fx[j]; + } + } + } +} + + |