-
Notifications
You must be signed in to change notification settings - Fork 0
/
region_group.go
68 lines (58 loc) · 1.67 KB
/
region_group.go
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
/*
Copyright (C) 2014-2017 Wolfger Schramm <[email protected]>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package kiwotigo
type RegionGroup struct {
Regions []*Region
}
func NewRegionGroup(maxRegionCount int) (group *RegionGroup) {
group = new(RegionGroup)
group.Regions = make([]*Region, 0, maxRegionCount)
return group
}
func (group *RegionGroup) IsInside(region *Region) bool {
for _, reg := range group.Regions {
if reg == region {
return true
}
}
return false
}
func (group *RegionGroup) IsOverlapping(other *RegionGroup) bool {
for _, region := range other.Regions {
if group.IsInside(region) {
return true
} else {
for _, neighbor := range region.neighbors {
if group.IsInside(neighbor) {
return true
}
}
}
}
return false
}
func (group *RegionGroup) Merge(other *RegionGroup) {
for _, region := range other.Regions {
group.Append(region)
}
}
func (group *RegionGroup) Append(region *Region) {
if group.IsInside(region) {
return
}
group.Regions = append(group.Regions, region)
for _, neighbor := range region.neighbors {
group.Append(neighbor)
}
}