<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>SphinxBase: src/libsphinxbase/util/genrand.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.3 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">SphinxBase <span id="projectnumber">0.6</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
initNavTree('genrand_8c.html','');
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<h1>src/libsphinxbase/util/genrand.c</h1> </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */</span>
<a name="l00002"></a>00002 <span class="comment">/* ====================================================================</span>
<a name="l00003"></a>00003 <span class="comment"> * Copyright (c) 1999-2004 Carnegie Mellon University. All rights</span>
<a name="l00004"></a>00004 <span class="comment"> * reserved.</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00007"></a>00007 <span class="comment"> * modification, are permitted provided that the following conditions</span>
<a name="l00008"></a>00008 <span class="comment"> * are met:</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * 1. Redistributions of source code must retain the above copyright</span>
<a name="l00011"></a>00011 <span class="comment"> * notice, this list of conditions and the following disclaimer. </span>
<a name="l00012"></a>00012 <span class="comment"> *</span>
<a name="l00013"></a>00013 <span class="comment"> * 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00014"></a>00014 <span class="comment"> * notice, this list of conditions and the following disclaimer in</span>
<a name="l00015"></a>00015 <span class="comment"> * the documentation and/or other materials provided with the</span>
<a name="l00016"></a>00016 <span class="comment"> * distribution.</span>
<a name="l00017"></a>00017 <span class="comment"> *</span>
<a name="l00018"></a>00018 <span class="comment"> * This work was supported in part by funding from the Defense Advanced </span>
<a name="l00019"></a>00019 <span class="comment"> * Research Projects Agency and the National Science Foundation of the </span>
<a name="l00020"></a>00020 <span class="comment"> * United States of America, and the CMU Sphinx Speech Consortium.</span>
<a name="l00021"></a>00021 <span class="comment"> *</span>
<a name="l00022"></a>00022 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND </span>
<a name="l00023"></a>00023 <span class="comment"> * ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, </span>
<a name="l00024"></a>00024 <span class="comment"> * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR</span>
<a name="l00025"></a>00025 <span class="comment"> * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY</span>
<a name="l00026"></a>00026 <span class="comment"> * NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span>
<a name="l00027"></a>00027 <span class="comment"> * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT </span>
<a name="l00028"></a>00028 <span class="comment"> * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, </span>
<a name="l00029"></a>00029 <span class="comment"> * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY </span>
<a name="l00030"></a>00030 <span class="comment"> * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT </span>
<a name="l00031"></a>00031 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE </span>
<a name="l00032"></a>00032 <span class="comment"> * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00033"></a>00033 <span class="comment"> *</span>
<a name="l00034"></a>00034 <span class="comment"> * ====================================================================</span>
<a name="l00035"></a>00035 <span class="comment"> *</span>
<a name="l00036"></a>00036 <span class="comment"> */</span>
<a name="l00037"></a>00037 <span class="comment">/* </span>
<a name="l00038"></a>00038 <span class="comment"> A C-program for MT19937, with initialization improved 2002/1/26.</span>
<a name="l00039"></a>00039 <span class="comment"> Coded by Takuji Nishimura and Makoto Matsumoto.</span>
<a name="l00040"></a>00040 <span class="comment"></span>
<a name="l00041"></a>00041 <span class="comment"> Before using, initialize the state by using init_genrand(seed) </span>
<a name="l00042"></a>00042 <span class="comment"> or init_by_array(init_key, key_length).</span>
<a name="l00043"></a>00043 <span class="comment"></span>
<a name="l00044"></a>00044 <span class="comment"> Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,</span>
<a name="l00045"></a>00045 <span class="comment"> All rights reserved. </span>
<a name="l00046"></a>00046 <span class="comment"></span>
<a name="l00047"></a>00047 <span class="comment"> Redistribution and use in source and binary forms, with or without</span>
<a name="l00048"></a>00048 <span class="comment"> modification, are permitted provided that the following conditions</span>
<a name="l00049"></a>00049 <span class="comment"> are met:</span>
<a name="l00050"></a>00050 <span class="comment"></span>
<a name="l00051"></a>00051 <span class="comment"> 1. Redistributions of source code must retain the above copyright</span>
<a name="l00052"></a>00052 <span class="comment"> notice, this list of conditions and the following disclaimer.</span>
<a name="l00053"></a>00053 <span class="comment"></span>
<a name="l00054"></a>00054 <span class="comment"> 2. Redistributions in binary form must reproduce the above copyright</span>
<a name="l00055"></a>00055 <span class="comment">` notice, this list of conditions and the following disclaimer in the</span>
<a name="l00056"></a>00056 <span class="comment"> documentation and/or other materials provided with the distribution.</span>
<a name="l00057"></a>00057 <span class="comment"></span>
<a name="l00058"></a>00058 <span class="comment"> 3. The names of its contributors may not be used to endorse or promote </span>
<a name="l00059"></a>00059 <span class="comment"> products derived from this software without specific prior written </span>
<a name="l00060"></a>00060 <span class="comment"> permission.</span>
<a name="l00061"></a>00061 <span class="comment"></span>
<a name="l00062"></a>00062 <span class="comment"> THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS</span>
<a name="l00063"></a>00063 <span class="comment"> "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT</span>
<a name="l00064"></a>00064 <span class="comment"> LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR</span>
<a name="l00065"></a>00065 <span class="comment"> A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR</span>
<a name="l00066"></a>00066 <span class="comment"> CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,</span>
<a name="l00067"></a>00067 <span class="comment"> EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,</span>
<a name="l00068"></a>00068 <span class="comment"> PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR</span>
<a name="l00069"></a>00069 <span class="comment"> PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF</span>
<a name="l00070"></a>00070 <span class="comment"> LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING</span>
<a name="l00071"></a>00071 <span class="comment"> NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span>
<a name="l00072"></a>00072 <span class="comment"> SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00073"></a>00073 <span class="comment"></span>
<a name="l00074"></a>00074 <span class="comment"></span>
<a name="l00075"></a>00075 <span class="comment"> Any feedback is very welcome.</span>
<a name="l00076"></a>00076 <span class="comment"> http://www.math.keio.ac.jp/matumoto/emt.html</span>
<a name="l00077"></a>00077 <span class="comment"> email: matumoto@math.keio.ac.jp</span>
<a name="l00078"></a>00078 <span class="comment">*/</span>
<a name="l00079"></a>00079
<a name="l00080"></a>00080
<a name="l00081"></a>00081 <span class="comment">/*</span>
<a name="l00082"></a>00082 <span class="comment"> * randgen.c : a portable random generator </span>
<a name="l00083"></a>00083 <span class="comment"> * </span>
<a name="l00084"></a>00084 <span class="comment"> *</span>
<a name="l00085"></a>00085 <span class="comment"> * **********************************************</span>
<a name="l00086"></a>00086 <span class="comment"> * CMU ARPA Speech Project</span>
<a name="l00087"></a>00087 <span class="comment"> *</span>
<a name="l00088"></a>00088 <span class="comment"> * Copyright (c) 1999 Carnegie Mellon University.</span>
<a name="l00089"></a>00089 <span class="comment"> * ALL RIGHTS RESERVED.</span>
<a name="l00090"></a>00090 <span class="comment"> * **********************************************</span>
<a name="l00091"></a>00091 <span class="comment"> * </span>
<a name="l00092"></a>00092 <span class="comment"> * HISTORY</span>
<a name="l00093"></a>00093 <span class="comment"> * $Log: genrand.c,v $</span>
<a name="l00094"></a>00094 <span class="comment"> * Revision 1.2 2005/06/22 03:01:50 arthchan2003</span>
<a name="l00095"></a>00095 <span class="comment"> * Added keyword</span>
<a name="l00096"></a>00096 <span class="comment"> *</span>
<a name="l00097"></a>00097 <span class="comment"> * Revision 1.3 2005/03/30 01:22:48 archan</span>
<a name="l00098"></a>00098 <span class="comment"> * Fixed mistakes in last updates. Add</span>
<a name="l00099"></a>00099 <span class="comment"> *</span>
<a name="l00100"></a>00100 <span class="comment"> * </span>
<a name="l00101"></a>00101 <span class="comment"> * 18-Nov-04 ARCHAN (archan@cs.cmu.edu) at Carnegie Mellon University</span>
<a name="l00102"></a>00102 <span class="comment"> * First incorporated from the Mersenne Twister Random</span>
<a name="l00103"></a>00103 <span class="comment"> * Number Generator package. It was chosen because it is</span>
<a name="l00104"></a>00104 <span class="comment"> * in BSD-license and its performance is quite</span>
<a name="l00105"></a>00105 <span class="comment"> * reasonable. Of course if you look at the inventors's</span>
<a name="l00106"></a>00106 <span class="comment"> * page. This random generator can actually gives</span>
<a name="l00107"></a>00107 <span class="comment"> * 19937-bits period. This is already far from we need. </span>
<a name="l00108"></a>00108 <span class="comment"> * This will possibly good enough for the next 10 years. </span>
<a name="l00109"></a>00109 <span class="comment"> *</span>
<a name="l00110"></a>00110 <span class="comment"> * I also downgrade the code a little bit to avoid Sphinx's</span>
<a name="l00111"></a>00111 <span class="comment"> * developers misused it. </span>
<a name="l00112"></a>00112 <span class="comment"> */</span>
<a name="l00113"></a>00113
<a name="l00114"></a>00114
<a name="l00115"></a>00115
<a name="l00116"></a>00116 <span class="preprocessor">#include <stdio.h></span>
<a name="l00117"></a>00117
<a name="l00118"></a>00118 <span class="preprocessor">#include "sphinxbase/genrand.h"</span>
<a name="l00119"></a>00119
<a name="l00120"></a>00120 <span class="comment">/* Period parameters */</span>
<a name="l00121"></a>00121 <span class="preprocessor">#define N 624</span>
<a name="l00122"></a>00122 <span class="preprocessor"></span><span class="preprocessor">#define M 397</span>
<a name="l00123"></a>00123 <span class="preprocessor"></span><span class="preprocessor">#define MATRIX_A 0x9908b0dfUL </span><span class="comment">/* constant vector a */</span>
<a name="l00124"></a>00124 <span class="preprocessor">#define UPPER_MASK 0x80000000UL </span><span class="comment">/* most significant w-r bits */</span>
<a name="l00125"></a>00125 <span class="preprocessor">#define LOWER_MASK 0x7fffffffUL </span><span class="comment">/* least significant r bits */</span>
<a name="l00126"></a>00126
<a name="l00127"></a>00127 <span class="keywordtype">void</span> init_genrand(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> s);
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="keywordtype">void</span>
<a name="l00130"></a><a class="code" href="genrand_8h.html#a2881c7b606d9a2b2852e5946d71d32b7">00130</a> <a class="code" href="genrand_8h.html#a2881c7b606d9a2b2852e5946d71d32b7" title="Initialize the seed of the random generator.">genrand_seed</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> s)
<a name="l00131"></a>00131 {
<a name="l00132"></a>00132 init_genrand(s);
<a name="l00133"></a>00133 }
<a name="l00134"></a>00134
<a name="l00135"></a>00135
<a name="l00136"></a>00136 <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> mt[N]; <span class="comment">/* the array for the state vector */</span>
<a name="l00137"></a>00137 <span class="keyword">static</span> <span class="keywordtype">int</span> mti = N + 1; <span class="comment">/* mti==N+1 means mt[N] is not initialized */</span>
<a name="l00138"></a>00138
<a name="l00139"></a>00139 <span class="comment">/* initializes mt[N] with a seed */</span>
<a name="l00140"></a>00140 <span class="keywordtype">void</span>
<a name="l00141"></a>00141 init_genrand(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> s)
<a name="l00142"></a>00142 {
<a name="l00143"></a>00143 mt[0] = s & 0xffffffffUL;
<a name="l00144"></a>00144 <span class="keywordflow">for</span> (mti = 1; mti < N; mti++) {
<a name="l00145"></a>00145 mt[mti] =
<a name="l00146"></a>00146 (1812433253UL * (mt[mti - 1] ^ (mt[mti - 1] >> 30)) + mti);
<a name="l00147"></a>00147 <span class="comment">/* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */</span>
<a name="l00148"></a>00148 <span class="comment">/* In the previous versions, MSBs of the seed affect */</span>
<a name="l00149"></a>00149 <span class="comment">/* only MSBs of the array mt[]. */</span>
<a name="l00150"></a>00150 <span class="comment">/* 2002/01/09 modified by Makoto Matsumoto */</span>
<a name="l00151"></a>00151 mt[mti] &= 0xffffffffUL;
<a name="l00152"></a>00152 <span class="comment">/* for >32 bit machines */</span>
<a name="l00153"></a>00153 }
<a name="l00154"></a>00154 }
<a name="l00155"></a>00155
<a name="l00156"></a>00156 <span class="comment">/* generates a random number on [0,0xffffffff]-interval */</span>
<a name="l00157"></a>00157 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>
<a name="l00158"></a>00158 genrand_int32(<span class="keywordtype">void</span>)
<a name="l00159"></a>00159 {
<a name="l00160"></a>00160 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> y;
<a name="l00161"></a>00161 <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> mag01[2] = { 0x0UL, MATRIX_A };
<a name="l00162"></a>00162 <span class="comment">/* mag01[x] = x * MATRIX_A for x=0,1 */</span>
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="keywordflow">if</span> (mti >= N) { <span class="comment">/* generate N words at one time */</span>
<a name="l00165"></a>00165 <span class="keywordtype">int</span> kk;
<a name="l00166"></a>00166
<a name="l00167"></a>00167 <span class="keywordflow">if</span> (mti == N + 1) <span class="comment">/* if init_genrand() has not been called, */</span>
<a name="l00168"></a>00168 init_genrand(5489UL); <span class="comment">/* a default initial seed is used */</span>
<a name="l00169"></a>00169
<a name="l00170"></a>00170 <span class="keywordflow">for</span> (kk = 0; kk < N - M; kk++) {
<a name="l00171"></a>00171 y = (mt[kk] & UPPER_MASK) | (mt[kk + 1] & LOWER_MASK);
<a name="l00172"></a>00172 mt[kk] = mt[kk + M] ^ (y >> 1) ^ mag01[y & 0x1UL];
<a name="l00173"></a>00173 }
<a name="l00174"></a>00174 <span class="keywordflow">for</span> (; kk < N - 1; kk++) {
<a name="l00175"></a>00175 y = (mt[kk] & UPPER_MASK) | (mt[kk + 1] & LOWER_MASK);
<a name="l00176"></a>00176 mt[kk] = mt[kk + (M - N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
<a name="l00177"></a>00177 }
<a name="l00178"></a>00178 y = (mt[N - 1] & UPPER_MASK) | (mt[0] & LOWER_MASK);
<a name="l00179"></a>00179 mt[N - 1] = mt[M - 1] ^ (y >> 1) ^ mag01[y & 0x1UL];
<a name="l00180"></a>00180
<a name="l00181"></a>00181 mti = 0;
<a name="l00182"></a>00182 }
<a name="l00183"></a>00183
<a name="l00184"></a>00184 y = mt[mti++];
<a name="l00185"></a>00185
<a name="l00186"></a>00186 <span class="comment">/* Tempering */</span>
<a name="l00187"></a>00187 y ^= (y >> 11);
<a name="l00188"></a>00188 y ^= (y << 7) & 0x9d2c5680UL;
<a name="l00189"></a>00189 y ^= (y << 15) & 0xefc60000UL;
<a name="l00190"></a>00190 y ^= (y >> 18);
<a name="l00191"></a>00191
<a name="l00192"></a>00192 <span class="keywordflow">return</span> y;
<a name="l00193"></a>00193 }
<a name="l00194"></a>00194
<a name="l00195"></a>00195 <span class="comment">/* generates a random number on [0,0x7fffffff]-interval */</span>
<a name="l00196"></a>00196 <span class="keywordtype">long</span>
<a name="l00197"></a><a class="code" href="genrand_8h.html#a10263695978c84103fb3526fdae21d4c">00197</a> <a class="code" href="genrand_8h.html#a10263695978c84103fb3526fdae21d4c" title="generates a random number on [0,0x7fffffff]-interval">genrand_int31</a>(<span class="keywordtype">void</span>)
<a name="l00198"></a>00198 {
<a name="l00199"></a>00199 <span class="keywordflow">return</span> (<span class="keywordtype">long</span>) (genrand_int32() >> 1);
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201
<a name="l00202"></a>00202 <span class="comment">/* generates a random number on [0,1]-real-interval */</span>
<a name="l00203"></a>00203 <span class="keywordtype">double</span>
<a name="l00204"></a>00204 genrand_real1(<span class="keywordtype">void</span>)
<a name="l00205"></a>00205 {
<a name="l00206"></a>00206 <span class="keywordflow">return</span> genrand_int32() * (1.0 / 4294967295.0);
<a name="l00207"></a>00207 <span class="comment">/* divided by 2^32-1 */</span>
<a name="l00208"></a>00208 }
<a name="l00209"></a>00209
<a name="l00210"></a>00210 <span class="comment">/* generates a random number on [0,1)-real-interval */</span>
<a name="l00211"></a>00211 <span class="keywordtype">double</span>
<a name="l00212"></a>00212 genrand_real2(<span class="keywordtype">void</span>)
<a name="l00213"></a>00213 {
<a name="l00214"></a>00214 <span class="keywordflow">return</span> genrand_int32() * (1.0 / 4294967296.0);
<a name="l00215"></a>00215 <span class="comment">/* divided by 2^32 */</span>
<a name="l00216"></a>00216 }
<a name="l00217"></a>00217
<a name="l00218"></a>00218 <span class="comment">/* generates a random number on (0,1)-real-interval */</span>
<a name="l00219"></a>00219 <span class="keywordtype">double</span>
<a name="l00220"></a><a class="code" href="genrand_8h.html#ad5fbfda1cb738d2beff277444bc71b1a">00220</a> <a class="code" href="genrand_8h.html#ad5fbfda1cb738d2beff277444bc71b1a" title="generates a random number on (0,1)-real-interval">genrand_real3</a>(<span class="keywordtype">void</span>)
<a name="l00221"></a>00221 {
<a name="l00222"></a>00222 <span class="keywordflow">return</span> (((<span class="keywordtype">double</span>) genrand_int32()) + 0.5) * (1.0 / 4294967296.0);
<a name="l00223"></a>00223 <span class="comment">/* divided by 2^32 */</span>
<a name="l00224"></a>00224 }
<a name="l00225"></a>00225
<a name="l00226"></a>00226 <span class="comment">/* generates a random number on [0,1) with 53-bit resolution*/</span>
<a name="l00227"></a>00227 <span class="keywordtype">double</span>
<a name="l00228"></a><a class="code" href="genrand_8h.html#a2fca03c5dad1835f55e09c6e66d3b960">00228</a> <a class="code" href="genrand_8h.html#a2fca03c5dad1835f55e09c6e66d3b960" title="generates a random number on [0,1) with 53-bit resolution">genrand_res53</a>(<span class="keywordtype">void</span>)
<a name="l00229"></a>00229 {
<a name="l00230"></a>00230 <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> a = genrand_int32() >> 5, b = genrand_int32() >> 6;
<a name="l00231"></a>00231 <span class="keywordflow">return</span> (a * 67108864.0 + b) * (1.0 / 9007199254740992.0);
<a name="l00232"></a>00232 }
<a name="l00233"></a>00233
<a name="l00234"></a>00234 <span class="comment">/* These real versions are due to Isaku Wada, 2002/01/09 added */</span>
</pre></div></div>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><b>genrand.c</b> </li>
<li class="footer">Generated on Tue Apr 19 2011 for SphinxBase by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </li>
</ul>
</div>
</body>
</html>
distrib
>
Fedora
>
14
>
x86_64
>
media
>
updates
>
by-pkgid
>
0b420d0fce195cf4115dc6a3be5c2da2
>
files
>
192
