112 lines
2.5 KiB
C
112 lines
2.5 KiB
C
/**
|
|
* @file randgauss.h
|
|
* @brief randgauss class definition
|
|
*
|
|
* $LicenseInfo:firstyear=2003&license=viewergpl$
|
|
*
|
|
* Copyright (c) 2003-2009, Linden Research, Inc.
|
|
*
|
|
* Second Life Viewer Source Code
|
|
* 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://secondlifegrid.net/programs/open_source/licensing/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://secondlifegrid.net/programs/open_source/licensing/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.
|
|
* $/LicenseInfo$
|
|
*/
|
|
|
|
const F32 table[][2] = {
|
|
{.00f, .5f},
|
|
{.01f, .504f},
|
|
{.02f, .508f},
|
|
{.03f, .512f},
|
|
{.06f, .5239f},
|
|
{.08f, .5319f},
|
|
{.11f, .5438f},
|
|
{.13f, .5517f},
|
|
{.16f, .5636f},
|
|
{.18f, .5714f},
|
|
{.21f, .5832f},
|
|
{.23f, .5910f},
|
|
{.26f, .6026f},
|
|
{.28f, .6103f},
|
|
{.31f, .6217f},
|
|
{.34f, .6331f},
|
|
{.36f, .6406f},
|
|
{.39f, .6517f},
|
|
{.42f, .6628f},
|
|
{.44f, .6700f},
|
|
{.47f, .6808f},
|
|
{.50f, .6915f},
|
|
{.53f, .7019f},
|
|
{.56f, .7123f},
|
|
{.59f, .7224f},
|
|
{.62f, .7324f},
|
|
{.65f, .7422f},
|
|
{.68f, .7517f},
|
|
{.71f, .7611f},
|
|
{.74f, .7703f},
|
|
{.78f, .7823f},
|
|
{.81f, .7910f},
|
|
{.85f, .8023f},
|
|
{.88f, .8106f},
|
|
{.92f, .8212f},
|
|
{.96f, .8315f},
|
|
{1.0f, .8413f},
|
|
{1.04f, .8508f},
|
|
{1.09f, .8621f},
|
|
{1.13f, .8708f},
|
|
{1.18f, .8810f},
|
|
{1.23f, .8907f},
|
|
{1.29f, .9015f},
|
|
{1.35f, .9115f},
|
|
{1.41f, .9207f},
|
|
{1.48f, .9306f},
|
|
{1.56f, .9406f},
|
|
{1.65f, .9505f},
|
|
{1.76f, .9608f},
|
|
{1.89f, .9706f},
|
|
{2.06f, .9803f},
|
|
{2.33f, .9901f},
|
|
{99.0f, 1.0f}};
|
|
|
|
inline F32 randGauss(F32 mean, F32 stdev)
|
|
{
|
|
S32 i = 0;
|
|
F32 u = rand() / (F32) RAND_MAX;
|
|
F32 n;
|
|
|
|
if (u >= 0.5)
|
|
{
|
|
while (u > table[i][1])
|
|
i++;
|
|
|
|
n = table[i-1][0];
|
|
|
|
} else {
|
|
u = 1 - u;
|
|
while (u > table[i][1])
|
|
i++;
|
|
n = 1 - table[i-1][0];
|
|
}
|
|
//printf("u: %f, n: %f, i: %d\n", u, n, i); //debug
|
|
|
|
return (mean + stdev * n);
|
|
}
|
|
|