# revset.py - revision set queries for mercurial

#

# Copyright 2010 Matt Mackall <mpm@selenic.com>

#

# This software may be used and distributed according to the terms of the

# GNU General Public License version 2 or any later version.

import re

import parser, util, error, discovery

import match as _match

from i18n import _

elements = {

    "(": (20, ("group", 1, ")"), ("func", 1, ")")),

    "-": (19, ("negate", 19), ("minus", 19)),

    "::": (17, ("dagrangepre", 17), ("dagrange", 17),

           ("dagrangepost", 17)),

    "..": (17, ("dagrangepre", 17), ("dagrange", 17),

           ("dagrangepost", 17)),

    ":": (15, ("rangepre", 15), ("range", 15), ("rangepost", 15)),

    "not": (10, ("not", 10)),

    "!": (10, ("not", 10)),

    "and": (5, None, ("and", 5)),

    "&": (5, None, ("and", 5)),

    "or": (4, None, ("or", 4)),

    "|": (4, None, ("or", 4)),

    "+": (4, None, ("or", 4)),

    ",": (2, None, ("list", 2)),

    ")": (0, None, None),

    "symbol": (0, ("symbol",), None),

    "string": (0, ("string",), None),

    "end": (0, None, None),

}

keywords = set(['and', 'or', 'not'])

def tokenize(program):

    pos, l = 0, len(program)

    while pos < l:

        c = program[pos]

        if c.isspace(): # skip inter-token whitespace

            pass

        elif c == ':' and program[pos:pos + 2] == '::': # look ahead carefully

            yield ('::', None, pos)

            pos += 1 # skip ahead

        elif c == '.' and program[pos:pos + 2] == '..': # look ahead carefully

            yield ('..', None, pos)

            pos += 1 # skip ahead

        elif c in "():,-|&+!": # handle simple operators

            yield (c, None, pos)

        elif c in '"\'': # handle quoted strings

            pos += 1

            s = pos

            while pos < l: # find closing quote

                d = program[pos]

                if d == '\\': # skip over escaped characters

                    pos += 2

                    continue

                if d == c:

                    yield ('string', program[s:pos].decode('string-escape'), s)

                    break

                pos += 1

            else:

                raise error.ParseError(_("unterminated string"), s)

        elif c.isalnum() or c in '._' or ord(c) > 127: # gather up a symbol/keyword

            s = pos

            pos += 1

            while pos < l: # find end of symbol

                d = program[pos]

                if not (d.isalnum() or d in "._" or ord(d) > 127):

                    break

                if d == '.' and program[pos - 1] == '.': # special case for ..

                    pos -= 1

                    break

                pos += 1

            sym = program[s:pos]

            if sym in keywords: # operator keywords

                yield (sym, None, s)

            else:

                yield ('symbol', sym, s)

            pos -= 1

        else:

            raise error.ParseError(_("syntax error"), pos)

        pos += 1

    yield ('end', None, pos)

# helpers

def getstring(x, err):

    if x and (x[0] == 'string' or x[0] == 'symbol'):

        return x[1]

    raise error.ParseError(err)

def getlist(x):

    if not x:

        return []

    if x[0] == 'list':

        return getlist(x[1]) + [x[2]]

    return [x]

def getargs(x, min, max, err):

    l = getlist(x)

    if len(l) < min or len(l) > max:

        raise error.ParseError(err)

    return l

def getset(repo, subset, x):

    if not x:

        raise error.ParseError(_("missing argument"))

    return methods[x[0]](repo, subset, *x[1:])

# operator methods

def negate(repo, subset, x):

    return getset(repo, subset,

                  ('string', '-' + getstring(x, _("can't negate that"))))

def stringset(repo, subset, x):

    x = repo[x].rev()

    if x == -1 and len(subset) == len(repo):

        return [-1]

    if x in subset:

        return [x]

    return []

def symbolset(repo, subset, x):

    if x in symbols:

        raise error.ParseError(_("can't use %s here") % x)

    return stringset(repo, subset, x)

def rangeset(repo, subset, x, y):

    if m < n:

def andset(repo, subset, x, y):

    return getset(repo, getset(repo, subset, x), y)

def orset(repo, subset, x, y):

    s = set(getset(repo, subset, x))

    s |= set(getset(repo, [r for r in subset if r not in s], y))

    return [r for r in subset if r in s]

def notset(repo, subset, x):

    s = set(getset(repo, subset, x))

    return [r for r in subset if r not in s]

def listset(repo, subset, a, b):

    raise error.ParseError(_("can't use a list in this context"))

def func(repo, subset, a, b):

    if a[0] == 'symbol' and a[1] in symbols:

        return symbols[a[1]](repo, subset, b)

    raise error.ParseError(_("not a function: %s") % a[1])

# functions

def p1(repo, subset, x):

    ps = set()

    cl = repo.changelog

    for r in getset(repo, subset, x):

        ps.add(cl.parentrevs(r)[0])

    return [r for r in subset if r in ps]

def p2(repo, subset, x):

    ps = set()

    cl = repo.changelog

    for r in getset(repo, subset, x):

        ps.add(cl.parentrevs(r)[1])

    return [r for r in subset if r in ps]

def parents(repo, subset, x):

    ps = set()

    cl = repo.changelog

    for r in getset(repo, subset, x):

        ps.update(cl.parentrevs(r))

    return [r for r in subset if r in ps]

def maxrev(repo, subset, x):

    s = getset(repo, subset, x)

    if s:

        m = max(s)

        if m in subset:

            return [m]

    return []

def limit(repo, subset, x):

    l = getargs(x, 2, 2, _("limit wants two arguments"))

    try:

        lim = int(getstring(l[1], _("limit wants a number")))

    except ValueError:

        raise error.ParseError(_("limit expects a number"))

    return getset(repo, subset, l[0])[:lim]

def children(repo, subset, x):

    cs = set()

    cl = repo.changelog

    s = set(getset(repo, subset, x))

    for r in xrange(0, len(repo)):

        for p in cl.parentrevs(r):

            if p in s:

                cs.add(r)

    return [r for r in subset if r in cs]

def branch(repo, subset, x):

    s = getset(repo, range(len(repo)), x)

    b = set()

    for r in s:

        b.add(repo[r].branch())

    s = set(s)

    return [r for r in subset if r in s or repo[r].branch() in b]

def ancestor(repo, subset, x):

    l = getargs(x, 2, 2, _("ancestor wants two arguments"))

    a = getset(repo, subset, l[0])

    b = getset(repo, subset, l[1])

    if len(a) > 1 or len(b) > 1:

        raise error.ParseError(_("ancestor arguments must be single revisions"))

    return [repo[a[0]].ancestor(repo[b[0]]).rev()]

def ancestors(repo, subset, x):

    args = getset(repo, range(len(repo)), x)

    s = set(repo.changelog.ancestors(*args)) | set(args)

    return [r for r in subset if r in s]

def descendants(repo, subset, x):

    args = getset(repo, range(len(repo)), x)

    s = set(repo.changelog.descendants(*args)) | set(args)

    return [r for r in subset if r in s]

def follow(repo, subset, x):

    getargs(x, 0, 0, _("follow takes no arguments"))

    p = repo['.'].rev()

    s = set(repo.changelog.ancestors(p)) | set([p])

    return [r for r in subset if r in s]

def date(repo, subset, x):

    ds = getstring(x, _("date wants a string"))

    dm = util.matchdate(ds)

    return [r for r in subset if dm(repo[r].date()[0])]

def keyword(repo, subset, x):

    kw = getstring(x, _("keyword wants a string")).lower()

    l = []

    for r in subset:

        c = repo[r]

        t = " ".join(c.files() + [c.user(), c.description()])

        if kw in t.lower():

            l.append(r)

    return l

def grep(repo, subset, x):

    gr = re.compile(getstring(x, _("grep wants a string")))

    l = []

    for r in subset:

        c = repo[r]

        for e in c.files() + [c.user(), c.description()]:

            if gr.search(e):

                l.append(r)

                continue

    return l

def author(repo, subset, x):

    n = getstring(x, _("author wants a string")).lower()

    return [r for r in subset if n in repo[r].user().lower()]

def hasfile(repo, subset, x):

    pat = getstring(x, _("file wants a pattern"))

    m = _match.match(repo.root, repo.getcwd(), [pat])

    s = []

    for r in subset:

        for f in repo[r].files():

            if m(f):

                s.append(r)

                continue

    return s

def contains(repo, subset, x):

    pat = getstring(x, _("contains wants a pattern"))

    m = _match.match(repo.root, repo.getcwd(), [pat])

    s = []

    if m.files() == [pat]:

        for r in subset:

            if pat in repo[r]:

                s.append(r)

                continue

    else:

        for r in subset:

            for f in repo[r].manifest():

                if m(f):

                    s.append(r)

                    continue

    return s

def checkstatus(repo, subset, pat, field):

    m = _match.match(repo.root, repo.getcwd(), [pat])

    s = []

    fast = (m.files() == [pat])

    for r in subset:

        c = repo[r]

        if fast:

            if pat not in c.files():

                continue

        else:

            for f in c.files():

                if m(f):

                    break

            else:

                continue

        files = repo.status(c.p1().node(), c.node())[field]

        if fast:

            if pat in files:

                s.append(r)

                continue

        else:

            for f in files:

                if m(f):

                    s.append(r)

                    continue

    return s

def modifies(repo, subset, x):

    pat = getstring(x, _("modifies wants a pattern"))

    return checkstatus(repo, subset, pat, 0)

def adds(repo, subset, x):

    pat = getstring(x, _("adds wants a pattern"))

    return checkstatus(repo, subset, pat, 1)

def removes(repo, subset, x):

    pat = getstring(x, _("removes wants a pattern"))

    return checkstatus(repo, subset, pat, 2)

def merge(repo, subset, x):