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 datastore | 5 package datastore |
6 | 6 |
7 import ( | 7 import ( |
8 "encoding/json" | 8 "encoding/json" |
9 "fmt" | 9 "fmt" |
10 "testing" | 10 "testing" |
11 | 11 |
12 . "github.com/luci/luci-go/common/testing/assertions" | 12 . "github.com/luci/luci-go/common/testing/assertions" |
13 . "github.com/smartystreets/goconvey/convey" | 13 . "github.com/smartystreets/goconvey/convey" |
(...skipping 226 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
240 } | 240 } |
241 | 241 |
242 for i := 1; i < len(s); i++ { | 242 for i := 1; i < len(s); i++ { |
243 So(s[i-1], shouldBeLess, s[i]) | 243 So(s[i-1], shouldBeLess, s[i]) |
244 So(s[i-1], shouldNotBeEqual, s[i]) | 244 So(s[i-1], shouldNotBeEqual, s[i]) |
245 So(s[i], shouldNotBeEqual, s[i-1]) | 245 So(s[i], shouldNotBeEqual, s[i-1]) |
246 So(s[i], shouldNotBeLess, s[i-1]) | 246 So(s[i], shouldNotBeLess, s[i-1]) |
247 } | 247 } |
248 }) | 248 }) |
249 } | 249 } |
OLD | NEW |