code: func NewResolver(qs graph.QuadStore, nodes ...quad.Value) *Resolver {
  	it := &Resolver{
  		uid:   NextUID(),
  		qs:    qs,
  		order: make([]quad.Value, len(nodes)),
  		// Generally there are going to be no/few duplicates given
  		// so allocate maps large enough to accommodate all
  		values: make(map[quad.Value]graph.Value, len(nodes)),
  		nodes:  make(map[interface{}]quad.Value, len(nodes)),
  	}
  	copy(it.order, nodes)
  	return it
  }
docs: // Creates a new Resolver iterator.