summaryrefslogtreecommitdiff
path: root/2.3-1/src/c/interpolation/interp1/dinterp13a.c
diff options
context:
space:
mode:
authorBrijeshcr2017-07-06 15:24:41 +0530
committerGitHub2017-07-06 15:24:41 +0530
commita7eeecce4c7c39ea52a2d434815c574a2c42730d (patch)
tree9968264546fd54f9eaa6ad80ee7db47e366f8601 /2.3-1/src/c/interpolation/interp1/dinterp13a.c
parent3308ea7a973e2c1e1c8bea99ac7cc783ce8e8b06 (diff)
parent115efeb443a7e6da44f628537811b69a01553ab2 (diff)
downloadScilab2C-a7eeecce4c7c39ea52a2d434815c574a2c42730d.tar.gz
Scilab2C-a7eeecce4c7c39ea52a2d434815c574a2c42730d.tar.bz2
Scilab2C-a7eeecce4c7c39ea52a2d434815c574a2c42730d.zip
Merge pull request #3 from sandeepgupta007/master
LinearAlgebra Function Added
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, 0 insertions, 75 deletions
diff --git a/2.3-1/src/c/interpolation/interp1/dinterp13a.c b/2.3-1/src/c/interpolation/interp1/dinterp13a.c
deleted file mode 100644
index 7b755e1c..00000000
--- a/2.3-1/src/c/interpolation/interp1/dinterp13a.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 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];
- }
- }
- }
-}
-
-