X-Git-Url: https://git.verplant.org/?a=blobdiff_plain;f=src%2Frandom_generator.cpp;h=ea03c413e05a40b96dcfb98f924dfa5006fca0a3;hb=08ccb17345a52f5ffd8a5dd6ecf675cad55f16a7;hp=90fbd5cd64a26f02cc28b603eb880587f05c7b7f;hpb=fea3446f05e1e7673607b835c269d3e8d1929ab3;p=supertux.git

diff --git a/src/random_generator.cpp b/src/random_generator.cpp
index 90fbd5cd6..ea03c413e 100644
--- a/src/random_generator.cpp
+++ b/src/random_generator.cpp
@@ -67,7 +67,7 @@ int RandomGenerator::srand(int x)    {
 }
 
 int RandomGenerator::rand() {
-    int rv;                                  // a posative int
+    int rv;                                  // a positive int
     while ((rv = RandomGenerator::random()) <= 0) // neg or zero causes probs
         ;
     if (debug > 0)
@@ -147,7 +147,7 @@ double RandomGenerator::randf(double u, double v) {
 // then initialized to contain information for random number generation with
 // that much state information.  Good sizes for the amount of state
 // information are 32, 64, 128, and 256 bytes.  The state can be switched by
-// calling the setstate() routine with the same array as was initiallized
+// calling the setstate() routine with the same array as was initialized
 // with initstate().  By default, the package runs with 128 bytes of state
 // information and generates far better random numbers than a linear
 // congruential generator.  If the amount of state information is less than
@@ -302,7 +302,7 @@ void RandomGenerator::initialize() {
 
 //
 // Compute x = (7^5 * x) mod (2^31 - 1)
-// wihout overflowing 31 bits:
+// without overflowing 31 bits:
 //      (2^31 - 1) = 127773 * (7^5) + 2836
 // From "Random number generators: good ones are hard to find",
 // Park and Miller, Communications of the ACM, vol. 31, no. 10,