summaryrefslogtreecommitdiff
path: root/2.3-1/src/c/interpolation/interp1/dinterp13a.c
diff options
context:
space:
mode:
authorAnkitr192017-07-04 15:33:41 +0530
committerAnkitr192017-07-04 15:33:41 +0530
commit46f9a6c3b848a549f5d92929fd6d1efb501e176a (patch)
tree0063bfdcb730f75e8cd4281d6f775791883c87d4 /2.3-1/src/c/interpolation/interp1/dinterp13a.c
parent5cfbe7196dd381f1e3f49f5673ce5c9291748364 (diff)
parentc66867c874436fb37ef54c67b048885ce094e894 (diff)
downloadScilab2C-46f9a6c3b848a549f5d92929fd6d1efb501e176a.tar.gz
Scilab2C-46f9a6c3b848a549f5d92929fd6d1efb501e176a.tar.bz2
Scilab2C-46f9a6c3b848a549f5d92929fd6d1efb501e176a.zip
New functions added and rpi issues resolved
Diffstat (limited to '2.3-1/src/c/interpolation/interp1/dinterp13a.c')
-rw-r--r--2.3-1/src/c/interpolation/interp1/dinterp13a.c75
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];
+ }
+ }
+ }
+}
+
+