Make LazyMultiError constructed via function

filter/dscache/plan.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 dscache
 
 import (
         "bytes"
 
         ds "github.com/luci/gae/service/datastore"
@@ skipping 74 matching lines @@
 //     from datastore and then attempt to save them back to memcache.
 //   * some entries are 'lock' entries, owned by something else, so we should
 //     get them from datastore and then NOT save them to memcache.
 //
 // Or some combination thereof. This also handles memcache enries with invalid
 // data in them, cases where items have caching disabled entirely, etc.
 func makeFetchPlan(c context.Context, aid, ns string, f *facts) *plan {
         p := plan{
                 keepMeta: f.getMeta != nil,
                 decoded:  make([]ds.PropertyMap, len(f.lockItems)),
-                lme:      errors.LazyMultiError{Size: len(f.lockItems)},
+                lme:      errors.NewLazyMultiError(len(f.lockItems)),
         }
         for i, lockItm := range f.lockItems {
                 m := f.getMeta.GetSingle(i)
                 getKey := f.getKeys[i]
 
                 if lockItm == nil {
                         // this item wasn't cacheable (e.g. the model had caching disabled,
                         // shardsForKey returned 0, etc.)
                         p.add(i, getKey, m, nil)
                         continue
@@ skipping 22 matching lines @@
                                 p.add(i, getKey, m, nil)
                         }
 
                 default:
                         // have some other sort of object, or our AddMulti failed to add this item.
                         p.add(i, getKey, m, nil)
                 }
         }
         return &p
 }