Remove most error code from luci/gae

impl/memory/taskqueue.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 (
-        "errors"
         "net/http"
         "regexp"
 
         "golang.org/x/net/context"
 
-        "github.com/luci/gae"
         "github.com/luci/gae/impl/dummy"
         tq "github.com/luci/gae/service/taskqueue"
+        "github.com/luci/luci-go/common/errors"
         "github.com/luci/luci-go/common/mathrand"
 )
 
 /////////////////////////////// public functions ///////////////////////////////
 
 func useTQ(c context.Context) context.Context {
         return tq.SetFactory(c, func(ic context.Context) tq.Interface {
                 tqd := cur(ic).Get(memContextTQIdx)
                 if x, ok := tqd.(*taskQueueData); ok {
                         return &taskqueueImpl{
@@ skipping 175 matching lines @@
                         name[i] = validTaskChars[mathrand.Get(c).Intn(len(validTaskChars))]
                 }
                 cur = string(name[:])
                 _, ok = queue[cur]
         }
         return cur
 }
 
 func multi(tasks []*tq.Task, queueName string, f func(*tq.Task, string) (*tq.Task, error)) ([]*tq.Task, error) {
         ret := []*tq.Task(nil)
-        lme := gae.LazyMultiError{Size: len(tasks)}
+        lme := errors.LazyMultiError{Size: len(tasks)}
         for i, task := range tasks {
                 rt, err := f(task, queueName)
                 ret = append(ret, rt)
                 lme.Assign(i, err)
         }
         return ret, lme.Get()
 }
 
 func dupTask(t *tq.Task) *tq.Task {
         ret := &tq.Task{}
@@ skipping 24 matching lines @@
 func dupQueue(q tq.QueueData) tq.QueueData {
         r := make(tq.QueueData, len(q))
         for k, q := range q {
                 r[k] = make(map[string]*tq.Task, len(q))
                 for tn, t := range q {
                         r[k][tn] = dupTask(t)
                 }
         }
         return r
 }