equal
deleted
inserted
replaced
189 def changelog(self, ctx, shortlog=False): |
189 def changelog(self, ctx, shortlog=False): |
190 def changelist(**map): |
190 def changelist(**map): |
191 parity = (start - end) & 1 |
191 parity = (start - end) & 1 |
192 cl = self.repo.changelog |
192 cl = self.repo.changelog |
193 l = [] # build a list in forward order for efficiency |
193 l = [] # build a list in forward order for efficiency |
194 for i in range(start, end): |
194 for i in xrange(start, end): |
195 ctx = self.repo.changectx(i) |
195 ctx = self.repo.changectx(i) |
196 n = ctx.node() |
196 n = ctx.node() |
197 |
197 |
198 l.insert(0, {"parity": parity, |
198 l.insert(0, {"parity": parity, |
199 "author": ctx.user(), |
199 "author": ctx.user(), |
232 cl = self.repo.changelog |
232 cl = self.repo.changelog |
233 count = 0 |
233 count = 0 |
234 qw = query.lower().split() |
234 qw = query.lower().split() |
235 |
235 |
236 def revgen(): |
236 def revgen(): |
237 for i in range(cl.count() - 1, 0, -100): |
237 for i in xrange(cl.count() - 1, 0, -100): |
238 l = [] |
238 l = [] |
239 for j in range(max(0, i - 100), i): |
239 for j in xrange(max(0, i - 100), i): |
240 ctx = self.repo.changectx(j) |
240 ctx = self.repo.changectx(j) |
241 l.append(ctx) |
241 l.append(ctx) |
242 l.reverse() |
242 l.reverse() |
243 for e in l: |
243 for e in l: |
244 yield e |
244 yield e |
320 |
320 |
321 def entries(**map): |
321 def entries(**map): |
322 l = [] |
322 l = [] |
323 parity = (count - 1) & 1 |
323 parity = (count - 1) & 1 |
324 |
324 |
325 for i in range(start, end): |
325 for i in xrange(start, end): |
326 ctx = fctx.filectx(i) |
326 ctx = fctx.filectx(i) |
327 n = fl.node(i) |
327 n = fl.node(i) |
328 |
328 |
329 l.insert(0, {"parity": parity, |
329 l.insert(0, {"parity": parity, |
330 "filerev": i, |
330 "filerev": i, |
529 |
529 |
530 def changelist(**map): |
530 def changelist(**map): |
531 parity = 0 |
531 parity = 0 |
532 cl = self.repo.changelog |
532 cl = self.repo.changelog |
533 l = [] # build a list in forward order for efficiency |
533 l = [] # build a list in forward order for efficiency |
534 for i in range(start, end): |
534 for i in xrange(start, end): |
535 n = cl.node(i) |
535 n = cl.node(i) |
536 changes = cl.read(n) |
536 changes = cl.read(n) |
537 hn = hex(n) |
537 hn = hex(n) |
538 t = changes[2] |
538 t = changes[2] |
539 |
539 |