bestagon 0.7.0

An engine for discrete stuff in hexagonal grids
Documentation 
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

use crate::{EdgeAx, Hex, HexAx, Node, NodeAx};

pub trait Nodes<TNode>
where
  TNode: Node,
{
  fn nodes(&self) -> impl Iterator<Item = TNode>;
}

impl Nodes<NodeAx> for HexAx {
  fn nodes(&self) -> impl Iterator<Item = NodeAx> {
    [
      self.n_south_west().into(),
      self.n_south_east().into(),
      self.n_east().into(),
      self.n_north_east().into(),
      self.n_north_west().into(),
      self.n_west().into(),
    ]
    .into_iter()
  }
}

impl Nodes<NodeAx> for EdgeAx {
  fn nodes(&self) -> impl Iterator<Item = NodeAx> {
    if self.q % 2 == 0 {
      [
        NodeAx::new(
          self.q * 3 / 2 + 1,
          ((self.r * 3) as f32 / 2.).floor() as isize,
        ),
        NodeAx::new(
          self.q * 3 / 2 - 1,
          ((self.r * 3) as f32 / 2.).ceil() as isize,
        ),
      ]
    } else {
      if self.r % 2 == 0 {
        [
          NodeAx::new(
            ((self.q * 3) as f32 / 2.).floor() as isize,
            self.r * 3 / 2 + 1,
          ),
          NodeAx::new(
            ((self.q * 3) as f32 / 2.).ceil() as isize,
            self.r * 3 / 2 - 1,
          ),
        ]
      } else {
        [
          NodeAx::new(
            ((self.q * 3) as f32 / 2.).floor() as isize,
            ((self.r * 3) as f32 / 2.).floor() as isize,
          ),
          NodeAx::new(
            ((self.q * 3) as f32 / 2.).ceil() as isize,
            ((self.r * 3) as f32 / 2.).ceil() as isize,
          ),
        ]
      }
    }
    .into_iter()
  }
}

#[cfg(test)]
mod test {
  #[test]
  fn test_nodes_for_edges() {}
}