summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDiego Biurrun <diego@biurrun.de>2008-08-04 21:54:50 +0000
committerDiego Biurrun <diego@biurrun.de>2008-08-04 21:54:50 +0000
commit354de1d0b5df3b832491b00cbdfc34943033a3ab (patch)
tree77ba894675abb94f71a2a5361c494acbfd29b359
parent910e3668170d2e1e56dc28f8b722232a218e4b9a (diff)
misc spelling/wording fixes
Originally committed as revision 14539 to svn://svn.ffmpeg.org/ffmpeg/trunk
-rw-r--r--libavutil/random.c2
-rw-r--r--libavutil/random.h18
2 files changed, 10 insertions, 10 deletions
diff --git a/libavutil/random.c b/libavutil/random.c
index 0d31e8ad8b..79919882ee 100644
--- a/libavutil/random.c
+++ b/libavutil/random.c
@@ -41,7 +41,7 @@ void av_init_random(unsigned int seed, AVRandomState *state)
int index;
/*
- This differs from the wikipedia article. Source is from the Makoto
+ This differs from the wikipedia article. Source is from the
Makoto Matsumoto and Takuji Nishimura code, with the following comment:
*/
/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
diff --git a/libavutil/random.h b/libavutil/random.h
index 1e10ae48e5..86e4f64e67 100644
--- a/libavutil/random.h
+++ b/libavutil/random.h
@@ -28,17 +28,17 @@
typedef struct {
unsigned int mt[AV_RANDOM_N]; ///< the array for the state vector
- int index; ///< current untempered value we use as the base.
+ int index; ///< Current untempered value we use as the base.
} AVRandomState;
-void av_init_random(unsigned int seed, AVRandomState *state); ///< to be inlined, the struct must be visible, so it doesn't make sense to try and keep it opaque with malloc/free like calls
-void av_random_generate_untempered_numbers(AVRandomState *state); ///< Regenerate the untempered numbers (must be done every 624 iterations, or it will loop)
+void av_init_random(unsigned int seed, AVRandomState *state); ///< To be inlined, the struct must be visible. So it does not make sense to try and keep it opaque with malloc/free-like calls.
+void av_random_generate_untempered_numbers(AVRandomState *state); ///< Regenerate the untempered numbers (must be done every 624 iterations, or it will loop).
/**
- * generates a random number on [0,0xffffffff]-interval
+ * Generates a random number from the interval [0,0xffffffff].
*
- * Please do NOT use the mersenne twister, it is slow, use the random generator
+ * Please do NOT use the Mersenne Twister, it is slow. Use the random generator
* from lfg.c/h or a simple LCG like state= state*1664525+1013904223.
* If you still choose to use MT, expect that you will have to provide
* some evidence that it makes a difference for the case where you use it.
@@ -47,14 +47,14 @@ static inline unsigned int av_random(AVRandomState *state)
{
unsigned int y;
- // regenerate the untempered numbers if we should...
+ // Regenerate the untempered numbers if we should...
if (state->index >= AV_RANDOM_N)
av_random_generate_untempered_numbers(state);
- // grab one...
+ // Grab one...
y = state->mt[state->index++];
- /* Now temper (Mersenne Twister coefficients) The coefficients for MT19937 are.. */
+ /* Now temper (Mersenne Twister coefficients). The coefficients for MT19937 are.. */
y ^= (y >> 11);
y ^= (y << 7) & 0x9d2c5680;
y ^= (y << 15) & 0xefc60000;
@@ -63,7 +63,7 @@ static inline unsigned int av_random(AVRandomState *state)
return y;
}
-/** return random in range [0-1] as double */
+/** Return random in range [0-1] as double. */
static inline double av_random_real1(AVRandomState *state)
{
/* divided by 2^32-1 */