Noah Petherbridge
a2e1bd1ccb
* Events.OnCollide now receives a CollideEvent object, which makes
available the .Actor who collided and the .Overlap rect which is
zero-relative to the target actor. Doodad scripts can use the .Overlap
to see WHERE in their own box the other actor has intruded.
* Update the LockedDoor and ElectricDoor doodads to detect when the
player has entered their inner rect (since their doors are narrower
than their doodad size)
* Update the Button doodads to only press in when the player actually
touches them (because their sizes are shorter than their doodad
height)
* Update the Trapdoor to only trigger its animation when the board
along its top has been touched, not when the empty space below was
touched from the bottom.
* Events.OnLeave now implemented and fires when an actor who was
previously intersecting your doodad has left.
* The engine detects when an event JS callback returns false.
Eventually, the OnCollide can return false to signify the collision is
not accepted and the actor should be bumped away as if they hit solid
geometry.
118 lines
1.8 KiB
Go
118 lines
1.8 KiB
Go
package collision_test
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"git.kirsle.net/apps/doodle/lib/render"
|
|
"git.kirsle.net/apps/doodle/pkg/collision"
|
|
)
|
|
|
|
func TestActorCollision(t *testing.T) {
|
|
boxes := []render.Rect{
|
|
// 0: intersects with 1
|
|
// Expected intersection rect would be
|
|
// X,Y = 90,10
|
|
// X2,Y2 = 100,99
|
|
render.Rect{
|
|
X: 0,
|
|
Y: 0,
|
|
W: 100,
|
|
H: 100,
|
|
},
|
|
|
|
// 1: intersects with 0
|
|
// Expected intersection rect would be
|
|
// X,Y = 90,10
|
|
// X2,Y2 = 100,99
|
|
render.Rect{
|
|
X: 90,
|
|
Y: 10,
|
|
W: 100,
|
|
H: 100,
|
|
},
|
|
|
|
// 2: no intersection
|
|
render.Rect{
|
|
X: 200,
|
|
Y: 200,
|
|
W: 32,
|
|
H: 32,
|
|
},
|
|
|
|
// 3: intersects with 4
|
|
// Expected intersection rect would be
|
|
// X,Y = 240,200
|
|
// X2,Y2 = 264,231
|
|
render.Rect{
|
|
X: 233,
|
|
Y: 200,
|
|
W: 32,
|
|
H: 32,
|
|
},
|
|
|
|
// 4: intersects with 3
|
|
render.Rect{
|
|
X: 240,
|
|
Y: 200,
|
|
W: 32,
|
|
H: 32,
|
|
},
|
|
|
|
// 5: completely contains 6 and intersects 7.
|
|
render.Rect{
|
|
X: 300,
|
|
Y: 300,
|
|
W: 1000,
|
|
H: 600,
|
|
},
|
|
render.Rect{
|
|
X: 450,
|
|
Y: 500,
|
|
W: 42,
|
|
H: 42,
|
|
},
|
|
render.Rect{
|
|
X: 1200,
|
|
Y: 350,
|
|
W: 512,
|
|
H: 512,
|
|
},
|
|
}
|
|
|
|
assert := func(i int, result collision.BoxCollision, expectA, expectB int) {
|
|
if result.A != expectA || result.B != expectB {
|
|
t.Errorf(
|
|
"unexpected collision at index %d of BetweenBoxes() generator\n"+
|
|
"expected: (%d,%d)\n"+
|
|
" but got: (%d,%d)",
|
|
i,
|
|
expectA, expectB,
|
|
result.A, result.B,
|
|
)
|
|
}
|
|
}
|
|
|
|
var i int
|
|
for overlap := range collision.BetweenBoxes(boxes) {
|
|
a, b := overlap.A, overlap.B
|
|
|
|
// Ensure expected collisions happened.
|
|
switch i {
|
|
case 0:
|
|
assert(i, overlap, 0, 1)
|
|
case 1:
|
|
assert(i, overlap, 3, 4)
|
|
case 2:
|
|
assert(i, overlap, 5, 6)
|
|
case 3:
|
|
assert(i, overlap, 5, 7)
|
|
default:
|
|
t.Errorf("got unexpected collision result, index %d, tuple (%d,%d)",
|
|
i, a, b,
|
|
)
|
|
}
|
|
|
|
i++
|
|
}
|
|
}
|