| OLD | NEW |
| 1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 The LUCI Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed under the Apache License, Version 2.0 |
| 3 // found in the LICENSE file. | 3 // that can be found in the LICENSE file. |
| 4 | 4 |
| 5 package memory | 5 package memory |
| 6 | 6 |
| 7 import ( | 7 import ( |
| 8 "bytes" | 8 "bytes" |
| 9 "fmt" | 9 "fmt" |
| 10 "sort" | 10 "sort" |
| 11 "strings" | 11 "strings" |
| 12 | 12 |
| 13 ds "github.com/luci/gae/service/datastore" | 13 ds "github.com/luci/gae/service/datastore" |
| (...skipping 528 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 542 if bestIdx == nil { | 542 if bestIdx == nil { |
| 543 // something is really wrong here... if relevantIdxs is
!nil, then we | 543 // something is really wrong here... if relevantIdxs is
!nil, then we |
| 544 // should always be able to make progress in this loop. | 544 // should always be able to make progress in this loop. |
| 545 impossible(fmt.Errorf("deadlock: cannot fulfil query?")) | 545 impossible(fmt.Errorf("deadlock: cannot fulfil query?")) |
| 546 } | 546 } |
| 547 ret = append(ret, generate(q, bestIdx, constraints)) | 547 ret = append(ret, generate(q, bestIdx, constraints)) |
| 548 } | 548 } |
| 549 | 549 |
| 550 return ret, nil | 550 return ret, nil |
| 551 } | 551 } |
| OLD | NEW |