smeagol 0.1.2

Conway's Game of Life using HashLife and SIMD.
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

/*
 * This Source Code Form is subject to the terms of the Mozilla Public License,
 * v. 2.0. If a copy of the MPL was not distributed with this file, You can
 * obtain one at http://mozilla.org/MPL/2.0/.
 */

use crate::node::*;

impl NodeId {
    /// Returns the level of the node.
    pub fn level(self, store: &Store) -> Level {
        match store.node(self) {
            Node::Leaf { .. } => Level(4),
            Node::Interior { level, .. } => level,
        }
    }

    /// Returns the number of alive cells in the node.
    pub fn population(self, store: &Store) -> u128 {
        match store.node(self) {
            Node::Leaf { grid } => u128::from(grid.count_ones().wrapping_sum()),
            Node::Interior { population, .. } => population,
        }
    }

    /// Returns the minimum coordinate that can be used in a position for the node.
    ///
    /// For a level `n` node, this is equal to `-2^(n-1)`.
    pub fn min_coord(self, store: &Store) -> i64 {
        match store.node(self) {
            Node::Leaf { .. } => -8,
            Node::Interior { level, .. } => {
                if level == Level(64) {
                    i64::min_value()
                } else {
                    -(1 << (level.0 - 1))
                }
            }
        }
    }

    /// Returns the maximum coordinate that can be used in a position for the node.
    ///
    /// For a level `n` node, this is equal to `2^(n-1) - 1`.
    pub fn max_coord(self, store: &Store) -> i64 {
        match store.node(self) {
            Node::Leaf { .. } => 7,
            Node::Interior { level, .. } => {
                if level == Level(64) {
                    i64::max_value()
                } else {
                    (1 << (level.0 - 1)) - 1
                }
            }
        }
    }
}