Method Next

path_intersection.go:555–569

()

}

func (n *SweepNode) Next() *SweepNode {
	// go right
	if n.right != nil {
		n = n.right
		for n.left != nil {
			n = n.left // find the left-most of current subtree
		}
		return n
	}

	for n.parent != nil && n.parent.right == n {
		n = n.parent // find first parent for which we're left
	}
	return n.parent // can be nil
}

//func (a *SweepNode) swap(b *SweepNode) {
//	a.SweepPoint, b.SweepPoint = b.SweepPoint, a.SweepPoint