aboutsummaryrefslogtreecommitdiff
path: root/source/spots.d
blob: 0f9d8b72a73dc70165ccfe9899dbc30cb698b46a (plain)
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
import std.bigint;
import std.digest.crc;
import std.random : unpredictableSeed;
import std.range;
import lru : LRUCache;
import deimos.ncurses;

private BigInt positive(BigInt n)
{
    if (n >= 0)
        return n * 2;
    else
        return -n * 2 - 1;
}

private BigInt pair(BigInt n, BigInt m)
{
    // https://stackoverflow.com/a/919661
    return (positive(n) + positive(m)) * (positive(n) + positive(m) + 1) / 2 + positive(m);
}

struct Spot
{
    private char _contents;
    this(char c)
    {
        _contents = c;
    }

    @property contents()
    {
        return _contents;
    }

    bool opEqual(const Spot s)
    {
        return s._contents == _contents;
    }

    bool isRock()
    {
        return _contents == '*';
    }
}

interface SpotSource
{
    Spot opIndex(BigInt y, BigInt x);
}

class RandomSource : SpotSource
{
    uint seed;
    double density = .0025;
    private LRUCache!(BigInt[2], Spot) cache;

    this()
    {
        seed = unpredictableSeed;
        cache = new LRUCache!(BigInt[2], Spot)(50000);
    }

    this(uint seed)
    {
        this.seed = seed;
    }

    this(uint seed, double density)
    {
        this.density = density;
        this(seed);
    }

    private uint hash(BigInt n)
    {
        CRC32 crc;
        crc.start();
        crc.put((cast(ubyte*)&seed)[0 .. seed.sizeof]);
        foreach (i; iota(n.ulongLength))
        {
            auto digit = n.getDigit(i);
            crc.put((cast(ubyte*)&digit)[0 .. digit.sizeof]);
        }
        auto result = crc.finish();
        auto hash = *(cast(uint*)&result);
        return hash;
    }

    public Spot opIndex(BigInt y, BigInt x)
    {
        if ([y, x] in cache)
            return cache[[y, x]];
        auto roll = cast(double) hash(pair(y, x)) / uint.max;
        Spot ret;
        if (roll < density)
            ret = Spot('*');
        else
            ret = Spot(' ');
        cache[[y, x]] = ret;
        return ret;
    }
}

class OverlaySource : SpotSource
{
    private SpotSource _base;
    private Spot[BigInt[2]] _overlay;

    this(SpotSource base)
    {
        _base = base;
    }

    void opIndexAssign(Spot spot, BigInt y, BigInt x)
    {
        Spot* p = [y, x] in _overlay;
        if (p !is null && spot == _base[y, x])
        {
            _overlay.remove([y, x]);
        }
        else
        {
            _overlay[[y, x]] = spot;
        }
    }

    Spot opIndex(BigInt y, BigInt x)
    {
        Spot* p = [y, x] in _overlay;
        if (p !is null)
            return *p;
        else
            return _base[y, x];
    }

    unittest
    {
        auto base = new RandomSource(0, 0.0);
        auto src = new OverlaySource(base);
        src[BigInt(0), BigInt(0)] = Spot('*');
        src[BigInt(0), BigInt(1)] = Spot('*');
        assert(src[BigInt(0), BigInt(0)] == Spot('*'));
        assert(src[BigInt(0), BigInt(1)] == Spot('*'));
    }
}