diff options
author | Sandeep Gupta | 2017-07-05 12:41:25 +0530 |
---|---|---|
committer | Sandeep Gupta | 2017-07-05 12:41:25 +0530 |
commit | 06337f0dc8114c70fd0c7767083971a0d091750a (patch) | |
tree | 446481550ba88e6e0f7df2db7fdc66d2016ee2f1 /src/c/interpolation/interp1/sinterp13a.c | |
parent | c2e305c3b82ed944d57402dd515b3d5839a31980 (diff) | |
download | Scilab2C_fossee_old-06337f0dc8114c70fd0c7767083971a0d091750a.tar.gz Scilab2C_fossee_old-06337f0dc8114c70fd0c7767083971a0d091750a.tar.bz2 Scilab2C_fossee_old-06337f0dc8114c70fd0c7767083971a0d091750a.zip |
LinearAlgebra and MatrixOperation Update
Diffstat (limited to 'src/c/interpolation/interp1/sinterp13a.c')
-rw-r--r-- | src/c/interpolation/interp1/sinterp13a.c | 75 |
1 files changed, 0 insertions, 75 deletions
diff --git a/src/c/interpolation/interp1/sinterp13a.c b/src/c/interpolation/interp1/sinterp13a.c deleted file mode 100644 index b8cb085..0000000 --- a/src/c/interpolation/interp1/sinterp13a.c +++ /dev/null @@ -1,75 +0,0 @@ -/* 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 sinterp13a(float *x,int size1,float *fx,int size2,float *q,int size3,char *ch,int size4,float *out) -{ - int i,j,k,f; - float 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]; - } - } - } -} - - |