1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
/**
* @file llrand.h
* @brief Information, functions, and typedefs for randomness.
*
* Copyright (c) 2000-2007, Linden Research, Inc.
*
* The source code in this file ("Source Code") is provided by Linden Lab
* to you under the terms of the GNU General Public License, version 2.0
* ("GPL"), unless you have obtained a separate licensing agreement
* ("Other License"), formally executed by you and Linden Lab. Terms of
* the GPL can be found in doc/GPL-license.txt in this distribution, or
* online at http://secondlife.com/developers/opensource/gplv2
*
* There are special exceptions to the terms and conditions of the GPL as
* it is applied to this Source Code. View the full text of the exception
* in the file doc/FLOSS-exception.txt in this software distribution, or
* online at http://secondlife.com/developers/opensource/flossexception
*
* By copying, modifying or distributing this software, you acknowledge
* that you have read and understood your obligations described above,
* and agree to abide by those obligations.
*
* ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO
* WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY,
* COMPLETENESS OR PERFORMANCE.
*/
#ifndef LL_LLRAND_H
#define LL_LLRAND_H
#include "boost/random/lagged_fibonacci.hpp"
#include "boost/random/mersenne_twister.hpp"
/**
* Use the boost random number generators if you want a stateful
* random numbers. If you want more random numbers, use the
* c-functions since they will generate faster/better randomness
* across the process.
*
* I tested some of the boost random engines, and picked a good double
* generator and a good integer generator. I also took some timings
* for them on linux using gcc 3.3.5. The harness also did some other
* fairly trivial operations to try to limit compiler optimizations,
* so these numbers are only good for relative comparisons.
*
* usec/inter algorithm
* 0.21 boost::minstd_rand0
* 0.039 boost:lagged_fibonacci19937
* 0.036 boost:lagged_fibonacci607
* 0.44 boost::hellekalek1995
* 0.44 boost::ecuyer1988
* 0.042 boost::rand48
* 0.043 boost::mt11213b
* 0.028 stdlib random()
* 0.05 stdlib lrand48()
* 0.034 stdlib rand()
* 0.020 the old & lame LLRand
*/
/**
*@brief Generate a float from [0, RAND_MAX).
*/
S32 ll_rand();
/**
*@brief Generate a float from [0, val) or (val, 0].
*/
S32 ll_rand(S32 val);
/**
*@brief Generate a float from [0, 1.0).
*/
F32 ll_frand();
/**
*@brief Generate a float from [0, val) or (val, 0].
*/
F32 ll_frand(F32 val);
/**
*@brief Generate a double from [0, 1.0).
*/
F64 ll_drand();
/**
*@brief Generate a double from [0, val) or (val, 0].
*/
F64 ll_drand(F64 val);
/**
* @brief typedefs for good boost lagged fibonacci.
* @see boost::lagged_fibonacci
*
* These generators will quickly generate doubles. Note the memory
* requirements, because they are somewhat high. I chose the smallest
* one, and one comparable in speed but higher periodicity without
* outrageous memory requirements.
* To use:
* LLRandLagFib607 foo((U32)time(NULL));
* double bar = foo();
*/
typedef boost::lagged_fibonacci607 LLRandLagFib607;
/**<
* lengh of cycle: 2^32,000
* memory: 607*sizeof(double) (about 5K)
*/
typedef boost::lagged_fibonacci2281 LLRandLagFib2281;
/**<
* lengh of cycle: 2^120,000
* memory: 2281*sizeof(double) (about 17K)
*/
/**
* @breif typedefs for a good boost mersenne twister implementation.
* @see boost::mersenne_twister
*
* This fairly quickly generates U32 values
* To use:
* LLRandMT19937 foo((U32)time(NULL));
* U32 bar = foo();
*
* lengh of cycle: 2^19,937-1
* memory: about 2496 bytes
*/
typedef boost::mt11213b LLRandMT19937;
#endif
|
