Function TestLoopRelations

s2/loop_test.go:807–1431

(t *testing.T)

}

func TestLoopRelations(t *testing.T) {
	// this loop is used in the regression test cases below.
	containingLoop := LoopFromPoints([]Point{
		PointFromLatLng(LatLngFromDegrees(-38.0, -135.0)),
		PointFromLatLng(LatLngFromDegrees(-38.0, 149.0)),
		PointFromLatLng(LatLngFromDegrees(77.0, 149.0)),
		PointFromLatLng(LatLngFromDegrees(77.0, -135.0)),
	})

	innerTile := LoopFromPoints([]Point{
		PointFromLatLng(LatLngFromDegrees(37.99616267972809, 13.007812500000002)),
		PointFromLatLng(LatLngFromDegrees(37.99616267972809, 13.359375000000002)),
		PointFromLatLng(LatLngFromDegrees(38.272819658516866, 13.359375000000002)),
		PointFromLatLng(LatLngFromDegrees(38.272819658516866, 13.007812500000002)),
	})

	// +0.2 lat +0.2 lon from innerTile
	extendedTile := LoopFromPoints([]Point{
		PointFromLatLng(LatLngFromDegrees(37.99616267972809, 13.007812500000002)),
		PointFromLatLng(LatLngFromDegrees(37.99616267972809, 13.559375000000002)),
		PointFromLatLng(LatLngFromDegrees(38.472819658516866, 13.559375000000002)),
		PointFromLatLng(LatLngFromDegrees(38.472819658516866, 13.007812500000002)),
	})

	tests := []struct {
		a, b       *Loop
		contains   bool // A contains B
		contained  bool // B contains A
		disjoint   bool // A and B are disjoint (intersection is empty)
		covers     bool // (A union B) covers the entire sphere
		sharedEdge bool // the loops share at least one edge (possibly reversed)
	}{
		// Check full and empty relationships with normal loops and each other.
		{
			a:          FullLoop(),
			b:          FullLoop(),
			contains:   true,
			contained:  true,
			covers:     true,
			sharedEdge: true,
		},
		{
			a:          FullLoop(),
			b:          northHemi,
			contains:   true,
			covers:     true,
			sharedEdge: false,
		},
		{
			a:          FullLoop(),
			b:          EmptyLoop(),
			contains:   true,
			disjoint:   true,
			covers:     true,
			sharedEdge: false,
		},
		{
			a:          northHemi,