summaryrefslogtreecommitdiff
path: root/2.3-1/src/c/interpolation/interp1/sinterp13a.c
diff options
context:
space:
mode:
authorSandeep Gupta2017-07-05 12:41:25 +0530
committerSandeep Gupta2017-07-05 12:41:25 +0530
commitdd50e95a8193fb0faa846ccaa971a115ba69e71c (patch)
tree8d66abedd68dc5255ad323b95a16c9b592657f35 /2.3-1/src/c/interpolation/interp1/sinterp13a.c
parent3308ea7a973e2c1e1c8bea99ac7cc783ce8e8b06 (diff)
downloadScilab2C-dd50e95a8193fb0faa846ccaa971a115ba69e71c.tar.gz
Scilab2C-dd50e95a8193fb0faa846ccaa971a115ba69e71c.tar.bz2
Scilab2C-dd50e95a8193fb0faa846ccaa971a115ba69e71c.zip
LinearAlgebra and MatrixOperation Update
Diffstat (limited to '2.3-1/src/c/interpolation/interp1/sinterp13a.c')
-rw-r--r--2.3-1/src/c/interpolation/interp1/sinterp13a.c75
1 files changed, 0 insertions, 75 deletions
diff --git a/2.3-1/src/c/interpolation/interp1/sinterp13a.c b/2.3-1/src/c/interpolation/interp1/sinterp13a.c
deleted file mode 100644
index b8cb0851..00000000
--- a/2.3-1/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];
- }
- }
- }
-}
-
-