func (s *PathElementSet) Insert(pe PathElement) {
	loc := sort.Search(len(s.members), func(i int) bool {
		return !s.members[i].Less(pe)
	})
	if loc == len(s.members) {
		s.members = append(s.members, pe)
		return
	}
	if s.members[loc].Equals(pe) {
		return
	}
	s.members = append(s.members, PathElement{})
	copy(s.members[loc+1:], s.members[loc:])
	s.members[loc] = pe
}
// Insert adds pe to the set.
Insert adds pe to the set.
// Insert adds pe to the set .
func (s *PathElementSet) Insert(pe PathElement) {
	loc := sort.Search(len(s.members), func(i int) bool {
		return !s.members[i].Less(pe)
	})
	if loc == len(s.members) {
		s.members = append(s.members, pe)
		return
	}
	if s.members[loc].Equals(pe) {
		return
	}
	s.members = append(s.members, PathElement{})
	copy(s.members[loc+1:], s.members[loc:])
	s.members[loc] = pe
}
func ( s * PathElementSet ) Insert ( pe PathElement ) { loc := sort . Search ( len ( s . members ) , func ( i int ) bool { return ! s . members [ i ] . Less ( pe ) } ) if loc == len ( s . members ) { s . members = append ( s . members , pe ) return } if s . members [ loc ] . Equals ( pe ) { return } s . members = append ( s . members , PathElement { } ) copy ( s . members [ loc + 1 : ] , s . members [ loc : ] ) s . members [ loc ] = pe }
Insert adds pe to the set.
Insert adds pe to the set .