datastore: Update AllocateIDs to take keys.

filter/dscache/support.go

 // Copyright 2015 The LUCI Authors. All rights reserved.
 // Use of this source code is governed under the Apache License, Version 2.0
 // that can be found in the LICENSE file.
 
 package dscache
 
 import (
         "fmt"
         "math/rand"
         "time"
@@ skipping 45 matching lines @@
                 }
                 ret[i] = MakeMemcacheKey(s.mr.Intn(shards), key)
         }
         return ret
 }
 
 func (s *supportContext) mkAllKeys(keys []*ds.Key) []string {
         size := 0
         nums := make([]int, len(keys))
         for i, key := range keys {
-                if !key.Incomplete() {
+                if !key.IsIncomplete() {
                         shards := s.numShards(key)
                         nums[i] = shards
                         size += shards
                 }
         }
         if size == 0 {
                 return nil
         }
         ret := make([]string, 0, size)
         for i, key := range keys {
-                if !key.Incomplete() {
+                if !key.IsIncomplete() {
                         keySuffix := HashKey(key)
                         for shard := 0; shard < nums[i]; shard++ {
                                 ret = append(ret, fmt.Sprintf(KeyFormat, shard, keySuffix))
                         }
                 }
         }
         return ret
 }
 
 // crappyNonce creates a really crappy nonce using math/rand. This is generally
@@ skipping 63 matching lines @@
                 return nil, nil
         }
         ret := make([]memcache.Item, len(mcKeys))
         for i := range ret {
                 ret[i] = (s.mc.NewItem(mcKeys[i]).
                         SetFlags(uint32(ItemHasLock)).
                         SetExpiration(time.Second * time.Duration(LockTimeSeconds)))
         }
         return ret, mcKeys
 }