bestagon 0.6.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
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

#[derive(Copy, Clone, Debug, PartialEq)]
pub struct Vec2<T> {
  pub x: T,
  pub y: T,
}

impl<T> Vec2<T> {
  pub fn new(x: T, y: T) -> Self {
    Vec2 { x, y }
  }
  pub fn into_tuple(self) -> (T, T) {
    (self.x, self.y)
  }
}

impl<T> From<(T, T)> for Vec2<T> {
  fn from(value: (T, T)) -> Self {
    Vec2::new(value.0, value.1)
  }
}

macro_rules! div_impl {
    ($($t:ty)*) => ($(
        impl std::ops::Div<$t> for Vec2<$t> {
            type Output = Vec2<$t>;

            fn div(self, other: $t) -> Self::Output {
              Vec2::new(self.x / other, self.y / other)
            }
        }
    )*)
}

div_impl! { f32 isize }

macro_rules! add_impl {
    ($($t:ty)*) => ($(
        impl std::ops::Add for Vec2<$t> {
            type Output = Vec2<$t>;

            fn add(self, other: Self) -> Self::Output {
              Vec2::new(self.x + other.x, self.y + other.y)
            }
        }
    )*)
}

add_impl! { f32 isize }

macro_rules! subtract_impl {
    ($($t:ty)*) => ($(
        impl std::ops::Sub for Vec2<$t> {
            type Output = Vec2<$t>;

            fn sub(self, other: Self) -> Self::Output {
              Vec2::new(self.x - other.x, self.y - other.y)
            }
        }
    )*)
}

subtract_impl! { f32 isize }

pub trait AverageExt: Iterator {
  fn average<M>(self) -> M
  where
    M: Average<Self::Item>,
    Self: Sized,
  {
    M::average(self)
  }
}

impl<I: Iterator> AverageExt for I {}

pub trait Average<A = Self> {
  fn average<I>(iter: I) -> Self
  where
    I: Iterator<Item = A>;
}

impl Average for Vec2<f32> {
  fn average<I>(iter: I) -> Self
  where
    I: Iterator<Item = Vec2<f32>>,
  {
    let mut sum = Vec2::new(0.0, 0.0);
    let mut count: usize = 0;

    for v in iter {
      sum = sum + v;
      count += 1;
    }

    if count > 0 {
      sum / (count as f32)
    } else {
      sum
    }
  }
}

impl<'a> Average<&'a Vec2<f32>> for Vec2<f32> {
  fn average<I>(iter: I) -> Self
  where
    I: Iterator<Item = &'a Vec2<f32>>,
  {
    iter.copied().average()
  }
}

#[cfg(feature = "glam")]
impl Into<glam::Vec2> for Vec2<f32> {
  fn into(self) -> glam::Vec2 {
    glam::Vec2::new(self.x, self.y)
  }
}

#[cfg(test)]
mod test {
  use super::*;
  #[test]
  fn add_cartesians() {
    let a = Vec2::new(2., 3.);
    let b = Vec2::new(5., 6.);
    let sum = a + b;
    assert!(sum.x == a.x + b.x);
    assert!(sum.y == a.y + b.y);
  }

  #[test]
  fn avg_of_vec2s() {
    let vecs = [Vec2::new(1.0, 1.0), Vec2::new(3.0, 3.0)];
    let avg = vecs.iter().average();
    assert_eq!(Vec2::new(2.0, 2.0), avg);
  }
}