hexagon-map 0.0.2

Coordinate transformation and pathfinding for hexagonal 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

use hexagon_map::{AxialPoint, CubicPoint, HexagonMap, IsometricLine};
use itertools::Itertools;

#[test]
fn ready() {
    println!("it works!")
}

#[test]
fn test() {
    let map = HexagonMap::<bool>::width_first(3, 4, true);
    for (p, maze) in map.points_all() {
        println!("{p:?}: {maze}")
    }
}

#[test]
fn test_circuit() {
    let circuit = IsometricLine::new(CubicPoint::new(0, 0), 0);
    assert_eq!(circuit.collect_vec(), vec![AxialPoint::new(0, 0)], "Circuit with radius 0 should contain only one point");
    let circuit = IsometricLine::new(CubicPoint::new(1, 1), 1);
    assert_eq!(
        circuit.collect_vec(),
        vec![
            AxialPoint::new(1, 2),
            AxialPoint::new(2, 1),
            AxialPoint::new(1, 1),
            AxialPoint::new(1, 0),
            AxialPoint::new(0, 1),
            AxialPoint::new(1, 1)
        ],
        "Circuit with radius 1 should contain 6 points"
    );
}

#[test]
fn test_action_field() {
    let map = HexagonMap::<bool>::width_first(3, 4, true);
    let cost = map.action_field(CubicPoint::new(0, 0), 10.0).with_cost(|p, _| (p.q + p.p).abs() as f64);
    for (p, maze) in cost.solve() {
        println!("{p}: {maze}")
    }
}

#[test]
fn test_path() {
    let map = HexagonMap::<bool>::rhombus(3, 4);
    let (path, cost) = map
        .path_finder(CubicPoint::new(0, 0), CubicPoint::new(1, -2))
        .with_cost(|p, _| (p.q + p.p).abs() as f64)
        .solve_points();
    for point in path {
        println!("{point}: {cost}")
    }
}