diff options
Diffstat (limited to 'src/c/elementaryFunctions/linspace')
-rw-r--r-- | src/c/elementaryFunctions/linspace/dlinspacea.c | 39 | ||||
-rw-r--r-- | src/c/elementaryFunctions/linspace/dlinspacea.c~ | 39 | ||||
-rw-r--r-- | src/c/elementaryFunctions/linspace/dlinspaces.c | 25 | ||||
-rw-r--r-- | src/c/elementaryFunctions/linspace/dlinspaces.c~ | 25 | ||||
-rw-r--r-- | src/c/elementaryFunctions/linspace/u8linspacea.c~ | 39 | ||||
-rw-r--r-- | src/c/elementaryFunctions/linspace/u8linspaces.c~ | 25 |
6 files changed, 192 insertions, 0 deletions
diff --git a/src/c/elementaryFunctions/linspace/dlinspacea.c b/src/c/elementaryFunctions/linspace/dlinspacea.c new file mode 100644 index 0000000..f67968d --- /dev/null +++ b/src/c/elementaryFunctions/linspace/dlinspacea.c @@ -0,0 +1,39 @@ +/* + 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/src/c/elementaryFunctions/linspace/dlinspacea.c~ b/src/c/elementaryFunctions/linspace/dlinspacea.c~ new file mode 100644 index 0000000..f67968d --- /dev/null +++ b/src/c/elementaryFunctions/linspace/dlinspacea.c~ @@ -0,0 +1,39 @@ +/* + 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/src/c/elementaryFunctions/linspace/dlinspaces.c b/src/c/elementaryFunctions/linspace/dlinspaces.c new file mode 100644 index 0000000..82b88e3 --- /dev/null +++ b/src/c/elementaryFunctions/linspace/dlinspaces.c @@ -0,0 +1,25 @@ +/* + 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/src/c/elementaryFunctions/linspace/dlinspaces.c~ b/src/c/elementaryFunctions/linspace/dlinspaces.c~ new file mode 100644 index 0000000..82b88e3 --- /dev/null +++ b/src/c/elementaryFunctions/linspace/dlinspaces.c~ @@ -0,0 +1,25 @@ +/* + 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/src/c/elementaryFunctions/linspace/u8linspacea.c~ b/src/c/elementaryFunctions/linspace/u8linspacea.c~ new file mode 100644 index 0000000..2e623fa --- /dev/null +++ b/src/c/elementaryFunctions/linspace/u8linspacea.c~ @@ -0,0 +1,39 @@ +/* + 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/src/c/elementaryFunctions/linspace/u8linspaces.c~ b/src/c/elementaryFunctions/linspace/u8linspaces.c~ new file mode 100644 index 0000000..0320a27 --- /dev/null +++ b/src/c/elementaryFunctions/linspace/u8linspaces.c~ @@ -0,0 +1,25 @@ +/* + 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 + } + } + + + +} + |