mirror of https://github.com/tidwall/tile38.git
91 lines
3.1 KiB
Go
91 lines
3.1 KiB
Go
|
package poly
|
||
|
|
|
||
|
|
import "testing"
|
||
|
|
|
||
|
|
func testIntersectsLinesA(t *testing.T, a, b, c, d Point, expect bool) {
|
||
|
|
res := lineintersects(a, b, c, d)
|
||
|
|
if res != expect {
|
||
|
|
t.Fatalf("{%v,%v}, {%v,%v} = %t, expect %t", a, b, c, d, res, expect)
|
||
|
|
}
|
||
|
|
res = lineintersects(b, a, c, d)
|
||
|
|
if res != expect {
|
||
|
|
t.Fatalf("{%v,%v}, {%v,%v} = %t, expect %t", b, a, c, d, res, expect)
|
||
|
|
}
|
||
|
|
res = lineintersects(a, b, d, c)
|
||
|
|
if res != expect {
|
||
|
|
t.Fatalf("{%v,%v}, {%v,%v} = %t, expect %t", a, b, d, c, res, expect)
|
||
|
|
}
|
||
|
|
res = lineintersects(b, a, d, c)
|
||
|
|
if res != expect {
|
||
|
|
t.Fatalf("{%v,%v}, {%v,%v} = %t, expect %t", b, a, d, c, res, expect)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
func testIntersectsLines(t *testing.T, a, b, c, d Point, expect bool) {
|
||
|
|
testIntersectsLinesA(t, a, b, c, d, expect)
|
||
|
|
testIntersectsLinesA(t, c, d, a, b, expect)
|
||
|
|
}
|
||
|
|
|
||
|
|
func TestIntersectsLines(t *testing.T) {
|
||
|
|
testIntersectsLines(t, P(0, 6), P(12, -6), P(0, 0), P(12, 0), true)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(5, 5), P(5, 5), P(0, 10), true)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(5, 5), P(5, 6), P(0, 10), false)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(5, 5), P(5, 4), P(0, 10), true)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(2, 2), P(0, 2), P(2, 0), true)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(2, 2), P(0, 2), P(1, 1), true)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(2, 2), P(2, 0), P(1, 1), true)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(0, 4), P(1, 4), P(4, 1), false)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(0, 4), P(1, 4), P(4, 4), false)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(0, 4), P(4, 1), P(4, 4), false)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(4, 0), P(1, 4), P(4, 1), false)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(4, 0), P(1, 4), P(4, 4), false)
|
||
|
|
testIntersectsLines(t, P(0, 0), P(4, 0), P(4, 1), P(4, 4), false)
|
||
|
|
testIntersectsLines(t, P(0, 4), P(4, 0), P(1, 4), P(4, 1), false)
|
||
|
|
testIntersectsLines(t, P(0, 4), P(4, 0), P(1, 4), P(4, 4), false)
|
||
|
|
testIntersectsLines(t, P(0, 4), P(4, 0), P(4, 1), P(4, 4), false)
|
||
|
|
}
|
||
|
|
|
||
|
|
func testIntersectsShapes(t *testing.T, exterior Polygon, holes []Polygon, shape Polygon, expect bool) {
|
||
|
|
got := shape.Intersects(exterior, holes)
|
||
|
|
if got != expect {
|
||
|
|
t.Fatalf("%v intersects %v = %v, expect %v", shape, exterior, got, expect)
|
||
|
|
}
|
||
|
|
got = exterior.Intersects(shape, nil)
|
||
|
|
if got != expect {
|
||
|
|
t.Fatalf("%v intersects %v = %v, expect %v", exterior, shape, got, expect)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
func TestIntersectsShapes(t *testing.T) {
|
||
|
|
|
||
|
|
testIntersectsShapes(t,
|
||
|
|
Polygon{P(6, 0), P(12, 0), P(12, -6), P(6, 0)},
|
||
|
|
nil,
|
||
|
|
Polygon{P(0, 0), P(0, 6), P(6, 0), P(0, 0)},
|
||
|
|
true)
|
||
|
|
|
||
|
|
testIntersectsShapes(t,
|
||
|
|
Polygon{P(7, 0), P(12, 0), P(12, -6), P(7, 0)},
|
||
|
|
nil,
|
||
|
|
Polygon{P(0, 0), P(0, 6), P(6, 0), P(0, 0)},
|
||
|
|
false)
|
||
|
|
|
||
|
|
testIntersectsShapes(t,
|
||
|
|
Polygon{P(0.5, 0.5), P(0.5, 4.5), P(4.5, 0.5), P(0.5, 0.5)},
|
||
|
|
nil,
|
||
|
|
Polygon{P(0, 0), P(0, 6), P(6, 0), P(0, 0)},
|
||
|
|
true)
|
||
|
|
|
||
|
|
testIntersectsShapes(t,
|
||
|
|
Polygon{P(0, 0), P(0, 6), P(6, 0), P(0, 0)},
|
||
|
|
[]Polygon{Polygon{P(1, 1), P(1, 2), P(2, 2), P(2, 1), P(1, 1)}},
|
||
|
|
Polygon{P(0.5, 0.5), P(0.5, 4.5), P(4.5, 0.5), P(0.5, 0.5)},
|
||
|
|
true)
|
||
|
|
|
||
|
|
testIntersectsShapes(t,
|
||
|
|
Polygon{P(0, 0), P(0, 10), P(10, 10), P(10, 0), P(0, 0)},
|
||
|
|
[]Polygon{Polygon{P(2, 2), P(2, 6), P(6, 6), P(6, 2), P(2, 2)}},
|
||
|
|
Polygon{P(1, 1), P(1, 9), P(9, 9), P(9, 1), P(1, 1)},
|
||
|
|
true)
|
||
|
|
}
|