Show More
@@ -10,15 +10,27 b'' | |||||
10 | # Eventually, it could take care of updating (adding/removing/moving) |
|
10 | # Eventually, it could take care of updating (adding/removing/moving) | |
11 | # tags too. |
|
11 | # tags too. | |
12 |
|
12 | |||
13 | from node import nullid, bin, hex, short |
|
13 | from __future__ import absolute_import | |
14 | from i18n import _ |
|
14 | ||
15 |
import |
|
15 | import array | |
16 | import encoding |
|
|||
17 | import error |
|
|||
18 | from array import array |
|
|||
19 | import errno |
|
16 | import errno | |
20 | import time |
|
17 | import time | |
21 |
|
18 | |||
|
19 | from .i18n import _ | |||
|
20 | from .node import ( | |||
|
21 | bin, | |||
|
22 | hex, | |||
|
23 | nullid, | |||
|
24 | short, | |||
|
25 | ) | |||
|
26 | from . import ( | |||
|
27 | encoding, | |||
|
28 | error, | |||
|
29 | util, | |||
|
30 | ) | |||
|
31 | ||||
|
32 | array = array.array | |||
|
33 | ||||
22 | # Tags computation can be expensive and caches exist to make it fast in |
|
34 | # Tags computation can be expensive and caches exist to make it fast in | |
23 | # the common case. |
|
35 | # the common case. | |
24 | # |
|
36 | # | |
@@ -263,7 +275,7 b' def _readtagcache(ui, repo):' | |||||
263 | If the cache is not up to date, the caller is responsible for reading tag |
|
275 | If the cache is not up to date, the caller is responsible for reading tag | |
264 | info from each returned head. (See findglobaltags().) |
|
276 | info from each returned head. (See findglobaltags().) | |
265 | ''' |
|
277 | ''' | |
266 | import scmutil # avoid cycle |
|
278 | from . import scmutil # avoid cycle | |
267 |
|
279 | |||
268 | try: |
|
280 | try: | |
269 | cachefile = repo.vfs(_filename(repo), 'r') |
|
281 | cachefile = repo.vfs(_filename(repo), 'r') |
General Comments 0
You need to be logged in to leave comments.
Login now