-
Notifications
You must be signed in to change notification settings - Fork 2
/
filter.go
111 lines (84 loc) · 2.18 KB
/
filter.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
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
package cirno
import (
"fmt"
)
// FilterByIdentity returns all the shapes
// matching the specified identity template.
func (shapes Shapes) FilterByIdentity(identity int32) Shapes {
filteredShapes := make(Shapes, 0)
for shape := range shapes {
if shape.GetIdentity()&identity == identity {
filteredShapes.Insert(shape)
}
}
return filteredShapes
}
// FilterByMask returns all the shapes
// matching the specified mask template.
func (shapes Shapes) FilterByMask(mask int32) Shapes {
filteredShapes := make(Shapes, 0)
for shape := range shapes {
if shape.GetMask()&mask == mask {
filteredShapes.Insert(shape)
}
}
return filteredShapes
}
// FilterByCollisionRight returns all the shapes the given shape
// should collide.
func (shapes Shapes) FilterByCollisionRight(shape Shape) (Shapes, error) {
if shape == nil {
return nil, fmt.Errorf("the shape is nil")
}
filteredShapes := make(Shapes, 0)
for item := range shapes {
shouldCollide, err := shape.ShouldCollide(item)
if err != nil {
return nil, err
}
if shouldCollide {
filteredShapes.Insert(item)
}
}
return filteredShapes, nil
}
// FilterByCollisionLeft returns all the shapes that should
// collide the given shape.
func (shapes Shapes) FilterByCollisionLeft(shape Shape) (Shapes, error) {
if shape == nil {
return nil, fmt.Errorf("the shape is nil")
}
filteredShapes := make(Shapes, 0)
for item := range shapes {
shouldCollide, err := item.ShouldCollide(shape)
if err != nil {
return nil, err
}
if shouldCollide {
filteredShapes.Insert(item)
}
}
return filteredShapes, nil
}
// FilterByCollision returns all the shapes that should collide
// or get collided by the given shape.
func (shapes Shapes) FilterByCollision(shape Shape) (Shapes, error) {
if shape == nil {
return nil, fmt.Errorf("the shape is nil")
}
filteredShapes := make(Shapes, 0)
for item := range shapes {
shouldCollideLeft, err := item.ShouldCollide(shape)
if err != nil {
return nil, err
}
shouldCollideRight, err := shape.ShouldCollide(item)
if err != nil {
return nil, err
}
if shouldCollideLeft || shouldCollideRight {
filteredShapes.Insert(item)
}
}
return filteredShapes, nil
}