27         revs = []

    27 

    28         while node != nullid:

    28         def decorate(text, rev):

    29             revs.append(node)

    29             return [(rev, l) for l in text.splitlines(1)]

    30             node = self.parents(node)[0]

    30 

    31         revs.reverse()

    31         def strip(annotation):

    32         prev = []

    32             return [e[1] for e in annotation]

    33         annotate = []

    33 

    34         

    34         def pair(parent, child):

    35         for node in revs:

    36             curr = self.read(node).splitlines(1)

    37             linkrev = self.linkrev(node)

    38             sm = SequenceMatcher(None, prev, curr)

    42                     new += annotate[m:n]

    39                     new += parent[m:n]

    44                     new += [(linkrev, l) for l in curr[s:t]]

    41                     new += child[s:t]

    45             annotate, prev = new, curr

    42             return new

    46         return annotate

    43 

    44         needed = {}

    45         visit = [node]

    46         while visit:

    47             n = visit.pop(0)

    48             for p in self.parents(n):

    49                 if p not in needed:

    50                     needed[p] = 1

    51                     visit.append(p)

    52 

    53         visit = needed.keys()

    54         visit = [ (self.rev(n), n) for n in visit ]

    55         visit.sort()

    56         visit = [ p[1] for p in visit ]

    57         hist = {}

    58 

    59         for n in visit:

    60             curr = decorate(self.read(n), self.linkrev(n))

    61             for p in self.parents(n):

    62                 if p != nullid:

    63                     curr = pair(hist[p], curr)

    64             hist[n] = curr

    65 

    66         return hist[n]