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
use std::collections::HashSet;
use std::ops::Range;
use super::{Goban, GobanSVGError};
#[derive(Debug, Clone)]
pub enum GobanRange {
ShrinkWrap,
FullBoard,
Ranged(Range<u8>, Range<u8>),
}
impl GobanRange {
pub fn get_ranges(&self, goban: &Goban) -> Result<(Range<u8>, Range<u8>), GobanSVGError> {
match self {
Self::FullBoard => Ok((0..goban.size.0, 0..goban.size.1)),
Self::ShrinkWrap => {
let points: HashSet<(u8, u8)> = goban
.stones()
.map(|s| (s.x, s.y))
.chain(goban.marks.iter().copied())
.chain(goban.triangles.iter().copied())
.chain(goban.circles.iter().copied())
.chain(goban.squares.iter().copied())
.chain(goban.selected.iter().copied())
.chain(goban.labels.keys().copied())
.chain(goban.lines.iter().flat_map(|&(p1, p2)| vec![p1, p2]))
.chain(goban.arrows.iter().flat_map(|&(p1, p2)| vec![p1, p2]))
.collect();
let x_start = {
let p = points
.iter()
.map(|&(x, _)| x)
.min()
.unwrap_or(0)
.saturating_sub(1);
if p == 1 {
0
} else {
p
}
};
let x_end = {
let p = points
.iter()
.map(|&(x, _)| (x + 2).min(goban.size.0))
.max()
.unwrap_or(goban.size.0);
if p == goban.size.0 - 1 {
goban.size.0
} else {
p
}
};
let y_start = {
let p = points
.iter()
.map(|&(_, y)| y)
.min()
.unwrap_or(0)
.saturating_sub(1);
if p == 1 {
0
} else {
p
}
};
let y_end = {
let p = points
.iter()
.map(|&(_, y)| (y + 2).min(goban.size.1))
.max()
.unwrap_or(goban.size.1);
if p == goban.size.1 - 1 {
goban.size.1
} else {
p
}
};
Ok((x_start..x_end, y_start..y_end))
}
Self::Ranged(a, b) => {
if a.end > goban.size.0 || b.end > goban.size.1 {
Err(GobanSVGError::InvalidRange)
} else {
Ok((a.clone(), b.clone()))
}
}
}
}
}