s/Equal/Equals/g

Author: lavalamp

fieldpath/element.go

@@ -90,8 +90,8 @@ func (e PathElement) Less(rhs PathElement) bool {
 	return false
 }
 
-// Equal returns true if both path elements are equal.
-func (e PathElement) Equal(rhs PathElement) bool {
+// Equals returns true if both path elements are equal.
+func (e PathElement) Equals(rhs PathElement) bool {
 	return !e.Less(rhs) && !rhs.Less(e)
 }
 
@@ -158,7 +158,7 @@ func (s *PathElementSet) Insert(pe PathElement) {
 		s.members = append(s.members, pe)
 		return
 	}
-	if s.members[loc].Equal(pe) {
+	if s.members[loc].Equals(pe) {
 		return
 	}
 	n := len(s.members) - 1
@@ -250,7 +250,7 @@ func (s *PathElementSet) Has(pe PathElement) bool {
 	if loc == len(s.members) {
 		return false
 	}
-	if s.members[loc].Equal(pe) {
+	if s.members[loc].Equals(pe) {
 		return true
 	}
 	return false
@@ -262,7 +262,7 @@ func (s *PathElementSet) Equals(s2 *PathElementSet) bool {
 		return false
 	}
 	for k := range s.members {
-		if !s.members[k].Equal(s2.members[k]) {
+		if !s.members[k].Equals(s2.members[k]) {
 			return false
 		}
 	}

fieldpath/set.go

@@ -185,7 +185,7 @@ func (s *SetNodeMap) Descend(pe PathElement) *Set {
 		s.members = append(s.members, setNode{pathElement: pe, set: &Set{}})
 		return s.members[loc].set
 	}
-	if s.members[loc].pathElement.Equal(pe) {
+	if s.members[loc].pathElement.Equals(pe) {
 		return s.members[loc].set
 	}
 	n := len(s.members) - 1
@@ -225,7 +225,7 @@ func (s *SetNodeMap) Get(pe PathElement) (*Set, bool) {
 	if loc == len(s.members) {
 		return nil, false
 	}
-	if s.members[loc].pathElement.Equal(pe) {
+	if s.members[loc].pathElement.Equals(pe) {
 		return s.members[loc].set, true
 	}
 	return nil, false
@@ -238,7 +238,7 @@ func (s *SetNodeMap) Equals(s2 *SetNodeMap) bool {
 		return false
 	}
 	for i := range s.members {
-		if !s.members[i].pathElement.Equal(s2.members[i].pathElement) {
+		if !s.members[i].pathElement.Equals(s2.members[i].pathElement) {
 			return false
 		}
 		if !s.members[i].set.Equals(s2.members[i].set) {