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
|
#ifndef RANDOM_H
#define RANDOM_H
#include "rng.h"
bool coinflip();
int div_rand_round( int num, int den );
int div_round_up( int num, int den );
bool one_chance_in(int a_million);
bool x_chance_in_y(int x, int y);
int random2(int max);
int maybe_random2(int x, bool random_factor);
int random_range(int low, int high);
int random_range(int low, int high, int nrolls);
const char* random_choose_string(const char* first, ...);
int random_choose(int first, ...);
int random_choose_weighted(int weight, int first, ...);
int random2avg(int max, int rolls);
int bestroll(int max, int rolls);
int random2limit(int max, int limit);
int binomial_generator(unsigned n_trials, unsigned trial_prob);
int fuzz_value(int val, int lowfuzz, int highfuzz, int naverage = 2);
int roll_dice(int num, int size);
struct dice_def
{
int num;
int size;
dice_def(int n = 0, int s = 0) : num(n), size(s) {}
int roll() const;
};
dice_def calc_dice(int num_dice, int max_damage);
void scale_dice(dice_def &dice, int threshold = 24);
class rng_save_excursion
{
public:
rng_save_excursion(long seed) { push_rng_state(); seed_rng(seed); }
rng_save_excursion() { push_rng_state(); }
~rng_save_excursion() { pop_rng_state(); }
};
template<typename Iterator>
int choose_random_weighted(Iterator beg, const Iterator end)
{
ASSERT(beg < end);
#ifdef DEBUG
int times_set = 0;
#endif
int totalweight = 0;
int count = 0, result = 0;
while (beg != end)
{
totalweight += *beg;
if (random2(totalweight) < *beg)
{
result = count;
#ifdef DEBUG
times_set++;
#endif
}
++count;
++beg;
}
#ifdef DEBUG
ASSERT(times_set > 0);
#endif
return result;
}
#endif
|
