Method FindPrevNext

path_intersection.go:839–852

func (s *SweepStatus) First() *SweepNode { if s.root == nil { return nil } n := s.root for n.left != nil { n = n.left } return n } func (s *SweepStatus) Last() *SweepNode { if s.root == nil { return nil } n := s.root for n.right != nil { n = n.right } return n } Find returns the

(item *SweepPoint)

//}

func (s *SweepStatus) FindPrevNext(item *SweepPoint) (*SweepNode, *SweepNode) {
	if s.root == nil {
		return nil, nil
	}

	n, cmp := s.find(item)
	if cmp < 0 {
		return n.Prev(), n
	} else if 0 < cmp {
		return n, n.Next()
	} else {
		return n.Prev(), n.Next() // should never happen
	}
}

//func (s *SweepStatus) Insert(item *SweepPoint) *SweepNode {
//	if s.root == nil {