randg() w żadnym razie nie może zwracac 1 !!!

Author: borkowsk

EXAMPLES/Testrand.cpp

@@ -2,7 +2,7 @@
 /// @brief Random points in a resizable window/
 ///        Losowe punkty w oknie, którego rozmiar można zmieniać.
 //-------------------------------------------------------------------------
-/// @date 2026-04-24 (last update)
+/// @date 2026-05-11 (last update)
 /// @page page_e8_randpoints RANDOM POINTS/LOSOWE PUNKTY
 /// @brief Random points in a resizable window/Losowe punkty w oknie, którego rozmiar można zmieniać
 /// @section intro_sec_e8 Random points in a resizable window/Losowe punkty w oknie o zmiennym rozmiarze
@@ -17,7 +17,8 @@
 #include <cstdio>
 #include <cstdlib>
 #include <cfloat>
-#define USES_STDC_RAND
+//#define USES_STDC_RAND
+#define USES_RANDG
 //#include "random.h"
 #include "wb_rand.hpp"
 #include "wb_cpucl.hpp"

UTILS/RTM_LIGHT/wb_randg.c

@@ -1,8 +1,7 @@
 /** \file
- *  \brief IMPLEMENTATION FOR PSEUDORANDOM NUMBER GENERATOR "randg".
- * @date 2026-04-30 (last modification)
- * @note When using the full RTM library there is no need to add this file in your project!
- * ****************************************************************************************************************** */
+ *  \brief IMPLEMENTATION FOR PSEUDORANDOM NUMBER GENERATOR "randg". */
+/*        ========================================================== */
+/** @date 2026-05-11 (last modification) */
 
 #include <stdlib.h>
 #include <stdio.h>
@@ -44,48 +43,51 @@ void srandg(short int srandg_init_val)
 float randg()
 {
   //TODO - MUTEXOWE ZABEZPIECZENIE ::rand() na wielowątkowość!!!
-  static short int        inext, inextp;
-  static int32            ma[55];
-  int32                   mj, mk, mbig = 1000000000;
-  short int               i, k;
-
-  if (di < 0)
-  {
-    mj = 161803398 - abs(di);
-    mj %= mbig;
-    ma[54] = mj;
-    mk = 1;
-    for (i=1; i <= 54; i++)
+    static int16_t       inext, inextp;
+    static int32_t       ma[55];
+    int32_t              mj, mk, mbig = 1000000000;
+    int16_t              i, k;
+
+    if (di < 0)
     {
-      k = (21 * i) % 55;
-      ma[k - 1] = mk;
-      mk = mj - mk;
-      if (mk < 0)
-    mk += mbig;
-      mj = ma[k - 1];
+        mj = 161803398 - abs(di);
+        mj %= mbig;
+        ma[54] = mj;
+        mk = 1;
+        for (i=1; i <= 54; i++)
+        {
+            k = (21 * i) % 55;
+            ma[k - 1] = mk;
+            mk = mj - mk;
+            if (mk < 0)
+                mk += mbig;
+            mj = ma[k - 1];
+        };
+        for (k = 1; k <= 4; k++)
+            for (i = 1; i <= 55; i++)
+            {
+                ma[i - 1] -= ma[(i + 30) % 55];
+                if (ma[i - 1] < 0)
+                    ma[i - 1] += mbig;
+            };
+        inext = 0;
+        inextp = 31;
+        di= 1;
     };
-    for (k = 1; k <= 4; k++)
-      for (i = 1; i <= 55; i++)
-      {
-    ma[i - 1] -= ma[(i + 30) % 55];
-    if (ma[i - 1] < 0)
-      ma[i - 1] += mbig;
-      };
-    inext = 0;
-    inextp = 31;
-    di= 1;
-  };
-  inext++;
-  if (inext == 56)
-    inext = 1;
-  inextp++;
-  if (inextp == 56)
-    inextp = 1;
-  mj=ma[inext - 1] - ma[inextp - 1];
-  if (mj < 0)
-    mj += mbig;
-  ma[inext - 1] = mj;
-  return (mj * 1.e-9f);/* CZY MOŻE BYĆ 1.e-9f czy powinno BYĆ MAX. DLA DOUBLE? */
+    inext++;
+    if (inext == 56)
+        inext = 1;
+    inextp++;
+    if (inextp == 56)
+        inextp = 1;
+    mj=ma[inext - 1] - ma[inextp - 1];
+    if (mj < 0)
+        mj += mbig;
+    ma[inext - 1] = mj;
+    float tmp=(mj * 1.e-9f);                //assert(tmp<1.0f);
+    if(tmp>=1) /* Czasem się tak jednak zdarza... */
+        tmp=0.999999940395355224609375f;
+    return tmp;/* CZY MOŻE BYC 1.e-9f czy winno BYC DOUBLE */
 }
 
 float randnorm()
@@ -127,6 +129,6 @@ float randexp()
     return (float)( -log(dum) );
 }
 
-/* *************************** */
-/* FROM OLD Numerical Recipies */
-/* *************************** */
+/* ********************************************* */
+/* For WBRTM (light) FROM OLD Numerical Recipies */
+/* ********************************************* */