Some more fixes

graph/graphtest/graphtest.go

@@ -98,7 +98,7 @@ func BenchmarkAll(b *testing.B, gen testutil.DatabaseFunc, conf *Config) {
 	})
 }
 
-// This is a simple test graph.
+// MakeQuadSet makes a simple test graph.
 //
 //    +---+                        +---+
 //    | A |-------               ->| F |<--
@@ -842,6 +842,7 @@ func TestLoadTypedQuads(t testing.TB, gen testutil.DatabaseFunc, conf *Config) {
 	require.Equal(t, exp, st, "Unexpected quadstore size")
 }
 
+// TestAddRemove tests add and remove
 // TODO(dennwc): add tests to verify that QS behaves in a right way with IgnoreOptions,
 // returns ErrQuadExists, ErrQuadNotExists is doing rollback.
 func TestAddRemove(t testing.TB, gen testutil.DatabaseFunc, conf *Config) {

graph/iterator/fixed.go

@@ -35,7 +35,7 @@ type Fixed struct {
 	values []refs.Ref
 }
 
-// Creates a new Fixed iterator with a custom comparator.
+// NewFixed creates a new Fixed iterator with a custom comparator.
 func NewFixed(vals ...refs.Ref) *Fixed {
 	return &Fixed{
 		values: append([]refs.Ref{}, vals...),

graph/iterator/iterator.go

@@ -97,7 +97,7 @@ type Index interface {
 	Contains(ctx context.Context, v refs.Ref) bool
 }
 
-// Tagger is an interface for iterators that can tag values. Tags are returned as a part of TagResults call.
+// TaggerShape is an interface for iterators that can tag values. Tags are returned as a part of TagResults call.
 type TaggerShape interface {
 	Shape
 	TaggerBase
@@ -172,20 +172,23 @@ func Height(it Shape, filter func(Shape) bool) int {
 	return maxDepth + 1
 }
 
-// Here we define the simplest iterator -- the Null iterator. It contains nothing.
+// Null is the simplest iterator -- the Null iterator. It contains nothing.
 // It is the empty set. Often times, queries that contain one of these match nothing,
 // so it's important to give it a special iterator.
 type Null struct{}
 
+// NewNull creates a new Null iterator
 // Fairly useless New function.
 func NewNull() *Null {
 	return &Null{}
 }
 
+// Iterate implements Iterator
 func (it *Null) Iterate() Scanner {
 	return it
 }
 
+// Lookup implements Iterator
 func (it *Null) Lookup() Index {
 	return it
 }

graph/iterator/resolver.go

@@ -29,7 +29,7 @@ type Resolver struct {
 	order []quad.Value
 }
 
-// Creates a new Resolver iterator.
+// NewResolver creates a new Resolver iterator.
 func NewResolver(qs refs.Namer, nodes ...quad.Value) *Resolver {
 	it := &Resolver{
 		qs:    qs,