summaryrefslogtreecommitdiff
path: root/2.3-1/src/c/elementaryFunctions/linspace
diff options
context:
space:
mode:
Diffstat (limited to '2.3-1/src/c/elementaryFunctions/linspace')
-rw-r--r--2.3-1/src/c/elementaryFunctions/linspace/dlinspacea.c~39
-rw-r--r--2.3-1/src/c/elementaryFunctions/linspace/dlinspaces.c~25
-rw-r--r--2.3-1/src/c/elementaryFunctions/linspace/u8linspacea.c~39
-rw-r--r--2.3-1/src/c/elementaryFunctions/linspace/u8linspaces.c~25
4 files changed, 0 insertions, 128 deletions
diff --git a/2.3-1/src/c/elementaryFunctions/linspace/dlinspacea.c~ b/2.3-1/src/c/elementaryFunctions/linspace/dlinspacea.c~
deleted file mode 100644
index f67968d6..00000000
--- a/2.3-1/src/c/elementaryFunctions/linspace/dlinspacea.c~
+++ /dev/null
@@ -1,39 +0,0 @@
-/*
- Scilab2C FOSSEE IIT Bombay
- */
-
-#include "linspace.h"
-void dlinspacea(double *low_limit,int _row,double *up_limit,double range_num,double *out)
-{
- int i,j,k;
- double temp;
- float step_iterate[_row]; // for each row the spacing between two values is different.
- for(i=0;i<_row;i++)
- {
-
- step_iterate[i] = (up_limit[i]-low_limit[i])/(range_num-1);
-
- }
- for(j=0;j < _row;j++)
- {
- out[j] = low_limit[j]; // For every row first element is the first value of low_limit array
- temp = low_limit[j];
- for(k=1;k < (double)range_num;k++ )
- {
- out[(_row*k)+j] = temp + step_iterate[j]; /* Output matrix positions for 3 X 5 matrix are [0 3 6 9 12;1 4 7 10 13;2 5 8 11 14] so (_row*k)+j) used*/
- temp = out[(_row*k)+j];
- if(k == (double)range_num-1 )
- {
- out[(_row*k)+j] = (double)up_limit[j]; // Last value of output is equal to first value of up_limit array
- }
-
- }
-
-
- }
-
-
-
-
-}
-
diff --git a/2.3-1/src/c/elementaryFunctions/linspace/dlinspaces.c~ b/2.3-1/src/c/elementaryFunctions/linspace/dlinspaces.c~
deleted file mode 100644
index 82b88e34..00000000
--- a/2.3-1/src/c/elementaryFunctions/linspace/dlinspaces.c~
+++ /dev/null
@@ -1,25 +0,0 @@
-/*
- Scilab2C FOSSEE IIT Bombay
- */
-
-#include "linspace.h"
-void dlinspaces(double low_limit,double up_limit,double range_num,double *out)
-{
- int j;
- double temp = low_limit;
- float step_iterate = (up_limit-low_limit)/(range_num-1);
- out[0] = low_limit; //First value of output is equal to low_limit value
- for(j=1; j<(double)range_num; j++)
- {
- out[j] = temp + step_iterate;
- temp = out[j];
- if(j == (double)range_num-1 )
- {
- out[j] = (double)up_limit; // Last value of output is equal to up_limit value
- }
- }
-
-
-
-}
-
diff --git a/2.3-1/src/c/elementaryFunctions/linspace/u8linspacea.c~ b/2.3-1/src/c/elementaryFunctions/linspace/u8linspacea.c~
deleted file mode 100644
index 2e623fa6..00000000
--- a/2.3-1/src/c/elementaryFunctions/linspace/u8linspacea.c~
+++ /dev/null
@@ -1,39 +0,0 @@
-/*
- Scilab2C FOSSEE IIT Bombay
- */
-
-#include "linspace.h"
-void u8linspacea(uint8 *low_limit,int _row,uint8 *up_limit,double range_num,uint8 *out)
-{
- int i,j,k;
- uint8 temp;
- float step_iterate[_row]; // for each row the spacing between two values is different.
- for(i=0;i<_row;i++)
- {
-
- step_iterate[i] = (up_limit[i]-low_limit[i])/(range_num-1);
-
- }
- for(j=0;j < _row;j++)
- {
- out[j] = low_limit[j]; // For every row first element is the first value of low_limit array
- temp = low_limit[j];
- for(k=1;k < (double)range_num;k++ )
- {
- out[(_row*k)+j] = temp + step_iterate[j]; /* Output matrix positions for 3 X 5 matrix are [0 3 6 9 12;1 4 7 10 13;2 5 8 11 14] so (_row*k)+j) used*/
- temp = out[(_row*k)+j];
- if(k == (double)range_num-1 )
- {
- out[(_row*k)+j] = (uint8)up_limit[j]; // Last value of output is equal to first value of up_limit array
- }
-
- }
-
-
- }
-
-
-
-
-}
-
diff --git a/2.3-1/src/c/elementaryFunctions/linspace/u8linspaces.c~ b/2.3-1/src/c/elementaryFunctions/linspace/u8linspaces.c~
deleted file mode 100644
index 0320a276..00000000
--- a/2.3-1/src/c/elementaryFunctions/linspace/u8linspaces.c~
+++ /dev/null
@@ -1,25 +0,0 @@
-/*
- Scilab2C FOSSEE IIT Bombay
- */
-
-#include "linspace.h"
-void u8linspaces(uint8 low_limit,uint8 up_limit,double range_num,uint8 *out)
-{
- int j;
- uint8 temp = low_limit;
- float step_iterate = (up_limit-low_limit)/(range_num-1);
- out[0] = low_limit; //First value of output is equal to low_limit value
- for(j=1; j<(double)range_num; j++)
- {
- out[j] = temp + step_iterate;
- temp = out[j];
- if(j == (double)range_num-1 )
- {
- out[j] = (uint8)up_limit; // Last value of output is equal to up_limit value
- }
- }
-
-
-
-}
-