4
|
1 |
(*
|
|
2 |
* Hedgewars, a worms-like game
|
|
3 |
* Copyright (c) 2004, 2005 Andrey Korotaev <unC0Rr@gmail.com>
|
|
4 |
*
|
|
5 |
* Distributed under the terms of the BSD-modified licence:
|
|
6 |
*
|
|
7 |
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
8 |
* of this software and associated documentation files (the "Software"), to deal
|
|
9 |
* with the Software without restriction, including without limitation the
|
|
10 |
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
|
|
11 |
* sell copies of the Software, and to permit persons to whom the Software is
|
|
12 |
* furnished to do so, subject to the following conditions:
|
|
13 |
*
|
|
14 |
* 1. Redistributions of source code must retain the above copyright notice,
|
|
15 |
* this list of conditions and the following disclaimer.
|
|
16 |
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
17 |
* this list of conditions and the following disclaimer in the documentation
|
|
18 |
* and/or other materials provided with the distribution.
|
|
19 |
* 3. The name of the author may not be used to endorse or promote products
|
|
20 |
* derived from this software without specific prior written permission.
|
|
21 |
*
|
|
22 |
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
|
|
23 |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
24 |
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
|
|
25 |
* EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
26 |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
27 |
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
28 |
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
29 |
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
30 |
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
31 |
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
32 |
*)
|
|
33 |
|
|
34 |
unit uRandom;
|
|
35 |
interface
|
|
36 |
|
102
|
37 |
procedure SetRandomSeed(Seed: shortstring);
|
4
|
38 |
function GetRandom: real; overload;
|
|
39 |
function GetRandom(m: LongWord): LongWord; overload;
|
|
40 |
|
|
41 |
implementation
|
102
|
42 |
const rndM = 2147483578;
|
|
43 |
var cirbuf: array[0..63] of Longword;
|
|
44 |
n: byte;
|
4
|
45 |
|
102
|
46 |
function GetNext: Longword;
|
4
|
47 |
begin
|
102
|
48 |
n:= (n + 1) and $3F;
|
|
49 |
cirbuf[n]:=
|
|
50 |
(cirbuf[(n + 40) and $3F] + {== n - 24 mod 64}
|
|
51 |
cirbuf[(n + 9) and $3F]) mod rndM; {== n - 55 mod 64}
|
|
52 |
|
|
53 |
Result:= cirbuf[n]
|
|
54 |
end;
|
|
55 |
|
|
56 |
procedure SetRandomSeed(Seed: shortstring);
|
|
57 |
var i: Longword;
|
|
58 |
begin
|
|
59 |
for i:= 0 to pred(Length(Seed)) do
|
|
60 |
cirbuf[i]:= byte(Seed[i + 1]) * 35791253;
|
|
61 |
|
|
62 |
for i:= Length(Seed) to 63 do
|
|
63 |
cirbuf[i]:= i * 23860799;
|
|
64 |
|
|
65 |
for i:= 0 to 1024 do GetNext;
|
4
|
66 |
end;
|
|
67 |
|
|
68 |
function GetRandom: real;
|
|
69 |
begin
|
102
|
70 |
Result:= frac( GetNext * 0.0007301 + GetNext * 0.003019)
|
4
|
71 |
end;
|
|
72 |
|
102
|
73 |
function GetRandom(m: LongWord): LongWord;
|
4
|
74 |
begin
|
102
|
75 |
Result:= GetNext mod m
|
4
|
76 |
end;
|
|
77 |
|
|
78 |
end.
|