s/EachAdjacentTo/AdjacentTo/

Author: sdboyer

graph.go

@@ -269,7 +269,7 @@ type AdjacencyEnumerator interface {
 	// Calls the provided step function once with each vertex adjacent to the
 	// the provided vertex. In a digraph, this includes both successor
 	// and predecessor vertices.
-	EachAdjacentTo(start Vertex, adjacentVertexStep VertexStep)
+	AdjacentTo(start Vertex, adjacentVertexStep VertexStep)
 }
 
 // A VertexMembershipChecker can indicate the presence of a vertex.

graph/al/data.go

@@ -130,7 +130,7 @@ func (g *dataDirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *dataDirected) EachAdjacentTo(start Vertex, f VertexStep) {
+func (g *dataDirected) AdjacentTo(start Vertex, f VertexStep) {
 	g.mu.RLock()
 	defer g.mu.RUnlock()
 
@@ -439,7 +439,7 @@ func (g *dataUndirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *dataUndirected) EachAdjacentTo(vertex Vertex, f VertexStep) {
+func (g *dataUndirected) AdjacentTo(vertex Vertex, f VertexStep) {
 	g.mu.RLock()
 	defer g.mu.RUnlock()
 

graph/al/directed.go

@@ -81,7 +81,7 @@ func (g *mutableDirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *mutableDirected) EachAdjacentTo(start Vertex, f VertexStep) {
+func (g *mutableDirected) AdjacentTo(start Vertex, f VertexStep) {
 	g.mu.RLock()
 	defer g.mu.RUnlock()
 
@@ -315,7 +315,7 @@ func (g *immutableDirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *immutableDirected) EachAdjacentTo(start Vertex, f VertexStep) {
+func (g *immutableDirected) AdjacentTo(start Vertex, f VertexStep) {
 	g.IncidentTo(start, func(e Edge) bool {
 		u, v := e.Both()
 		if u == start {

graph/al/labeled.go

@@ -160,7 +160,7 @@ func (g *labeledDirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *labeledDirected) EachAdjacentTo(start Vertex, f VertexStep) {
+func (g *labeledDirected) AdjacentTo(start Vertex, f VertexStep) {
 	g.mu.RLock()
 	defer g.mu.RUnlock()
 
@@ -438,7 +438,7 @@ func (g *labeledUndirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *labeledUndirected) EachAdjacentTo(vertex Vertex, f VertexStep) {
+func (g *labeledUndirected) AdjacentTo(vertex Vertex, f VertexStep) {
 	g.mu.RLock()
 	defer g.mu.RUnlock()
 

graph/al/undirected.go

@@ -59,7 +59,7 @@ func (g *mutableUndirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *mutableUndirected) EachAdjacentTo(vertex Vertex, f VertexStep) {
+func (g *mutableUndirected) AdjacentTo(vertex Vertex, f VertexStep) {
 	g.mu.RLock()
 	defer g.mu.RUnlock()
 

graph/al/weighted.go

@@ -130,7 +130,7 @@ func (g *weightedDirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *weightedDirected) EachAdjacentTo(start Vertex, f VertexStep) {
+func (g *weightedDirected) AdjacentTo(start Vertex, f VertexStep) {
 	g.mu.RLock()
 	defer g.mu.RUnlock()
 
@@ -438,7 +438,7 @@ func (g *weightedUndirected) IncidentTo(v Vertex, f EdgeStep) {
 }
 
 // Enumerates the vertices adjacent to the provided vertex.
-func (g *weightedUndirected) EachAdjacentTo(vertex Vertex, f VertexStep) {
+func (g *weightedUndirected) AdjacentTo(vertex Vertex, f VertexStep) {
 	g.mu.RLock()
 	defer g.mu.RUnlock()
 

null.go

@@ -26,7 +26,7 @@ func (g nullGraph) ArcsFrom(Vertex, ArcStep)               {}
 func (g nullGraph) EachPredecessorOf(Vertex, VertexStep)      {}
 func (g nullGraph) ArcsTo(Vertex, ArcStep)                 {}
 func (g nullGraph) EachSuccessorOf(Vertex, VertexStep)        {}
-func (g nullGraph) EachAdjacentTo(start Vertex, f VertexStep) {}
+func (g nullGraph) AdjacentTo(start Vertex, f VertexStep) {}
 
 func (g nullGraph) HasVertex(v Vertex) bool {
 	return false

null_test.go

@@ -25,7 +25,7 @@ func (s NullGraphSuite) TestEnumerators(c *C) {
 		return
 	})
 
-	NullGraph.EachAdjacentTo("foo", func(v Vertex) (terminate bool) {
+	NullGraph.AdjacentTo("foo", func(v Vertex) (terminate bool) {
 		c.Error("The NullGraph should be empty of edges and vertices.")
 		return
 	})

spec/literal.go

@@ -170,7 +170,7 @@ func (g GraphLiteralFixture) EachSuccessorOf(v Vertex, f VertexStep) {
 	}
 }
 
-func (g GraphLiteralFixture) EachAdjacentTo(v Vertex, f VertexStep) {
+func (g GraphLiteralFixture) AdjacentTo(v Vertex, f VertexStep) {
 	switch v {
 	case "foo":
 		f("bar")

spec/suite_graph.go

@@ -85,12 +85,12 @@ func (s *GraphSuite) TestEdgesTermination(c *C) {
 	c.Assert(hit, Equals, 1)
 }
 
-func (s *GraphSuite) TestEachAdjacentTo(c *C) {
+func (s *GraphSuite) TestAdjacentTo(c *C) {
 	g := s.Factory(GraphFixtures["2e3v"])
 
 	vset := set.NewNonTS()
 	var hit int
-	g.EachAdjacentTo("bar", func(adj Vertex) (terminate bool) {
+	g.AdjacentTo("bar", func(adj Vertex) (terminate bool) {
 		hit++
 		vset.Add(adj)
 		return
@@ -102,11 +102,11 @@ func (s *GraphSuite) TestEachAdjacentTo(c *C) {
 	c.Assert(hit, Equals, 2)
 }
 
-func (s *GraphSuite) TestEachAdjacentToTermination(c *C) {
+func (s *GraphSuite) TestAdjacentToTermination(c *C) {
 	g := s.Factory(GraphFixtures["3e4v"])
 
 	var hit int
-	g.EachAdjacentTo("foo", func(adjacent Vertex) bool {
+	g.AdjacentTo("foo", func(adjacent Vertex) bool {
 		hit++
 		return true
 	})

util.go

@@ -74,7 +74,7 @@ func CollectVerticesAdjacentTo(v Vertex, g AdjacencyEnumerator) (vertices []Vert
 		vertices = make([]Vertex, 0, 8)
 	}
 
-	g.EachAdjacentTo(v, func(v Vertex) (terminate bool) {
+	g.AdjacentTo(v, func(v Vertex) (terminate bool) {
 		vertices = append(vertices, v)
 		return
 	})