forked from bmurray7/mersenne-twister-examples
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathruby-mersenne-twister.rb
90 lines (74 loc) · 2.2 KB
/
ruby-mersenne-twister.rb
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
=begin
Copyright (c) 2013 Arturs Meinarts
Permission is hereby granted, free of charge, to any person obtaining
a copy of this software and associated documentation files (the
"Software"), to deal in the Software without restriction, including
without limitation the rights to use, copy, modify, merge, publish,
distribute, sublicense, and/or sell copies of the Software, and to
permit persons to whom the Software is furnished to do so, subject to
the following conditions:
The above copyright notice and this permission notice shall be
included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
=end
module ExtendedFixnum
module BitOperations
def last_bits(num)
result = 0
num.times{|x| result += self[x] << x}
result
end
end
end
class Fixnum
include ExtendedFixnum::BitOperations
end
class Bignum
include ExtendedFixnum::BitOperations
end
class MersenneTwister
def initialize(seed_num = nil)
seed_num ||= rand(40227307522636928640) + 1
@mt = [] #(0..623).map{0}
@index = 0
seed(seed_num)
end
def randomize
generate_numbers
end
def random
extract_number
end
private
def extract_number
generate_numbers if @index == 0
y = @mt[@index]
y = y ^ (y >> 11)
y = y ^ ((y << 7) & 2636928640)
y = y ^ ((y << 15) & 4022730752)
y = y ^ (y >> 18)
@index = (@index + 1) % 624
y
end
def seed(seed_num)
@mt[0] = seed_num
for i in 1..623
@mt[i] = (1812433253 * (@mt[i-1] ^ (@mt[i-1] >> 30)) + i).last_bits(32)
end
true
end
def generate_numbers
for i in 0..623
y = @mt[i][31] + @mt[(i+1) % 624].last_bits(31)
@mt[i] = @mt[(i + 397) % 624] ^ (y >> 1)
@mt[i] = @mt[i] ^ 2567483615 if y.odd?
end
true
end
end