hexmap 0.2.1

A crate for creating and working with hex-based tile maps.
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

use crate::hex::Hex;
use crate::offset::Offset;
use std::cmp;
use std::collections::{HashMap, HashSet};


type HexSet = HashSet<Hex>;

struct Map {
    pub tiles: HexSet,
}

fn make_parallelogram(width: i32, height: i32) -> HexSet {
    let mut hex_set: HexSet = HexSet::new();

    for q in 0..width {
        for r in 0..height {
            hex_set.insert(Hex::new(q, r, -q - r));
        }
    }

    hex_set
}

fn make_triangle(size: i32) -> HexSet {
    let mut hex_set: HexSet = HexSet::new();

    let q_min = 0;
    let q_max = size;

    for q in q_min..=q_max {
        let size = &size;
        let r_min = size - q;
        for r in r_min..=*size {
            hex_set.insert(Hex::new(q, r, -q - r));
        }
    }

    hex_set
}

pub fn make_hexagon(radius: i32) -> HexSet {
    let mut hex_set: HexSet = HexSet::new();

    let q_min = -radius;
    let q_max = radius;

    for q in q_min..=q_max {
        let r_min = cmp::max(-radius, -q - radius);
        let r_max = cmp::min(radius, -q + radius);
        for r in r_min..=r_max {
            hex_set.insert(Hex::new(q, r, -q - r));
        }
    }

    hex_set
}

fn make_rectangle(width: i32, height: i32) -> HexSet {
    let mut hex_set: HexSet = HexSet::new();

    for col in 0..=width {
        for row in 0..=height {
            let offset = Offset { col, row };
            let hex = offset.to_hex();
            hex_set.insert(hex);
        }
    }

    hex_set
}