You are an expert in writing code in many different languages. Your goal is to perform code completion for the following code, keeping in mind the rest of the code and the file meta data.
    Metadata details:
    filename: intersect_test.go
    path of file: ./repos/tegola/maths/clip/intersect
    
    the code of the file until where you have to start completion: package intersect

import (
	"testing"

	"github.com/go-spatial/tegola/maths"
	"github.com/go-spatial/tegola/maths/clip/region"
	"github.com/go-spatial/tegola/maths/clip/subject"
)

func TestNewIntersect(t *testing.T) {

	// Counter Clockwise subject.
	sl, err := subject.New([]float64{-5, -5, -5, 5, 5, 5, 5, -5})
	if err != nil {
		t.Errorf("Got unexpected error: %v", err)
		return
	}
	rl := region.New(sl.Winding(), maths.Pt{0, 0}, maths.Pt{10, 10})
	/*
		log.Printf("region: %#v\n", rl)
		log.Printf("subject: %#v\n", sl)
	*/
	l := New()
	inwardPt := NewPt(maths.Pt{0, 5}, true)
	l.PushBack(inwardPt)
	rl.Axis(0).PushInBetween(inwardPt.AsRegionPoint())
	if slp := sl.GetPair(2); slp != nil {
		slp.PushInBetween(inwardPt.AsSubjectPoint())
	}

	outwardPt := NewPt(maths.Pt{5, 0}, false)
	l.PushBack(outwardPt)
	rl.Axis(3).PushInBetween(outwardPt.AsRegionPoint())
	if slp := sl.GetPair(3); slp != nil {
		slp.PushInBetween(outwardPt.AsSubjectPoint())
	}
	/*
		log.Printf("intersect: %#v\n", l)
		log.Printf("region: %#v\n", rl)
		log.Printf("subject: %#v\n", sl)
	*/
	expectedWalk := [][]maths.Pt{
		{
			{0, 5}, {5, 5}, {5, 0}, {0, 0},
		},
	}
	current := 0
	for ib := l.FirstInboundPtWalker(); ib != nil; ib = ib.Next() {
		if len(expectedWalk) <= current {
			t.Fatalf("Too many paths: expected: %v got: %v", len(expectedWalk), current)
		}
		//log.Printf("InBound %#v\n", ib)
		ib.Walk(func(idx int, pt maths.Pt) bool {
			//log.Printf("Pt %v: %v\n", idx, pt)
			if len(expectedWalk[current]) <= idx {
				t.Fatalf("Too many points for (%v): expected: %v got: %v", current, len(expectedWalk[current]), idx)
			}
			if 
    
func TestNewIntersect(t *testing.T) {

	// Counter Clockwise subject.
	sl, err := subject.New([]float64{-5, -5, -5, 5, 5, 5, 5, -5})
	if err != nil {
		t.Errorf("Got unexpected error: %v", err)
		return
	}
	rl := region.New(sl.Winding(), maths.Pt{0, 0}, maths.Pt{10, 10})
	/*
		log.Printf("region: %#v\n", rl)
		log.Printf("subject: %#v\n", sl)
	*/
	l := New()
	inwardPt := NewPt(maths.Pt{0, 5}, true)
	l.PushBack(inwardPt)
	rl.Axis(0).PushInBetween(inwardPt.AsRegionPoint())
	if slp := sl.GetPair(2); slp != nil {
		slp.PushInBetween(inwardPt.AsSubjectPoint())
	}

	outwardPt := NewPt(maths.Pt{5, 0}, false)
	l.PushBack(outwardPt)
	rl.Axis(3).PushInBetween(outwardPt.AsRegionPoint())
	if slp := sl.GetPair(3); slp != nil {
		slp.PushInBetween(outwardPt.AsSubjectPoint())
	}
	/*
		log.Printf("intersect: %#v\n", l)
		log.Printf("region: %#v\n", rl)
		log.Printf("subject: %#v\n", sl)
	*/
	expectedWalk := [][]maths.Pt{
		{
			{0, 5}, {5, 5}, {5, 0}, {0, 0},
		},
	}
	current := 0
	for ib := l.FirstInboundPtWalker(); ib != nil; ib = ib.Next() {
		if len(expectedWalk) <= current {
			t.Fatalf("Too many paths: expected: %v got: %v", len(expectedWalk), current)
		}
		//log.Printf("InBound %#v\n", ib)
		ib.Walk(func(idx int, pt maths.Pt) bool {
			//log.Printf("Pt %v: %v\n", idx, pt)
			if len(expectedWalk[current]) <= idx {
				t.Fatalf("Too many points for (%v): expected: %v got: %v", current, len(expectedWalk[current]), idx)
			}
			if !expectedWalk[current][idx].IsEqual(pt) {
				t.Errorf("Point(%v) not correct of line %v: Expected: %v got %v", idx, current, expectedWalk[current][idx], pt)

			}
			if idx == 10 {
				t.Error("More then 10 paths returned!!")
				return false
			}
			return true
		})
		current++
	}

}