10 files changed, 375 insertions, 11 deletions
diff --git a/src/c/auxiliaryFunctions/rand/dranda.c b/src/c/auxiliaryFunctions/rand/dranda.c
index f4678279..3defc264 100644
--- a/src/c/auxiliaryFunctions/rand/dranda.c
+++ b/src/c/auxiliaryFunctions/rand/dranda.c
@@ -16,5 +16,5 @@ void dranda(double *out, int size) {
   int i = 0;
   for (i = 0 ; i < size ; ++i) {
     out[i] = drands();
-  }
+      }
 }
diff --git a/src/c/auxiliaryFunctions/rand/drands.c b/src/c/auxiliaryFunctions/rand/drands.c
index 9b7c4cf4..658cd0b0 100644
--- a/src/c/auxiliaryFunctions/rand/drands.c
+++ b/src/c/auxiliaryFunctions/rand/drands.c
@@ -34,37 +34,60 @@ double	drands(void) {
   
       if (m2==0){
 	/*  if first entry, compute machine integer word length */
-		while (m>m2){
+               while (m>m2){
 		m2=m;
 		m=itwo*m2;
+               
 		}
+               
 		halfm = m2;
-	
-		/* compute multiplier and increment for linear congruential method */
+               
+	        /* compute multiplier and increment for linear congruential method */
 		ia = 8*(int)(halfm*atan(1.0)/8.0) + 5;
-		ic = 2*(int)(halfm*(0.5-sqrt(3.0)/6.0)) + 1;
-		mic = (m2 - ic) + m2;
-	
-		/* s is the scale factor for converting to floating point */
+               
+                ic = 2*(int)(halfm*(0.5-sqrt(3.0)/6.0)) + 1;
+		
+                mic = (m2 - ic) + m2;
+               
+                /* s is the scale factor for converting to floating point */
 		s = 0.5/halfm;
+                
+
 	}
 	
 	/* compute next random number	*/
 	iy = iy*ia;
+      
+
 
 	/* the following statement is for computers which do not allow
 	   integer overflow on addition  */
-      if (iy > mic) iy = (iy - m2) - m2;
+      if (iy > mic) 
+       {
+         iy = (iy - m2) - m2;
+        
+       }  
 
       iy = iy + ic;
 
 	/* the following statement is for computers where the
 	   word length for addition is greater than for multiplication */
-      if (iy/2 > m2) iy = (iy - m2) - m2;
+      if (iy/2 > m2)
+       { 
+         iy = (iy - m2) - m2;
+        
+       }
 
 	/* the following statement is for computers where integer
 	   overflow affects the sign bit */
-      if (iy < 0) iy = (iy + m2) + m2;
+      if (iy < 0) 
+       {
+        iy = (iy + m2) + m2;
+       
+
+       }
+      
+
       return (double)iy*s;
 }
 
diff --git a/src/c/auxiliaryFunctions/rand/i16randa.c b/src/c/auxiliaryFunctions/rand/i16randa.c
new file mode 100644
index 00000000..b6aa741d
--- /dev/null
+++ b/src/c/auxiliaryFunctions/rand/i16randa.c
@@ -0,0 +1,23 @@
+/* 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: Mushir
+ Organization: FOSSEE, IIT Bombay
+ Email: toolbox@scilab.in
+*/
+
+#include "rand.h"
+
+void i16randa(double *out,int size)
+{
+  int i = 0;
+  for(i = 0 ; i < size ; ++i)
+    {
+       out[i] = i16rands();
+    }
+
+}
diff --git a/src/c/auxiliaryFunctions/rand/i16rands.c b/src/c/auxiliaryFunctions/rand/i16rands.c
new file mode 100644
index 00000000..67173d23
--- /dev/null
+++ b/src/c/auxiliaryFunctions/rand/i16rands.c
@@ -0,0 +1,57 @@
+/* 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: Mushir
+ Organization: FOSSEE, IIT Bombay
+ Email: toolbox@scilab.in
+*/
+
+#include "rand.h"
+#include <stdio.h>
+
+double i16rands(void)  
+{
+
+int m=1;
+const int itwo=2;
+static int m2=0,halfm=0,ia=0,ic=0,mic=0,iy=0;
+static double s=0.0;
+if(m2==0)
+{
+  /*if first entry,compute machine integer word length*/
+  while(m>m2)
+   {
+      m2=m;
+      m=itwo*m2;
+   }
+   halfm = m2;
+   /* compute multiplier and increment for linear congruential methos */
+   ia = 8*(int)(halfm*atan(1.0)/8.0) + 5;
+   ic = 2*(int)(halfm*(0.5-sqrt(3.0)/6.0)) +1;
+   mic = (m2 - ic) + m2;
+  /* s is the scale factor for converting to floating point*/
+  s = 0.5/halfm;
+
+}
+
+/* compute next random number */
+ iy = iy*ia;
+/* the following statement is for computers which do not allow interger overflow on addition*/
+if(iy > mic) iy = (iy - m2) - m2;
+ iy = iy + ic;
+
+ /* the following statement is for computers where the word length for addition is greater than for multiplication */
+ if(iy/2 > m2) iy = (iy - m2) - m2;
+ /* the following statement is for computers where integer overflow affects the sign bit */
+ if(iy < 0) iy = (iy + m2) + m2;
+ return (double)iy*s;
+
+
+
+
+
+}
diff --git a/src/c/auxiliaryFunctions/rand/i8randa.c b/src/c/auxiliaryFunctions/rand/i8randa.c
new file mode 100644
index 00000000..68d3ff3b
--- /dev/null
+++ b/src/c/auxiliaryFunctions/rand/i8randa.c
@@ -0,0 +1,23 @@
+/* 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: Mushir
+ Organization: FOSSEE, IIT Bombay
+ Email: toolbox@scilab.in
+*/
+
+#include "rand.h"
+
+void i8randa(double *out,int size)
+{
+  int i = 0;
+  for(i = 0 ; i < size ; ++i)
+    {
+       out[i] = i8rands();
+    }
+
+}
diff --git a/src/c/auxiliaryFunctions/rand/i8rands.c b/src/c/auxiliaryFunctions/rand/i8rands.c
new file mode 100644
index 00000000..e9b30a33
--- /dev/null
+++ b/src/c/auxiliaryFunctions/rand/i8rands.c
@@ -0,0 +1,53 @@
+/* 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: Mushir
+ Organization: FOSSEE, IIT Bombay
+ Email: toolbox@scilab.in
+*/
+
+#include "rand.h"
+#include <stdio.h>
+
+double i8rands(void)  
+{
+
+int m=1;
+const int itwo=2;
+static int m2=0,halfm=0,ia=0,ic=0,mic=0,iy=0;
+static double s=0.0;
+if(m2==0)
+{
+  /*if first entry,compute machine integer word length*/
+  while(m>m2)
+   {
+      m2=m;
+      m=itwo*m2;
+   }
+   halfm = m2;
+   /* compute multiplier and increment for linear congruential methos */
+   ia = 8*(int)(halfm*atan(1.0)/8.0) + 5;
+   ic = 2*(int)(halfm*(0.5-sqrt(3.0)/6.0)) +1;
+   mic = (m2 - ic) + m2;
+  /* s is the scale factor for converting to floating point*/
+  s = 0.5/halfm;
+
+}
+
+/* compute next random number */
+ iy = iy*ia;
+/* the following statement is for computers which do not allow interger overflow on addition*/
+if(iy > mic) iy = (iy - m2) - m2;
+ iy = iy + ic;
+
+ /* the following statement is for computers where the word length for addition is greater than for multiplication */
+ if(iy/2 > m2) iy = (iy - m2) - m2;
+ /* the following statement is for computers where integer overflow affects the sign bit */
+ if(iy < 0) iy = (iy + m2) + m2;
+ return (double)iy*s;
+
+}
diff --git a/src/c/auxiliaryFunctions/rand/u16randa.c b/src/c/auxiliaryFunctions/rand/u16randa.c
new file mode 100644
index 00000000..cfcfb50f
--- /dev/null
+++ b/src/c/auxiliaryFunctions/rand/u16randa.c
@@ -0,0 +1,23 @@
+/* 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: Mushir
+ Organization: FOSSEE, IIT Bombay
+ Email: toolbox@scilab.in
+*/
+
+#include "rand.h"
+
+void u16randa(double *out,int size)
+{
+  int i = 0;
+  for(i = 0 ; i < size ; ++i)
+    {
+       out[i] = u16rands();
+    }
+
+}
diff --git a/src/c/auxiliaryFunctions/rand/u16rands.c b/src/c/auxiliaryFunctions/rand/u16rands.c
new file mode 100644
index 00000000..2023be4a
--- /dev/null
+++ b/src/c/auxiliaryFunctions/rand/u16rands.c
@@ -0,0 +1,57 @@
+/* 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: Mushir
+ Organization: FOSSEE, IIT Bombay
+ Email: toolbox@scilab.in
+*/
+
+#include "rand.h"
+#include <stdio.h>
+
+double u16rands(void)  
+{
+
+int m=1;
+const int itwo=2;
+static int m2=0,halfm=0,ia=0,ic=0,mic=0,iy=0;
+static double s=0;
+if(m2==0)
+{
+  /*if first entry,compute machine integer word length*/
+  while(m>m2)
+   {
+      m2=m;
+      m=itwo*m2;
+   }
+   halfm = m2;
+   /* compute multiplier and increment for linear congruential methos */
+   ia = 8*(int)(halfm*atan(1.0)/8.0) + 5;
+   ic = 2*(int)(halfm*(0.5-sqrt(3.0)/6.0)) +1;
+   mic = (m2 - ic) + m2;
+  /* s is the scale factor for converting to floating point*/
+  s = 0.5/halfm;
+
+}
+
+/* compute next random number */
+ iy = iy*ia;
+/* the following statement is for computers which do not allow interger overflow on addition*/
+if(iy > mic) iy = (iy - m2) - m2;
+ iy = iy + ic;
+
+ /* the following statement is for computers where the word length for addition is greater than for multiplication */
+ if(iy/2 > m2) iy = (iy - m2) - m2;
+ /* the following statement is for computers where integer overflow affects the sign bit */
+ if(iy < 0) iy = (iy + m2) + m2;
+ return (double)iy*s;
+
+
+
+}
+
+
diff --git a/src/c/auxiliaryFunctions/rand/u8randa.c b/src/c/auxiliaryFunctions/rand/u8randa.c
new file mode 100644
index 00000000..a7fc5836
--- /dev/null
+++ b/src/c/auxiliaryFunctions/rand/u8randa.c
@@ -0,0 +1,26 @@
+/* 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: Mushir
+ Organization: FOSSEE, IIT Bombay
+ Email: toolbox@scilab.in
+*/
+
+#include "rand.h"
+#include<stdio.h>
+void u8randa(double *out,int size)
+{
+  
+  int i = 0;
+   
+  for(i = 0 ; i < size ; ++i)
+    {
+       out[i] = u8rands();
+      
+    }
+
+}
diff --git a/src/c/auxiliaryFunctions/rand/u8rands.c b/src/c/auxiliaryFunctions/rand/u8rands.c
new file mode 100644
index 00000000..d03741a4
--- /dev/null
+++ b/src/c/auxiliaryFunctions/rand/u8rands.c
@@ -0,0 +1,79 @@
+/* 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: Mushir
+ Organization: FOSSEE, IIT Bombay
+ Email: toolbox@scilab.in
+*/
+
+#include "rand.h"
+#include <stdio.h>
+
+double u8rands(void)  
+{
+
+int m=1;
+const int itwo=2;
+static int m2=0,halfm=0,ia=0,ic=0,mic=0,iy=0;
+static double s=0.0;
+if(m2==0)
+{ 
+  /*if first entry,compute machine integer word length*/
+ 
+  while(m>m2)
+   { 
+      
+      m2=m;
+     
+      m=itwo*m2;
+    
+   }
+  
+   halfm = m2;
+     /* compute multiplier and increment for linear congruential methos */
+   ia = 8*(int)(halfm*atan(1.0)/8.0) + 5;
+   ic = 2*(int)(halfm*(0.5-sqrt(3.0)/6.0)) +1;
+  
+   mic = (m2 - ic) + m2;
+   
+  /* s is the scale factor for converting to floating point*/
+   s = 0.5/halfm;
+  
+
+}
+
+/* compute next random number */
+ iy = iy*ia;
+ 
+/* the following statement is for computers which do not allow interger overflow on addition*/
+if(iy > mic) 
+{
+ iy = (iy - m2) - m2;
+ 
+}
+ iy = iy + ic;
+
+ /* the following statement is for computers where the word length for addition is greater than for multiplication */
+ if(iy/2 > m2)
+{
+ iy = (iy - m2) - m2;
+ 
+}
+ /* the following statement is for computers where integer overflow affects the sign bit */
+ if(iy < 0) 
+ {
+ iy = (iy + m2) + m2;
+ 
+ }
+
+ return (double)iy*s;
+
+
+
+
+
+}