Switch to external stringset implementation.

impl/memory/datastore_index.go

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 package memory
 
 import (
         "bytes"
         "fmt"
         "sort"
 
         ds "github.com/luci/gae/service/datastore"
         "github.com/luci/gae/service/datastore/serialize"
         "github.com/luci/gkvlite"
+        "github.com/luci/luci-go/common/stringset"
 )
 
 type qIndexSlice []*ds.IndexDefinition
 
 func (s qIndexSlice) Len() int           { return len(s) }
 func (s qIndexSlice) Swap(i, j int)      { s[i], s[j] = s[j], s[i] }
 func (s qIndexSlice) Less(i, j int) bool { return s[i].Less(s[j]) }
 
 func defaultIndexes(kind string, pmap ds.PropertyMap) []*ds.IndexDefinition {
         ret := make(qIndexSlice, 0, 2*len(pmap)+1)
@@ skipping 36 matching lines @@
 type serializedIndexablePmap map[string]serializedPvals
 
 func partiallySerialize(k ds.Key, pm ds.PropertyMap) (ret serializedIndexablePmap) {
         ret = make(serializedIndexablePmap, len(pm)+2)
         ret["__key__"] = [][]byte{serialize.ToBytes(ds.MkProperty(k))}
         for k != nil {
                 ret["__ancestor__"] = append(ret["__ancestor__"], serialize.ToBytes(ds.MkProperty(k)))
                 k = k.Parent()
         }
         for k, vals := range pm {
-                dups := stringSet{}
+                dups := stringset.New(0)
                 newVals := make(serializedPvals, 0, len(vals))
                 for _, v := range vals {
                         if v.IndexSetting() == ds.NoIndex {
                                 continue
                         }
                         data := serialize.ToBytes(v)
                         dataS := string(data)
-                        if !dups.add(dataS) {
+                        if !dups.Add(dataS) {
                                 continue
                         }
                         newVals = append(newVals, data)
                 }
                 if len(newVals) > 0 {
                         ret[k] = newVals
                 }
         }
         return
 }
@@ skipping 207 matching lines @@
         compIdx := []*ds.IndexDefinition{}
         walkCompIdxs(store, nil, func(i *ds.IndexDefinition) bool {
                 compIdx = append(compIdx, i)
                 return true
         })
 
         mergeIndexes(key.Namespace(), store,
                 indexEntriesWithBuiltins(key, oldEnt, compIdx),
                 indexEntriesWithBuiltins(key, newEnt, compIdx))
 }