Mercurial > public > mercurial-scm > hg-stable
annotate mercurial/revset.py @ 11467:6b836d5c8c9e stable
revset: make negate work for sort specs
| author | Matt Mackall <mpm@selenic.com> |
|---|---|
| date | Wed, 30 Jun 2010 17:44:36 -0500 |
| parents | 88abbb046e66 |
| children | ebaf117c2642 |
| rev | line source |
|---|---|
| 11275 | 1 # revset.py - revision set queries for mercurial |
| 2 # | |
| 3 # Copyright 2010 Matt Mackall <mpm@selenic.com> | |
| 4 # | |
| 5 # This software may be used and distributed according to the terms of the | |
| 6 # GNU General Public License version 2 or any later version. | |
| 7 | |
| 8 import re | |
|
11301
3d0591a66118
move discovery methods from localrepo into new discovery module
Dirkjan Ochtman <dirkjan@ochtman.nl>
parents:
11293
diff
changeset
|
9 import parser, util, error, discovery |
| 11275 | 10 import match as _match |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
11 from i18n import _ |
| 11275 | 12 |
| 13 elements = { | |
| 14 "(": (20, ("group", 1, ")"), ("func", 1, ")")), | |
| 15 "-": (19, ("negate", 19), ("minus", 19)), | |
|
11278
7df88cdf47fd
revset: add support for prefix and suffix versions of : and ::
Matt Mackall <mpm@selenic.com>
parents:
11275
diff
changeset
|
16 "::": (17, ("dagrangepre", 17), ("dagrange", 17), |
|
7df88cdf47fd
revset: add support for prefix and suffix versions of : and ::
Matt Mackall <mpm@selenic.com>
parents:
11275
diff
changeset
|
17 ("dagrangepost", 17)), |
|
7df88cdf47fd
revset: add support for prefix and suffix versions of : and ::
Matt Mackall <mpm@selenic.com>
parents:
11275
diff
changeset
|
18 "..": (17, ("dagrangepre", 17), ("dagrange", 17), |
|
7df88cdf47fd
revset: add support for prefix and suffix versions of : and ::
Matt Mackall <mpm@selenic.com>
parents:
11275
diff
changeset
|
19 ("dagrangepost", 17)), |
|
7df88cdf47fd
revset: add support for prefix and suffix versions of : and ::
Matt Mackall <mpm@selenic.com>
parents:
11275
diff
changeset
|
20 ":": (15, ("rangepre", 15), ("range", 15), ("rangepost", 15)), |
| 11275 | 21 "not": (10, ("not", 10)), |
| 22 "!": (10, ("not", 10)), | |
| 23 "and": (5, None, ("and", 5)), | |
| 24 "&": (5, None, ("and", 5)), | |
| 25 "or": (4, None, ("or", 4)), | |
| 26 "|": (4, None, ("or", 4)), | |
| 27 "+": (4, None, ("or", 4)), | |
| 28 ",": (2, None, ("list", 2)), | |
| 29 ")": (0, None, None), | |
| 30 "symbol": (0, ("symbol",), None), | |
| 31 "string": (0, ("string",), None), | |
| 32 "end": (0, None, None), | |
| 33 } | |
| 34 | |
| 35 keywords = set(['and', 'or', 'not']) | |
| 36 | |
| 37 def tokenize(program): | |
| 38 pos, l = 0, len(program) | |
| 39 while pos < l: | |
| 40 c = program[pos] | |
| 41 if c.isspace(): # skip inter-token whitespace | |
| 42 pass | |
|
11278
7df88cdf47fd
revset: add support for prefix and suffix versions of : and ::
Matt Mackall <mpm@selenic.com>
parents:
11275
diff
changeset
|
43 elif c == ':' and program[pos:pos + 2] == '::': # look ahead carefully |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
44 yield ('::', None, pos) |
|
11278
7df88cdf47fd
revset: add support for prefix and suffix versions of : and ::
Matt Mackall <mpm@selenic.com>
parents:
11275
diff
changeset
|
45 pos += 1 # skip ahead |
| 11275 | 46 elif c == '.' and program[pos:pos + 2] == '..': # look ahead carefully |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
47 yield ('..', None, pos) |
| 11275 | 48 pos += 1 # skip ahead |
|
11278
7df88cdf47fd
revset: add support for prefix and suffix versions of : and ::
Matt Mackall <mpm@selenic.com>
parents:
11275
diff
changeset
|
49 elif c in "():,-|&+!": # handle simple operators |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
50 yield (c, None, pos) |
| 11275 | 51 elif c in '"\'': # handle quoted strings |
| 52 pos += 1 | |
| 53 s = pos | |
| 54 while pos < l: # find closing quote | |
| 55 d = program[pos] | |
| 56 if d == '\\': # skip over escaped characters | |
| 57 pos += 2 | |
| 58 continue | |
| 59 if d == c: | |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
60 yield ('string', program[s:pos].decode('string-escape'), s) |
| 11275 | 61 break |
| 62 pos += 1 | |
| 63 else: | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
64 raise error.ParseError(_("unterminated string"), s) |
|
11404
37cbedbeae96
revset: allow extended characters in symbols
Matt Mackall <mpm@selenic.com>
parents:
11385
diff
changeset
|
65 elif c.isalnum() or c in '._' or ord(c) > 127: # gather up a symbol/keyword |
| 11275 | 66 s = pos |
| 67 pos += 1 | |
| 68 while pos < l: # find end of symbol | |
| 69 d = program[pos] | |
|
11404
37cbedbeae96
revset: allow extended characters in symbols
Matt Mackall <mpm@selenic.com>
parents:
11385
diff
changeset
|
70 if not (d.isalnum() or d in "._" or ord(d) > 127): |
| 11275 | 71 break |
| 72 if d == '.' and program[pos - 1] == '.': # special case for .. | |
| 73 pos -= 1 | |
| 74 break | |
| 75 pos += 1 | |
| 76 sym = program[s:pos] | |
| 77 if sym in keywords: # operator keywords | |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
78 yield (sym, None, s) |
| 11275 | 79 else: |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
80 yield ('symbol', sym, s) |
| 11275 | 81 pos -= 1 |
| 82 else: | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
83 raise error.ParseError(_("syntax error"), pos) |
| 11275 | 84 pos += 1 |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
85 yield ('end', None, pos) |
| 11275 | 86 |
| 87 # helpers | |
| 88 | |
| 89 def getstring(x, err): | |
|
11406
42408cd43f55
revset: fix up contains/getstring when no args passed
Matt Mackall <mpm@selenic.com>
parents:
11404
diff
changeset
|
90 if x and (x[0] == 'string' or x[0] == 'symbol'): |
| 11275 | 91 return x[1] |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
92 raise error.ParseError(err) |
| 11275 | 93 |
| 94 def getlist(x): | |
| 95 if not x: | |
| 96 return [] | |
| 97 if x[0] == 'list': | |
| 98 return getlist(x[1]) + [x[2]] | |
| 99 return [x] | |
| 100 | |
|
11339
744d5b73f776
revset: improve filter argument handling
Matt Mackall <mpm@selenic.com>
parents:
11304
diff
changeset
|
101 def getargs(x, min, max, err): |
| 11275 | 102 l = getlist(x) |
|
11339
744d5b73f776
revset: improve filter argument handling
Matt Mackall <mpm@selenic.com>
parents:
11304
diff
changeset
|
103 if len(l) < min or len(l) > max: |
|
11289
4215ce511134
revset: raise ParseError exceptions
Matt Mackall <mpm@selenic.com>
parents:
11284
diff
changeset
|
104 raise error.ParseError(err) |
| 11275 | 105 return l |
| 106 | |
| 107 def getset(repo, subset, x): | |
| 108 if not x: | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
109 raise error.ParseError(_("missing argument")) |
| 11275 | 110 return methods[x[0]](repo, subset, *x[1:]) |
| 111 | |
| 112 # operator methods | |
| 113 | |
| 114 def stringset(repo, subset, x): | |
| 115 x = repo[x].rev() | |
| 11282 | 116 if x == -1 and len(subset) == len(repo): |
| 117 return [-1] | |
| 11275 | 118 if x in subset: |
| 119 return [x] | |
| 120 return [] | |
| 121 | |
| 122 def symbolset(repo, subset, x): | |
| 123 if x in symbols: | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
124 raise error.ParseError(_("can't use %s here") % x) |
| 11275 | 125 return stringset(repo, subset, x) |
| 126 | |
| 127 def rangeset(repo, subset, x, y): | |
|
11456
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
128 m = getset(repo, subset, x) |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
129 if not m: |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
130 m = getset(repo, range(len(repo)), x) |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
131 |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
132 n = getset(repo, subset, y) |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
133 if not n: |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
134 n = getset(repo, range(len(repo)), y) |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
135 |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
136 if not m or not n: |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
137 return [] |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
138 m, n = m[0], n[-1] |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
139 |
| 11275 | 140 if m < n: |
|
11456
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
141 r = range(m, n + 1) |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
142 else: |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
143 r = range(m, n - 1, -1) |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
144 s = set(subset) |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
145 return [x for x in r if x in s] |
| 11275 | 146 |
| 147 def andset(repo, subset, x, y): | |
| 148 return getset(repo, getset(repo, subset, x), y) | |
| 149 | |
| 150 def orset(repo, subset, x, y): | |
| 151 s = set(getset(repo, subset, x)) | |
| 152 s |= set(getset(repo, [r for r in subset if r not in s], y)) | |
| 153 return [r for r in subset if r in s] | |
| 154 | |
| 155 def notset(repo, subset, x): | |
| 156 s = set(getset(repo, subset, x)) | |
| 157 return [r for r in subset if r not in s] | |
| 158 | |
| 159 def listset(repo, subset, a, b): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
160 raise error.ParseError(_("can't use a list in this context")) |
| 11275 | 161 |
| 162 def func(repo, subset, a, b): | |
| 163 if a[0] == 'symbol' and a[1] in symbols: | |
| 164 return symbols[a[1]](repo, subset, b) | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
165 raise error.ParseError(_("not a function: %s") % a[1]) |
| 11275 | 166 |
| 167 # functions | |
| 168 | |
| 169 def p1(repo, subset, x): | |
| 170 ps = set() | |
| 171 cl = repo.changelog | |
| 172 for r in getset(repo, subset, x): | |
| 173 ps.add(cl.parentrevs(r)[0]) | |
| 174 return [r for r in subset if r in ps] | |
| 175 | |
| 176 def p2(repo, subset, x): | |
| 177 ps = set() | |
| 178 cl = repo.changelog | |
| 179 for r in getset(repo, subset, x): | |
| 180 ps.add(cl.parentrevs(r)[1]) | |
| 181 return [r for r in subset if r in ps] | |
| 182 | |
| 183 def parents(repo, subset, x): | |
| 184 ps = set() | |
| 185 cl = repo.changelog | |
| 186 for r in getset(repo, subset, x): | |
| 187 ps.update(cl.parentrevs(r)) | |
| 188 return [r for r in subset if r in ps] | |
| 189 | |
| 190 def maxrev(repo, subset, x): | |
| 191 s = getset(repo, subset, x) | |
| 192 if s: | |
| 193 m = max(s) | |
| 194 if m in subset: | |
| 195 return [m] | |
| 196 return [] | |
| 197 | |
| 198 def limit(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
199 l = getargs(x, 2, 2, _("limit wants two arguments")) |
| 11275 | 200 try: |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
201 lim = int(getstring(l[1], _("limit wants a number"))) |
| 11275 | 202 except ValueError: |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
203 raise error.ParseError(_("limit expects a number")) |
| 11275 | 204 return getset(repo, subset, l[0])[:lim] |
| 205 | |
| 206 def children(repo, subset, x): | |
| 207 cs = set() | |
| 208 cl = repo.changelog | |
| 209 s = set(getset(repo, subset, x)) | |
| 210 for r in xrange(0, len(repo)): | |
| 211 for p in cl.parentrevs(r): | |
| 212 if p in s: | |
| 213 cs.add(r) | |
| 214 return [r for r in subset if r in cs] | |
| 215 | |
| 216 def branch(repo, subset, x): | |
| 217 s = getset(repo, range(len(repo)), x) | |
| 218 b = set() | |
| 219 for r in s: | |
| 220 b.add(repo[r].branch()) | |
| 221 s = set(s) | |
| 222 return [r for r in subset if r in s or repo[r].branch() in b] | |
| 223 | |
| 224 def ancestor(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
225 l = getargs(x, 2, 2, _("ancestor wants two arguments")) |
| 11275 | 226 a = getset(repo, subset, l[0]) |
| 227 b = getset(repo, subset, l[1]) | |
| 228 if len(a) > 1 or len(b) > 1: | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
229 raise error.ParseError(_("ancestor arguments must be single revisions")) |
| 11275 | 230 return [repo[a[0]].ancestor(repo[b[0]]).rev()] |
| 231 | |
| 232 def ancestors(repo, subset, x): | |
| 233 args = getset(repo, range(len(repo)), x) | |
|
11456
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
234 if not args: |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
235 return [] |
| 11275 | 236 s = set(repo.changelog.ancestors(*args)) | set(args) |
| 237 return [r for r in subset if r in s] | |
| 238 | |
| 239 def descendants(repo, subset, x): | |
| 240 args = getset(repo, range(len(repo)), x) | |
|
11456
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
241 if not args: |
|
88abbb046e66
revset: deal with empty sets in range endpoints
Matt Mackall <mpm@selenic.com>
parents:
11446
diff
changeset
|
242 return [] |
| 11275 | 243 s = set(repo.changelog.descendants(*args)) | set(args) |
| 244 return [r for r in subset if r in s] | |
| 245 | |
| 246 def follow(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
247 getargs(x, 0, 0, _("follow takes no arguments")) |
| 11275 | 248 p = repo['.'].rev() |
| 249 s = set(repo.changelog.ancestors(p)) | set([p]) | |
| 250 return [r for r in subset if r in s] | |
| 251 | |
| 252 def date(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
253 ds = getstring(x, _("date wants a string")) |
| 11275 | 254 dm = util.matchdate(ds) |
| 255 return [r for r in subset if dm(repo[r].date()[0])] | |
| 256 | |
| 257 def keyword(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
258 kw = getstring(x, _("keyword wants a string")).lower() |
| 11275 | 259 l = [] |
| 260 for r in subset: | |
| 261 c = repo[r] | |
| 262 t = " ".join(c.files() + [c.user(), c.description()]) | |
| 263 if kw in t.lower(): | |
| 264 l.append(r) | |
| 265 return l | |
| 266 | |
| 267 def grep(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
268 gr = re.compile(getstring(x, _("grep wants a string"))) |
| 11275 | 269 l = [] |
| 270 for r in subset: | |
| 271 c = repo[r] | |
| 272 for e in c.files() + [c.user(), c.description()]: | |
| 273 if gr.search(e): | |
| 274 l.append(r) | |
| 275 continue | |
| 276 return l | |
| 277 | |
| 278 def author(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
279 n = getstring(x, _("author wants a string")).lower() |
| 11275 | 280 return [r for r in subset if n in repo[r].user().lower()] |
| 281 | |
| 282 def hasfile(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
283 pat = getstring(x, _("file wants a pattern")) |
| 11275 | 284 m = _match.match(repo.root, repo.getcwd(), [pat]) |
| 285 s = [] | |
| 286 for r in subset: | |
| 287 for f in repo[r].files(): | |
| 288 if m(f): | |
| 289 s.append(r) | |
| 290 continue | |
| 291 return s | |
| 292 | |
| 293 def contains(repo, subset, x): | |
|
11406
42408cd43f55
revset: fix up contains/getstring when no args passed
Matt Mackall <mpm@selenic.com>
parents:
11404
diff
changeset
|
294 pat = getstring(x, _("contains wants a pattern")) |
| 11275 | 295 m = _match.match(repo.root, repo.getcwd(), [pat]) |
| 296 s = [] | |
| 297 if m.files() == [pat]: | |
| 298 for r in subset: | |
| 299 if pat in repo[r]: | |
| 300 s.append(r) | |
| 301 continue | |
| 302 else: | |
| 303 for r in subset: | |
| 304 for f in repo[r].manifest(): | |
| 305 if m(f): | |
| 306 s.append(r) | |
| 307 continue | |
| 308 return s | |
| 309 | |
| 310 def checkstatus(repo, subset, pat, field): | |
| 311 m = _match.match(repo.root, repo.getcwd(), [pat]) | |
| 312 s = [] | |
| 313 fast = (m.files() == [pat]) | |
| 314 for r in subset: | |
| 315 c = repo[r] | |
| 316 if fast: | |
| 317 if pat not in c.files(): | |
| 318 continue | |
| 319 else: | |
| 320 for f in c.files(): | |
| 321 if m(f): | |
| 322 break | |
| 323 else: | |
| 324 continue | |
| 325 files = repo.status(c.p1().node(), c.node())[field] | |
| 326 if fast: | |
| 327 if pat in files: | |
| 328 s.append(r) | |
| 329 continue | |
| 330 else: | |
| 331 for f in files: | |
| 332 if m(f): | |
| 333 s.append(r) | |
| 334 continue | |
| 335 return s | |
| 336 | |
| 337 def modifies(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
338 pat = getstring(x, _("modifies wants a pattern")) |
| 11275 | 339 return checkstatus(repo, subset, pat, 0) |
| 340 | |
| 341 def adds(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
342 pat = getstring(x, _("adds wants a pattern")) |
| 11275 | 343 return checkstatus(repo, subset, pat, 1) |
| 344 | |
| 345 def removes(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
346 pat = getstring(x, _("removes wants a pattern")) |
| 11275 | 347 return checkstatus(repo, subset, pat, 2) |
| 348 | |
| 349 def merge(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
350 getargs(x, 0, 0, _("merge takes no arguments")) |
| 11275 | 351 cl = repo.changelog |
| 352 return [r for r in subset if cl.parentrevs(r)[1] != -1] | |
| 353 | |
| 354 def closed(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
355 getargs(x, 0, 0, _("closed takes no arguments")) |
|
11349
cf8a9154a362
revset: fix call to ctx.extra() in closed()
Georg Brandl <georg@python.org>
parents:
11339
diff
changeset
|
356 return [r for r in subset if repo[r].extra().get('close')] |
| 11275 | 357 |
| 358 def head(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
359 getargs(x, 0, 0, _("head takes no arguments")) |
| 11275 | 360 hs = set() |
| 361 for b, ls in repo.branchmap().iteritems(): | |
| 362 hs.update(repo[h].rev() for h in ls) | |
| 363 return [r for r in subset if r in hs] | |
| 364 | |
| 365 def reverse(repo, subset, x): | |
| 366 l = getset(repo, subset, x) | |
| 367 l.reverse() | |
| 368 return l | |
| 369 | |
| 370 def sort(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
371 l = getargs(x, 1, 2, _("sort wants one or two arguments")) |
| 11275 | 372 keys = "rev" |
| 373 if len(l) == 2: | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
374 keys = getstring(l[1], _("sort spec must be a string")) |
| 11275 | 375 |
| 376 s = l[0] | |
| 377 keys = keys.split() | |
| 378 l = [] | |
| 379 def invert(s): | |
| 380 return "".join(chr(255 - ord(c)) for c in s) | |
| 381 for r in getset(repo, subset, s): | |
| 382 c = repo[r] | |
| 383 e = [] | |
| 384 for k in keys: | |
| 385 if k == 'rev': | |
| 386 e.append(r) | |
| 387 elif k == '-rev': | |
| 388 e.append(-r) | |
| 389 elif k == 'branch': | |
| 390 e.append(c.branch()) | |
| 391 elif k == '-branch': | |
| 392 e.append(invert(c.branch())) | |
| 393 elif k == 'desc': | |
| 394 e.append(c.description()) | |
| 395 elif k == '-desc': | |
| 396 e.append(invert(c.description())) | |
| 397 elif k in 'user author': | |
| 398 e.append(c.user()) | |
| 399 elif k in '-user -author': | |
| 400 e.append(invert(c.user())) | |
| 401 elif k == 'date': | |
| 402 e.append(c.date()[0]) | |
| 403 elif k == '-date': | |
| 404 e.append(-c.date()[0]) | |
| 405 else: | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
406 raise error.ParseError(_("unknown sort key %r") % k) |
| 11275 | 407 e.append(r) |
| 408 l.append(e) | |
| 409 l.sort() | |
| 410 return [e[-1] for e in l] | |
| 411 | |
| 412 def getall(repo, subset, x): | |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
413 getargs(x, 0, 0, _("all takes no arguments")) |
| 11275 | 414 return subset |
| 415 | |
| 416 def heads(repo, subset, x): | |
| 417 s = getset(repo, subset, x) | |
| 418 ps = set(parents(repo, subset, x)) | |
| 419 return [r for r in s if r not in ps] | |
| 420 | |
| 421 def roots(repo, subset, x): | |
| 422 s = getset(repo, subset, x) | |
| 423 cs = set(children(repo, subset, x)) | |
| 424 return [r for r in s if r not in cs] | |
| 425 | |
| 426 def outgoing(repo, subset, x): | |
|
11293
0e5ce2325795
revset: delay import of hg to avoid start-up import loops
Matt Mackall <mpm@selenic.com>
parents:
11289
diff
changeset
|
427 import hg # avoid start-up nasties |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
428 l = getargs(x, 0, 1, _("outgoing wants a repository path")) |
|
11339
744d5b73f776
revset: improve filter argument handling
Matt Mackall <mpm@selenic.com>
parents:
11304
diff
changeset
|
429 dest = l[1:] or '' |
| 11275 | 430 dest = repo.ui.expandpath(dest or 'default-push', dest or 'default') |
| 431 dest, branches = hg.parseurl(dest) | |
| 432 other = hg.repository(hg.remoteui(repo, {}), dest) | |
| 433 repo.ui.pushbuffer() | |
|
11301
3d0591a66118
move discovery methods from localrepo into new discovery module
Dirkjan Ochtman <dirkjan@ochtman.nl>
parents:
11293
diff
changeset
|
434 o = discovery.findoutgoing(repo, other) |
| 11275 | 435 repo.ui.popbuffer() |
| 436 cl = repo.changelog | |
| 437 o = set([cl.rev(r) for r in repo.changelog.nodesbetween(o, None)[0]]) | |
| 438 return [r for r in subset if r in o] | |
| 439 | |
|
11280
a5eb0bf7e158
revset: add tagged predicate
Matt Mackall <mpm@selenic.com>
parents:
11279
diff
changeset
|
440 def tagged(repo, subset, x): |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
441 getargs(x, 0, 0, _("tagged takes no arguments")) |
|
11280
a5eb0bf7e158
revset: add tagged predicate
Matt Mackall <mpm@selenic.com>
parents:
11279
diff
changeset
|
442 cl = repo.changelog |
|
a5eb0bf7e158
revset: add tagged predicate
Matt Mackall <mpm@selenic.com>
parents:
11279
diff
changeset
|
443 s = set([cl.rev(n) for t, n in repo.tagslist() if t != 'tip']) |
|
a5eb0bf7e158
revset: add tagged predicate
Matt Mackall <mpm@selenic.com>
parents:
11279
diff
changeset
|
444 return [r for r in subset if r in s] |
|
a5eb0bf7e158
revset: add tagged predicate
Matt Mackall <mpm@selenic.com>
parents:
11279
diff
changeset
|
445 |
| 11275 | 446 symbols = { |
|
11284
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
447 "adds": adds, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
448 "all": getall, |
| 11275 | 449 "ancestor": ancestor, |
| 450 "ancestors": ancestors, | |
|
11284
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
451 "author": author, |
| 11275 | 452 "branch": branch, |
|
11284
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
453 "children": children, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
454 "closed": closed, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
455 "contains": contains, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
456 "date": date, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
457 "descendants": descendants, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
458 "file": hasfile, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
459 "follow": follow, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
460 "grep": grep, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
461 "head": head, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
462 "heads": heads, |
| 11275 | 463 "keyword": keyword, |
|
11284
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
464 "limit": limit, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
465 "max": maxrev, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
466 "merge": merge, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
467 "modifies": modifies, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
468 "outgoing": outgoing, |
| 11275 | 469 "p1": p1, |
| 470 "p2": p2, | |
| 471 "parents": parents, | |
|
11284
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
472 "removes": removes, |
|
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
473 "reverse": reverse, |
| 11275 | 474 "roots": roots, |
|
11284
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
475 "sort": sort, |
|
11280
a5eb0bf7e158
revset: add tagged predicate
Matt Mackall <mpm@selenic.com>
parents:
11279
diff
changeset
|
476 "tagged": tagged, |
|
11284
0b5c2e82aeb5
revset: sort the predicate list
Matt Mackall <mpm@selenic.com>
parents:
11283
diff
changeset
|
477 "user": author, |
| 11275 | 478 } |
| 479 | |
| 480 methods = { | |
| 481 "range": rangeset, | |
| 482 "string": stringset, | |
| 483 "symbol": symbolset, | |
| 484 "and": andset, | |
| 485 "or": orset, | |
| 486 "not": notset, | |
| 487 "list": listset, | |
| 488 "func": func, | |
| 489 } | |
| 490 | |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
491 def optimize(x, small): |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
492 if x == None: |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
493 return 0, x |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
494 |
| 11275 | 495 smallbonus = 1 |
| 496 if small: | |
| 497 smallbonus = .5 | |
| 498 | |
| 499 op = x[0] | |
|
11283
a6356b2695a3
revset: fix - handling in the optimizer
Matt Mackall <mpm@selenic.com>
parents:
11282
diff
changeset
|
500 if op == 'minus': |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
501 return optimize(('and', x[1], ('not', x[2])), small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
502 elif op == 'dagrange': |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
503 return optimize(('and', ('func', ('symbol', 'descendants'), x[1]), |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
504 ('func', ('symbol', 'ancestors'), x[2])), small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
505 elif op == 'dagrangepre': |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
506 return optimize(('func', ('symbol', 'ancestors'), x[1]), small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
507 elif op == 'dagrangepost': |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
508 return optimize(('func', ('symbol', 'descendants'), x[1]), small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
509 elif op == 'rangepre': |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
510 return optimize(('range', ('string', '0'), x[1]), small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
511 elif op == 'rangepost': |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
512 return optimize(('range', x[1], ('string', 'tip')), small) |
|
11467
6b836d5c8c9e
revset: make negate work for sort specs
Matt Mackall <mpm@selenic.com>
parents:
11456
diff
changeset
|
513 elif op == 'negate': |
|
6b836d5c8c9e
revset: make negate work for sort specs
Matt Mackall <mpm@selenic.com>
parents:
11456
diff
changeset
|
514 return optimize(('string', |
|
6b836d5c8c9e
revset: make negate work for sort specs
Matt Mackall <mpm@selenic.com>
parents:
11456
diff
changeset
|
515 '-' + getstring(x[1], _("can't negate that"))), small) |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
516 elif op in 'string symbol negate': |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
517 return smallbonus, x # single revisions are small |
| 11275 | 518 elif op == 'and' or op == 'dagrange': |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
519 wa, ta = optimize(x[1], True) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
520 wb, tb = optimize(x[2], True) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
521 w = min(wa, wb) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
522 if wa > wb: |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
523 return w, (op, tb, ta) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
524 return w, (op, ta, tb) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
525 elif op == 'or': |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
526 wa, ta = optimize(x[1], False) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
527 wb, tb = optimize(x[2], False) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
528 if wb < wa: |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
529 wb, wa = wa, wb |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
530 return max(wa, wb), (op, ta, tb) |
| 11275 | 531 elif op == 'not': |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
532 o = optimize(x[1], not small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
533 return o[0], (op, o[1]) |
| 11275 | 534 elif op == 'group': |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
535 return optimize(x[1], small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
536 elif op in 'range list': |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
537 wa, ta = optimize(x[1], small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
538 wb, tb = optimize(x[2], small) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
539 return wa + wb, (op, ta, tb) |
| 11275 | 540 elif op == 'func': |
|
11383
de544774ebea
revset: all your error messages are belong to _
Martin Geisler <mg@lazybytes.net>
parents:
11349
diff
changeset
|
541 f = getstring(x[1], _("not a symbol")) |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
542 wa, ta = optimize(x[2], small) |
| 11275 | 543 if f in "grep date user author keyword branch file": |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
544 w = 10 # slow |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
545 elif f in "modifies adds removes outgoing": |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
546 w = 30 # slower |
| 11275 | 547 elif f == "contains": |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
548 w = 100 # very slow |
| 11275 | 549 elif f == "ancestor": |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
550 w = 1 * smallbonus |
| 11275 | 551 elif f == "reverse limit": |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
552 w = 0 |
| 11275 | 553 elif f in "sort": |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
554 w = 10 # assume most sorts look at changelog |
| 11275 | 555 else: |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
556 w = 1 |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
557 return w + wa, (op, x[1], ta) |
|
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
558 return 1, x |
| 11275 | 559 |
| 560 parse = parser.parser(tokenize, elements).parse | |
| 561 | |
| 562 def match(spec): | |
|
11385
e5a2134c083b
revset: nicer exception for empty queries
Matt Mackall <mpm@selenic.com>
parents:
11383
diff
changeset
|
563 if not spec: |
|
e5a2134c083b
revset: nicer exception for empty queries
Matt Mackall <mpm@selenic.com>
parents:
11383
diff
changeset
|
564 raise error.ParseError(_("empty query")) |
| 11275 | 565 tree = parse(spec) |
|
11279
62ccf4cd6e7f
revset: optimize the parse tree directly
Matt Mackall <mpm@selenic.com>
parents:
11278
diff
changeset
|
566 weight, tree = optimize(tree, True) |
| 11275 | 567 def mfunc(repo, subset): |
| 568 return getset(repo, subset, tree) | |
| 569 return mfunc |