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
|
#ifndef RANDOM2_HPP
#define RANDOM2_HPP
# include "random.hpp"
# include "utils2.hpp"
# include <algorithm>
namespace random_
{
namespace detail
{
struct RandomIterator
{
int bound;
int current;
bool frist;
void operator ++()
{
frist = false;
// TODO: reimplement in terms of LFSRs, so that certain
// blockage patterns don't favor adjacent cells.
current = current + 1;
if (current == bound)
current = 0;
}
int operator *()
{
return current;
}
};
inline
bool operator == (RandomIterator l, RandomIterator r)
{
return l.current == r.current && l.frist == r.frist;
}
inline
bool operator != (RandomIterator l, RandomIterator r)
{
return !(l == r);
}
}
/// Yield every cell from 0 .. bound - 1 in some order.
/// The starting position is random, but not the order itself.
///
/// Expected usage:
/// for (int i : random_::iterator(vec.size()))
/// if (vec[i].okay())
/// return frob(vec[i]);
inline
IteratorPair<detail::RandomIterator> iterator(int bound)
{
int current = random_::to(bound);
return
{
detail::RandomIterator{bound, current, true},
detail::RandomIterator{bound, current, false}
};
}
/// similar to std::random_shuffle(c.begin(), c.end()), but guaranteed
/// to use a good source of randomness.
template<class C>
void shuffle(C&& c)
{
std::random_shuffle(c.begin(), c.end(), random_::to);
}
} // namespace random_
#endif // RANDOM2_HPP
|
