comparison hgext/directaccess.py @ 1508:8dfb88ca0c08

directaccess: inspect trees of len() > 3

Previously, when inspecting revset AST's we'd only traverse down the tree if it
was length 3 ([op, left, right]). In some situations, like 'or' the tree node
will be greater than length 3 ([op, first, second, ..., nth]). So we need to
traverse all the parts of the node to catch all the symbols.

1507:6f574c76c142

        result = []
        for entry in tree[2][1].split('\0'):
            if hashre.match(entry):
                result.append(entry)
        return result
    elif len(tree) == 3:
        return gethashsymbols(tree[1]) + gethashsymbols(tree[2])
    else:
        return []

def _posttreebuilthook(orig, tree, repo):
    # This is use to enabled direct hash access

1508:8dfb88ca0c08

        result = []
        for entry in tree[2][1].split('\0'):
            if hashre.match(entry):
                result.append(entry)
        return result
    elif len(tree) >= 3:
        results = []
        for subtree in tree[1:]:
            results += gethashsymbols(subtree)
        return results
    else:
        return []

def _posttreebuilthook(orig, tree, repo):
    # This is use to enabled direct hash access